Cryptology ePrint Archive: Report 2018/473

A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement

Daniele Friolo and Daniel Masny and Daniele Venturi

Abstract: We show how to construct maliciously secure oblivious transfer (M-OT) from a mild strengthening of key agreement (KA) which we call *strongly uniform* KA (SU-KA), where the latter roughly means that the messages sent by one party are computationally close to uniform, even if the other party is malicious. Our transformation is black-box, almost round preserving (adding only a constant overhead of two rounds), and achieves standard simulation-based security in the plain model.

As we show, 2-round SU-KA can be realized from cryptographic assumptions such as low-noise LPN, high-noise LWE, Subset Sum, DDH, CDH and RSA---all with polynomial hardness---thus yielding a black-box construction of fully-simulatable, round-optimal, M-OT from the same set of assumptions (some of which were not known before).

By invoking a recent result of Benhamouda and Lin (EUROCRYPT 2017), we also obtain (non-black-box) 5-round maliciously secure MPC in the plain model, from the same assumptions.

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

Date: received 17 May 2018, last revised 18 Feb 2019

Contact author: friolo at di uniroma1 it,dmasny@visa com,venturi@di uniroma1 it

Available format(s): PDF | BibTeX Citation

Note: Changed title.

Version: 20190218:085430 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]