research-article

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly

Authors:

Oded Goldreich,

Or MeirAuthors Info & Claims

ACM Transactions on Computation Theory (TOCT), Volume 7, Issue 4

Article No.: 16, Pages 1 - 13

https://doi.org/10.1145/2799645

Published: 31 August 2015 Publication History

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.

References

[1]

S. Aaronson. 2007. The learnability of quantum states. In Proceedings of the Royal Society 463, 2088, 3089--3114.

[2]

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.

Digital Library

[3]

S. Arora and S. Safra. 1998. Probabilistic checkable proofs: A new characterization of NP. Journal of the ACM 45, 70--122.

Digital Library

[4]

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.

[5]

L. Babai, L. Fortnow, and C. Lund. 1991. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3--40.

Digital Library

[6]

R. V. Book. 1974. Tally languages and complexity classes. Information and Control 26, 2, 186--193.

[7]

V. T. Chakaravarthy and S. Roy. 2006. Oblivious symmetric alternation. In STACS 2006. Lecture Notes in Computer Science, Vol. 3884. Springer, 230--241.

Digital Library

[8]

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.

Digital Library

[9]

O. Goldreich. 2001. Foundation of Cryptography—Basic Tools. Cambridge University Press.

Digital Library

[10]

O. Goldreich. 2008. Computational Complexity: A Conceptual Perspective. Cambridge University Press.

[11]

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.

Digital Library

[12]

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.

Digital Library

[13]

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.

Digital Library

[14]

K.-I. Ko. 1987. On helping by robust oracle machines. Theoretical Computer Science 52, 15--36.

Digital Library

[15]

H. Krawczyk. 1994. LFSR-based hashing and authentication. In Advances in Cryptology—CRYPTO’94. Lecture Notes in Computer Science, Vol. 839. Springer, 129--139.

Digital Library

[16]

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.

Digital Library

[17]

C. Lautemann. 1993. BPP and the polynomial hierarchy. Information Processing Letters 17, 4, 215--217.

[18]

C. Lund, L. Fortnow, H. Karloff, and N. Nisan. 1992. Algebraic methods for interactive proof systems. Journal of the ACM 39, 4, 859--868.

Digital Library

[19]

A. Shamir. 1992. IP = PSPACE. Journal of the ACM 39, 4, 869--877.

Digital Library

[20]

A. Srinivasan and D. Zuckerman. 1999. Computing with very weak random sources. SIAM Journal on Computing 28, 4, 1433--1459.

Digital Library

[21]

U. Schöning. 1980. Robust algorithms: A different approach to oracles. Theoretical Computer Science 40, 57--66.

[22]

U. Schöning. 1988. Robust oracle machines. In Mathematical Foundations of Computer Science 1988. Lecture Notes in Computer Science, Vol. 324. Springer, 93--106.

Digital Library

Cited By

Chen LRothblum RTell RYogev E(2023)On Exponential-time Hypotheses, Derandomization, and Circuit Lower BoundsJournal of the ACM10.1145/359358170:4(1-62)Online publication date: 20-Apr-2023
https://dl.acm.org/doi/10.1145/3593581
Chen LRothblum RTell RYogev E(2020)On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00010(13-23)Online publication date: Nov-2020
https://doi.org/10.1109/FOCS46700.2020.00010

Index Terms

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Theorem proving algorithms
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Logic
    1. Proof theory

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 poly_k 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 computing

We 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 Computing

We 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

Information & Contributors

Information

Published In

cover image ACM Transactions on Computation Theory

ACM Transactions on Computation Theory Volume 7, Issue 4

September 2015

110 pages

ISSN:1942-3454

EISSN:1942-3462

DOI:10.1145/2818749

Editor:
Eric Allender
Rutgers University, USA

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 August 2015

Accepted: 01 May 2015

Received: 01 April 2014

Published in TOCT Volume 7, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
143
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen LRothblum RTell RYogev E(2023)On Exponential-time Hypotheses, Derandomization, and Circuit Lower BoundsJournal of the ACM10.1145/359358170:4(1-62)Online publication date: 20-Apr-2023
https://dl.acm.org/doi/10.1145/3593581
Chen LRothblum RTell RYogev E(2020)On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS46700.2020.00010(13-23)Online publication date: Nov-2020
https://doi.org/10.1109/FOCS46700.2020.00010

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents