Crypto Seminar - Isaac Hair
— 5:30pm
Location:
In Person and Virtual - ET
-
Blelloch-Skees Conference Room, Gates Hillman 8115
Speaker:
ISAAC HAIR
,
Undergraduate Computing Student, College of Creative Studies, University of California, Santa Barbara
https://scholar.google.com/citations?user=ZdSHcl8AAAAJ&hl=en
We give a public key encryption scheme that is provably secure against poly-size adversaries, assuming n^{(log n)^c} hardness of the standard planted clique conjecture, for any constant c > 0, and a relatively mild hardness conjecture about noisy k-LIN over expanders that is not known to imply public-key encryption on its own. Both of our conjectures correspond to natural average-case variants of NP-complete problems and have been studied for multiple decades, with unconditional lower bounds supporting them in a variety of restricted models of computation. Our encryption scheme answers an open question in a seminal work by Applebaum, Barak, and Wigderson [STOC'10].
This is a joint work with Riddhi Ghosal (UCLA), Aayush Jain (CMU), and Amit Sahai (UCLA).
In Person and Zoom Participation. See announcement.
Event Website:
https://sites.google.com/view/crypto-seminar/home