Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems

In a companion paper [De Yu] we have developed the tool of non-interactive proof-system we call "Metaproof" (µ-NIZK proof system); this provides a proof of "the existence of a proof to a statement". Using a reduction of the theorem to a set of claims about encrypted values, enabled us to develop a crucial proof-system property which we called "on-line simulatable NIZK proof-system". This was used to implement the "Many-Prover Non-Interactive Proof-System" where independent users can send proofs (which was not known in the original system and was open), and a "Self-Referential NIZK proof system" where the random reference string is available to the polynomial-time opponent who chooses the theorem to prove, (this was an intriguing question regarding such systems).In this abstract we present an introduction to the basic tools and their possible applications. The subject of this paper is a variety of cryptographic applications provided by the new tools. We demonstrate its applicability in enhancing security and properties of a methodology for signature and authentication developed by Bellare and Goldwasser [BeGo] (by using the Metaproof system to solve the open problem of many-prover NIZK system). We also show, among other things, how the tools can be used to provide security mechanisms such as an "Oblivious Warden" which translates non-interactive proofs to random ones independently of the proof itself, and the notion of "Gradual opening of a zero-knowledge computation" which is first demonstrated to be correct using a non-interactive proof, and then is opened gradually and fast (i.e., without further proofs).

[1]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[2]  Adi Shamir,et al.  Multiple non-interactive zero knowledge proofs based on a single random string , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[3]  Silvio Micali,et al.  Non-Interactive Zero-Knowledge with Preprocessing , 1988, CRYPTO.

[4]  Silvio Micali,et al.  Non-Interactive Zero-Knowledge Proof Systems , 1987, CRYPTO.

[5]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[6]  Manuel Blum,et al.  Non-interactive zero-knowledge and its applications , 1988, STOC '88.

[7]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[8]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[9]  Moni Naor,et al.  Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10]  Moti Yung,et al.  Direct Minimum-Knowledge Computations , 1987, CRYPTO.

[11]  Silvio Micali,et al.  On-Line/Off-Line Digital Schemes , 1989, CRYPTO.

[12]  Johan Håstad,et al.  Pseudo-random generators under uniform assumptions , 1990, STOC '90.

[13]  Moni Naor,et al.  Bit Commitment Using Pseudo-Randomness , 1989, CRYPTO.

[14]  Adi Shamir,et al.  Witness indistinguishable and witness hiding protocols , 1990, STOC '90.

[15]  Silvio Micali,et al.  Non-Interactive Oblivious Transfer and Spplications , 1989, CRYPTO.

[16]  Mihir Bellare,et al.  New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs , 1989, CRYPTO.

[17]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[18]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[19]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[20]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[21]  John Rompel,et al.  One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Moni Naor,et al.  Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.

[24]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[25]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[26]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..