Publicaties
Gekozen filters:
Gekozen filters:
Verifying C++ Dynamic Binding KU Leuven
CHERI-TrEE: Flexible enclaves on capability machines KU Leuven
This paper studies the integration of two successful hardware-supported security mechanisms: capabilities and enclaved execution. Capabilities are a powerful and flexible security mechanism for implementing fine-grained memory access control and compartmentalizing untrusted or buggy software components. Capabilities have a long history but have gained significant momentum recently, as evidenced by ARM’s experimental Morello processor that ...
Immune responses in healthy adults elicited by a bivalent norovirus vaccine candidate composed of GI.4 and GII.4 VLPs without adjuvant KU Leuven Universiteit Gent
UNLABELLED: The development of an efficacious vaccine against norovirus is of paramount importance given its potential to reduce the global burden of norovirus-associated morbidity and mortality. Here, we report a detailed immunological analysis of a phase I, double-blind, placebo-controlled clinical trial performed on 60 healthy adults, ages 18 to 40. Total serum immunoglobulin and serum IgA against vaccine strains and cross-reactive serum IgG ...
End-to-End Security for Distributed Event-Driven Enclave Applications on Heterogeneous TEEs KU Leuven
This article presents an approach to provide strong assurance of the secure execution of distributed event-driven applications on shared infrastructures, while relying on a small Trusted Computing Base. We build upon and extend security primitives provided by Trusted Execution Environments (TEEs) to guarantee authenticity and integrity properties of applications, and to secure control of input and output devices. More specifically, we guarantee ...
Completeness Thresholds for Memory Safety of Array Traversing Programs KU Leuven
We report on intermediate results of – to the best of our knowledge – the first study of completeness thresholds for (partially) bounded memory safety proofs. Specifically, we consider heap-manipulating programs that iterate over arrays without allocating or freeing memory. In this setting, we present the first notion of completeness thresholds for program verification which reduce unbounded memory safety proofs to (partially) bounded ones. ...