(Enter summary)
Abstract: We present general definitions of security for multi-party cryptographic protocols and show
that, using these definitions, security is preserved under a natural composition method.
The definitions follow the general paradigm of known definitions; yet some substantial modifications
and simplifications are introduced. In particular, `black-box simulation' is no longer
required. The composition method is essentially the natural `subroutine substitution' method
suggested by Micali and
... (Update)
Cited by: More
Comparing Two Notions of Simulatability - Dennis Hofheinz And
(Correct)
Cryptography from Anonymity - Yuval Ishai Eyal
(Correct)
Formale Sicherheit in der Quantenkryptologie - Formal Security In
(Correct)
Similar documents (at the sentence level):
24.0%: Security and Composition of Multi-party Cryptographic Protocols - Canetti (1998)
(Correct)
Active bibliography (related documents): More All
0.2: Randomness versus Fault-Tolerance - Canetti, Kushilevitz, Ostrovsky.. (1999)
(Correct)
0.2: The Match-making Problem - Graaf (1995)
(Correct)
0.2: Trading Correctness for Privacy in Unconditional Multi-Party.. - Fitzi, al. (1998)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: On Adaptive Vs. Non-Adaptive Security of Multiparty.. - Canetti, Damgaard.. (2001)
(Correct)
0.3: Simplified VSS and Fast-track Multiparty Computations with .. - Gennaro, Rabin, Rabin (1998)
(Correct)
0.3: A Production Cell Controlled by Dependable Multiparty Interactions - Zorzo (1999)
(Correct)
Related documents from co-citation: More All
43: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
38: Secure multi-party computation
- Goldreich - 1998
37: Secure Computation (context) - MICALI, ROGAWAY
BibTeX entry: (Update)
R. Canetti. Security and composition of multi-party cryptographic protocols, June 1998. Manuscript. http://citeseer.ist.psu.edu/canetti98security.html More
@article{ canetti00security,
author = "Ran Canetti",
title = "Security and Composition of Multiparty Cryptographic Protocols",
journal = "Journal of Cryptology: the journal of the International Association for Cryptologic Research",
volume = "13",
number = "1",
pages = "143--202",
year = "2000",
url = "citeseer.ist.psu.edu/canetti98security.html" }
Citations (may not include all citations):
531
The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
326
Non-malleable cryptography
- Dolev, Dwork et al. - 1991
287
Multi-party Unconditionally Secure Protocols (context) - Chaum, Crepeau et al. - 1988
278
Probabilistic encryption (context) - Goldwasser, Micali - 1984
250
How to Play any Mental Game (context) - Goldreich, Micali et al. - 1987
219
Completeness Theorems for NonCryptographic Fault-Tolerant Di.. (context) - Ben-Or, Goldwasser et al. - 1988
154
Secure Multi-Party Computation
- Goldreich - 1998
133
A practical scheme for non-interactive Verifiable Secret Sha.. (context) - Feldman - 1987
127
Verifiable Secret Sharing and Multi-party Protocols with Hon.. (context) - Rabin, Ben-Or - 1989
120
A modular approach to the design and analysis of authenticat.. (context) - Bellare, Canetti et al. - 1998
120
Secure Computation (context) - Micali, Rogaway - 1992
119
How to withstand mobile virus attacks (context) - Ostrovsky, Yung - 1991
98
Fair Computation of General Functions in Presence of Immoral.. (context) - Goldwasser, Levin - 1990
90
Secure Multi-party Protocols and Zero-Knowledge Proof System.. (context) - Beaver - 1991
80
Studies in Secure Multi-party Computation and Applications
- Canetti - 1995
78
Foundations of Secure Interactive Computing (context) - Beaver - 1991
54
Privacy and communication complexity
- Kushilevitz - 1989
40
Maintaining security in the presence of transient faults (context) - Canetti, Herzberg
40
Foundations of Cryptography (Fragments of a book
- Goldreich - 1995
39
Complete characterization of adversaries tolerable in secure..
- Hirt, Maurer - 1997
30
Multi-party computation with faulty majority (context) - Beaver, Goldwasser - 1989
29
Incoercible multi-party computation
- Canetti, Gennaro - 1996
23
Adaptively Secure Computation (context) - Canetti, Feige et al. - 1996
19
Asynchronous Secure Computations (context) - Ben-Or, Canetti et al. - 1993
9
Modular composition of multi-party cryptographic protocols: .. (context) - Canetti
6
Cryptographic computation: Secure faut-tolerant protocols an.. (context) - Galil, Haber et al. - 1988
The graph only includes citing articles where the year of publication is known.
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