Subquadratic SNARGs in the random oracle model
From MaRDI portal
Publication:2120100
DOI10.1007/978-3-030-84242-0_25zbMath1485.94073OpenAlexW3157539470MaRDI QIDQ2120100
Alessandro Chiesa, Eylon Yogev
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_25
Related Items
Asymptotically quasi-optimal cryptography, On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles, Lower bound on SNARGs in the random oracle model, Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II, Tight security bounds for Micali's SNARGs
Uses Software
Cites Work
- Unnamed Item
- On the complexity of interactive proofs with bounded communication
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- Barriers for succinct arguments in the random oracle model
- Succinct arguments in the quantum random oracle model
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Proof verification and the hardness of approximation problems
- Interactive Oracle Proofs
- On Generalized Feistel Networks
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Probabilistic checking of proofs
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Efficient probabilistically checkable proofs and applications to approximations
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- One Way Hash Functions and DES
