Abstract
dc:description.abstractWe construct universal secret-key and public-key encryption schemes using combiners, in the style of Levin’s universal one-way function. Given a finite list of candidate encryption schemes, our combiners produce a single scheme that is correct and semantically secure if and only if at least one of the input schemes satisfies these properties. Our constructions are efficient and require no assumptions beyond the existence of such a secure scheme within the list. We develop and analyze these combiners for both the secret-key and public-key settings, establishing correctness and many-message semantic security. We show that if there exists any encryption scheme that is efficiently computable and semantically secure, then the output of our combiner is also secure and efficient. By enumerating all possible polynomial-time encryption schemes and applying our construction, we obtain universal encryption schemes which are secure if and only if any such scheme exists.
Degree
thesis:*- Name thesis:degree_name
- M.S., Computer Science
- Level thesis:degree_level
- Master of Science
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- Cornell University
- Year dc:date.issued
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Fassman, Ellie
- Chair dc:contributor.chair
-
- Stephens-Davidowitz, Noah
- Committee member dc:contributor.committeemember
-
- Kleinberg, Robert
Subjects
dc:subject × 2Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Bibid
- 16938391
- Dc Identifier Other
-
ProQuest Submission ID: 12383
ProQuest Publication ID: 31998799