Mihir Bellare, Oded Goldreich  Home/Search
Context Related
| ucsd.edu/users/mihir/papers...pok.ps.gz umjy.chonnam.ac.kr/~journey/cs...pok.ps mit.edu/pub/people/oded/pok.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: umjy.chonnam.ac.kr/...index.shtml (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The notion of a "proof of knowledge," suggested by Goldwasser, Micali and Rackoff, has been used in many works as a tool for the construction of cryptographic protocols and other schemes. Yet the commonly cited formalizations of this notion are unsatisfactory and in particular inadequate for some of the applications in which they are used. Consequently, new researchers keep getting misled by existing literature. The purpose of this paper is to indicate the source of these problems and suggest a ... (Update)
Cited by: More
On Probabilistic versus Deterministic Provers - In The Definition (2006) (Correct)
Testing Disjointness of Private Datasets - Aggelos Kiayias And (2005) (Correct)
Unrestricted Aggregate Signatures - Bellare, Namprempre, Neven (2006) (Correct)
Similar documents (at the sentence level):
67.6%: On Defining Proofs of Knowledge - Bellare, Goldreich (Correct)
Active bibliography (related documents): More All
1.0: Proving Computational Ability - Bellare, Goldreich (1992) (Correct)
0.3: A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
0.3: Efficient and Non-Malleable Proofs of Plaintext Knowledge and.. - Katz (2002) (Correct)
Similar documents based on text: More All
0.4: How to Prove All NP Statements in Zero-Knowledge and a.. - Goldreich, al. (1998) (Correct)
0.3: Probabilistic Proof Systems - Part I - Vadhan (2000) (Correct)
0.3: Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (Correct)
Related documents from co-citation: More All
30: The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
26: Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988
21: Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Kn.. (context) - Goldreich, Micali et al. - 1991
BibTeX entry: (Update)
Bellare, M., Goldreich, O., "On Defining Proofs of Knowledge," Advances in Cryptology -- CRYPTO '92, Lecture Notes in Computer Science No. 740, Springer-Verlag, pp. 390--420. http://citeseer.ist.psu.edu/article/bellare92defining.html More
@article{ bellare93defining,
author = "Mihir Bellare and Oded Goldreich",
title = "On Defining Proofs of Knowledge",
journal = "Lecture Notes in Computer Science",
volume = "740",
pages = "390--420",
year = "1993",
url = "citeseer.ist.psu.edu/article/bellare92defining.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
206 Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988
196 Minimum Disclosure Proofs of knowledge (context) - Brassard, Chaum et al. - 1988
194 Proofs that Yields Nothing but Their Validity or All Languag.. (context) - Goldreich, Micali et al. - 1991
132 Hiding Instances in Multioracle Queries (context) - Beaver, Feigenbaum - 1990
67 Definitions and Properties of Zero-Knowledge Proof Systems - Goldreich, Oren
55 A Uniform-Complexity Treatment of Encryption and Zero-Knowle.. - Goldreich
39 On Completeness and Soundness in Interactive Proof Systems - Furer, Goldreich et al. - 1989
38 Witness Indistinguishability and Witness Hiding Protocols (context) - Feige, Shamir - 1990
32 the Cunning Power of Cheating Verifiers: Some Observations a.. (context) - Oren - 1987
13 The True Complexity of Statistical Zero-Knowledge (context) - Bellare, Micali et al. - 1990
12 IP=PSPACE (context) - Shamir - 1990
10 Multi-Party Cryptographic Computations: Techniques and Appli.. (context) - Haber - 1987
8 the Communication Complexity of Zero-Knowledge Proofs (context) - Boyar, Lund et al. - 1989
6 Computationally Convincing Proofs of Knowledge (context) - Brassard, Cr'epeau et al. - 1991
4 On Sequential and Parallel Composition of Zero-Knowledge Pro.. (context) - Goldreich, Krawczyk - 1990
4 Symmetric Public-Key Encryption (context) - Galil, Haber et al. - 1986
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