A taxonomy of proof systems (part 1)

Authors:
Oded Goldreich
Affiliations:
-
Venue:
ACM SIGACT News
Year:
1993

Citing 11
Cited 0

The complexity of perfect zero-knowledge

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?

Information Processing Letters
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Multi-prover interactive proofs: how to remove intractability assumptions

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimization, approximation, and complexity classes

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
A note on efficient zero-knowledge proofs and arguments (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Everything Provable is Provable in Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Bit Commitment Using Pseudo-Randomness

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several alternative formulations of the concept of an efficient proof system are nowadays coexisting in our field. These systems include the classical formulation of NP, interactive proof systems (giving rise to the class IP)computationally-sound proof systems, and probabilistically checkable proofs (PCP) which are closely related to multi-prover interactive proofs (MIP). Although these notions are sometimes introduced using the same generic phrases, they are actually very different in motivation, applications and expressive power. The main objective of this essay is to try to clarify these differences.