A knowledge-based analysis of zero knowledge
While the intuition underlying a zero knowledge proof system [GMR85] is that no
“knowledge” is leaked by the prover to the verifier, researchers are just beginning to analyze …
“knowledge” is leaked by the prover to the verifier, researchers are just beginning to analyze …
[PS][PS] Alternative models for zero knowledge interactive proofs
U Feige - 1990 - wisdom.weizmann.ac.il
An interactive proof system is a procedure by which a computational unlimited (but
untrusted) prover can convince a polynomial time veri er of the validity of some complex …
untrusted) prover can convince a polynomial time veri er of the validity of some complex …
Multiple noninteractive zero knowledge proofs under general assumptions
U Feige, D Lapidot, A Shamir - SIAM Journal on computing, 1999 - SIAM
In this paper we show how to construct noninteractive zero knowledge proofs for any NP
statement under general (rather than number theoretic) assumptions, and how to enable …
statement under general (rather than number theoretic) assumptions, and how to enable …
An epistemic characterization of zero knowledge
Halpern, Moses and Tuttle presented a definition of interactive proofs using a notion they
called practical knowledge, but left open the question of finding an epistemic formula that …
called practical knowledge, but left open the question of finding an epistemic formula that …
Zero knowledge with efficient provers
MH Nguyen, S Vadhan - Proceedings of the thirty-eighth annual ACM …, 2006 - dl.acm.org
We prove that every problem in NP that has a zero-knowledge proof also has a zero-
knowledge proof where the prover can be implemented in probabilistic polynomial time …
knowledge proof where the prover can be implemented in probabilistic polynomial time …
[PDF][PDF] Linear zero-knowledge—A note on efficient zero-knowledge proofs and arguments
R Cramer, I Damgård - Proceedings of the twenty-ninth annual ACM …, 1997 - dl.acm.org
We present a 4-move zero-knowledge proof system [21] for any NP language L, which
allows showing that z EL with error probability y less than 2–k using communication …
allows showing that z EL with error probability y less than 2–k using communication …
A note on efficient zero-knowledge proofs and arguments
J Kilian - Proceedings of the twenty-fourth annual ACM …, 1992 - dl.acm.org
In this note, we present new zero-knowledge interactive proofs and arguments for
languages in NP. To show that x ε L, with an error probability of at most 2-k, our zero …
languages in NP. To show that x ε L, with an error probability of at most 2-k, our zero …
On the concrete complexity of zero-knowledge proofs
The fact that there axe zero-knowledge proofs for all languages in NP has, potentially,
enormous implications to cryptography. For cryptographers, the issue is no longer “which …
enormous implications to cryptography. For cryptographers, the issue is no longer “which …
On the possibility of one-message weak zero-knowledge
We investigate whether it is possible to obtain any meaningful type of zero-knowledge
proofs using a one-message (ie, non-interactive) proof system. We show that, under …
proofs using a one-message (ie, non-interactive) proof system. We show that, under …
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
Y Oren - 28th Annual Symposium on Foundations of Computer …, 1987 - ieeexplore.ieee.org
In this paper we investigate some properties of zero-knowledge proofs, a notion introduced
by Goldwasser, Micali and Rackoff. We introduce and classify various definitions of zero …
by Goldwasser, Micali and Rackoff. We introduce and classify various definitions of zero …