Minimum Resource Zero-Knowledge Proofs [chapter]

Joe Kilian, Silvio Micali, Rafail Ostrovsky
Advances in Cryptology — CRYPTO' 89 Proceedings  
We consider several resources relating to zero-knowledge protocols: The number of envelopes used in the protocol, the number of oblivious transfers protocols executed during the protocol, and the total amount of communication required by the protocol. We show that after a pre-processing stage consisting of O(k) executions of Oblivious Transfer, any polynomial number of NP-theorems of any poly-size can be proved non-interactively and in zero-knowledge, based on the existence of any one-way
more » ... f any one-way function, so that the probability of accepting a false theorem is less then 1 2 k .
doi:10.1007/0-387-34805-0_47 dblp:conf/crypto/KilianO89 fatcat:gtmjtnxwl5g3tfnnrtotmfgvz4