Multi-bit Cryptosystems Based on Lattice Problems

DOI10.1007/978-3-540-71677-8_21zbMATH Open1161.94411OpenAlexW1489262079MaRDI QIDQ5756540FDOQ5756540

Keita Xagawa, Keisuke Tanaka, Akinori Kawachi

Publication date: 4 September 2007

Published in: Public Key Cryptography – PKC 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_21

Recommendations

• scientific article; zbMATH DE number 1304121
• A lattice-based public-key cryptosystem
• scientific article; zbMATH DE number 1302849
• scientific article; zbMATH DE number 1852141
• Multi-bit leveled homomorphic encryption via dual LWE-based

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (13)

• Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
• On the LWE cryptosystem with more general disturbance
• The Geometry of Lattice Cryptography
• Cryptographic algorithms for privacy-preserving online applications
• Finding Shortest Lattice Vectors in the Presence of Gaps
• Cryptoschemes based on difficulty of simultaneous solving two different difficult problems
• Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Survey of Lattice-Based Group Signature
• Element distinctness and bounded input size in private set intersection and related protocols
• Public-Key Encryption Schemes with Auxiliary Inputs
• On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
• Title not available (Why is that?)

Uses Software

• NTRU

This page was built for publication: Multi-bit Cryptosystems Based on Lattice Problems

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