Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
We present an asymptotically optimal reduction of one-out-of-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunction with Privacy Amplification. Interactive Hashing is used in an innovative way to test the receiver’s adherence to the protocol. We show that (1 + ε)k uses of Bit OT suffice to implement String OT for k-bit strings. Our protocol represents a two-fold improvement over the best constructions in the literature and is asymptotically optimal. We then show that our construction can also accommodate weaker versions of Bit OT, thereby obtaining a significantly lower expansion factor compared to previous constructions. Besides increasing efficiency, our constructions allow the use of any 2-universal family of Hash Functions for performing Privacy Amplification. Of independent interest, our reduction illustrates the power of Interactive Hashing as an ingredient in the design of cryptographic protocols.
Keywordsinteractive hashing oblivious transfer privacy amplification
- 4.Brassard, G., Crépeau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEETIT: IEEE Transactions on Information Theory 42 (1996)Google Scholar
- 5.Cachin, C., Crépeau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: IEEE Symposium on Foundations of Computer Science (1998)Google Scholar
- 10.Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology 11(2) (1998)Google Scholar
- 11.Ostrovsky, R., Venkatesan, R., Yung, M.: Fair games against an all-powerful adversary. AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13 (1993)Google Scholar
- 12.Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Memo TR–81, Aiken Computation Laboratory. Harvard University (1981)Google Scholar