Succinct arguments from multi-prover interactive proofs and their efficiency benefits

DOI10.1007/978-3-642-32009-5_16MaRDI QIDQ2914264zbMATH OpenOpenAlexFDO

Authors Nir Bitansky, Alessandro Chiesa

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)

Recommendations

• The hunting of the SNARK
• Succinct non-interactive arguments via linear interactive proofs
• Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
• On succinct arguments and witness encryption from groups
• Succinct non-interactive arguments via linear interactive proofs

Cited in

(36)

• The hunting of the SNARK
• SPARKs: succinct parallelizable arguments of knowledge
• Verifiable registration-based encryption
• On succinct arguments and witness encryption from groups
• Succinct non-interactive arguments via linear interactive proofs
• Time- and space-efficient arguments from groups of unknown order
• Gemini: elastic SNARKs for diverse environments
• Multi-prover interactive proofs: unsound foundations
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• On the existence of extractable one-way functions
• Spooky Encryption and Its Applications
• Spooky interaction and its discontents: compilers for succinct two-message argument systems
• Succinct non-interactive arguments via linear interactive proofs
• Non-cooperative rational interactive proofs
• Probabilistic checking against non-signaling strategies from linearity testing
• Lattice-based SNARGs and their application to more efficient obfuscation
• On the virtue of succinct proofs
• No-signaling linear PCPs
• No-signaling linear PCPs
• 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
• Proving as fast as computing: succinct arguments with constant prover overhead
• NIZK from SNARGs
• Parallelizable delegation from LWE
• Faster sounder succinct arguments and \textsf{IOP}s
• Succinct interactive oracle proofs: applications and limitations
• On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
• Quantum advantage from any non-local game
• Lattice-based functional commitments: fast verification and cryptanalysis
• Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
• Approximate lower bound arguments
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
• Doubly efficient cryptography: commitments, arguments and RAM MPC
• An efficient ZK compiler from SIMD circuits to general circuits
• Explicit time and space efficient encoders exist only with random access

This page was built for publication: Succinct arguments from multi-prover interactive proofs and their efficiency benefits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914264)