(Enter summary)
Abstract: this paper is to explain the various notions involved and to offer a
new terminology that emphasizes their differences. There are two orthogonal aspects
to zero-knowledge interactive proofs. One is the notion of zero-knowledge and the
other is the notion of interactive proof. Unfortunately, these two notions are often
thought to be inseparable. This confusion is reminiscent of the long lasting confusion
among many people between public-key encryption and digital signature. It is clear
that... (Update)
Context of citations to this paper: More
...exists an interface (simulator) S that reproduces the conversation with (almost) the right probability distribution. However, in [BC89] it is argued that, certainly in the original context of computational protocols for proofs of knowledge, this seems unreasonable. For...
.... systems (this terminology was recently suggested by Chaum) Computationally convincing protocols are usually referred to as arguments [BC2]. The advantage of the apparently weaker notion of argument over that of proof systems is that arguments can be perfect zero knowledge...
Cited by: More
Do You Know What I Know? - Mikucki (1999)
(Correct)
Computational and Statistical Indistinguishabilities - Kurosawa, WATANABE (1994)
(Correct)
Subquadratic Zero-Knowledge - Boyar, Brassard, Peralta (1995)
(Correct)
Active bibliography (related documents): More All
0.3: On the Composition of Zero-Knowledge Proof Systems - Goldreich, Krawczyk (1990)
(Correct)
0.2: One-Way Functions are Essential for Non-Trivial.. - Ostrovsky, Wigderson (2002)
(Correct)
0.2: A Note On Computational Indistinguishability - Oded Goldreich (1990)
(Correct)
Similar documents based on text: More All
0.5: Everything in NP can be argued in perfect zero-knowledge.. - Brassard, Crepeau, Yung (1989)
(Correct)
0.4: Interactive Hashing Simplifies Zero-Knowledge Protocol.. - Ostrovsky, Venkatesan, .. (1998)
(Correct)
0.4: Computationally convincing proofs of knowledge.. - Brassard, Crépeau..
(Correct)
Related documents from co-citation: More All
8: The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
6: Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al. - 1988
6: Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988
BibTeX entry: (Update)
G. Brassard and C. Cr'epeau, "Sorting out zero-knowledge," In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology, Proc. of Eurocrypt '89 (Lecture Notes in Computer Science 434), pp. 181--191. Springer-Verlag, 1990. Houthalen, Belgium, April 10--13. http://citeseer.ist.psu.edu/brassard90sorting.html More
@article{ brassard90sorting,
author = "Gilles Brassard and Claude Cr{\'e}peau",
title = "Sorting Out Zero-Knowledge",
journal = "Lecture Notes in Computer Science",
volume = "434",
pages = "181--??",
year = "1990",
url = "citeseer.ist.psu.edu/brassard90sorting.html" }
Citations (may not include all citations):
531
The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1985
531
The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
278
Probabilistic encryption (context) - Goldwasser, Micali - 1984
206
Zero knowledge proofs of identity (context) - Feige, Fiat et al. - 1988
196
Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988
187
Security without identification: Transaction system to make .. (context) - Chaum - 1985
173
Trading group theory for randomness (context) - Babai - 1985
110
Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
83
Multi-prover interactive proofs: How to remove intractabilit.. (context) - Or, Goldwasser et al. - 1988
79
Arthur-Merlin games: A randomized proof system, and a hierar.. (context) - Babai, Moran - 1988
70
The complexity of perfect zero-knowledge
- Fortnow - 1987
51
Random self-reducibility and zero-knowledge interactive proo.. (context) - Tompa, Woll - 1987
41
Non-transitive transfer of confidence: A perfect zero-knowle..
- Brassard, Crepeau - 1986
33
Quantum cryptography (context) - Bennett, Brassard
32
the cunning power of cheating verifiers: Some observations a.. (context) - Oren - 1987
23
Everything in NP can be argued in perfect zero-knowledge in ..
- Brassard, Crepeau et al. - 1989
22
Demonstrating that a public predicate can be satisfied witho.. (context) - Chaum - 1987
21
A private interactive test of a Boolean predicate and minimu.. (context) - Galil, Haber et al. - 1985
17
Lecture Notes in Computer Science (context) - Brassard, Modern - 1988
14
Perfect zero-knowledge languages can be recognized in two ro.. (context) - Aiello, Hastad - 1987
11
Does co-NP have short interactive proofs (context) - Boppana, Hastad et al. - 1987
7
Secure implementation of identification systems (context) - Bengio, Brassard et al.
4
On sparse pseudo-random distributions (context) - Goldreich, Krawczyk
1
Efficient identification schemes using two prover interactiv.. (context) - Goldwasser, Kilian et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.counterpane.com/biblio/all-by-author.html): More
On SDSI's Linked Local Name Spaces - Abadi (1997)
(Correct)
Equivalence Between Two Flavours of Oblivious Transfers - Crepeau (1988)
(Correct)
Two Observations on Probabilistic Primality Testing - Beauchemin, Brassard.. (1987)
(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