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.

Keeping secrets from those you work with : constructions and characterizations of encryption

Author(s)
Wilson, David A., Ph. D. Massachusetts Institute of Technology
Thumbnail
DownloadFull printable version (22.45Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Shafi Goldwasser.
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
given to expanding the models in which encrypted messages are sent (leading to constructions such as identity-based encryption) and the additional functionalities supported by encryption schemes (such as homomorphic operations). This thesis explores the relations between several of these primitives and models, both in terms of generic constructions, and constructions based on specific hardness assumptions. First, we define bounded-collusion identity-based encryption (BC-IBE), a variant of IBE in which the adversary is only allowed to make a limited number of key queries. This restriction allows more general constructions; specifically, we give three distinct generic constructions of BC-IBE from public-key encryption with short ciphertext size. Each of these constructions requires slightly different properties of the underlying public-key scheme; we give specific instantiations of each of these constructions, thus achieving BC-IBE from the DDH, LWE, NTRU, and QR assumptions. Second, we explore the relationship between obfuscation and fully-homomorphic encryption. We define a notion of secure obfuscation for a family of functions known as the f-reencryption functionality, and prove that a secure obfuscator for this functionality generically yields a fully-homomorphic encryption scheme. Furthermore, we relate this new definition to previous definitions of obfuscation, and give an instantiation of such an obfuscator based on the LWE assumption, yielding an FHE construction.
Description
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
 
75
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (pages 75-82).
 
Date issued
2014
URI
http://hdl.handle.net/1721.1/91102
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.