2026-09-19T04:35:37Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1180822026-06-17T14:43:05Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Shafi Goldwasser.
Holmgren, Justin Lee
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2018-09-17T15:56:43Z
2018-09-17T15:56:43Z
2018
2018
http://hdl.handle.net/1721.1/118082
1052123725
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 171-176).
In this thesis, we present two lines of research developing tools that, in addition to being of independent theoretical interest, yield improved protocols for secure out-sourcing of computation: Succinct Garbling Schemes. A garbling scheme is a way to encode a program P and input x as P̃̃ and x̃ such that P̃ can be evaluated on i to obtain P(x), but (P̃, x̃) reveals nothing more than P(x). We devise an efficient garbling scheme, based on the recent notion of indistinguishability obfuscation, in which the RAM running time and space usage of P on x are each the same as for P̃ on ,x̃. No-Signaling Multi-Prover Interactive Proofs. A multi-prover interactive proof (MIP) is a protocol by a which a "verifier" can ascertain the truth of a mathematical statement by interacting with two or more "provers" that cannot communicate with each other. We devise an MIP that achieves better efficiency and stronger soundness guarantees than previous constructions. In terms of efficiency, our MIP allows proving many statements with roughly the same (small) communication complexity as is required to prove a single statement. The soundness guarantee is that the verifier cannot be fooled even by malicious provers that can, in a very limited sense, collude in their messages to the verifier. The latter guarantee crucially enables an application to delegation of computation. Specifically, we obtain a protocol by which a weak device can outsource expensive computations to a powerful but untrusted server, while being assured that the computation is performed correctly.
by Justin Lee Holmgren.
Ph.D.
176 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Secure computation on untrusted platforms
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="73484cb3-bfb5-402f-b554-dcfd7b15d03a">
<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>Secure computation on untrusted platforms</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2018</PublicationDate>
<Authors>
<Author>
<DisplayName>Holmgren, Justin Lee</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 present two lines of research developing tools that, in addition to being of independent theoretical interest, yield improved protocols for secure out-sourcing of computation: Succinct Garbling Schemes. A garbling scheme is a way to encode a program P and input x as P̃̃ and x̃ such that P̃ can be evaluated on i to obtain P(x), but (P̃, x̃) reveals nothing more than P(x). We devise an efficient garbling scheme, based on the recent notion of indistinguishability obfuscation, in which the RAM running time and space usage of P on x are each the same as for P̃ on ,x̃. No-Signaling Multi-Prover Interactive Proofs. A multi-prover interactive proof (MIP) is a protocol by a which a "verifier" can ascertain the truth of a mathematical statement by interacting with two or more "provers" that cannot communicate with each other. We devise an MIP that achieves better efficiency and stronger soundness guarantees than previous constructions. In terms of efficiency, our MIP allows proving many statements with roughly the same (small) communication complexity as is required to prove a single statement. The soundness guarantee is that the verifier cannot be fooled even by malicious provers that can, in a very limited sense, collude in their messages to the verifier. The latter guarantee crucially enables an application to delegation of computation. Specifically, we obtain a protocol by which a weak device can outsource expensive computations to a powerful but untrusted server, while being assured that the computation is performed correctly.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>