Cryptology ePrint Archive: Report 2021/833

ATLAS: Efficient and Scalable MPC in the Honest Majority Setting

Vipul Goyal and Hanjun Li and Rafail Ostrovsky and Antigoni Polychroniadou and Yifan Song

Abstract: In this work, we address communication, computation, and round efficiency of unconditionally secure multi-party computation for arithmetic circuits in the honest majority setting. We achieve both algorithmic and practical improvements:

-- The best known result in the semi-honest setting has been due to Damgard and Nielsen (CRYPTO 2007). Over the last decade, their construction has played an important role in the progress of efficient secure computation. However despite a number of follow-up works, any significant improvements to the basic semi-honest protocol have been hard to come by. We show 33% improvement in communication complexity of this protocol. We show how to generalize this result to the malicious setting, leading to the best known unconditional honest majority MPC with malicious security. -- We focus on the round complexity of the Damgard and Nielsen protocol and improve it by a factor of 2. Our improvement relies on a novel observation relating to an interplay between Damgard and Nielsen multiplication and Beaver triple multiplication. An implementation of our constructions shows an execution run time improvement compared to the state of the art ranging from 30% to 50%.

Category / Keywords: cryptographic protocols / Multiparty Computation, Information-theoretic Cryptography, Communication Complexity

Original Publication (with major differences): IACR-CRYPTO-2021

Date: received 18 Jun 2021

Contact author: goyal at cs cmu edu, lihanjun1212 at gmail com, rafail at cs ucla edu, antigonipoly at gmail com, yifans2 at andrew cmu edu

Available format(s): PDF | BibTeX Citation

Version: 20210621:075404 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]