Sciweavers

4 search results - page 1 / 1
» Real-or-random Key Secrecy of the Otway-Rees Protocol via a ...
Sort
View
85
Voted
ENTCS
2006
145views more  ENTCS 2006»
14 years 9 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes
CCS
2005
ACM
15 years 3 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 1 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
JOC
2011
157views more  JOC 2011»
14 years 4 months ago
Universally Composable Symbolic Security Analysis
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...
Ran Canetti, Jonathan Herzog