## CryptoDB

### Paper: Two-Round Oblivious Transfer from CDH or LPN

Authors: Nico Döttling , CISPA Sanjam Garg , UC Berkeley Mohammad Hajiabadi , UC Berkeley Daniel Masny , Visa Research Daniel Wichs , Northeastern University DOI: 10.1007/978-3-030-45724-2_26 (login may be required) Search ePrint Search Google Slides EUROCRYPT 2020 We show a new general approach for constructing maliciously-secure two-round oblivious transfer (OT). Specifically, we provide a generic sequence of transformations to upgrade a very basic notion of two-roundOT, which we call elementary OT, to UC-secure OT. We then give simple constructions of elementary OT under the Computational Diffie-Hellman(CDH) assumption or the Learning Parity with Noise (LPN) assumption, yielding the first constructions of malicious (UC-secure) two-round OT under these assumptions. Since two-round OT is complete for two-round 2-party and multi-party computation in the malicious setting, we also achieve the first constructions of the latter under these assumptions.
##### BibTeX
@inproceedings{eurocrypt-2020-30192,
title={Two-Round Oblivious Transfer from CDH or LPN},
booktitle={39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings},
series={Lecture Notes in Computer Science},
publisher={Springer},
keywords={Two-round UC-secure OT;Computational Diffie-Hellman;LPN},
volume={12105},
doi={10.1007/978-3-030-45724-2_26},
author={Nico Döttling and Sanjam Garg and Mohammad Hajiabadi and Daniel Masny and Daniel Wichs},
year=2020
}