MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Doctoral Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Cryptographic tools for the cloud

Author(s)
Gorbunov, Sergey
Thumbnail
DownloadFull printable version (11.64Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Vinod Vaikuntanathan.
Terms of use
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
Metadata
Show full item record
Abstract
Classical cryptography is playing a major role in securing the Internet. Banking transactions, medical records, personal and military messages are transmitted securely through the Internet using classical encryption and signature algorithms designed and developed over the last decades. However, today we face new security challenges that arise in cloud settings that cannot be solved effectively by these classical algorithms. In this thesis, we address three major challenges that arise in cloud settings and present new cryptographic algorithms to solve them. Privacy of data. How can a user efficiently and securely share data with multiple authorized receivers through the cloud? To address this challenge, we present attribute-based and predicate encryption schemes for circuits of any arbitrary polynomial size. Our constructions are secure under the standard learning with errors (LWE) assumption. Previous constructions were limited to Boolean formulas, captured by the complexity class NC1. Privacy of programs. How can a user share a program, which may include some secrets, preserving its functionality and without leaking any information about the secrets? Program obfuscation is a mechanism that allows to scramble a program preserving its input/output functionality while preventing reverse engineering. We describe a new graph-induced multilinear maps from lattices and show how it can be used to construct a candidate general purpose program obfuscator. Our construction uses standard (random) integer lattices. Previous constructions of mutilinear maps relied on hardness of problems in either principal ideal lattices or integers and were subjected to many algebraic attacks. Integrity of computations. How can a user outsource computations over a large database to the cloud and allow anyone efficiently authenticate the results? To address this, we present a fully homomorphic signature scheme for arbitrary circuits. The scheme allows the cloud server to run arbitrary computation, represented by circuit C, on the signed data x to get y = C(x) and produce a short "proof" o- that can be used by anyone to authenticate the output y. Our scheme is secure under the short integer solution (SIS) problem in standard lattices. Previous constructions of homomorphic signatures were limited to evaluating polynomials of constant degree.
Description
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (pages 159-169).
 
Date issued
2015
URI
http://hdl.handle.net/1721.1/99825
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Doctoral Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.