Lattice-based succinct arguments for NP with polylogarithmic-time verification
From MaRDI portal
Publication:6145785
DOI10.1007/978-3-031-38545-2_8OpenAlexW4385654788MaRDI QIDQ6145785
Alessandro Chiesa, Jonathan Bootle, Katerina Sotiraki
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_8
Cites Work
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Practical product proofs for lattice commitments
- Linear-time arguments with sublinear verification from tensor codes
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Sumcheck arguments and their applications
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Time- and space-efficient arguments from groups of unknown order
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Linear-size constant-query IOPs for delegating computation
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Lattice-based zero-knowledge SNARGs for arithmetic circuits
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Aurora: transparent succinct arguments for R1CS
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Cryptanalysis of the New CLT Multilinear Map over the Integers
- Cryptanalysis of GGH15 Multilinear Maps
- Practical Multilinear Maps over the Integers
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
- Interactive Oracle Proofs
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- New Multilinear Maps Over the Integers
- Algebraic methods for interactive proof systems
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Candidate Multilinear Maps from Ideal Lattices
- Constant-Round Interactive Proofs for Delegating Computation
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Graph-Induced Multilinear Maps from Lattices
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Proving as fast as computing: succinct arguments with constant prover overhead
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Practical sublinear proofs for R1CS from lattices
- Orion: zero knowledge proof with linear prover time
This page was built for publication: Lattice-based succinct arguments for NP with polylogarithmic-time verification
