Encryption is our go-to solution for secrecy related problems. If Alice and Bob want to communicate securely, they can encrypt their messages, and the security of encryption guarantees that the adversary cannot learn anything about the underlying message (assuming the decryption key is kept hidden). However, what if the adversary also learns the decryption key? Can we offer any kind of security in such scenarios? If the adversary does not have the entire ciphertext, then we can hope for security even in such scenarios. The primitive that captures such security threats is incompressible encryption.
In this talk, I will discuss some recent advances related to incompressible encryption. This includes incompressible notions of advanced encryption functionalities (such as attribute-based encryption and functional encryption), stronger security (which ensures security against side-channel attacks), and lower bounds for incompressible encryption.
Based on joint works with Kaartik Bhushan, Rishab Goyal, Manoj Prabhakaran, Varun Narayanan, Mahesh Sreekumar Rajasree, Aman Verma.
Short Bio:
Venkata Koppula is an assistant professor in the department of computer science and engineering at IIT Delhi. He did his PhD at UT Austin, and spent his postdoctoral years at the Weizmann Institute in Israel. His research interests are in Theoretical Cryptography, including both quantum and post-quantum cryptography.
