Improved Zero-Knowledge Identification with Lattices

DOI10.1007/978-3-642-16280-0_1MaRDI QIDQ4933208zbMATH OpenOpenAlexFDO

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

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 functionidentification schemelattice-based cryptographySIS problemzero-knowledge

Mathematics Subject Classification ID

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

Recommendations

• Improved Zero-Knowledge Identification with Lattices
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
• scientific article; zbMATH DE number 67084
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Adaptively secure identity-based identification from lattices without random oracles
• Deterministic identity-based encryption from lattices with more compact public parameters

Cites work

• A new identification scheme based on syndrome decoding
• Asymptotically Efficient Lattice-Based Digital Signatures
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Generalized Compact Knapsacks Are Collision Resistant
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1302859 (Why is no real title available?)
• scientific article; zbMATH DE number 1942419 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• scientific article; zbMATH DE number 799789 (Why is no real title available?)
• Improved identification schemes based on error-correcting codes
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Predicting Lattice Reduction
• SWIFFT: A Modest Proposal for FFT Hashing
• The knowledge complexity of interactive proof-systems
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Zero-knowledge proofs of identity

Cited in

(8)

• On lattice-based interactive protocols: an approach with less or no aborts
• An efficient statistical zero-knowledge authentication protocol for smart cards
• The geometry of lattice cryptography
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Extended security arguments for signature schemes
• A lightweight identification protocol based on lattices

Describes a project that uses

Uses Software

• SWIFFT

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

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