Improved Zero-Knowledge Identification with Lattices

DOI10.1007/978-3-642-16280-0_1zbMath1286.94061OpenAlexW1817312375MaRDI QIDQ4933208

Pierre-Louis Cayrel, Rosemberg Silva, Markus Rückert, Richard Lindner

Publication date: 12 October 2010

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16280-0_1

zbMATH Keywords

hash functionlattice-based cryptographyzero-knowledgeidentification schemeSIS problem

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Lattice ideals, congruence relations (06B10) Network protocols (68M12)

Related Items (2)

Extended security arguments for signature schemes ⋮ The Geometry of Lattice Cryptography

Uses Software

• SWIFFT

Cites Work

• Zero-knowledge proofs of identity
• Improved identification schemes based on error-correcting codes
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• SWIFFT: A Modest Proposal for FFT Hashing
• Generalized Compact Knapsacks Are Collision Resistant
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A new identification scheme based on syndrome decoding
• The knowledge complexity of interactive proof-systems
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Asymptotically Efficient Lattice-Based Digital Signatures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Predicting Lattice Reduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved Zero-Knowledge Identification with Lattices