How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Journal of the ACM (JACM)
SIAM Journal on Computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The knowledge complexity of quadratic residuosity languages
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract)
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
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
Pairwise Independence and Derandomization
Pairwise Independence and Derandomization
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On the complexity of bounded-interaction and noninteractive zero-knowledge proofs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Recycling random bits in composed perfect zero-knowledge
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Robust Non-interactive Zero Knowledge
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Practical Zero-Knowledge Proofs for Circuit Evaluation
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Perfect non-interactive zero knowledge for NP
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We show that any language L in NP has a noninteractive zero-knowledge proof system which uses Θ(log(1/s) + nƐ) random bits, where s is the soundness error, n the length of the input and Ɛ can be any constant 0. In order to achieve this result, we formulate and investigate the problem of randomness-efficient error reduction for noninteractive zero-knowledge proofs, which generalizes the analogue and well-studied problem for BPP computation.