Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2007 | public
Book Section - Chapter

Low-end uniform hardness vs. randomness tradeoffs for AM

Abstract

In 1998, Impagliazzo and Wigderson [18] proved a hardness vs. randomness tradeoff for BPP in the uniform setting,which was subsequently extended to give optimal tradeoffs for the full range of possible hardness assumptions by Trevisan and Vadhan [29] (in a slightly weaker setting). In 2003, Gutfreund,Shaltiel and Ta-Shma [11] proved a uniform hardness vs. randomness tradeoff for AM, but that result only worked on the "high-end" of possible hardness assumptions. In this work, we give uniform hardness vs. randomness tradeoffs for AM that are near-optimal for the full range of possible hardness assumptions. Following [11], we do this by constructing a hitting-set-generator (HSG) for AM with "resilient reconstruction." Our construction is a recursive variant of the Miltersen-Vinodchandran HSG [24], the only known HSG construction with this required property. The main new idea is to have the reconstruction procedure operate implicitly and locally on superpolynomially large objects, using tools from PCPs(low-degree testing, self-correction) together with a novel use of extractors that are built from Reed-Muller codes [28, 26] for a sort of locally-computable error-reduction. As a consequence we obtain gap theorems for AM (and AM ∩ coAM) that state, roughly, that either AM (or AM ∩ coAM)protocols running in time t(n) can simulate all of EXP("Arthur-Merlin games are powerful"), or else all of AM (or AM ∩ coAM) can be simulated in nondeterministic time s(n) ("Arthur-Merlin games can be derandomized"), for a near-optimal relationship between t(n) and s(n). As in GST, the case of AM ∩ coAM yields a particularly clean theorem that is of special interest due to the wide array of cryptographic and other problems that lie in this class.

Additional Information

© 2007 ACM. Supported by BSF grant 2004329. Supported by NSF CCF-0346991, BSF 2004329, a Sloan Research Fellowship, and an Okawa Foundation research grant.

Additional details

Created:
August 19, 2023
Modified:
October 23, 2023