Paper 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.
Note: Changed title.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- MPCmaliciously secure OTLPNLWEDDHCDHRSAblack-boxplain modelround optimal
- Contact author(s)
- friolo @ di uniroma1 it,dmasny @ visa com,venturi @ di uniroma1 it
- History
- 2019-09-24: last of 5 revisions
- 2018-05-23: received
- See all versions
- Short URL
- https://ia.cr/2018/473
- License
-
CC BY