Faster sounder succinct arguments and \textsf{IOP}s
From MaRDI portal
Publication:6155264
Recommendations
- Proving as fast as computing: succinct arguments with constant prover overhead
- Barriers for succinct arguments in the random oracle model
- Linear-time arguments with sublinear verification from tensor codes
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
Cites work
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- A combination of testability and decodability by tensor products
- Aurora: transparent succinct arguments for R1CS
- Computationally Sound Proofs
- Constant-round interactive proofs for delegating computation
- Cryptography with constant computational overhead
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-size constant-query IOPs for delegating computation
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time encodable and decodable error-correcting codes
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Low-complexity cryptographic hash functions
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Relaxed locally correctable codes
- Robust Local Testability of Tensor Products of LDPC Codes
- SPARKs: succinct parallelizable arguments of knowledge
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- The Knowledge Complexity of Interactive Proof Systems
- Time- and space-efficient arguments from groups of unknown order
- Zero-knowledge proofs from secure multiparty computation
Cited in
(9)- Ligero: lightweight sublinear arguments without a trusted setup
- Proving as fast as computing: succinct arguments with constant prover overhead
- Oblivious transfer with constant computational overhead
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Linear-size Boolean circuits for multiselection
- Blaze: fast SNARKs from interleaved RAA codes
- Proving as fast as computing: succinct arguments with constant prover overhead
- Linear prover IOPs in log star rounds
- Quantum rewinding for IOP-based succinct arguments
This page was built for publication: Faster sounder succinct arguments and \textsf{IOP}s
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155264)
