Subquadratic SNARGs in the random oracle model
From MaRDI portal
Publication:2120100
Recommendations
- Lower bound on SNARGs in the random oracle model
- Subcomputable Schnorr randomness
- On random oracle separations
- Quasiperiods, subword complexity and the smallest Pisot number
- On higher-order probabilistic subrecursion
- On higher-order probabilistic subrecursion
- Subsampling mathematical relaxations and average-case complexity
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- Aurora: transparent succinct arguments for R1CS
- Barriers for succinct arguments in the random oracle model
- Computationally Sound Proofs
- Efficient probabilistically checkable proofs and applications to approximations
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Interactive oracle proofs
- Lattice-based SNARGs and their application to more efficient obfuscation
- On generalized Feistel networks
- On the complexity of interactive proofs with bounded communication
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
- One Way Hash Functions and DES
- Polynomially low error PCPs with \(\operatorname{polyloglog} n\) queries via modular composition
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Scalable zero knowledge with no trusted setup
- Short pairing-based non-interactive zero-knowledge arguments
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Succinct arguments in the quantum random oracle model
- Succinct non-interactive arguments via linear interactive proofs
- Transparent SNARKs from DARK compilers
Cited in
(11)- Subvector commitments with application to succinct arguments
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- Correlation intractability and SNARGs from sub-exponential DDH
- Asymptotically quasi-optimal cryptography
- SNARGs for P from sub-exponential DDH and QR
- Succinct arguments in the quantum random oracle model
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Tight security bounds for Micali's SNARGs
- Lower bound on SNARGs in the random oracle model
This page was built for publication: Subquadratic SNARGs in the random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120100)
