Practical product proofs for lattice commitments
From MaRDI portal
Publication:2096537
Recommendations
- Lattice-based zero-knowledge arguments for integer relations
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Lattice-based zero-knowledge arguments for additive and multiplicative relations
- More efficient commitments from structured lattice assumptions
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
Cites work
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Aurora: transparent succinct arguments for R1CS
- Computationally Sound Proofs
- Cut-off phenomenon for the ax+b Markov chain over a finite field
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Generalized Compact Knapsacks Are Collision Resistant
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- Lattice signatures without trapdoors
- Lattice-based zero-knowledge arguments for integer relations
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- More efficient commitments from structured lattice assumptions
- New bounds in some transference theorems in the geometry of numbers
- On ideal lattices and learning with errors over rings
- On the Chung-Diaconis-Graham random process
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Random walks arising in random number generation
- Security considerations for Galois non-dual RLWE families
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Theory of Cryptography
- Worst-case to average-case reductions for module lattices
Cited in
(39)- Lattice-based zero-knowledge arguments for integer relations
- 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
- 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
- RLWE-based zero-knowledge proofs for linear and multiplicative relations
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- 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
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Ring/module learning with errors under linear leakage -- hardness and applications
- On structure-preserving cryptography and lattices
- Aggregating Falcon signatures with LaBRADOR
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Greyhound: fast polynomial commitments from lattices
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- Post-quantum lattice-based e-voting for multiple candidates
- Generic construction of threshold ring signatures and lattice-based instantiations
- The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
- \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- Lattice-based proof of shuffle and applications to electronic voting
This page was built for publication: Practical product proofs for lattice commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096537)
