Succinct Non-interactive Arguments via Linear Interactive Proofs

  • Nir Bitansky
  • Alessandro Chiesa
  • Yuval Ishai
  • Omer Paneth
  • Rafail Ostrovsky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7785)

Abstract

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.

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Nir Bitansky
    • 1
  • Alessandro Chiesa
    • 2
  • Yuval Ishai
    • 3
  • Omer Paneth
    • 4
  • Rafail Ostrovsky
    • 5
  1. 1.Tel Aviv UniversityIsrael
  2. 2.MITUSA
  3. 3.TechnionIsrael
  4. 4.Boston UniversityUSA
  5. 5.UCLAUSA

Personalised recommendations