Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Lattice Trapdoors and IBE from Middle-Product LWE

Alex Lombardi, Vinod Vaikuntanathan, Thuy-Duong Vuong

Published Jan 1, 2019• 19 citations
Publisher
DOI
10.1007/978-3-030-36030-6_2

Related papers

Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Model

Huy Quoc Le, Dung Hoang Duong, Willy Susilo +1 more

arXiv:2007.06881•Lecture notes in computer science•Jan 1, 2020•0 citations

Tight Lattice-Based Signatures Without Trapdoors from Search LWE

Rutchathon Chairattana-Apirom, Nico Döttling, Julian Loss +2 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Digital Signatures from the Middle-Product LWE

Ryo Hiromasa

Lecture notes in computer science•Jan 1, 2018•8 citations

How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE

Rikke Bendlin, Sara Krehbiel, Chris Peikert

Lecture notes in computer science•Jan 1, 2013•72 citations

Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Model

Huy Quoc Le, Dung Hoang Duong, Willy Susilo +1 more

© 2020, Springer Nature Switzerland AG. At CRYPTO 2017, Roşca, Sakzad, Stehlé and Steinfeld introduced the Middle–Product LWE (MPLWE) assumption which is as secure as Polynomial-LWE for a large class of polynomials, making the corresponding cryptographic schemes more flexible in choosing the underlying polynomial ring in design while still keeping the equivalent efficiency. Recently at TCC 2019, Lombardi, Vaikuntanathan and Vuong introduced a variant of MPLWE assumption and constructed the first IBE scheme based on MPLWE. Their core technique is to construct lattice trapdoors compatible with MPLWE in the same paradigm of Gentry, Peikert and Vaikuntanathan at STOC 2008. However, their method cannot directly offer a Hierarchical IBE construction. In this paper, we make a step further by proposing a novel trapdoor delegation mechanism for an extended family of polynomials from which we construct, for the first time, a Hierachical IBE scheme from MPLWE. Our Hierarchy IBE scheme is provably secure in the standard model.

•Jan 1, 2020•8 citations

Trapdoors for Ideal Lattices with Applications

Russell W. F. Lai, Henry K. F. Cheung, Sherman S. M. Chow

Lecture notes in computer science•Jan 1, 2015•16 citations
© 2020, Springer Nature Switzerland AG. At CRYPTO 2017, Roşca, Sakzad, Stehlé and Steinfeld introduced the Middle–Product LWE (MPLWE) assumption which is as secure as Polynomial-LWE for a large class of polynomials, making the corresponding cryptographic schemes more flexible in choosing the underlying polynomial ring in design while still keeping the equivalent efficiency. Recently at TCC 2019, Lombardi, Vaikuntanathan and Vuong introduced a variant of MPLWE assumption and constructed the first IBE scheme based on MPLWE. Their core technique is to construct lattice trapdoors compatible with MPLWE in the same paradigm of Gentry, Peikert and Vaikuntanathan at STOC 2008. However, their method cannot directly offer a Hierarchical IBE construction. In this paper, we make a step further by proposing a novel trapdoor delegation mechanism for an extended family of polynomials from which we construct, for the first time, a Hierachical IBE scheme from MPLWE. Our Hierarchy IBE scheme is provably secure in the standard model.