Computational Oblivious Transfer and Interactive Hashing

Kirill Morozov and George Savvides

Abstract

We use interactive hashing to achieve the most efficient OT protocol to date based solely on the assumption that trapdoor permutations (TDP) exist. Our protocol can be seen as the following (simple) modification of either of the two famous OT constructions: 1) In the one by Even et al (1985), a receiver must send a random domain element to a sender through IH; 2) In the one by Ostrovsky et al (1993), the players should use TDP instead of one-way permutation. A similar approach is employed to achieve oblivious transfer based on the security of the McEliece cryptosystem. In this second protocol, the receiver inputs a public key into IH, while privately keeping the corresponding secret key. Two different versions of IH are used: the computationally secure one in the first protocol, and the information-theoretically secure one in the second.

Note: This version only includes some corrected errata and minor revisions, as compared to the previous version.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Keywords
Oblivious transferinteractive hashingtrapdoor permutationMcEliece cryptosystem
Contact author(s)
kirill morozov @ aist go jp
History
2009-05-29: last of 2 revisions
See all versions
Short URL
https://ia.cr/2009/074

CC BY

BibTeX

@misc{cryptoeprint:2009/074,
author = {Kirill Morozov and George Savvides},
title = {Computational Oblivious Transfer and Interactive Hashing},
howpublished = {Cryptology ePrint Archive, Paper 2009/074},
year = {2009},
note = {\url{https://eprint.iacr.org/2009/074}},
url = {https://eprint.iacr.org/2009/074}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.