Non-interactive zero-knowledge: A low-randomness characterization of np (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 271-280

  De Santis, A ^a   Di Crescenzo, G ^b   Persiano, G ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

ERROR REDUCTION; EXTENDED ABSTRACTS; NON-INTERACTIVE ZERO KNOWLEDGE; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; RANDOM BITS;

RANDOM PROCESSES;

EID: 33746068866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_24     Document Type: Conference Paper

References (24)

1. M. Ajtai, J. Komlos, and E. Szemeredi, Deterministic Simulation in Logspace, Proc. of STOC 87.
2. M. Ben-Or, S. Goldwasser, J. Kilian and A. Wigderson, Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions, Proc. of STOC 88.
3. M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero- Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084-1118.
4. M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Appli- cations, Proc. of STOC 88.
5. M. Blum and S. Micali, How to Generate Cryptographically Strong Sequence of Pseudo-Random Bits, SIAM J. on Computing, vol. 13, no. 4, 1984, pp. 850-864.
6. J. Boyar and R. Peralta, Short Discreet Proofs, Proc. of EUROCRYPT 96.
7. A. Cohen and A. Wigderson, Dispersers, Deterministic Amplification and Weak Random Sources, Proc. of FOCS 89.
8. I. Damgaard, Non-interactive circuit-based proofs and non-interactive perfect zero- knowledge with preprocessing, Proc. of EUROCRYPT 92.
9. A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, in Theoretical Computer Science, Vol. 132, pp. 291-317 (1994).
10. A. De Santis, G. Di Crescenzo, and G. Persiano, Randomness-Eficient Non- Interactive Zero-Knowledge, Proc. of ICALP 97.
11. A. De Santis and M. Yung, Cryptographic applications of the meta-proof and the many-prover systems, Proc. of CRYPTO 90.
12. G. Di Crescenzo, Recycling Random Bits for Composed Perfect Zero-Knowledge, Proc. of EUROCRYPT 95.
13. U. Feige, S. Goldwasser, L. Lovasz, S. Safra and M. Szegedy, Approximating Clique is Almost NP-complete, Proc. of FOCS 91.
14. U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, Proc. of STOC 90.
15. Gillman, A Chernoff Bound for Random Walks on Expanders, Proc. of STOC 93.
16. M. Gareye D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979.
17. O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, vol. 38, n. 1, 1991, pp. 691-729.
18. O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, vol. 7, 1994, pp. 1-32.
19. S. Goldwasser, and S. Micali, Probabilistic Encryption, in Journal of Computer and System Sciences, vol. 28, n. 2, 1984, pp. 270-299.
20. S. Goldwasser, S. Micali, and C. Racko, The Knowledge Complexity of Interactive Proof-Systems, SIAM J. on Computing, vol. 18, n. 1, 1989.
21. R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proc. of FOCS 89.
22. J. Kilian, On the complexity of bounded-interaction and non-interactive zero- knowledge proofs, Proc. of FOCS 94.
23. J. Kilian, and E. Petrank, Aneficient zero-knowledge proof system for NP under general assumptions, Journal of Cryptology, vol. 11, n. 1, pp. 1-28.
24. M. Luby and A. Wigderson, Pairwise Independence and Derandomization, ICSI Technical Report TR-95-035.