Sciweavers

113 search results - page 2 / 23
» Safe Equivalences for Security Properties
Sort
View
CSFW
2012
IEEE
11 years 7 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
SOSP
2007
ACM
14 years 2 months ago
Secure virtual architecture: a safe execution environment for commodity operating systems
This paper describes an efficient and robust approach to provide a safe execution environment for an entire operating system, such as Linux, and all its applications. The approach...
John Criswell, Andrew Lenharth, Dinakar Dhurjati, ...
IJSN
2006
78views more  IJSN 2006»
13 years 5 months ago
An approach to synthesise safe systems
: Detectors are system components that identify whether the system is in a particular state. Detectors can be used to ensure arbitrary safety properties for systems, that is, they ...
Arshad Jhumka, Felix C. Freiling, Christof Fetzer,...
CCS
2008
ACM
13 years 7 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
POPL
2001
ACM
14 years 5 months ago
Secure safe ambients
Secure Safe Ambients (SSA) are a typed variant of Safe Ambients [9], whose type system allows behavioral invariants of ambients to be expressed and verified. The most significant a...
Michele Bugliesi, Giuseppe Castagna