Authentication protocol using trapdoored matrices

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.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2016

Author dc:creator

• Sotiraki, Aikaterini

Advisor dc:contributor.advisor

• Ronald L. Rivest.

• Electrical Engineering and Computer Science.

Statement dc:rights

• 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.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/103737

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/103737