Lattice-based succinct arguments from vanishing polynomials (extended abstract)

Cites Work

Unnamed Item
Unnamed Item
Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
Quasi-optimal SNARGs via linear multi-prover interactive proofs
A non-PCP approach to succinct quantum-safe zero-knowledge
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
A compressed \(\varSigma \)-protocol theory for lattices
Succinct arguments in the quantum random oracle model
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
Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
Scalable Zero Knowledge via Cycles of Elliptic Curves
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Trapdoors for hard lattices and new cryptographic constructions
Simple verifiable delay functions
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
On the Size of Pairing-Based Non-interactive Arguments
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
Succinct vector, polynomial, and functional commitments from lattices
Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
On the hardness of the NTRU problem
Proofs for inner pairing products and applications