Sciweavers

CONCUR
2003
Springer
14 years 4 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
14 years 5 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet