Shorter lattice-based zero-knowledge proofs via one-time commitments
From MaRDI portal
Publication:2061919
DOI10.1007/978-3-030-75245-3_9zbMath1479.94232OpenAlexW3164004061MaRDI QIDQ2061919
Ngoc Khanh Nguyen, Gregor Seiler, Vadim Lyubashevsky
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_9
Related Items
SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ On the hardness of module learning with errors with short distributions ⋮ 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 ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- New bounds in some transference theorems in the geometry of numbers
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- More efficient commitments from structured lattice assumptions
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- LWE with side information: attacks and concrete security estimation
- Practical product proofs for lattice commitments
- Hardness of LWE on general entropic distributions
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Worst-case to average-case reductions for module lattices
- Revisiting the expected cost of solving uSVP and applications to LWE
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Lattice Signatures and Bimodal Gaussians
- Lattice Signatures without Trapdoors
- Circular and KDM Security for Identity-Based Encryption
- Public-Key Encryption Schemes with Auxiliary Inputs
- Universally composable two-party and multi-party secure computation
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A new identification scheme based on syndrome decoding
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
- Bi-Deniable Public-Key Encryption
- Fine-Tuning Groth-Sahai Proofs
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
This page was built for publication: Shorter lattice-based zero-knowledge proofs via one-time commitments
