A recent branch of cryptography focuses on the physical constraints that a real-life
cryptographic device must face, and attempts to exploit these constraints (running time …

Current standard security practices do not provide substantial assurance that the end-to-end
behavior of a computing system satisfies important security policies such as confidentiality …

An E cient Cryptographic Protocol Veri er Based on Prolog Rules Page 1 An E cient
Cryptographic Protocol Veri er Based on Prolog Rules Bruno Blanchet INRIA Rocquencourt …

After giving general context on the verification of security protocols, we focus on the
automatic symbolic protocol verifier ProVerif. This verifier can prove secrecy, authentication …

We propose a new method to check authenticity properties of cryptographic protocols. First,
code up the protocol in the spi-calculus of Abadi and Gordon. Second, specify authenticity …

We present a general technique for modeling remote electronic voting protocols in the
applied pi-calculus and for automatically verifying their security. In the first part of this paper …

We study and further develop two language-based techniques for analyzing security
protocols. One is based on a typed process calculus; the other, on untyped logic programs …

Code voting seeks to address the issues of privacy and integrity for Remote Internet Voting.
It sidesteps many of the inherent vulnerabilities of the Internet and client platforms but it does …

We present the first type and effect system for proving authenticity properties of security
protocols based on asymmetric cryptography. The most significant new features of our type …

We methodically expand protocol narrations into terms of a process algebra in order to
specify some of the checks that need to be made in a protocol. We then apply static analysis …