Low-end uniform hardness vs. randomness tradeoffs for AM

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 430-439

  Shaltiel, Ronen ^a   Umans, Christopher ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Arthur Merlin games; Derandomization; Hardness vs. randomness tradeoff; Hitting set generator

Indexed keywords

ARTHUR-MERLIN GAMES; DERANDOMIZATION; HITTING-SET GENERATORS; OPTIMAL TRADEOFFS;

CODES (SYMBOLS); COMPUTER SIMULATION; CRYPTOGRAPHY; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

GAME THEORY;

EID: 35448955268     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250854     Document Type: Conference Paper

References (33)

1. A. E. Andreev, A. E. F. Clementi, and J. D. P. Rolim. Hitting sets derandomize BPP. In ICALP, pages 357-368, 1996.
2. V. Arvind and J. Kobler. On pseudorandomness and resource-bounded measure. Theoretical Computer Science, 255, 2001.
3. L. Babai, L. Fortnow, and C. Lund. Nondeterininistic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
4. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307-318, 1993.
5. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In Choffrut and Lengauer [8], pages 37-48.
6. M. Blum and S. Kannan. Designing programs that check their work. Journal of the ACM, 42(1):269-291, 1995.
7. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, Nov. 1984.
8. C. Choffrut and T. Lengauer, editors. STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, volume 415 of Lecture Notes in Computer Science. Springer, 1990.
9. K. Friedl and M. Sudan. Some improvements to total degree tests. In ISTCS, pages 190-198, 1995.
10. O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer-Verlag, Algorithms and Combinatorics, 1998.
11. D. Gutfreund, R. Shaltiel, and A. Ta-Shma. Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity, 12(3-4):85-130, 2003.
12. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In 36th Annual Symposium on Foundations of Computer Science, pages 538-545, 1995.
13. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: Exponential time vs. probabilistic polynomial time. In Proceedings of the 16th Annual Conference on Computational Complexity (CCC-01), pages 2-12, 2001.
14. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Near-optimal conversion of hardness into pseudo-randomness. In 40th Annual Symposium on Foundations of Computer Science, pages 181-190, 1999.
15. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Extractors and pseudo-random genera-tors with optimal seed length. In Proceedings of the thirty second annual Symposium on Theory of Computing, pages 1-10, 2000.
16. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Reducing the seed length in the Nisan-Wigderson generator. To appear in Combinatorica, 2006.
17. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
18. R. Impagliazzo and A. Wigderson. Randomness vs. time: De-randomization under a uniform assumption. In 39th Annual Symposium on Foundations of Computer Science, pages 734-743, 1998.
19. V. Kabanets. Easiness assumptions and hardness tests: Trading time for zero error. In Proceedings of the 15th Annual IEEE Conference on Computational Colmplexity (COCO-00), pages 150-157, 2000.
20. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1-2):1-46, 2004.
21. A. R. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing, 31(5):1501-1526, Oct. 2002.
22. R. J. Lipton. Efficient checking of computations. In Choffrut and Lengauer [8], pages 207-215.
23. C.-J. Lu. Encryption against storage-bounded adversaries from on-line strong extractors. J. Cryptology, 17(1):27-42, 2004.
24. P. B. Miltersen and N. V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In 40th Annual Symposium on Foundations of Computer Science, pages 71-80, 1999.
25. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49(2):149-167, Oct. 1994.
26. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42nd Symposium on Foundations of Computer Science, pages 648-657, 2001.
27. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62:236-266, 2001.
28. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.
29. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th Annual Conference on Computational Complexity, 2002.
30. C. Umans. Pseudo-random generators for all hardnesses. Journal of Computer and System Sciences, 67:419-440, 2003.
31. C. Umans. Reconstructive dispersers and hitting set generators. In APPROX-RANDOM, pages 460-471, 2005.
32. S. P. Vadhan. Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptology, 17(1):43-77, 2004.
33. A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23th Annual Symposium on Foundations of Computer Science, pages 80-91, 1982.