University Seminar: Logic Across Disciplines-Cryptographic Constructions

University Seminar: Logic Across Disciplines

Time: Thursday, February 18, 4:00-5:00PM

Place: zoom

Speaker:  Keshav Srinivasan, GWU

Title: Universal Cryptographic Constructions

Abstract: The encryption and authentication schemes used in modern cryptography are dependent on mathematical hardness assumptions, unproven conjectures in computational complexity theory. We will give an introduction to these hardness assumptions, and explain their relationship to cryptographic constructions. In the final portion of the talk, we will discuss work by Leonid Levin and others concerning universal cryptographic constructions, which utilize Universal Turing Machines to avoid reliance on specific hardness assumptions.

If you would like a Zoom invitation please write to [email protected]