Abstract

Abstract. 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 that, for the members of a language, efficiently demonstrate membership in the language without conveying any additional knowledge. All previously known zero-knowledge proofs were only for number-theoretic languages in NP fl CONP. Under the assumption that secure encryption functions exist or by using “physical means for hiding information, ‘ ‘ it is shown that all languages in NP have zero-knowledge proofs. Loosely speaking, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula, in particular, without yielding neither a

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
279	Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes - Babai, Moran - 1988
267	Trading group theory for randomness - Babai - 1985
120	C.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole - Alexi, Chor, et al. - 1988
57	Statistical zero-knowledge languages can be recognized in two rounds - Aiello, H˚astad - 1991
31	Perfect zero-knowledge in constant rounds - Bellare, Micali, et al. - 1990
22	Computational complexity and the classification of finite simple groups - Babai, Kantor, et al. - 1983
18	On the Power of Interaction - Aiello, Goldwasser, et al. - 1986
2	Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols", presented at CRYPTO 86 - D - 1986
1	A fully polynomial simultaneous broadcast in the presence of faults, Unpublished manuscript - GALIL, Z, et al. - 1985