Name
Abstract | ||
|---|---|---|
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 tools. An important question is whether this kind of formal analysis implies security guarantees in the strong sense of modern cryptography. Initiated by the seminal work of Abadi and Rogaway, this question has been investigated and numerous positive results showing this so-called computational soundness of formal analysis have been obtained. However, for the case of active adversaries and protocols that use symmetric encryption computational soundness has remained a challenge. In this paper, we show the first general computational soundness result for key exchange protocols with symmetric encryption, along the lines of a paper by Canetti and Herzog on protocols with public-key encryption. More specifically, we develop a symbolic, automatically checkable criterion, based on observational equivalence, and show that a key exchange protocol that satisfies this criterion realizes a key exchange functionality in the sense of universal composability. Our results hold under standard cryptographic assumptions. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1653662.1653674 | IACR Cryptology ePrint Archive |
Keywords | DocType | Volume |
so-called computational soundness,checkable criterion,symmetric encryption computational soundness,simulation-based security,computational soundness,public-key encryption,general computational soundness result,cryptographic protocols,important question,key exchange functionality,formal analysis,symmetric encryption,key exchange protocol,cryptographic protocol,security protocol,public key encryption,key exchange | Conference | 2009 |
Citations | PageRank | References |
12 | 0.56 | 31 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralf Küsters | 1 | 1014 | 69.62 |
| Max Tuengerthal | 2 | 79 | 4.38 |