Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer
We give constructions of three-round secure multiparty computation (MPC) protocols for general functions that make black-box use of a two-round oblivious transfer (OT). For the case of semi-honest adversaries, we make use of a two-round, semi-honest secure OT in the plain model. This resolves the round-complexity of black-box (semi-honest) MPC protocols from minimal assumptions and answers an open question of Applebaum et al. (ITCS 2020). For the case of malicious adversaries, we make use of a two-round maliciously-secure OT in the common random/reference string model that satisfies a (mild) variant of adaptive security for the receiver.
Speaker Biography
Arpita Patra is presently an Associate Professor at the Indian Institute of Science and a visiting faculty researcher at Google Research. Her area of interest is Cryptography, focusing on theoretical and practical aspects of secure multiparty computation protocols. She received her PhD from the Indian Institute of Technology (IIT), Madras and held post-doctoral positions at the University of Bristol, UK, ETH Zurich, Switzerland, and Aarhus University, Denmark. Her research has been recognized with J P Morgan Chase Faculty Award, SONY Faculty Innovation Award, Google Research Award, NASI Young Scientist Platinum Jubilee Award, SERB Women Excellence Award, INAE Young Engineer Award and associateships with various scientific bodies such as the Indian Academy of Sciences (IAS), National Academy of Engineering (INAE ), The World Academy of Sciences (TWAS). She is a council member of the Indian Association for Research in Computing Science (IARCS) since December 2017. She has coauthored a textbook on Multi-party Computation titled “Secure Multiparty Computation against Passive Adversaries”.
