Paper 2018/473
A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement
Daniele Friolo, Daniel Masny, and Daniele Venturi
Abstract
We show how to construct maliciously secure oblivious transfer (M-OT) from a 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 up to 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).
Note: Full version.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in TCC 2019
- 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
BibTeX
@misc{cryptoeprint:2018/473,
author = {Daniele Friolo and Daniel Masny and Daniele Venturi},
title = {A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/473},
year = {2018},
url = {https://eprint.iacr.org/2018/473}
}
