MPC is arguably the 'holy-grail' problem in cryptographic protocol theory. This talk will cover the real world and ideal world security definition for MPC, the perfectly-secure BGW protocol with semi-honest security, its ingredients and its security analysis.
Impossibility results for Information-theoretic MPC
This talk will cover several impossibility results including the impossibility of - (i) information-theoretic MPC with n <= 2t in the semi-honest setting, and (ii) information-theoretic MPC with n <= 3t in the malicious setting. The talk will further extend the focus of MPC in the asynchronous network and will show that perfectly-secure MPC with n <= 4t is impossible for achieving malicious security in this setting. Lastly, the talk will be conclude with the interesting direction and results that aim towards closing the theoretical feasibility gap between MPC in synchronous and asynchronous networks.
Arpita Patra is an Assistant Professor at Indian Institute of Science. Her area of interest is Cryptography, focusing on theoretical and practical aspects of secure multiparty computation protocols. She received her PhD from Indian Institute of Technology (IIT), Madras and held post-doctoral positions at University of Bristol, UK, ETH Zurich, Switzerland and Aarhus University, Denmark. Her research has been recognized with an SERB Women Excellence award, an INAE Young Engineer award and associateships with various scientific bodies such as Indian Academy of Sciences (IAS), National Academy of Engineering (INAE ), The World Academy of Sciences (TWAS). She is a council member of Indian Association for Research in Computing Science (IARCS) since December 2017.