Oded Goldreich, Hugo Krawczyk  Home/Search
Context Related
| mit.edu/pub/people/oded/zkcomp.ps wisdom.weizmann.ac.il/pub/...zkcomp.ps umjy.chonnam.ac.kr/~journe...zkcomp.ps 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: cryptosoft.com/html/secpub (more) From: fermivista.math....weizmann.ac.il (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : The wide applicability of zero-knowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zero-knowledge protocols is zero-knowledge too. We demonstrate the limitations of the composition of zeroknowledge protocols by proving that the original definition of zero-knowledge is not closed under sequential composition; and that even the... (Update)
Cited by: More
Appears in the proceedings of the First ACM Conference on.. - Random Oracles Are (Correct)
Concurrently Non-Malleable Zero Knowledge in the.. - Deng, Di Crescenzo, Lin (2006) (Correct)
Provably Secure Substitution of Cryptographic Tools - Kissner, Molnar (2006) (Correct)
Active bibliography (related documents): More All
0.3: Sorting Out Zero-Knowledge - Brassard, CREPEAU (1990) (Correct)
0.3: One-Way Functions are Essential for Non-Trivial.. - Ostrovsky, Wigderson (2002) (Correct)
0.2: On Defining Proofs of Knowledge - Bellare, Goldreich (1992) (Correct)
Similar documents based on text: More All
1.8: Definitions And Properties Of Zero-Knowledge Proof Systems - Goldreich, Oren (1994) (Correct)
1.1: On the Existance of 3-Round Zero-Knowledge Proof Systems - Lepinski, Micali (2001) (Correct)
1.0: Black-Box Concurrent Zero-Knowledge Requires (almost) .. - Canetti, Kilian.. (2002) (Correct)
Related documents from co-citation: More All
81: The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
48: Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Kn.. (context) - Goldreich, Micali et al. - 1991
44: Concurrent Zero Knowledge - Dwork, Naor et al.
BibTeX entry: (Update)
O. Goldreich and H. Krawczyk, "On the composition of zero-knowledge proof systems," In Proceedings of 17th International Colloquium on Automata, Languages and Programming (ICALP), July 16--20, 1990. Coventry, U.K. http://citeseer.ist.psu.edu/goldreich90composition.html More
@article{ goldreich96composition,
author = "Oded Goldreich and Hugo Krawczyk",
title = "On the composition of {Z}ero-{K}nowledge {P}roof Systems",
journal = "{SIAM Journal on Computing}",
volume = "25",
number = "1",
pages = "169--192",
year = "1996",
url = "citeseer.ist.psu.edu/goldreich90composition.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
375 Probability Inequalities for Sums of Bounded Random Variable.. (context) - Hoeffding - 1963
278 Probabilistic Encryption (context) - Goldwasser - 1984
196 Minimum Disclosure Proofs of knowledge (context) - Brassard, Chaum et al. - 1988
194 Proofs that Yield Nothing But their Validity or All Language.. (context) - Goldreich, Micali et al. - 1991
191 New Hash Functions and Their Use in Authentication and Set E.. (context) - Wegman, Carter - 1981
185 How to Generate and Exchange Secrets (context) - Yao - 1986
173 Trading Group Theory for Randomness (context) - Babai - 1985
140 How to Play any Mental Game or A Completeness Theorem for Pr.. (context) - Goldreich, Micali et al. - 1987
98 Private Coins versus Public Coins in Interactive Proof Syste.. (context) - Goldwasser - 1989
88 Knowledge Complexity of Interactive Proofs (context) - Goldwasser, Micali et al. - 1985
70 the Power of Two-Point Based Sampling - Chor, Goldreich - 1989
69 Zero knowledge proofs of knowledge in two rounds (context) - Feige - 1989
67 Definitions and Properties of Zero-Knowledge Proof Systems - Goldreich, Oren - 1993
63 How to Construct Constant-Round ZeroKnowledge Proof Systems .. - Goldreich, Kahan - 1993
55 A Uniform-Complexity Treatment of Encryption and ZeroKnowled.. - Goldreich - 1993
51 Random Self-Reducibility and Zero-Knowledge Interactive Proo.. (context) - Tompa - 1987
41 Direct Minimum-Knowledge Computations (context) - Impagliazzo - 1987
38 Witness Indistinguishability and Witness Hiding Protocols (context) - Feige - 1990
37 a Set of Almost Deterministic k-Independent Random Variables (context) - Joffe - 1974
32 the Cunning Power of Cheating Verifiers: Some Observations A.. (context) - Oren - 1987
23 Perfect Zero Knowledge in Constant Rounds - Bellare, Micali et al. - 1990
23 Everything in NP can be argued in perfect zero-knowledge in .. - Brassard, Crepau et al. - 1989
13 True) Complexity of Statistical Zero Knowledge (context) - Bellare, Micali et al. - 1990
12 IP = PSPACE (context) - Shamir - 1990
4 University of Toronto (context) - Simon, Sc - 1989
4 Sparse Pseudorandom Distributions (context) - Goldreich, Krawczyk - 1992
4 Weizmann Institute (context) - Feige, Sc - 1987
1 Every Thing Provable is provable in ZK (context) - Ben-Or, Goldreich et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (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