Cryptology ePrint Archive: Report 2018/1078

Two Round Information-Theoretic MPC with Malicious Security

Prabhanjan Ananth and Arka Rai Choudhuri and Aarushi Goel and Abhishek Jain

Abstract: We provide the first constructions of two round information-theoretic (IT) secure multiparty computation (MPC) protocols in the plain model that tolerate any $t<n/2$ malicious corruptions. Our protocols satisfy the strongest achievable standard notions of security in two rounds in different communication models. Previously, IT-MPC protocols in the plain model either required a larger number of rounds, or a smaller minority of corruptions.

Category / Keywords: MPC, Round-optimal, Information-theoretic

Date: received 6 Nov 2018, last revised 7 Nov 2018

Contact author: aarushig at cs jhu edu

Available format(s): PDF | BibTeX Citation

Version: 20181109:163906 (All versions of this report)

Short URL: ia.cr/2018/1078


[ Cryptology ePrint archive ]