Short zero-knowledge proof of knowledge for lattice-based commitment

DOI10.1007/978-3-030-44223-1_15MaRDI QIDQ5041225zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

bimodal Gaussianlattice-based commitmentzero-knowledge proof of knowledge

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Shorter lattice-based zero-knowledge proofs via one-time commitments
• More efficient commitments from structured lattice assumptions
• Practical product proofs for lattice commitments
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications

Cites work

• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• An improved compression technique for signatures based on learning with errors
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 4187086 (Why is no real title available?)
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Lattice-based Cryptography
• More efficient commitments from structured lattice assumptions
• Multi-authority secret-ballot elections with linear work
• On the concrete hardness of learning with errors
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Statistically-hiding commitment from any one-way function
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(7)

• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
• Zero-knowledge proofs from spLWE-based commitments
• Message-restriction-free commitment scheme based on lattice assumption
• BLOOM: bimodal lattice one-out-of-many proofs and applications
• Toward practical lattice-based proof of knowledge from Hint-MLWE

Describes a project that uses

Uses Software

• BLISS

This page was built for publication: Short zero-knowledge proof of knowledge for lattice-based commitment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041225)