[Resource Topic] 2005/279: Efficient reduction of 1 out of $n$ oblivious transfers in random oracle model

Welcome to the resource topic for 2005/279

Title:
Efficient reduction of 1 out of n oblivious transfers in random oracle model

Authors: Bao Li, Hongda Li, Guangwu Xu, Haixia Xu

Abstract:

We first present a protocol which reduces 1-out-of-n oblivious
transfer OT$_l^m$ to 1-out-of-n oblivious transfer OT$_m^k$ for
n>2 in random oracle model, and show that the protocol is secure
against malicious sender and semi-honest receiver. Then, by
employing a cut-and-choose technique, we obtain a variant of the
basic protocol which is secure against a malicious receiver.

ePrint: https://eprint.iacr.org/2005/279

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 .