Everything Provable is Provable in Zero-Knowledge

@inproceedings{BenOr1988EverythingPI,
  title={Everything Provable is Provable in Zero-Knowledge},
  author={Michael Ben-Or and Oded Goldreich and Shafi Goldwasser and Johan H{\aa}stad and Joe Kilian and Silvio Micali and Phillip Rogaway},
  booktitle={CRYPTO},
  year={1988}
}
Assuming the existence of a secure probabilistic encryption scheme, we show that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof. This result extends the result of Goldreich, Micali and Wigderson, that, under the same assumption, all of NP admits zero-knowledge interactive proofs. Assuming envelopes for bit commitment, we show that every language that admits an interactive proof admits a perfect zero-knowledge interactive proof. 
Non-Interactive Zero-Knowledge with Preprocessing
TLDR
It is proved that the existence of any secure probabilistic encryption scheme is enough for Non-Interactive Zero-Knowledge in a modified model and the ability to prove a randomly chosen theorem allows to subsequently prove noninteractively and in Zero- knowledge any smaller size theorem whose proof is discovered.
Interactive Proofs with Provable Honest Verifiers
TLDR
This work considers a form of “no use” zeroknowledge, and shows that every language in PSPACE has an interactive proof system that provably achieves “ no-use” zero-knowledge against honest verifiers.
Interactive Proofs with Provable Security Against Honest Verifiers
  • J. Kilian
  • Computer Science, Mathematics
    CRYPTO
  • 1990
TLDR
This work considers a form of "no use" zero-knowledge, and shows that every language in PSPACE has an interactive proof system that provably achieves "no-use"zero-knowledge against honest verifiers.
Efficient Generic Zero-Knowledge Proofs from Commitments
TLDR
This paper presents a new kind of commitment scheme on which a novel and efficient Zero-knowledge protocol for circuit satisfiability is built and can prove knowledge of the AES-key which map a particular plaintext to a particular ciphertext in less than 4 seconds.
A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
TLDR
This paper presents a perfect zero-knowledge proof system for a decision problem which is computationally equivalent to the Discrete Logarithm Problem and provides additional evidence to the belief thatperfect zero- knowledge proof systems exist in a nontrivial manner.
Zero-Knowledge Proof Systems for QMA
TLDR
This work proves that every problem in the complexity class QMA has a quantum interactive proof system that is zero-knowledge with respect to efficient quantum computations.
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)
Informally speaking, an instance-hiding proof system for the function f is a protocol in which a polynomial-time verifier is convinced of the value of f(x) but does not reveal the input x to the
Zero-knowledge proofs for secure computation
TLDR
A new type of zero-knowledge proofs is introduced that stands between two existing notions, interactive zeroknowledge proofs and non-interactive zero- knowledge proofs, and can be built from essentially the same cryptographic assumptions than the former, which allows to get improved efficiency and security guarantees.
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs
You Can Prove So Many Things in Zero-Knowledge
TLDR
A new notion is introduced, an extension of proofs of knowledge, called Proofs of Non-Zero Knowledge, as they allow a prover to convince a verifier that he knows a secret satisfying some relation, without revealing any new information about the secret or even the relation that the secret satifies with the common input.
...
...

References

SHOWING 1-10 OF 26 REFERENCES
The complexity of perfect zero-knowledge
  • L. Fortnow
  • Computer Science, Mathematics
    Adv. Comput. Res.
  • 1989
TLDR
It is shown that knowledge complexity can be used to show that a language is easy to prove and that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial time hierarchy collapses.
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
TLDR
This paper demonstrates the generality and wide applicability of zero-knowledge proofs, a notion introduced by Goldwasser, Micali and Rackoff that efficiently demonstrate membership in the language without conveying any additional knowledge.
Random self-reducibility and zero knowledge interactive proofs of possession of information
  • M. Tompa, H. Woll
  • Mathematics, Computer Science
    28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
TLDR
It is shown that any "random self-reducible" problem has a zero knowledge interactive proof of this sort, and new zeroknowledge interactive proofs are exhibited for "knowledge" of the factorization of an integer, nonmembership in cyclic subgroups of Zp*, and determining whether an element generates Zp*.
Probabilistic Encryption
Private coins versus public coins in interactive proof systems
TLDR
The probabilistic, nondeterministic, polynomial time Turing machine is defined and shown to be equivalent in power to the interactive proof system and to BPP much as BPP is the Probabilistic analog to P.
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
  • Yair Oren
  • Computer Science, Mathematics
    28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
TLDR
It is shown that randomness of both the verifier and the prover, and nontriviality of the interaction are essential properties of non-trivial auxiliary-input zero-knowledge proofs.
The Notion of Security for Probabilistic Cryptosystems
TLDR
Three very different formal definitions of security for public-key cryptosystems have been proposed and it is proved all of them to be equivalent, providing evidence that the right formalization of the notion of security has been reached.
Interactive proof systems: Provers that never fail and random selection
TLDR
It is shown that any language having a bounded interactive proof has one with perfect completeness and only languages in NP have interactive proofs with perfect soundness, and a new protocol for proving approximately lower bounds and "random selection" is presented.
Randomness, interactive proofs, and zero-knowledge—A survey
TLDR
Recent approaches to the notions of randomness and proofs are surveyed and elements of the theory of resource bounded computation are presented (but only to the extent required for the description of the new approaches).
Does co-NP Have Short Interactive Proofs?
...
...