On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
From MaRDI portal
Publication:6169365
DOI10.1007/978-3-031-22318-1_15zbMath1519.94044MaRDI QIDQ6169365
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Rishabh Bhadauria, Laasya Bangalore
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- SPARKs: succinct parallelizable arguments of knowledge
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Recursive proof composition from accumulation schemes
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Time- and space-efficient arguments from groups of unknown order
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Interactive Oracle Proofs
- Polynomial Codes Over Certain Finite Fields
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Space-time trade-offs on the FFT algorithm
- The knowledge complexity of interactive proof-systems
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Constant-round interactive proofs for delegating computation
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Sublinear Zero-Knowledge Arguments for RAM Programs
This page was built for publication: On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
