Sciweavers

25 search results - page 1 / 5
» Soundness of Formal Encryption in the Presence of Active Adv...
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
13 years 10 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
13 years 10 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
CCS
2009
ACM
13 years 11 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
ESORICS
2005
Springer
13 years 10 months ago
Soundness of Formal Encryption in the Presence of Key-Cycles
Pedro Adão, Gergei Bana, Jonathan Herzog, A...