Randomness-optimal characterization of two NP proof systems

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

Volumn 2483, Issue , 2002, Pages 179-193

  De Santis, Alfredo ^a   Di Crescenzo, Giovanni ^b   Persiano, Giuseppe ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROGRAMMABLE LOGIC CONTROLLERS;

ERROR REDUCTION; NON-INTERACTIVE ZERO-KNOWLEDGE PROOFS; ONE-WAY FUNCTIONS; PROOF SYSTEM; RANDOM BITS;

RANDOM PROCESSES;

EID: 84942550475     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_15     Document Type: Conference Paper

References (37)

1. M. Ajtai, J. Komlos, and E. Szemeredi, Deterministic Simulation in Logspace, Proc. of STOC 87.
2. M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proof Systems, in Proc. of FOCS 90, pp. 563-572.
3. M. Ben-Or, S. Goldwasser, J. Kilian and A. Wigderson, Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions, Proc. of STOC 88.
4. M. Blum, Coin Flipping by Telephone, Proc. IEEE Spring COMPCOM (1982), 133-137.
5. M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Jou. on Computing, vol. 20, no. 6, Dec 1991, pp. 1084-1118.
6. M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, Proc. of STOC 88.
7. 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.
8. J. Boyar and R. Peralta, Short Discreet Proofs, Proc. of EUROCRYPT 96.
9. B. Chor and O. Goldreich, On the Power of Two-Point Based Sampling, Journal of Complexity, vol. 5, pp. 96-106, 1989.
10. A. Cohen and A. Wigderson, Dispersers, Deterministic Amplification and Weak Random Sources, Proc. of FOCS 89.
11. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai, Robust Non-Interactive Zero Knowledge, in Proc. of CRYPTO 2001.
12. A. De Santis, G. Di Crescenzo, and G. Persiano, Randomness-Effcient Non-Interactive Zero-Knowledge, Proc. of ICALP 97.
13. A. De Santis, G. Di Crescenzo, and G. Persiano, Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP, Proc. of ICALP 99.
14. A. De Santis and M. Yung, Cryptographic applications of the meta-proof and the many-prover systems, Proc. of CRYPTO 90.
15. C. Dwork and M. Naor, Zaps and Their Applications, Proc. of FOCS 2000.
16. U. Feige, S. Goldwasser, L. Lovasz, S. Safra and M. Szegedy, Approximating Clique is Almost NP-complete, Proc. of FOCS 91.
17. U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Under General Assumptions, SIAM Jou. on Computing, 29(1), 1999, p. 1-28.
18. U. Feige and A. Shamir, Witness-Indistinguishable and Witness-Hiding Protocols, Proc. of STOC 90.
19. O. Gabber and Z. Galil, Explicit Constructions of Linear Sized Superconcentrators, Journal of Computer and System Sciences, vol. 22, pp. 407-420, 1981.
20. Gillman, A. Chernoff Bound for Random Walks on Expanders, Proc. of STOC 93.
21. M. Gareye, D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979.
22. O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, vol. 7, 1994, pp. 1-32.
23. S. Goldwasser, and S. Micali, Probabilistic Encryption, in Journal of Computer and System Sciences, vol. 28, n. 2, 1984, pp. 270-299.
24. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM J. on Computing, vol. 18, n. 1, 1989.
25. J. Hastad, R. Impagliazzo, L. Levin and M. Luby, Construction of A Pseudo-Random Generator from Any One-Way Function, SIAM Jou. on Computing, vol. 28, n. 4, pp. 1364-1396.
26. R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proc. of FOCS 89.
27. J. Kilian, On the complexity of bounded-interaction and non-interactive zero-knowledge proofs, Proc. of FOCS 94.
28. R. Karp, N. Pippenger, and M. Sipser, Expanders, Randomness, or Time vs. Space, in Proc. of 1st Structures of Complexity Theory, 1986.
29. J. Kilian, and E. Petrank, An efficient zero-knowledge proof system for NP under general assumptions, Journal of Cryptology, vol. 11, n. 1, pp. 1-28.
30. A. Lubotzky, R. Phillips, and P. Sarnak, Explicit Expanders and the Ramanujan Conjectures, Proc. of STOC 86.
31. M. Naor, Bit Commitment from Pseudo-Randomness, Proc. of CRYPTO 89.
32. R. Ostrovsky and A. Wigderson, One-way Functions are Essential for Non-Trivial Zero-knowledge, in Proc. of the 2nd Israel Symposium on Theory of Computing and Systems (ISTCS-93).
33. N. Nisan, Pseudorandom bits for constant depth circuits, Combinatorica, 11, pp. 63-70, 1991.
34. O. Reingold, S. Vadhan and A. Wigderson, Entropy Waves, The Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors, in Proc. of FOCS 2000.
35. M. Sipser, A Complexity-Theoretic Aproach to Randomness, in Proc. of STOC 1983.
36. A. Sahai, Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security, in Proc. of FOCS 1999.
37. D. Zuckerman, Randomness-Optimal Oblivious Sampling, in Proc. of STOC 97.