Practical sublinear proofs for R1CS from lattices

Related Items (2)

Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS

Cites Work

Unnamed Item
Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
More efficient commitments from structured lattice assumptions
Shorter lattice-based zero-knowledge proofs via one-time commitments
A non-PCP approach to succinct quantum-safe zero-knowledge
Practical product proofs for lattice commitments
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
\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
Short lattice-based one-out-of-many proofs and applications to ring signatures
Aurora: transparent succinct arguments for R1CS
Worst-case to average-case reductions for module lattices
Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
On Ideal Lattices and Learning with Errors over Rings
Generalized Compact Knapsacks Are Collision Resistant
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Algebraic methods for interactive proof systems
IP = PSPACE
Quadratic Span Programs and Succinct NIZKs without PCPs
Theory of Cryptography
Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations

This page was built for publication: Practical sublinear proofs for R1CS from lattices