Uniform generation of script N℘-witnesses using an script N℘-oracle

Information and Computation

Volumn 163, Issue 2, 2000, Pages 510-526

  Bellare, Mihir ^a   Goldreich, Oded ^b,d   Petrank, Erez ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c IBM HAIFA RESEARCH LAB   (Israel)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; POLYNOMIALS; PROBABILITY; STATISTICAL METHODS;

STATISTICAL ZERO-KNOWLEDGE LANGUAGES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034672929     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2885     Document Type: Article

References (26)

1. Aiello, W., and Håstad, J. (1991), Statistical zero-knowledge languages can be recognized in two rounds, J. Comput. Syst. Sci. 45, 327-345.
2. Babai, L., Fortnow, L., and Lund, C. (1992), Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity 1, 3-40. [See also addendum in (1992), 2, 374.]
3. Bellare, M. Feige, U., and Kilian, J. (1995), On the role of shared randomness in two prover proof systems, in "Proceedings of the third Israel Symposium on Theory and Computing Systems," IEEE, New York.
4. Bellare, M. Micali, S., and Ostrovsky, R. (1990), The (true) complexity of statistical zero-knowledge, in "Proceedings of the 22nd Annual Symposium on the Theory of Computing," ACM, New York.
5. Bellare, M., and Petrank, E. (1992), Making zero-knowledge efficient, in "Proceedings of the 24th Annual Symposium on the Theory of Computing," ACM, New York.
6. Bellare, M., and Rompel, J. (1994), Randomness-efficient oblivious sampling, in "Proceedings of the 35th Symposium on Foundations of Computer Science," IEEE, New York.
7. Ben-Or, M. Goldwasser, S. Kilian, J., and Wigderson, A. (1988), Multi-prover interactive proofs: How to remove intractability assumptions, in "Proceedings of the 20th Annual Symposium on the Theory of Computing," ACM, New York.
8. c n)-wise independence in NC, in "Proceedings of the 30th Symposium on Foundations of Computer Science," IEEE, New York.
9. Fortnow, L. (1989), The complexity of perfect zero-knowledge, in "Advances in Computing Research: A Research Annual" (S. Micali, Ed.), Randomness and Computation, Vol. 5, pp. 327-343.
10. Goldreich, O., and Håstad, J., in press. On the complexity of interactive proofs with bounded communication. IPL,
11. See also ECCC Report TR96-018, 1996.
12. Goldreich, O. Ostrovsky, R., and Petrank, E. (1994), Knowledge complexity and computational complexity, in "Proceedings of the 26th Annual Symposium on the Theory of Computing," ACM, New York.
13. Goldreich, O., and Petrank, E. (1991), Quantifying knowledge complexity, in "Proceedings of the 32nd Symposium on Foundations of Computer Science," IEEE, New York.
14. Goldwasser, S., Micali, S., and Rackoff, C. (1989), The knowledge complexity of interactive proof systems, SIAM J. Comp. 18, 186-208.
15. Goldwasser, S., and Sipser, M. (1989), Private coins versus public coins in interactive proof systems, in "Advances in Computing Research: A Research Annual" (S. Micali, Ed.), Randomness and Computation, Vol. 5, pp. 73-90.
16. Jerrum, M., Valiant, L., and Vazirani, V. (1986), Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci. 43, 169-188.
17. Karp, R., and Luby, M. (1983), Monte-Carlo algorithms for enumeration and reliability problems, in "Proceedings of the 24th Symposium on Foundations of Computer Science," IEEE, New York.
18. Motwani, R. Naor, J., and Naor, M. (1989), The probabilistic method yields deterministic parallel algorithms, in "Proceedings of the 30th Symposium on Foundations of Computer Science," IEEE, New York.
19. Petrank, E., and Tardos, G. (1996), On the knowledge complexity of NP, in "Proceedings of the 37th Symposium on Foundations of Computer Science," IEEE, New York.
20. Sinclair, A. (1988), Randomized algorithms for counting and generating combinatorial structures, Ph.D. thesis University of Edinburgh.
21. Sinclair, A. (1993), Randomized algorithms for counting and generating combinatorial structures, in "Advances in Theoretical Computer Science," Birkhäuser, Boston.
22. Schmidt, J. Siegel, A., and Srinivasan, A. (1993), Chernoff-Hoeffding bounds for applications with limited independence, in "Proceedings of the 4th Annual Symposium on Discrete Algorithms," ACM-SIAM, New York.
23. Shoup, V. (1988), New algorithms for finding irreducible polynomials over finite fields, in "Proceedings of the 29th Symposium on Foundations of Computer Science," IEEE, New York.
24. Sipser, M. (1983), A complexity theoretic approach to randomness, in "Proceedings of the 15th Annual Symposium on the Theory of Computing," ACM, New York.
25. Stockmeyer, L. (1983), The complexity of approximate counting, in "Proceedings of the 15th Annual Symposium on the Theory of Computing," ACM, New York.
26. Valiant, L., and Vazirani, V. (1986), script N℘ is as easy as detecting unique solutions, Theoret. Comput. Sci. 47, 85-93.