[Resource Topic] 2020/647: A simple generic construction to build oblivious transfer protocols from homomorphic encryption schemes

Welcome to the resource topic for 2020/647

Title:
A simple generic construction to build oblivious transfer protocols from homomorphic encryption schemes

Authors: Saeid Esmaeilzade, Ziba Eslami, Nasrollah Pakniat

Abstract:

Oblivious transfer (OT) is a fundamental problem in cryptography where it is required that a sender transfers one of potentially many pieces of information to a receiver and at the same time remains oblivious as to which piece has been transferred. After its introduction back in 1981 by Rabin, some more useful variations of OT appeared in the literature such as OT^1_2, OT^1_n, and OT^k_n. In 2015, a very simple and efficient OT protocol was proposed by Chou and Orlandi. Later, Hauck and Loss proposed an improved protocol and proved it to be fully UC-secure under the CDH assumption. Our goal in this paper is to extend the results of Hauck and Loss and propose a simple generic construction to build OT^1_2 and in general OT^1_n. The machinery we employ is homomorphic encryption. We instantiate our construction with some well known homomorphic encryption schemes such as RSA, Paillier, and NTRU to obtain concrete OT protocols. We further provide the details of the proof of the UC-security of our generic construction.

ePrint: https://eprint.iacr.org/2020/647

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 .