Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
From MaRDI portal
Publication:5041225
DOI10.1007/978-3-030-44223-1_15zbMath1501.94057OpenAlexW3016112680MaRDI QIDQ5041225
No author found.
Publication date: 13 October 2022
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-44223-1_15
Related Items (2)
BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- More efficient commitments from structured lattice assumptions
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Lattice Signatures and Bimodal Gaussians
- Multi-Authority Secret-Ballot Elections with Linear Work
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Lattice-based Cryptography
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- An Improved Compression Technique for Signatures Based on Learning with Errors
This page was built for publication: Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment
