2026-09-19T11:36:51Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/911022026-06-16T18:14:08Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022

Shafi Goldwasser. Wilson, David A., Ph. D. Massachusetts Institute of Technology Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2014-10-21T17:26:11Z 2014-10-21T17:26:11Z 2014 2014 http://hdl.handle.net/1721.1/91102 892748802 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). 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. by David A. Wilson. Ph.D. 82 pages eng Massachusetts Institute of Technology 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 Electrical Engineering and Computer Science. Keeping secrets from those you work with : constructions and characterizations of encryption Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ea8e9a40-7dcb-4266-bb25-eebb1a3819ef"> <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>Keeping secrets from those you work with : constructions and characterizations of encryption</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2014</PublicationDate> <Authors> <Author> <DisplayName>Wilson, David A., Ph. D. Massachusetts Institute of Technology</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>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.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>