Practical product proofs for lattice commitments
From MaRDI portal
Publication:2096537
DOI10.1007/978-3-030-56880-1_17zbMath1504.94096OpenAlexW3031397331MaRDI QIDQ2096537
Thomas Attema, Gregor Seiler, Vadim Lyubashevsky
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_17
Related Items (21)
Lattice-based proof of shuffle and applications to electronic voting ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Practical sublinear proofs for R1CS from lattices ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ Verifiable decryption in the head ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ A framework for practical anonymous credentials from lattices ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Improved lattice-based mix-nets for electronic voting
Cites Work
- Unnamed Item
- Random walks arising in random number generation
- New bounds in some transference theorems in the geometry of numbers
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Security considerations for Galois non-dual RLWE families
- Lattice-based zero-knowledge arguments for integer relations
- More efficient commitments from structured lattice assumptions
- Cut-off phenomenon for the \(ax+b\) Markov chain over a finite field
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- 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
- On the Chung-Diaconis-Graham random process
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Lattice Signatures without Trapdoors
- On Ideal Lattices and Learning with Errors over Rings
- Generalized Compact Knapsacks Are Collision Resistant
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Computationally Sound Proofs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Theory of Cryptography
This page was built for publication: Practical product proofs for lattice commitments
