Breaking Assumption Barriers in Cryptography
Abstract
Explosion in cryptographic technologies over the past two decades has radically transformed what was previously thought to be possible. However, most of these developments build on a narrow set of computational hardness assumptions. This contrasts with a fundamental tenet of cryptography: base security on minimal assumptions. However, after decades of pessimism, the theoretical landscape is starting to shift. For example, a recent work of the PI surprisingly provides the first identity based encryption scheme under the Computational Diffie Hellman Assumption. Another work of the PI, yields the first construction of two round MPC based on just the minimal assumption of two round oblivious transfer. We anticipate that similar improvements in several other contexts are likely. This project will develop fresh ideas for basing several of the powerful cryptographic primitives invented in the 21st century on weaker (ideally minimal) computational assumptions than those currently known to be sufficient.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Jan 14, 2022
- Source ID
- FA95501910200
Entities
People
- Sanjam Garg
Organizations
- Air Force Office of Scientific Research
- United States Air Force
- University of California Regents