2026-09-19T02:39:25Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1003022026-06-06T00:48:58Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Vinod Vaikuntanathan.
Cyr, William (William B.)
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2015-12-16T15:54:27Z
2015-12-16T15:54:27Z
2015
2015
http://hdl.handle.net/1721.1/100302
930711196
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Title as it appears in MIT Commencement Exercises program, June 5, 2015: Mmultilinear maps. Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 43-44).
In this thesis, I explore the current multilinear map candidates and attacks against them. This involves analyzing the three proposals for multilinear maps which are based on ideal lattices, integers, and standard lattices. The attacks exploit the geometry of the lattices and linearity of the integers to break security. I also compare the applications of these schemes with what is required for attacks. Key agreement seems to need certain features of multilinear maps which expose vulnerabilities while other applications like indistinguishability obfuscation. I analyze the attacks against these maps and show why they are not able to break the program obfuscation application of multilinear maps.
by William Cyr.
M.Eng.
44 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Attacks on multilinear maps
Mmultilinear maps
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="216b2009-fccf-4b57-a142-dd3a3717014d">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Attacks on multilinear maps</Title>
<Subtitle>Mmultilinear maps</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2015</PublicationDate>
<Authors>
<Author>
<DisplayName>Cyr, William (William B.)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>In this thesis, I explore the current multilinear map candidates and attacks against them. This involves analyzing the three proposals for multilinear maps which are based on ideal lattices, integers, and standard lattices. The attacks exploit the geometry of the lattices and linearity of the integers to break security. I also compare the applications of these schemes with what is required for attacks. Key agreement seems to need certain features of multilinear maps which expose vulnerabilities while other applications like indistinguishability obfuscation. I analyze the attacks against these maps and show why they are not able to break the program obfuscation application of multilinear maps.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>