TY - GEN

T1 - Succinct non-interactive arguments via linear interactive proofs

AU - Bitansky, Nir

AU - Chiesa, Alessandro

AU - Ishai, Yuval

AU - Paneth, Omer

AU - Ostrovsky, Rafail

PY - 2013

Y1 - 2013

N2 - Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the length of such arguments; nowadays researches have focused also on minimizing verification time, by drawing motivation from the problem of delegating computation. A common relaxation is a preprocessing SNARG, which allows the verifier to conduct an expensive offline phase that is independent of the statement to be proven later. Recent constructions of preprocessing SNARGs have achieved attractive features: they are publicly-verifiable, proofs consist of only O(1) encrypted (or encoded) field elements, and verification is via arithmetic circuits of size linear in the NP statement. Additionally, these constructions seem to have "escaped the hegemony" of probabilistically-checkable proofs (PCPs) as a basic building block of succinct arguments.

AB - Succinct non-interactive arguments (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the length of such arguments; nowadays researches have focused also on minimizing verification time, by drawing motivation from the problem of delegating computation. A common relaxation is a preprocessing SNARG, which allows the verifier to conduct an expensive offline phase that is independent of the statement to be proven later. Recent constructions of preprocessing SNARGs have achieved attractive features: they are publicly-verifiable, proofs consist of only O(1) encrypted (or encoded) field elements, and verification is via arithmetic circuits of size linear in the NP statement. Additionally, these constructions seem to have "escaped the hegemony" of probabilistically-checkable proofs (PCPs) as a basic building block of succinct arguments.

UR - http://www.scopus.com/inward/record.url?scp=84873941196&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-36594-2_18

DO - 10.1007/978-3-642-36594-2_18

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84873941196

SN - 9783642365935

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 315

EP - 333

BT - Theory of Cryptography - 10th Theory of Cryptography Conference, TCC 2013, Proceedings

T2 - 10th Theory of Cryptography Conference, TCC 2013

Y2 - 3 March 2013 through 6 March 2013

ER -