Lattice Trapdoors and IBE from Middle-Product LWE

© 2019, International Association for Cryptologic Research. Middle-product learning with errors (MP-LWE) was recently introduced by Rosca, Sakzad, Steinfeld and Stehlé (CRYPTO 2017) as a way to combine the efficiency of Ring-LWE with the more robust security guarantees of plain LWE. While Ring-LWE...

Full description

Bibliographic Details
Main Authors: Lombardi, Alex (Author), Vaikuntanathan, Vinod (Author), Vuong, Thuy Duong (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Springer International Publishing, 2021-11-03T15:07:49Z.
Subjects:
Online Access:Get fulltext
LEADER 02422 am a22001813u 4500
001 137219
042 |a dc 
100 1 0 |a Lombardi, Alex  |e author 
100 1 0 |a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory  |e contributor 
700 1 0 |a Vaikuntanathan, Vinod  |e author 
700 1 0 |a Vuong, Thuy Duong  |e author 
245 0 0 |a Lattice Trapdoors and IBE from Middle-Product LWE 
260 |b Springer International Publishing,   |c 2021-11-03T15:07:49Z. 
856 |z Get fulltext  |u https://hdl.handle.net/1721.1/137219 
520 |a © 2019, International Association for Cryptologic Research. Middle-product learning with errors (MP-LWE) was recently introduced by Rosca, Sakzad, Steinfeld and Stehlé (CRYPTO 2017) as a way to combine the efficiency of Ring-LWE with the more robust security guarantees of plain LWE. While Ring-LWE is at the heart of efficient lattice-based cryptosystems, it involves the choice of an underlying ring which is essentially arbitrary. In other words, the effect of this choice on the security of Ring-LWE is poorly understood. On the other hand, Rosca et al. showed that a new LWE variant, called MP-LWE, is as secure as Polynomial-LWE (another variant of Ring-LWE) over any of a broad class of number fields. They also demonstrated the usefulness of MP-LWE by constructing an MP-LWE based public-key encryption scheme whose efficiency is comparable to Ring-LWE based public-key encryption. In this work, we take this line of research further by showing how to construct Identity-Based Encryption (IBE) schemes that are secure under a variant of the MP-LWE assumption. Our IBE schemes match the efficiency of Ring-LWE based IBE, including a scheme in the random oracle model with keys and ciphertexts of size (formula presented) (for n-bit identities). We construct our IBE scheme following the lattice trapdoors paradigm of [Gentry, Peikert, and Vaikuntanathan, STOC'08]; our main technical contributions are introducing a new leftover hash lemma and instantiating a new variant of lattice trapdoors compatible with MP-LWE. This work demonstrates that the efficiency/security tradeoff gains of MP-LWE can be extended beyond public-key encryption to more complex lattice-based primitives. 
546 |a en 
655 7 |a Article 
773 |t Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)