BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1047
DTSTAMP:20230914T125948Z
SUMMARY:Towards Optimal Secure Computation Protocols
DESCRIPTION:Speaker: Akshayaram Srinivasan (University of California\nBerke
 ley\, CA\, United States)\n\nAbstract: \nAbstract: Secure computation all
 ows a set of mutually distrusting parties to compute a joint function of t
 heir private inputs such that the parties only learn the output of the fun
 ctionality and nothing else about the inputs of the other parties. Secure 
 computation is one of the central primitives in cryptography that encompas
 ses several cryptographic abstractions and has many practical applications
 . The seminal results from the 1980s showed that every efficiently computa
 ble functionality can also be computed securely. However\, these protocols
  were prohibitively inefficient and could only be considered as feasibilit
 y results. One of the central problems in cryptography is to construct sec
 ure computation protocols that are optimal in all efficiency parameters. I
 n this talk\, I will give an overview of my recent works that make progres
 s towards constructing such optimal secure computation protocols.\nBio: Ak
 shayaram Srinivasan is a final-year Ph.D. student in the theory group at U
 C Berkeley. He received his B.Tech in Computer Science and Engineering fro
 m IIT-Madras in 2015. He is broadly interested in theoretical computer sci
 ence and in particular\, in the theory and applications of cryptography. H
 e has published research papers in top conferences in cryptography such as
  Foundations of Computer Science (FOCS)\, Crypto\, Eurocrypt\, and TCC. Hi
 s research has been recognized with the best paper award at Eurocrypt 2018
  and invitations to the Journal of Cryptology.\n
URL:https://www.tcs.tifr.res.in/web/events/1047
DTSTART;TZID=Asia/Kolkata:20200127T110000
DTEND;TZID=Asia/Kolkata:20200127T120000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR