Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira, Roberto Segala  Home/Search
Context
Related
| iacr.org/2005/452.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: We demonstrate how to carry out cryptographic security analysis of distributed protocols within the Probabilistic I/O Automata framework of Lynch, Segala, and Vaandrager. This framework provides tools for arguing rigorously about the concurrency and scheduling aspects of protocols, and about protocols presented at di#erent levels of abstraction. Consequently, it can help in making cryptographic analysis more precise and less susceptible to errors. (Update)
Active bibliography (related documents): More All
0.5: Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (Correct)
0.4: Automated Security Proofs with Sequences of Games - Blanchet, Pointcheval (2006) (Correct)
0.4: A Computationally Sound Mechanized Prover for Security Protocols - Blanchet (2005) (Correct)
Similar documents based on text:
5.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ canetti-using,
author = "Ran Canetti and Ling Cheung and Dilsun Kaynar and Moses Liskov and Nancy
Lynch and Olivier Pereira and Roberto Segala",
title = "Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol",
url = "citeseer.ist.psu.edu/canetti05using.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
250 How to Play any Mental Game (context) - Goldreich, Micali et al. - 1987
197 A randomized protocol for signing contracts (context) - Even, Goldreich et al. - 1985
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
174 Probabilistic simulations for probabilistic processes - Segala, Lynch - 1995
149 A Hard-Core Predicate for all One-Way Functions (context) - Goldreich, Levin - 1989
90 Modeling and Verification of Randomized Distributed Real-Tim.. (context) - Segala - 1995
77 Composition and Integrity Preservation of Secure Reactive Sy.. - Pfitzmann, Waidner - 2000
76 The Computational Soundness of Formal Encryption (context) - Abadi, Rogaway et al. - 2000
72 OAEP Reconsidered - Shoup - 2002
52 Specification and Refinement of Probabilistic Processes (context) - Jonsson, Larsen - 1991
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
21 Sequences of games: a tool for taming complexity in security.. - Shoup - 2004
21 Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004
9 Universally Composable Symbolic Analysis of Cryptographic Pr.. - Canetti, Herzog - 2004
5 Initiator-Resilient Universally Composable Key Exchange - Hofheinz, Mueller-Quade et al. - 2003
5 A plausible approach to computer-aided cryptographic proofs (context) - Halevi - 2005
4 Volume I Basic Tools (context) - Goldreich, Cryptography - 2003
2 The ACM Distinghished Dissertation (context) - Uses, in et al. - 1989
1 A Computationally Sound Automatic Prover for Cryptographic P.. (context) - Blanchet - 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