Michael Backes, Birgit Pfitzmann, Michael Waidner  Home/Search
Context Related
| iacr.org/2006/068.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/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Automated tools such as model checkers and theorem provers for the analysis of security protocols typically abstract from cryptography by Dolev-Yao models, i.e., abstract term algebras replace the real cryptographic operations. Recently it was shown that in essence this approach is cryptographically sound for certain operations like signing and encryption. The strongest results show this in the sense of blackbox reactive simulatability (BRSIM)/UC with only small changes to both Dolev-Yao... (Update)
Cited by: More
Completeness of Formal Hashes in the - Standard Model Flavio (2006) (Correct)
Sound Computational Interpretation of - Symbolic Hashes In (Correct)
Completeness of Formal Hashes in the Standard Model - Garcia, van Rossum (Correct)
Active bibliography (related documents): More All
2.0: Cryptographically Sound Theorem Proving - Sprenger, Backes, Basin.. (2006) (Correct)
1.8: Conditional Reactive Simulatability - Backes, Dürmuth, Hofheinz, Küsters (2006) (Correct)
1.8: Computationally Sound Secrecy Proofs by Mechanized Flow Analysis - Backes, Laud (2006) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
Related documents from co-citation: More All
4: Toward Realizing Random Oracles: Hash Functions that Hide All Partial Informatio.. - Canetti - 1997
3: Sound computational interpretation of formal hashes (context) - Garcia, van Rossum - 2006
3: Perfectly One-Way Probabilistic Hash Functions - Canetti, Micciancio et al. - 1998
BibTeX entry: (Update)
Michael Backes, Birgit Pfitzmann, and Michael Waidner. Limits of the Reactive Simulatability/UC of Dolev-Yao models with hashes. Cryptology ePrint Archive http://citeseer.ist.psu.edu/backes06limits.html More
@misc{ backes-limits,
author = "Michael Backes and Birgit Pfitzmann and Michael Waidner",
title = "Limits of the Reactive Simulatability/UC of Dolev-Yao Models with Hashes",
text = "Michael Backes, Birgit Pfitzmann, and Michael Waidner. Limits of the Reactive
Simulatability/UC of Dolev-Yao models with hashes. Cryptology ePrint Archive",
url = "citeseer.ist.psu.edu/backes06limits.html" }
Citations (may not include all citations):659 Random oracles are practical: A paradigm for designing effic.. - Bellare, Rogaway - 1993
339 Theory and applications of trapdoor functions (context) - Yao - 1982
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
263 The inductive approach to verifying cryptographic protocols - Paulson - 1998
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001
179 Security and composition of multiparty cryptographic protoco.. - Canetti - 2000
140 How to play any mental game -- or -- a completeness theorem .. (context) - Goldreich, Micali et al. - 1987
120 Secure computation (context) - Micali, Rogaway - 1991
98 Fair computation of general functions in presence of immoral.. (context) - Goldwasser, Levin - 1990
90 Secure multiparty protocols and zero knowledge proof systems.. (context) - Beaver - 1991
77 Composition and integrity preservation of secure reactive sy.. - Pfitzmann, Waidner - 2000
74 A model for asynchronous reactive systems and its applicatio.. - Pfitzmann, Waidner - 2001
56 Formal eavesdropping and its computational interpretation - Abadi, Jurjens - 2001
56 Universally composable commitments - Canetti, Fischlin - 2001
36 Universally composable notions of key exchange and secure ch.. - Canetti, Krawczyk - 2002
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
33 Semantics and program analysis of computationally secure inf.. - Laud - 2001
33 Reconciling two views of cryptography: The computational sou.. - Abadi, Rogaway - 2000
28 The Modelling and Analysis of Security Protocols: The CSP Ap.. (context) - Ryan, Schneider - 2001
24 A linguistic characterization of bounded oracle computation .. - Mitchell, Mitchell et al. - 1998
22 Symmetric encryption in a simulatable Dolev-Yao style crypto.. - Backes, Pfitzmann - 2004
21 Symmetric encryption in automatic analyses for confidentiali.. - Laud - 2004
21 Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004
19 A cryptographically sound security proof of the NeedhamSchro.. - Backes, Pfitzmann - 2004
18 Symmetric authentication within a simulatable cryptographic .. - Backes, Pfitzmann et al. - 2003
15 Georgia Institute of Technology (context) - Merritt, PhD - 1983
12 An efficient cryptographic protocol verifier based on Prolog.. - Blanchet - 2001
10 Logics for reasoning about cryptographic constructions - Impagliazzo, Kapron - 2003
10 Probabilistic polynomial-time semantics for a protocol secur.. (context) - Datta, Derek et al. - 2005
8 A cryptographically sound Dolev-Yao style security proof of .. - Backes, Durmuth - 2005
8 A cryptographically sound Dolev-Yao style security proof of .. - Backes - 2004
7 A probabilistic polynominal-time process calculus for analys.. (context) - Mitchell, Mitchell et al. - 2001
6 A computationally sound mechanized prover for security proto.. - Blanchet - 2006
5 Secrecy types for a simulatable cryptographic library (context) - Laud - 2005
4 OFMC: A symbolic model checker for security protocols (context) - Basin, Modersheim et al. - 2004
4 the relationships between notions of simulation-based securi.. - Datta, Kusters et al. - 2005
4 Cryptographically sound theorem proving - Sprenger, Backes et al. - 2006
3 Universally composable symbolic analysis of mutual authentic.. (context) - Canetti, Herzog - 2006
2 Universally composable commitments using random oracles (context) - Hofheinz, Muller-Quade - 2004
2 Limits of the cryptographic realization of Dolev-Yao-style X.. - Backes, Pfitzmann - 2005
2 Games and the impossibility of realizable ideal functionalit.. (context) - Datta, Derek et al. - 2006
1 Cryptographic key secrecy of the strengthened Yahalom protoc.. (context) - Backes, Pfitzmann - 2005
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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