Faster sounder succinct arguments and \textsf{IOP}s
From MaRDI portal
Publication:6155264
DOI10.1007/978-3-031-15802-5_17MaRDI QIDQ6155264
Justin Holmgren, Ron D. Rothblum
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Related Items (2)
Ligero: lightweight sublinear arguments without a trusted setup ⋮ Oblivious transfer with constant computational overhead
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- SPARKs: succinct parallelizable arguments of knowledge
- Linear-time arguments with sublinear verification from tensor codes
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Time- and space-efficient arguments from groups of unknown order
- Linear-size constant-query IOPs for delegating computation
- Aurora: transparent succinct arguments for R1CS
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Linear-time encodable and decodable error-correcting codes
- Interactive Oracle Proofs
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Robust Local Testability of Tensor Products of LDPC Codes
- The Knowledge Complexity of Interactive Proof Systems
- Computationally Sound Proofs
- Relaxed Locally Correctable Codes
- Constant-Round Interactive Proofs for Delegating Computation
- A combination of testability and decodability by tensor products
This page was built for publication: Faster sounder succinct arguments and \textsf{IOP}s
