Secure communication : CDS, PIR, PSM

Private Information Retrieval is the problem of querying two servers to nd a value in a database, while keeping the index private. We extend this problem to Generalized Wildcard PIR, where we instead query an aggregate of the entries whose indices match a pattern, called a generalized wildcard, which species what values each segment of the indices may take. We give a construction for this variant with similar communication to that of the best PIR protocols known. We study information theoretic models in cryptography, namely Private Information Retrieval, Conditional Disclosure of Secrets, and Private Simultaneous Messages. We give extensions of PIR and CDS in the area of generalized wildcards, and give constructions for those extensions. We discuss directions towards more ecient protocols, and raise open questions.

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

2017

Author dc:creator

• Grosof, Isaac (Isaac B.)

Advisor dc:contributor.advisor

• Vinod Vaikuntanathan.

• Electrical Engineering and Computer Science.

Statement dc:rights

• MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written 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/113150

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/113150