2026-09-19T01:28:58Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1270242026-06-16T18:52:30Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Vinod Vaikuntanathan and Virginia Vassilevska Williams.
LaVigne, Rio(Kristen Rio)
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2020-09-03T17:42:37Z
2020-09-03T17:42:37Z
2020
2020
https://hdl.handle.net/1721.1/127024
1191625265
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 157-168).
One of the fundamental goals of cryptography is to be able to offer security and privacy without sacrificing functionality. Cryptographers have been able to achieve the best of all three by exploiting the assumed hardness of some problems (e.g. discrete log), and have been able to build protocols for secure multiparty computation, collision-resistant hash functions, public key cryptography, and much more. This thesis explores three facets of this balance. First, we delve into Topology-Hiding Computation, which is multiparty computation where we also hide the communication network, strengthening the notion of privacy. Second, we study Property Preserving Hashing, which can be thought of as an extension of collision-resistant hashing where we add functionality. Finally, we explore Fine-Grained Cryptography, and develop a public key cryptosystem. In this model of cryptography, security takes on a much less restrictive role (e.g. adversaries must run in O(n¹⁰) time), but the protocols and security reductions must run in "fine-grained" time (e.g. less than O(n⁵)).
by Rio LaVigne.
Ph.D.
Ph.D. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
168 pages
eng
Massachusetts Institute of Technology
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Relationships between functionality, security, and privacy for multiparty computation, hashing, and encryption
Thesis
application/pdf
2020-09-03T17:42:37Z
Publication
Doctoral
EECS
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="11020389-2db3-428e-afdb-6912e59ac658">
<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>Relationships between functionality, security, and privacy for multiparty computation, hashing, and encryption</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2020</PublicationDate>
<Authors>
<Author>
<DisplayName>LaVigne, Rio(Kristen Rio)</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>One of the fundamental goals of cryptography is to be able to offer security and privacy without sacrificing functionality. Cryptographers have been able to achieve the best of all three by exploiting the assumed hardness of some problems (e.g. discrete log), and have been able to build protocols for secure multiparty computation, collision-resistant hash functions, public key cryptography, and much more. This thesis explores three facets of this balance. First, we delve into Topology-Hiding Computation, which is multiparty computation where we also hide the communication network, strengthening the notion of privacy. Second, we study Property Preserving Hashing, which can be thought of as an extension of collision-resistant hashing where we add functionality. Finally, we explore Fine-Grained Cryptography, and develop a public key cryptosystem. In this model of cryptography, security takes on a much less restrictive role (e.g. adversaries must run in O(n¹⁰) time), but the protocols and security reductions must run in "fine-grained" time (e.g. less than O(n⁵)).</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>