Cryptology ePrint Archive: Report 2018/473

Secure Multi-Party Computation from Strongly Uniform Key Agreement

Daniele Friolo and Daniel Masny and Daniele Venturi

Abstract: We give a construction of a secure multi-party computation (MPC) protocol from a special type of key agreement, where the distribution of the messages sent by one of the parties is computationally close to the uniform distribution over an efficiently sampleable group, even when the other party is malicious. We term the latter strongly uniform key agreement (SU-KA). First, we show that for any odd t, t-round SU-KA and statistically binding commitments are sufficient for a black-box construction of (t+1)-round maliciously secure oblivious transfer (M-OT). By invoking a recent result of Benhamouda and Lin (Eurocrypt 2017), the latter implies maliciously secure MPC within max(t+1,5) rounds in the plain model. Additionally, we investigate the relationship between SU-KA, and similar types of public-key encryption and semi-honestly secure OT protocols where we also demand strong uniformity. This finally allows us to instantiate our result for t=2 and t=3 under standard assumptions, including any of low-noise LPN, LWE, Subset Sum, DDH, CDH, and RSA (all with polynomial hardness), so that under the same set of assumptions we also obtain 5-round maliciously secure MPC (and 4-round M-OT) in the plain model.

Category / Keywords: MPC, maliciously secure OT, LPN, LWE, DDH, CDH, RSA, black-box, plain model, round optimal

Date: received 17 May 2018, last revised 25 May 2018

Contact author: friolo at di uniroma1 it,daniel masny@berkeley edu, venturi@di uniroma1 it

Available format(s): PDF | BibTeX Citation

Version: 20180525:064512 (All versions of this report)

Short URL: ia.cr/2018/473


[ Cryptology ePrint archive ]