Multi-bit Cryptosystems Based on Lattice Problems

DOI10.1007/978-3-540-71677-8_21MaRDI QIDQ5756540zbMATHOpenAlexFDO

Authors Akinori Kawachi, Keisuke Tanaka, Keita Xagawa

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(13)

• Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
• Cryptographic algorithms for privacy-preserving online applications
• Cryptoschemes based on difficulty of simultaneous solving two different difficult problems
• Finding shortest lattice vectors in the presence of gaps
• The geometry of lattice cryptography
• Element distinctness and bounded input size in private set intersection and related protocols
• Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
• On the LWE cryptosystem with more general disturbance
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• Public-key encryption schemes with auxiliary inputs
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Survey of lattice-based group signature
• scientific article; zbMATH DE number 1088230 (Why is no real title available?)

Describes a project that uses

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)