2026-09-18T22:33:43Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1037372022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Ronald L. Rivest.
Sotiraki, Aikaterini
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-07-18T20:05:19Z
2016-07-18T20:05:19Z
2016
2016
http://hdl.handle.net/1721.1/103737
953459409
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 51-52).
In this thesis, we propose a new type of public-key authentication protocol, which is based on timing gaps. The honest user's secret key allows him to perform a task faster than any adversary. In our construction, the public key is a n x n matrix and the secret key is a trapdoor of this matrix. The task which an honest user has to perform in order to authenticate himself is a matrix-vector multiplication, where the vector is supplied by the verifier. We provide specific constructions of the trapdoor and analyze them both theoretically and practically.
by Aikaterini Sotiraki.
S.M.
52 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.
Authentication protocol using trapdoored matrices
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="174573b7-3b11-4c15-9659-72859ee5c107">
<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>Authentication protocol using trapdoored matrices</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Sotiraki, Aikaterini</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, we propose a new type of public-key authentication protocol, which is based on timing gaps. The honest user's secret key allows him to perform a task faster than any adversary. In our construction, the public key is a n x n matrix and the secret key is a trapdoor of this matrix. The task which an honest user has to perform in order to authenticate himself is a matrix-vector multiplication, where the vector is supplied by the verifier. We provide specific constructions of the trapdoor and analyze them both theoretically and practically.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>