Ran Canetti  Home/Search
Context Related
| iacr.org/2000/067.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 propose a new paradigm for defining security of cryptographic protocols, called universally composable security. A salient property of definitions that follow this paradigm is that they guarantee security even when the analyzed protocol runs alongside an unbounded number of unknown (even maliciously designed) protocols, or more generally when the protocol is used as a component of an arbitrary distributed system. This property is essential for maintaining security of cryptographic protocols... (Update)
Similar documents based on text: More All
0.2: Universally Composable Notions of Key Exchange and Secure.. - Canetti, Krawczyk (2002) (Correct)
0.2: Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (Correct)
0.2: Universally Composable DKG with Linear Number of Exponentiations - Wikström (2004) (Correct)
BibTeX entry: (Update)
Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42th Annual Symposium on Foundations of Computer Science. IEEE, 2001. http://citeseer.ist.psu.edu/article/canetti05universally.html More
@inproceedings{ canetti01universally,
author = "Ran Canetti",
title = "Universally Composable Security: A New Paradigm for Cryptographic Protocols",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "136--145",
year = "2001",
url = "citeseer.ist.psu.edu/article/canetti05universally.html" }
Citations (may not include all citations):404 A calculus for cryptographic protocols: The spi calculus - Abadi, Gordon - 1997
76 The Computational Soundness of Formal Encryption (context) - Abadi, Rogaway et al. - 2000
56 How to go Beyond the Black-Box Simulation Barrier - Barak - 2001
46 Secure implementation of channel abstractions - Abadi, Fournet et al. - 1998
34 A composable cryptographic library with nested operations - Backes, tzmann et al. - 2003
30 A general composition theorem for secure reactive systems - Backes, tzmann et al. - 2004
22 Symmetric Encryption in a Simulatable Dolev-Yao Style Crypto.. - Backes, tzmann - 2004
18 Symmetric Authentication Within a Simulatable Cryptographic .. - Backes, tzmann et al. - 2003
18 Does encryption with redundancy provide authenticity (context) - An, Bellare - 2001
11 Secure Asynchronous Reactive Systems - Backes, tzmann et al. - 2004
6 Adaptively Secure Feldman VSS and Applications to Universall.. - Abe, Fehr - 2004
5 How to Break and Repair a Universally Composable Signature F.. - Backes, Hofheinz - 2004
The graph only includes citing articles where the year of publication is known.
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