Candidate Multilinear Maps
Author: Sanjam Garg
Publisher:
Published: 2013
Total Pages: 122
ISBN-13:
DOWNLOAD EBOOKIn 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.