Ran Canetti, Jonathan Herzog  Home/Search
Context Related
| iacr.org/2004/334.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2004/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Symbolic analysis of cryptographic protocols is dramatically simpler than full-fledged cryptographic analysis. In particular, it is readily amenable to automation. However, symbolic analysis does not a priori carry any cryptographic soundness guarantees. Following recent work on cryptographically sound symbolic analysis, we demonstrate how Dolev-Yao style symbolic analysis can be used to assert the security of cryptographic protocols within the universally composable (UC) security... (Update)
Cited by: More
Cryptographically Sound Security Proofs for - Basic And Public-Key (Correct)
Provably Secure Ubiquitous Systems: Universally.. - Burmester, van Le.. (2006) (Correct)
Using Probabilistic I/O Automata to Analyze an.. - Canetti, Cheung.. (2005) (Correct)
Active bibliography (related documents): More All
0.8: Low-level Ideal Signatures and General Integrity Idealization - Backes, Pfitzmann, Waidner (2004) (Correct)
0.5: Computational Soundness for Standard Assumptions of Formal.. - Herzog (2004) (Correct)
0.5: Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005) (Correct)
Similar documents based on text: More All
0.2: A Cryptographically Sound Dolev-Yao Style Security Proof of the.. - Backes (2004) (Correct)
0.2: Universally Composable Notions of Key Exchange and Secure.. - Canetti, Krawczyk (2002) (Correct)
0.2: Symbolic Analysis: A Basis for Parallelization.. - Mohammad Haghighat (1993) (Correct)
Related documents from co-citation: More All
8: A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
8: Soundness of formal encryption in the presence of active adversaries (context) - Micciancio, Warinschi - 2004
7: Symmetric encryption in automatic analyses for confidentiality against active ad.. - Laud - 2004
BibTeX entry: (Update)
R. Canetti and J. Herzog. Universally composable symbolic analysis of cryptographic protocols (the case of encryption-based mutual authentication and key exchange). Cryptology ePrint Archive, Report 2004. http://citeseer.ist.psu.edu/article/canetti05universally.html More
@misc{ canetti04universally,
author = "R. Canetti and J. Herzog",
title = "Universally composable symbolic analysis of cryptographic protocols",
text = "R. Canetti and J. Herzog. Universally composable symbolic analysis of cryptographic
protocols (the case of encryption-based mutual authentication and key exchange).
Cryptology ePrint Archive, Report 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/canetti05universally.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
501 A digital-signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
404 A calculus for cryptographic protocols: the spi calculus - Abadi, Gordon - 1999
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
326 Non-malleable cryptography - Dolev, Dwork et al. - 2000
322 Breaking and fixing the Needham--Schroeder public-key protoc.. - Lowe - 1996
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
188 Entity authentication and key distribution (context) - Bellare, Rogaway - 1993
184 Automated analysis of cryptographic protocols using Mur - Mitchell, Mitchell et al. - 1997
179 Security and composition of multiparty cryptographic protoco.. - Canetti - 2000
131 Noninteractive zero-knowledge proof of knowledge and the cho.. (context) - Racko, Simon - 1991
120 Secure computation (context) - Micali, Rogaway - 1991
114 A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell et al. - 1998
99 Foundations of Cryptography---Basic Tools (context) - Goldreich - 2001
98 Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1990
93 An attack on the Needham--Schroeder public-key authenticatio.. - Lowe - 1995
90 Secure multiparty protocols and zero-knowledge proof systems.. (context) - Beaver - 1991
83 ACM Transactions in Computer Systems (context) - Burrows, Abadi et al. - 1990
82 On formal models for secure key exchange - Shoup - 1999
81 Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
76 the computational soundness of formal encryption (context) - Abadi, Rogaway et al. - 2002
69 Applying formal methods to the analysis of a key management .. - Meadows - 1992
56 Formal eavesdropping and its computational interpretation - Abadi, Jurjens - 2001
55 The notion of security for probabilistic cryptosystems (context) - Micali, Racko et al. - 1988
51 Analysis of key-exchange protocols and their use for buildin.. - Canetti, Krawczyk - 2001
46 Probabilistic polynomial-time equivalence and security proto.. - Lincoln, Mitchell et al. - 1999
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
33 Analyzing security protocols with secrecy types and logic pr.. - Abadi, Blanchet - 2002
26 Universal composition with joint state - Canetti, Rabin - 2003
25 automaton models and proofs for shared-key communication sys.. (context) - Lynch - 1999
21 Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004
19 A cryptographically sound security proof of the Needham-Schr.. - Backes, Pfitzmann - 2003
19 A cryptographically sound security proof of the Needham-Schr.. - Backes, Pfitzmann - 2004
16 Completeness theorems for the Abadi-Rogaway logic of encrypt.. (context) - Micciancio, Warinschi - 2002
14 Electronic Notes in Theoretical Computer Science (context) - Pfitzmann, Schunter et al. - 2000
12 Plaintext awareness via key registration - Herzog, Liskov et al. - 2003
11 Relaxing chosen-ciphertext security - Canetti, Krawczyk et al. - 2003
10 Automatic proof of strong secrecy for security protocols (context) - Blanchet - 2004
9 Universally composable signatures (context) - Canetti - 2003
9 Universally composable signature (context) - Canetti - 2004
8 an automatic checker for security protocol analysis (context) - Song - 1999
4 Computational Soundness for Standard Assumptions of Formal C.. - Herzog - 2004
3 Weak key authenticity and the computational completeness of .. (context) - Horvitz, Gligor - 2003
2 ProVerif automatic cryptographic protocol verifier user manu.. (context) - Blanchet - 2004
2 Low-level ideal signatures and general integrity idealizatio.. - Backes, Pfitzmann et al. - 2004
2 Using SPIN to verify security protocols (context) - Maggi, Sisto - 2002
1 A meta-notion for protocol analysis (context) - Cervesato, Durgin et al. - 1999
1 Cryptology ePrint Archive (context) - Backes, Pfitzmann et al. - 2004
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/2004/): More
The Security and Efficiency of Micciancio's Cryptosystem - Ludwig (2004) (Correct)
Entropic Security and the Encryption of High Entropy Messages - Dodis, Smith (2004) (Correct)
On Cheating Immune Secret Sharing - Braeken, Nikova, al. (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC