Security protocol verification: Symbolic and computational models
B Blanchet - International conference on principles of security and …, 2012 - Springer
Security protocol verification has been a very active research area since the 1990s. This
paper surveys various approaches in this area, considering the verification in the symbolic …
paper surveys various approaches in this area, considering the verification in the symbolic …
Refinement types for secure implementations
J Bengtson, K Bhargavan, C Fournet… - ACM Transactions on …, 2011 - dl.acm.org
We present the design and implementation of a typechecker for verifying security properties
of the source code of cryptographic protocols and access control mechanisms. The …
of the source code of cryptographic protocols and access control mechanisms. The …
Protocol composition logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network
protocols that use public and symmetric key cryptography. The logic is designed around a …
protocols that use public and symmetric key cryptography. The logic is designed around a …
The declarative imperative: experiences and conjectures in distributed logic
JM Hellerstein - ACM SIGMOD Record, 2010 - dl.acm.org
The rise of multicore processors and cloud computing is putting enormous pressure on the
software community to find solutions to the difficulty of parallel and distributed programming …
software community to find solutions to the difficulty of parallel and distributed programming …
A modular correctness proof of IEEE 802.11 i and TLS
The IEEE 802.11 i wireless networking protocol provides mutual authentication between a
network access point and user devices prior to user connectivity. The protocol consists of …
network access point and user devices prior to user connectivity. The protocol consists of …
A derivation system and compositional logic for security protocols
Many authentication and key exchange protocols are built using an accepted set of standard
concepts such as Diffie–Hellman key exchange, nonces to avoid replay, certificates from an …
concepts such as Diffie–Hellman key exchange, nonces to avoid replay, certificates from an …
Modular code-based cryptographic verification
Type systems are effective tools for verifying the security of cryptographic programs. They
provide automation, modularity and scalability, and have been applied to large security …
provide automation, modularity and scalability, and have been applied to large security …
A logic of secure systems and its application to trusted computing
We present a logic for reasoning about properties of secure systems. The logic is built
around a concurrent programming language with constructs for modeling machines with …
around a concurrent programming language with constructs for modeling machines with …
Methods and apparatuses for user-verifiable trusted path in the presence of malware
An apparatus and method for establishing a trusted path between a user interface and a
trusted executable, wherein the trusted path includes a hypervisor and a driver shim. The …
trusted executable, wherein the trusted path includes a hypervisor and a driver shim. The …
Probabilistic polynomial-time semantics for a protocol security logic
We describe a cryptographically sound formal logic for proving protocol security properties
without explicitly reasoning about probability, asymptotic complexity, or the actions of a …
without explicitly reasoning about probability, asymptotic complexity, or the actions of a …