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
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Constant-round perfect zero-knowledge computationally convincing protocols
Theoretical Computer Science
SIAM Journal on Computing
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
Secret sharing and perfect zero knowledge
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
The knowledge complexity of quadratic residuosity languages
Theoretical Computer Science
Randomness in Distributed Protocols
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Special Uses and Sbuses of the Fiat-Shamir Passport Protocol
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Everything Provable is Provable in Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A Randomnesss-Rounds Tradeoff in Private Computation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
How to Utilize the Randomness of Zero-Knowledge Proofs
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Multiple non-interactive zero knowledge proofs based on a single random string
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Randomness in interactive proofs
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On server trust in private proxy auctions
Electronic Commerce Research
Hi-index | 0.01 |
In this paper we give techniques for recycling random bits both in the interactive and in the non-interactive model for perfect zero-knowledge proofs. Our first result is a non-interactive perfect zero-knowledge proof system for proving that at least one out of any given polynomial number of statements is true, in which the amount of public random bits used is the same as that for proving a single statement. Our second result is an interactive perfect zero-knowledge proof system for proving any given polynomial number of statements, in which the amount of private random bits used by the prover is, apart from a constant factor, the same as that for proving a single statement. In order to get a randomness-efficient proof system, we also reduce the random string of the verifier by using a multi-bit commitment scheme. The statements considered are of quadratic non residuosity modulo a Blum integer.