Revision #2 Authors: Tom Gur, Ron D. Rothblum, Yang P. Liu

Accepted on: 9th May 2018 07:13

Downloads: 268

Keywords:

Interactive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof.

The first variant, known as MA-proofs of Proximity (MAP), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as MA-proofs of Proximity (AMP), allows the proof to additionally depend on the verifier’s (entire) random string. The complexity of both MAPs and AMPs is the total number of bits that the verifier observes — namely, the sum of the proof length and query complexity.

Our main result is an exponential separation between the power of MAPs and AMPs. Specifically, we exhibit an explicit and natural property $\Pi$ that admits an AMP with complexity $O(\log n)$, whereas any MAP for $\Pi$ has complexity $\tilde{\Omega}(n^{1/4})$, where $n$ denotes the length of the input in bits. Our MAP lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014).

Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier’s queries are oblivious to the proof. In this setting we show that AMPs can only be quadratically stronger than MAPs. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.

Minor revision

Revision #1 Authors: Tom Gur, Ron D. Rothblum, Yang P. Liu

Accepted on: 9th May 2018 06:33

Downloads: 178

Keywords:

Non-interactive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, given access to a short proof. Two natural variants of such proof systems are MA-proofs of Proximity (MAP), in which the proof is a function of the input only, and AM-proofs of Proximity (AMP), in which the proof additionally may depend on the verifier’s (entire) random string. The complexity of both MAPs and AMPs is the total number of bits that the verifier observes — namely, the sum of the proof length and query complexity.

Our main result is an exponential separation between the power of MAPs and AMPs. Specifically, we exhibit an explicit and natural property $\Pi$ that admits an AMP with complexity $O(\log n)$, whereas any MAP for $\Pi$ has complexity $\tilde{\Omega}(n^{1/4})$, where $n$ denotes the length of the input in bits. Our MAP lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014).

Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier’s queries cannot depend on the proof. In this setting we show that AMPs can only be quadratically stronger than MAPs. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.

Minor revision

TR18-083 Authors: Tom Gur, Ron D. Rothblum, Yang P. Liu

Publication: 25th April 2018 10:14

Downloads: 301

Keywords:

Non-interactive proofs of proximity allow a sublinear-time verifier to check that

a given input is close to the language, given access to a short proof. Two natural

variants of such proof systems are MA-proofs of Proximity (MAP), in which the proof

is a function of the input only, and AM-proofs of Proximity (AMP), in which the proof

additionally may depend on the verifier’s (entire) random string. The complexity of

both MAPs and AMPs is the total number of bits that the verifier observes – namely,

the sum of the proof length and query complexity.

Our main result is an exponential separation between the power of MAPs and

AMPs. Specifically, we exhibit an explicit and natural property ? that admits an AMP

with complexity O(log n), whereas any MAP for ? has complexity ?(n^(1/4)), where n

denotes the length of the input in bits. Our MAP lower bound also yields an alternate

proof, which is more general and arguably much simpler, for a recent result of

Fischer et al. (ITCS, 2014).

Lastly, we also consider the notion of oblivious proofs of proximity, in which the

verifier’s queries cannot depend on the proof. In this setting we show that AMPs can

only be quadratically stronger than MAPs. As an application of this result, we show

an exponential separation between the power of public and private coin for oblivious

interactive proofs of proximity.