Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof... Proofs that Yield Nothing But Their Validity or All Languages Proof Systems in NP Have Zero-Knowledge ODED GOLDREICH Technion, Haifa, Israel SILVIO MICALI Institute of Technology, Catnbridge, Massachusetts Massachusetts AND AVI WIGDERSON Hebrew University, Jerusalem, Israel 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 satis@ing assignment nor properties such as whether there is a satisfying assignment in which xl = X3 etc. It is also demonstrated that zero-knowledge proofs exist œoutside the domain of cryptography and number theory.  Using no assumptions. it is shown that both graph isomorphism and http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Loading next page...
 
/lp/association-for-computing-machinery/proofs-that-yield-nothing-but-their-validity-or-all-languages-in-np-mf0saA1wS5

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1991 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/116825.116852
Publisher site
See Article on Publisher Site

Abstract

Proofs that Yield Nothing But Their Validity or All Languages Proof Systems in NP Have Zero-Knowledge ODED GOLDREICH Technion, Haifa, Israel SILVIO MICALI Institute of Technology, Catnbridge, Massachusetts Massachusetts AND AVI WIGDERSON Hebrew University, Jerusalem, Israel 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 satis@ing assignment nor properties such as whether there is a satisfying assignment in which xl = X3 etc. It is also demonstrated that zero-knowledge proofs exist œoutside the domain of cryptography and number theory.  Using no assumptions. it is shown that both graph isomorphism and

Journal

Journal of the ACM (JACM)Association for Computing Machinery

Published: Jul 1, 1991

There are no references for this article.