BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1522
DTSTAMP:20250320T085509Z
SUMMARY:Incompressible Encryption - Advanced Functionalities\, Stronger Sec
 urity and Lower Bounds
DESCRIPTION:Speaker: Venkata Koppula (IIT Delhi)\n\nAbstract: \nEncryption 
 is our go-to solution for secrecy related problems. If Alice and Bob want 
 to communicate securely\, they can encrypt their messages\, and the securi
 ty of encryption guarantees that the adversary cannot learn anything about
  the underlying message (assuming the decryption key is kept hidden). Howe
 ver\, what if the adversary also learns the decryption key? Can we offer a
 ny 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 encryp
 tion. \n \nIn this talk\, I will discuss some recent advances related t
 o incompressible encryption. This includes incompressible notions of advan
 ced encryption functionalities (such as attribute-based encryption and fun
 ctional encryption)\, stronger security (which ensures security against s
 ide-channel attacks)\, and lower bounds for incompressible encryption. \n
  \nBased on joint works with Kaartik Bhushan\, Rishab Goyal\, Manoj Prabh
 akaran\, Varun Narayanan\, Mahesh Sreekumar Rajasree\, Aman Verma.\nShort 
 Bio:\nVenkata Koppula is an assistant professor in the department of compu
 ter science and engineering at IIT Delhi. He did his PhD at UT Austin\, an
 d spent his postdoctoral years at the Weizmann Institute in Israel. His re
 search interests are in Theoretical Cryptography\, including both quantum 
 and post-quantum cryptography. \n \n
URL:https://www.tcs.tifr.res.in/web/events/1522
DTSTART;TZID=Asia/Kolkata:20250325T113000
DTEND;TZID=Asia/Kolkata:20250325T123000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR