| Title | : | Towards Optimal Secure Computation Protocols |
| Speaker | : | Akshayaram Srinivasan (UC Berkeley) |
| Details | : | Tue, 21 Jan, 2020 11:00 AM @ AM Turing Hall |
| Abstract: | : | 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. Bio:Akshayaram is a fifth year graduate student at the University of California, Berkeley. He works in the area of Theoretical Computer Science, more specifically in theoretical cryptography, pioneering the are of secure multiparty computation. One of his work with his PhD advisor received the best paper award at EUROCRYPT 2018. He completed his B. Tech from IIT Madras. |
