Message-Restriction-Free Commitment Scheme Based on Lattice Assumption

DOI10.1007/978-3-030-93206-0_7zbMath1504.94173OpenAlexW4206468182MaRDI QIDQ5095924

H. Miyaji, Atsuko Miyaji, Yun-Tao Wang

Publication date: 11 August 2022

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-93206-0_7

zbMATH Keywords

hash functioncommitment schemelattice-based protocol

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• More efficient commitments from structured lattice assumptions
• Multi-Authority Secret-Ballot Elections with Linear Work
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Fully homomorphic encryption using ideal lattices
• On lattices, learning with errors, random linear codes, and cryptography