A New Approach to Round Optimal Secure Multiparty Computation

Explore a groundbreaking paper on secure multiparty computation presented at Crypto 2017. Delve into the innovative approach proposed by Prabhanjan Ananth, Arka Rai Choudhuri, and Abhishek Jain for achieving round optimality in secure multiparty computation protocols. Examine the historical context, methodology, and key strategies employed, including the use of template methods, strong witness-indistinguishable arguments, and rebinding techniques. Gain insights into the development of robust non-interactive perfectly correct protocols and their implications for the field of cryptography.

Introduction
History
Template
Methodology
Strategy
Strong WI
Rebinding Secure
Robust NPC