Cryptology ePrint Archive: Report 2009/074
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.
Category / Keywords: Oblivious transfer, interactive hashing, trapdoor permutation, McEliece cryptosystem
Date: received 13 Feb 2009, last revised 29 May 2009
Contact author: kirill morozov at aist go jp
Available format(s): PDF | BibTeX Citation
Note: This version only includes some corrected errata and minor revisions, as compared to the previous version.
Version: 20090529:122804 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]