[Resource Topic] 2019/414: Two-Round Oblivious Transfer from CDH or LPN

Welcome to the resource topic for 2019/414

Title:
Two-Round Oblivious Transfer from CDH or LPN

Authors: Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs

Abstract:

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-round OT, 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.

ePrint: https://eprint.iacr.org/2019/414

Talk: https://www.youtube.com/watch?v=b6aOO6IlaIA

Slides: https://iacr.org/submit/files/slides/2020/eurocrypt/ec2020/190/slides.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .