Succinct arguments from multi-prover interactive proofs and their efficiency benefits
From MaRDI portal
Publication:2914264
DOI10.1007/978-3-642-32009-5_16zbMATH Open1296.94090OpenAlexW53264231MaRDI QIDQ2914264FDOQ2914264
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
Recommendations
Cited In (35)
- Succinct non-interactive arguments via linear interactive proofs
- Title not available (Why is that?)
- No-signaling linear PCPs
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Time- and space-efficient arguments from groups of unknown order
- Parallelizable delegation from LWE
- Lattice-based functional commitments: fast verification and cryptanalysis
- Lattice-based SNARGs and their application to more efficient obfuscation
- Succinct non-interactive arguments via linear interactive proofs
- Ligero: lightweight sublinear arguments without a trusted setup
- Probabilistic checking against non-signaling strategies from linearity testing
- Succinct vector, polynomial, and functional commitments from lattices
- Functional commitments for all functions, with transparent setup and from SIS
- Faster sounder succinct arguments and \textsf{IOP}s
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Proving as fast as computing: succinct arguments with constant prover overhead
- Spooky Encryption and Its Applications
- No-signaling linear PCPs
- Gemini: elastic SNARKs for diverse environments
- SPARKs: succinct parallelizable arguments of knowledge
- 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
- Multi-prover interactive proofs: unsound foundations
- Verifiable registration-based encryption
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- An efficient ZK compiler from SIMD circuits to general circuits
- Quantum advantage from any non-local game
- On the virtue of succinct proofs
- The hunting of the SNARK
- NIZK from SNARGs
- On the existence of extractable one-way functions
- Succinct interactive oracle proofs: applications and limitations
- On succinct arguments and witness encryption from groups
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)
