Cornell University
Advanced cryptography from lattice isomorphism—new constructions of IBE and FHE
Abstract
dc:description.abstractWe show how to translate some of the more advanced techniques used in LWE-based cryptography to the setting of lattice-isomorphism-based cryptography, which was recently introduced by Ducas and van Woerden [Eurocrypt, 2022]. In particular, we show constructions of two powerful cryptographic primitives, identity-based encryption (IBE) and fully homomorphic encryption (FHE). We then prove their security under the assumption that a suitable version of the Lattice Isomorphism Problem is hard.Our constructions use quite general and modular techniques, and we expect them to have other applications. Specifically, we show that the now-ubiquitous techniques introduced by Gentry, Peikert, and Vaikuntanathan [STOC, 2008] to build IBE and Gentry, Sahai, and Waters [Crypto, 2013] to build FHE can be made to work in our setting using any sufficiently “nice” lattice.
Degree
thesis:*- Name thesis:degree_name
- M.S., Computer Science
- Level thesis:degree_level
- Master of Science
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- Cornell University
- Year dc:date.issued
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Lai, Santiago
- Chair dc:contributor.chair
-
- Stephens-Davidowitz, Noah
- Committee member dc:contributor.committeemember
-
- Damle, Anil
Subjects
dc:subject × 4Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Other
-
Lai_cornell_0058O_12665
https://www.proquest.com/LegacyDocView/DISSNUM/32671106