Notice: eScholarship will undergo scheduled maintenance from Tuesday, January 21 to Wednesday, January 22. Some functionality may not be available during this time. Learn more at eScholarship Support.
In this thesis, we describe plausible lattice-based constructions with properties that
approximate the sought-after multilinear maps in hard-discrete-logarithm
groups. The security of our constructions relies on seemingly hard problems in ideal lattices, which can be viewed as extensions of the assumed hardness of the NTRU function. These new constructions radically enhance our tool set and open a floodgate of applications.
Main Content
For improved accessibility of PDF content, download the file to your device.
