… reveals one bit of knowledge to the verifier B (… zero knowledge proofs” which do not even
reveal this single bit. The basic idea is to replace “knowledge” by “knowledge about knowledge”…

… A zero-knowledge proof system of knowledge is a protocol between … proof of a given theorem
without revealing any additional information. This is different from a zero-knowledge proof …

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-knowledge proof …

… -verifier zero knowledge proofs automatically translate to general zero-knowledge proofs…
Moreover, it suggests a methodology for constructing general zero-knowledge proofs: first …

… zero-knowledge proof systems, in the sense that only languages in BPP have zero-knowledge
proofs … In particular, we show that any language having a Las Vegas zeroknowledge proof …

… We present a simple zero-knowledge proof of knowledge protocol of which many protocols
in the literature are instantiations. These include Schnorr’s protocol for proving knowledge of …

… not black-box simulation zero-knowledge, unless the corresponding languages … zero-knowledge
proofs was anintriguing open questions arising from the early works on zero-knowledge…

… zero-knowledge proof of knowledge for the given relation. In this paper we characterize a
class of relations where such a zero-knowledge proof of knowledge … trivial non zero-knowledge …

… Then it is easy to prove that if L possessed such a proof system that is Zero-Knowledge, L …
, Zero-Knowledge proofs are not possible. In order to have Zero-Knowledge proofs, the prover …

… on the round complexity of zero-knowledge proofs. We prove … proofs which are black-box
simulation zero-knowledge. … Merlin proofs that are black-box simulation zero-knowledge are in …