Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits

DOI10.1007/978-3-642-32009-5_16zbMath1296.94090OpenAlexW53264231MaRDI QIDQ2914264

Alessandro Chiesa, Nir Bitansky

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_16

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (22)

Succinct non-interactive arguments via linear interactive proofs ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ NIZK from SNARGs ⋮ Parallelizable delegation from LWE ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ The hunting of the SNARK ⋮ Unnamed Item ⋮ No-signaling linear PCPs ⋮ Unnamed Item ⋮ Quantum advantage from any non-local game ⋮ No-signaling linear PCPs ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ On the Existence of Extractable One-Way Functions ⋮ Spooky Encryption and Its Applications ⋮ Verifiable registration-based encryption ⋮ On succinct arguments and witness encryption from groups ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

This page was built for publication: Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits