Multi-bit Cryptosystems Based on Lattice Problems
From MaRDI portal
Publication:5756540
DOI10.1007/978-3-540-71677-8_21zbMath1161.94411OpenAlexW1489262079MaRDI QIDQ5756540
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
Related Items (8)
Cryptographic algorithms for privacy-preserving online applications ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ The Geometry of Lattice Cryptography ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Public-Key Encryption Schemes with Auxiliary Inputs ⋮ Survey of Lattice-Based Group Signature
Uses Software
This page was built for publication: Multi-bit Cryptosystems Based on Lattice Problems
