See this document in CiteSeerX!

Definitions And Properties Of Zero-Knowledge Proof Systems (1994)  (Make Corrections)  (67 citations)
Oded Goldreich, Yair Oren
Journal of Cryptology



  Home/Search   Context   Related

 
View or download:
wisdom.weizmann.ac.il/~oded/P...oren.ps
wisdom.weizmann.ac.il/~oded/P...oren.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wisdom.weizmann.ac.il/~o...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper we investigate some properties of zero-knowledge proofs, a notion introduced by Goldwasser, Micali and Rackoff. We introduce and classify two definitions of zero-knowledge: auxiliary \Gamma input zero-knowledge and blackbox \Gamma simulation zero-knowledge. We explain why auxiliary-input zero-knowledge is a definition more suitable for cryptographic applications than the original [GMR1] definition. In particular, we show that any protocol solely composed of subprotocols which are... (Update)

Cited by:   More
Cryptography in the Multi-string Model - Jens Groth Rafail   (Correct)
On Expected Probabilistic Polynomial-Time Adversaries: - Suggestion For Restricted (2006)   (Correct)
Ecient Zero-knowledge Authentication Based - On Linear Algebra (2001)   (Correct)

Active bibliography (related documents):   More   All
0.3:   An Efficient Non-Interactive Zero-Knowledge Proof System for.. - Kilian, Petrank (1995)   (Correct)
0.3:   Computational Experience with Approximation Algorithms for.. - Grossman, Wool (1994)   (Correct)
0.2:   Randomness, Interactive Proofs and Zero-Knowledge - Goldreich (1987)   (Correct)

Similar documents based on text:   More   All
1.8:   On the Composition of Zero-Knowledge Proof Systems - Goldreich, Krawczyk (1990)   (Correct)
1.5:   On Concurrent and Resettable Zero-Knowledge Proofs for NP - Kilian, Petrank, Richardson   (Correct)
1.4:   Probabilistic Proof Systems - Part I - Vadhan (2000)   (Correct)

Related documents from co-citation:   More   All
47:   The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
39:   Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Kn.. (context) - Goldreich, Micali et al. - 1991
37:   the composition of zero-knowledge proof systems - Goldreich, Krawczyk - 1990

BibTeX entry:   (Update)

O. Goldreich and Y. Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology, Vol. 7, No. 1, pages 1--32, 1994. http://citeseer.ist.psu.edu/goldreich94definitions.html   More

@article{ goldreich94definitions,
    author = "Oded Goldreich and Yair Oren",
    title = "Definitions and Properties of Zero-Knowledge Proof Systems",
    journal = "Journal of Cryptology",
    volume = "7",
    number = "1",
    pages = "1--32",
    year = "1994",
    url = "citeseer.ist.psu.edu/goldreich94definitions.html" }
Citations (may not include all citations):
531   The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
419   How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986
339   Theory and Applications of Trapdoor Functions (context) - Yao - 1982
278   Probabilistic Encryption (context) - Goldwasser - 1984
196   Minimum Disclosure Proofs of knowledge (context) - Brassard, Chaum et al. - 1988
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
111   the Composition of Zero-Knowledge Proof Systems - Goldreich - 1990
110   Proofs that Yield Nothing But their Validity and a Methodolo.. (context) - Goldreich, Micali et al. - 1986
88   Knowledge Complexity of Interactive Proofs (context) - Goldwasser, Micali et al. - 1985
70   The Complexity of Perfect Zero-Knowledge - Fortnow - 1987
51   Random Self-Reducibility and Zero-Knowledge Interactive Proo.. (context) - Tompa - 1987
41   Direct Minimum-Knowledge Computations (context) - Impagliazzo, Yung - 1987
32   the Cunning Power of Cheating Verifiers: Some Observations A.. (context) - Oren - 1987
22   Interactive Proof Systems: Provers that Never Fail and Rando.. (context) - Goldreich, Mansour et al. - 1987
14   Perfect Zero-Knowledge Languages Can Be Recognized in Two Ro.. (context) - Aiello - 1987
6   st FOCS (context) - Shamir, PSPACE - 1990
4   Arthur Merlin Games versus Interactive Proof Systems (context) - Goldwasser - 1986
3   personal communication (context) - Feige
1   Properties of Zero-Knowledge Proofs (context) - Oren - 1987
1   Relativized Perfect Zero-Knowledge is not BPP - Aiello - 1992



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.wisdom.weizmann.ac.il/~oded/papers.html):   More
Resettably-Sound Zero-Knowledge and its Applications - Barak, Goldreich.. (2001)   (Correct)
Improved derandomization of BPP using a hitting set generator - Goldreich, Wigderson (1999)   (Correct)
Improved Testing Algorithms for Monotonicity - Dodis, Goldreich, Lehman.. (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