Abstract
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by Fortnow, Santhanam, and Williams, who also showed that those classes are related to questions on circuit complexity.
In this article, we wish to highlight the notion of input-oblivious proof systems and initiate a more systematic study of them. We begin by describing in detail the results of Fortnow et al. and discussing their connection to circuit complexity. We then extend the study to input-oblivious versions of IP, and PCP, and ZK and present few preliminary results regarding those versions.
- S. Aaronson. 2007. The learnability of quantum states. In Proceedings of the Royal Society 463, 2088, 3089--3114.Google Scholar
Cross Ref
- S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. 1998. Proof verification and the hardness of approximation problems. Journal of the ACM 45, 501--555. Google Scholar
Digital Library
- S. Arora and S. Safra. 1998. Probabilistic checkable proofs: A new characterization of NP. Journal of the ACM 45, 70--122. Google Scholar
Digital Library
- V. Arvind, J. Köbler, and R. Schuler. 1995. On helping and interactive proof systems. International Journal of Foundations of Computer Science 6, 2, 137--153.Google Scholar
Cross Ref
- L. Babai, L. Fortnow, and C. Lund. 1991. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3--40. Google Scholar
Digital Library
- R. V. Book. 1974. Tally languages and complexity classes. Information and Control 26, 2, 186--193.Google Scholar
Cross Ref
- V. T. Chakaravarthy and S. Roy. 2006. Oblivious symmetric alternation. In STACS 2006. Lecture Notes in Computer Science, Vol. 3884. Springer, 230--241. Google Scholar
Digital Library
- L. Fortnow, R. Santhanam, and R. Williams. 2009. Fixed-polynomial size circuit bounds. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC’09). 19--26. Google Scholar
Digital Library
- O. Goldreich. 2001. Foundation of Cryptography—Basic Tools. Cambridge University Press. Google Scholar
Digital Library
- O. Goldreich. 2008. Computational Complexity: A Conceptual Perspective. Cambridge University Press. Google Scholar
Cross Ref
- O. Goldreich and A. Wigderson. 1997. Tiny families of functions with random properties: A quality-size trade-off for hashing. Journal of Random Structures and Algorithms 11, 4, 315--343. Google Scholar
Digital Library
- R. Impagliazzo, V. Kabanets, and A. Wigderson. 2001. In search of an easy witness: Exponential time vs. probabilistic polynomial time. In Proceedings of the 16th IEEE Conference on Computational Complexity. 2--12. Google Scholar
Digital Library
- R. M. Karp and R. J. Lipton. 1980. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC’80). 302--309. Google Scholar
Digital Library
- K.-I. Ko. 1987. On helping by robust oracle machines. Theoretical Computer Science 52, 15--36. Google Scholar
Digital Library
- H. Krawczyk. 1994. LFSR-based hashing and authentication. In Advances in Cryptology—CRYPTO’94. Lecture Notes in Computer Science, Vol. 839. Springer, 129--139. Google Scholar
Digital Library
- H. Krawczyk. 1995. New hash functions for message authentication. In Advances in Cryptology—EUROCRYPT’95. Lecture Notes in Computer Science, Vol. 921. Springer, 301--310. Google Scholar
Digital Library
- C. Lautemann. 1993. BPP and the polynomial hierarchy. Information Processing Letters 17, 4, 215--217.Google Scholar
Cross Ref
- C. Lund, L. Fortnow, H. Karloff, and N. Nisan. 1992. Algebraic methods for interactive proof systems. Journal of the ACM 39, 4, 859--868. Google Scholar
Digital Library
- A. Shamir. 1992. IP = PSPACE. Journal of the ACM 39, 4, 869--877. Google Scholar
Digital Library
- A. Srinivasan and D. Zuckerman. 1999. Computing with very weak random sources. SIAM Journal on Computing 28, 4, 1433--1459. Google Scholar
Digital Library
- U. Schöning. 1980. Robust algorithms: A different approach to oracles. Theoretical Computer Science 40, 57--66.Google Scholar
Cross Ref
- U. Schöning. 1988. Robust oracle machines. In Mathematical Foundations of Computer Science 1988. Lecture Notes in Computer Science, Vol. 324. Springer, 93--106. Google Scholar
Digital Library
Index Terms
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
Recommendations
Languages to diagonalize against advice classes
Abstract.Variants of Kannan’s Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice strings and satisfy certain mild conditions. Let polyk denote those functions ...
Derandomizing polynomial identity tests means proving circuit lower bounds
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computingWe show that derandomizing Polynomial Identity Testing is, essentially, equivalent to proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in polynomial time (or, even, nondeterministic subexponential time, infinitely ...
Towards a proof of the 2-to-1 games conjecture?
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe present a polynomial time reduction from gap-3LIN to label cover with 2-to-1 constraints. In the “yes” case the fraction of satisfied constraints is at least 1 −ε, and in the “no” case we show that this fraction is at most ε, assuming a certain (new) ...






Comments