Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

Computational Complexity

Volumn 12, Issue 3-4, 2003, Pages 85-130

  Gutfreund, Dan ^a   Shaltiel, Ronen ^b   Ta Shma, Amnon ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Arthur Merlin games; Derandomization

Indexed keywords

EID: 4744337602     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-003-0178-7     Document Type: Article

References (46)

1. W. AIELLO & J. HÅSTAD (1991). Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. System Sci. 42, 327-345.
2. S. ARORA & S. SAFRA (1998). Probabilistic checking of proofs: A new characterization of NP. J. ACM 45, 70-122.
3. V. ARVIND & J. KOBLER (1997). On resource-bounded measure and pseudorandomness. In Proc. 17th Conf. on Foundations of Software Technology and Theoretical Computer Science, 235-249.
4. L. BABAI, L. FORTNOW, L. LEVIN & M. SZEGEDY (1991a). Checking computations in polylogarithmic time. In Proc. 23rd Annual ACM Symposium on Theory of Computing, 21-31.
5. L. BABAI, L. FORTNOW & C. LUND (1991b). Nondeterministic exponential time has two-prover interactive protocols. Comput. Complexity 1, 3-40.
6. L. BABAI, L. FORTNOW, N. NISAN & A. WIGDERSON (1993). BPP has subexponential time simulations unless exptime has publishable proofs. Comput. Complexity 3, 307-318.
7. L. BABAI & S. MORAN (1988). Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes. J. Comput. System Sci. 36, 254-276.
8. B. BARAK, S. J. ONG & S. VADHAN (2003). Derandomization in cryptography. In Proc. 23rd International Cryptography Conference.
9. M. BLUM & S. KANNAN (1995). Designing programs that check their work. J. ACM 42, 269-291.
10. M. BLUM & S. MICALI (1984). How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 850-864.
11. J. FRIEDMAN (1990). A note on matrix rigidity. Technical Report TR-308-91, Department of Computer Science, Princeton Univ.
12. M. FÜRER, O. GOLDREICH, Y. MANSOUR, M. SIPSER & S. ZACHOS (1989). On completeness and soundness in interactive proof systems. Advances in Computing Research 5, Randomness and Computation, 429-442.
13. O. GOLDREICH & S. GOLDWASSER (1998). On the limits of non-approximability of lattice problems. In Proc. 30th Annual ACM Symposium on Theory of Computing, 1-9.
14. O. GOLDREICH, S. MICALI & A. WIGDERSON (1991). Proofs that yield nothing but their validity, or All languages in NP have zero-knowledge proof systems. J. ACM 38, 691-729.
15. O. GOLDREICH & D. ZUCKERMAN (1997). Another proof that BPP ⊆ PH (and more). Technical Report TR97-045, Electronic Colloquium on Computational Complexity.
16. S. GOLDWASSER & M. SIPSER (1989). Private coins versus public coins in interactive proof systems. Advances in Computing Research 5, Randomness and Computation, 73-90.
17. R. IMPAGLIAZZO, V. KABANETS & A. WIGDERSON (2002). In search of an easy witness: Exponential time vs. probabilistic polynomial time. J. Comput. System Sci. 64, 672-694.
18. R. IMPAGLIAZZO, R. SHALTIEL & A. WIGDERSON (1999). Near-optimal conversion of hardness into pseudo-randomness. In Proc. 40th Annual IEEE Symposium on Foundations of Computer Science, 181-190.
19. R. IMPAGLIAZZO, R. SHALTIEL & A. WIGDERSON (2000). Extractors and pseudo-randomn generators with optimal seed-length. In Proc. 32nd Annual ACM Symposium on Theory of Computing, 1-10.
20. R. IMPAGLIAZZO & A. WIGDERSON (1997). P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In Proc. 29th Annual ACM Symposium on Theory of Computing, 220-229.
21. R. IMPAGLIAZZO & A. WIGDERSON (1998). Randomness vs. time: de-randomization under a uniform assumption. In Proc. 39th Annual IEEE Symposium on Foundations of Computer Science, 734-743.
22. V. KABANETS (2000). Easiness assumptions and hardness tests: trading time for zero error. In Proc. 15th Annual IEEE Conference on Comput. Complexity, 150-157.
23. V. KABANETS (2002). Derandomization: a brief overview. Bull Eur. Assoc. Theoret. Comput. Sci. 76, 88-103.
24. R. M. KARP & R. J. LIPTON (1980). Some connections between nonuniform and uniform complexity classes. In Proc. 12th Annual ACM Symposium on Theory of Computing, 302-309.
25. A. R. KLIVANS & D. VAN MELKEBEEK (1999). Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. In Proc. 31st Annual ACM Symposium on Theory of Computing, 659-667.
26. C. J. LU (2001). Derandomizing Arthur-Merlin games under uniform assumptions. Comput. Complexity 10, 247-259.
27. P. B. MILTERSEN & N. V. VINODCHANDRAN (1999). Derandomizing Arthur-Merlin games ushig hitting sets. In Proc. 40th Annual IEEE Symposium on Foundations of Computer Science, 71-80.
28. N. NISAN (1996). Extracting randomness: how and why: a survey. In Proc. 11th Annual IEEE Conference on Comput. Complexity, 44-58.
29. N. NISAN & A. TA-SHMA (1999). Extracting randomness: a survey and new constructions. J. Comput. System Sci. 58, 148-173.
30. N. NISAN & A. WIGDERSON (1994). Hardness vs randomness. J. Comput. System Sci. 49, 149-167.
31. 2/r for one simple matrix. Comment. Math. Univ. Carolin. 32, 213-218.
32. A. RAZBOROV (1989). On rigid matrices. Manuscript (in Russian).
33. A. SAHAI & S. VADHAN (1997). A complete promise problem for statistical zero-knowledge. In Proc. 38th Annual IEEE Symposium on Foundations of Computer Science, 448-457.
34. M. SAKS, A. SRINIVASAN & S. ZHOU (1998). Explicit OR-dispersers with polylogarithmic degree. J. ACM 45, 123-154.
35. M. SANTHA (1989). Relativized Arthur-Merlin versus Merlin-Arthur games. Inform. and Comput. 80, 44-49.
36. R. SHALTIEL (2002). Recent developments in explicit constructions of extractors. Bull. Eur. Assoc. Theor. Comput. Sci. 77, 67-95.
37. R. SHALTIEL & C. UMANS (2001). Simple extractors for all min-entropies and a new pseudo-random generator. In Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, 648-657.
38. M. SIPSER (1988). Expanders, randomness, or time versus space. J. Comput. System Sci. 36, 379-383.
39. M. SUDAN, L. TREVISAN & S. VADHAN (1999). Pseudorandom generators without the XOR Lemma. In Proc. 31st Annual ACM Symposium on Theory of Computing, 537-546.
40. A. TA-SHMA (1998). Almost optimal dispersers. In Proc. 30th Annual ACM Symposium on Theory of Computing, 196-202.
41. A., TA-SHMA, C. UMANS & D. ZUCKERMAN (2001). Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd Annual ACM Symposium on Theory of Computing, 143-152.
42. L. TREVISAN & S. VADHAN (2002). Pseudorandomness and average-case complexity via uniform reductions. In Proc. 17th Annual IEEE Conference on Comput. Complexity, 129-138.
43. C. UMANS (2002). Pseudo-random generators for all hardnesses. In Proc. 34th Annual ACM Symposium on Theory of Computing, 627-634.
44. C. UMANS (2003). Personal communication.
45. L. G. VALIANT (1977). Graph-theoretic arguments in low-level complexity. In Proc. 6th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Comput. Sci. 53, Springer, 162-176.
46. A. C. YAO (1982). Theory and applications of trapdoor functions. In Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science, 80-91.