CS SEMINAR

Two-round Multiparty Secure Computation under Minimal Assumptions

Speaker
Mr Akshayaram Srinivasan, UC Berkeley
Chaired by
Dr Rahul JAIN, Professor, School of Computing
rahul@comp.nus.edu.sg

08 Jul 2019 Monday, 02:00 PM to 03:00 PM

SR3, COM1-02-12

Abstract:

Secure Multiparty Computation (MPC) allows a set of mutually distrusting parties to compute a joint function of their private inputs such that nothing else apart from the output of the function is leaked. In this talk, I will give a round-optimal construction of MPC under minimal assumptions.

Based on joint work with Sanjam Garg.


Biodata:

Akshayaram Srinivasan is a fourth-year Ph.D. student in the theory group at UC Berkeley. His advisor is Prof. Sanjam Garg. He received his B.Tech in Computer Science and Engineering from IIT-Madras in 2015. He is broadly interested in theoretical computer science and in particular, in the theory and applications of cryptography. He has published research papers in top conferences such as Foundations of Computer Science (FOCS), Crypto, Eurocrypt, and TCC. His research has been recognized with the best paper award at Eurocrypt 2018.