BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20200205T120000Z
UID:fc0eb270c5ede7eca8c08f6b7c1751e3-56
DTSTAMP:19700101T120016Z
DESCRIPTION:Towards Optimal Secure Computation Protocols
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/56/towards-optimal-secure-computation-protocols/
SUMMARY:Secure computation allows a set of mutually distrusting parties to compute a joint function of their private inputs such that the parties only learn the output of the functionality and nothing else about the inputs of the other parties. Secure computation is one of the central primitives in cryptography that encompasses several cryptographic abstractions and has many practical applications. The seminal results from the 1980s showed that every efficiently computable functionality can also be computed securely. However, these protocols were prohibitively inefficient and could only be considered as feasibility results. One of the central problems in cryptography is to construct secure computation protocols that are optimal in all efficiency parameters. In this talk, I will give an overview of my recent works that make progress towards constructing such optimal secure computation protocols.
DTSTART:20200205T120000Z
END:VEVENT
END:VCALENDAR