Input-oblivious proof systems and a uniform complexity perspective on P/poly

Oded Goldreich, Or Meir

Research output: Contribution to journalArticlepeer-review


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, PCP, and Z K, and present few preliminary results regarding those versions.

Original languageEnglish
Article number16
JournalACM Transactions on Computation Theory
Issue number4
StatePublished - 1 Aug 2015
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2015 ACM.


  • BPP
  • E
  • EXP
  • F.1.2 [Theory of Computation]: Computation by Abstract Devices
  • IP
  • MA
  • Modes of computation
  • NE
  • NEXP
  • NP
  • P/poly
  • PCP
  • RP
  • Theory
  • ZK

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Input-oblivious proof systems and a uniform complexity perspective on P/poly'. Together they form a unique fingerprint.

Cite this