Derandomizing Arthur-Merlin games using hitting sets

Computational Complexity

Volumn 14, Issue 3, 2005, Pages 256-279

  Miltersen, Peter Bro ^a   Vinodchandran, N V ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Classes; Complexity; Derandomization; Graph nonisomorphism; Interactive proof systems

Indexed keywords

EID: 29144500344     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-005-0197-7     Document Type: Conference Paper

References (50)

1. A. E. ANDREEV, A. E. F. CLEMENTI & J. D. P. ROLIM (1996a). Hitting properties of hard Boolean operators and their consequences on BPP. Technical Report TR96-055, Electronic Colloquium on Computational Complexity. Available at http://www.eccc.uni-trier.de/eccc.
2. A. E. ANDREEV, A. E. F. CLEMENTI & J. D. P. ROLIM (1996b). Hitting sets derandomize BPP. In Proc. 23rd International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1099, Springer, 357-368.
3. A. E. ANDREEV, A. E. F. CLEMENTI & J. D. P. ROLIM (1997a). Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs. In Proc. 24th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1256, Springer, 177-187.
4. A. E. ANDREEV, A. E. F. CLEMENTI, J. D. P. ROLIM & L. TREVISAN (1997b). Weak random sources, hitting sets, and BPP simulations. In Proc. 38th IEEE Symposium on Foundations of Computer Science, 264-272.
5. A. E. ANDREEV, A. E. F. CLEMENTI & J. D. P. ROLIM (1998). A new general derandomization method. J. ACM 45, 179-213.
6. V. ARVIND & J. KÖBLER (2001). On pseudorandomness and resource-bounded measure. Theoret. Comput. Sci. 255, 205-221.
7. L. BABAI (1985). Trading group theory for randomness. In Proc. 17th ACM Symposium on Theory of Computing, 421-429.
8. L. BABAI (1992). Bounded round interactive proofs in finite groups. SIAM J. Discrete Math. 5, 88-111.
9. L. BABAI, L. FORTNOW, L. A. LEVIN & M. SZEGEDY (1991). Checking computations in polylogarithmic time. In Proc. 23rd ACM Symposium on Theory of Computing, 21-31.
10. L. BABAI, L. FORTNOW, N. NISAN & A. WIGDERSON (1993). BPP has subexponential time simulations unless EXPTIME has publishable proofs. Comput. Complexity 3, 307-318.
11. L. BABAI, W. M. KANTOR & E. M. LUKS (1983). Computational complexity and the classification of finite simple groups. In Proc. 24th IEEE Symposium on Foundations of Computer Science, 162-171.
12. L. BABAI & E. M. LUKS (1983). Canonical labeling of graphs. In Proc. 15th ACM Symposium on Theory of Computing, 171-183.
13. 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.
14. J. L. BALCÁZAR, J. DÍAZ & J. GABARRÓ (1995). Structural Complexity II. EATCS Monogr. Theoret. Comput. Sci. 22, Springer.
15. B. BARAK, S. J. ONG & S. P. VADHAN (2003). Derandomization in cryptography. In Proc. 23rd International Cryptology Conference (CRYPTO 2003), Lecture Notes in Comput. Sci. 2729, Springer, 229-315.
16. M. BLUM & S. MICALI (1984). How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 850-864.
17. H. BUHRMAN & L. FORTNOW (1999). One-sided versus two-sided error in probabilistic computation. In Proc. 16th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1563, Springer, 100-109.
18. M. FÜRER, O. GOLDREICH, Y. MANSOUR, M. SIPSER & S. ZACHOS (1989). On completeness and soundness in interactive proof systems. In Advances in Computing Research 5: Randomness and Computation, S. Micali (ed.), 429-442.
19. O. GOLDREICH & L. A. LEVIN (1989). A hard-core predicate for all one-way functions. In Proc. 21th ACM Symposium on Theory of Computing, 25-32.
20. 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.
21. O. GOLDREICH, S. VADHAN & A. WIGDERSON (2000). Simplified derandomization of BPP using a hitting set generator. Technical Report TR00-004. Electronic Colloquium on Computational Complexity. Available at http://www.eccc.uni-trier.de/eccc.
22. S. GOLDWASSER & M. SIPSER (1989). Private coins versus public coins in interactive proof systems. In: Advances in Computing Research 5, 73-90.
23. D. GUTFREUND, R. SHALTIEL & A. TA-SHMA (2003). Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. In Proc. 18th IEEE Conference of Computational Complexity, 33-47.
24. R. IMPAGLIAZZO (1995). Hard-core distributions for somewhat hard problems. In Proc. 36th IEEE Symposium on Foundations of Computer Science, 538-547.
25. R. IMPAGLIAZZO, V. KABANETS & A. WIGDERSON (2002). In search of an easy witness: exponential time vs. probabilistic polynomial time. J. Comput. System Sci. 65, 672-694.
26. R. IMPAGLIAZZO, R. SHALTIEL & A. WIGDERSON (1999). Near-optimal conversion of hardness into pseudo-randomness. In Proc. 40th IEEE Symposium on Foundations of Computer Science, 181-190.
27. R. IMPAGLIAZZO, R. SHALTIEL & A. WIGDERSON (2000). Extractors and pseudo-random generators with optimal seed length. In Proc. 32nd ACM Symposium on Theory of Computing, 1-10.
28. R. IMPAGLIAZZO & A. WIGDERSON (1997). P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In Proc. 29th ACM Symposium on Theory of Computing, 220-229.
29. V. KABANETS (2001). Easiness assumptions and hardness tests: trading time for zero error. J. Comput. System Sci. 63, 236-252.
30. A. R. KLIVANS & D. VAN MELKEBEEK (2002). Graph Nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31, 1501-1526.
31. C.-.J. LU (2001). Derandomizing Arthur-Merlin games under uniform assumptions. Comput. Complexity 10, 247-259.
32. D. VAN MELKEBEEK (1998). Derandomizing Arthur-Merlin games. Technical Report TR-98-08, The University of Chicago, Department of Computer Science.
33. P. B. MILTERSEN (1998). Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 556-563.
34. P. B. MlLTERSEN (2001). Derandomizing complexity classes. In Handbook of Randomized Computing, Kluwer, 843-941.
35. P. B. MILTERSEN & N. V. VINODCHANDRAN (1999). Derandomizing Arthur-Merlin games using hitting sets. In Proc. 40th IEEE Symposium on Foundations of Computer Science, 71-80.
36. N. NISAN & A. WIGDERSON (1994). Hardness vs randomness. J. Comput. System Sci. 49, 149-167.
37. C. PAPADIMITRIOU (1994). Computational Complexity. Addison-Wesley.
38. M. SAKS, A. SRINIVASAN & S. H. ZHOU (1998). Explicit OR-dispersers with polylogarithmic degree. J. ACM 45, 123-154.
39. A. L. SELMAN (1996). Much ado about functions. In Proc. 11th IEEE Conference on Computational Complexity, 198-212.
40. R. SHALTIEL (2002). Recent developments in extractors. Bull. Europ. Assoc. Theoret. Comput. Sci. 77, 67-95.
41. R. SHALTIEL & C. UMANS (2001). Simple extractors for all minentropies and a new pseudo-random generator. In Proc. 41st IEEE Symposium on Foundations of Computer Science, 648-657.
42. R. SHALTIEL & C. UMANS (2004). Pseudorandomness for approximate counting and sampling. Technical Report TR04-84, Electronic Colloquium on Computational Complexity. Available at http://www.eccc.uni-trier.de/eccc.
43. M. SIPSER (1988). Expanders, randomness, or time versus space. J. Comput. System Sci. 36, 379-383.
44. M. SUDAN, L. TREVISAN & S. VADHAN (2001). Pseudorandom generators without the XOR lemma. J. Comput. System Sci. 62, 236-266.
45. A. TA-SHMA (2002). Almost optimal dispersers. Combinatorica 22, 123-145.
46. A. TA-SHMA, C. UMANS & D. ZUCKERMAN (2001). Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd ACM Symposium on Theory of Computing, 143-152.
47. L. TREVISAN (2001). Extractors and pseudorandom generators. J. ACM 48, 860-879.
48. C. UMANS (2003). Pseudo-random, generators for all hardnesses. J. Comput. System Sci. 67, 419-440.
49. C. B. WILSON (1985). Relativized circuit complexity. J. Comput. System Sci. 31, 169-181.
50. A. C. YAO (1982). Theory and application of trapdoor functions. In Proc. 23rd IEEE Symposium on Foundations of Computer Science, 80-91.