skip to main content
10.1145/1966913.1966977acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
short-paper

Efficient computational oblivious transfer using interactive hashing

Published: 22 March 2011 Publication History

Abstract

We present two protocols for reducing oblivious transfer (OT) to the security of trapdoor permutations and to the hardness of some coding problems, respectively. The first protocol is the most efficient known to date, while the second one is a theoretical proof-of-concept. Our constructions leverage the power of Interactive Hashing (IH). The first protocol can be viewed as a simple modification of the well-known OT construction by Even, Goldreich and Lem-pel (1985), in which a receiver must send a random domain element to a sender through IH. Alternatively, our protocol can be viewed as a simple modification of the construction by Ostrovsky, Venkatesan and Yung (1993), in which the players substitute the one-way permutation with a trapdoor permutation. We use a similar approach to derive a second OT protocol based on coding assumptions related to security of the McEliece cryptosystem. In our second construction, 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.

References

[1]
D. Beaver. Precomputing oblivious transfer. In D. Coppersmith, editor, CRYPTO, volume 963 of Lecture Notes in Computer Science, pages 97--109. Springer, 1995.
[2]
C. Cachin, C. Crépeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In FOCS, pages 493--502, 1998.
[3]
R. Canetti, editor. Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19--21, 2008, volume 4948 of Lecture Notes in Computer Science. Springer, 2008.
[4]
C. Crépeau. Equivalence between two flavours of oblivious transfers. In C. Pomerance, editor, CRYPTO, volume 293 of Lecture Notes in Computer Science, pages 350--354. Springer, 1987.
[5]
Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel. Constant-round oblivious transfer in the bounded storage model. J. Cryptology, 20(2):165--202, 2007. Conference version appears at TCC '04.
[6]
R. Dowsley, J. van de Graaf, J. Müller-Quade, and A. C. A. Nascimento. Oblivious transfer based on the McEliece assumptions. In R. Safavi-Naini, editor, ICITS, volume 5155 of Lecture Notes in Computer Science, pages 107--117. Springer, 2008.
[7]
D. Engelbert, R. Overbeck, and A. Schmidt. A summary of McEliece-type cryptosystems and their security. Journal of Mathematical Cryptology, 1(2):151--199, 2007.
[8]
S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Commun. ACM, 28(6):637--647, 1985.
[9]
O. Goldreich. Foundations of Cryptography - Volume 2 (Basic Applications). Cambridge University Press, 2004.
[10]
O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In STOC, pages 25--32. ACM, 1989.
[11]
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC, pages 218--229. ACM, 1987.
[12]
I. Haitner. Implementing oblivious transfer using collection of dense trapdoor permutations. In M. Naor, editor, TCC, volume 2951 of Lecture Notes in Computer Science, pages 394--409. Springer, 2004.
[13]
I. Haitner. Semi-honest to malicious oblivious transfer - the black-box way. In Canetti {3}, pages 412--426.
[14]
I. Haitner, J. J. Hoch, O. Reingold, and G. Segev. Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In FOCS, pages 669--679. IEEE Computer Society, 2007.
[15]
I. Haitner and O. Reingold. A new interactive hashing theorem. In IEEE Conference on Computational Complexity, pages 319--332, 2007.
[16]
K. Kobara, K. Morozov, and R. Overbeck. Coding-based oblivious transfer. In J. Calmet, W. Geiselmann, and J. Müller-Quade, editors, MMICS, volume 5393 of Lecture Notes in Computer Science, pages 142--156. Springer, 2008.
[17]
T. Koshiba and Y. Seri. Round-efficient one-way permutation based perfectly concealing bit commitment scheme. ECCC, TR06-093, July 2006. Available at: http://eccc.hpi-web.de/eccc-reports/2006/TR06-093/.
[18]
R. J. McEliece. A public key cryptosystem based on algebraic coding theory. DSN progress report, 42--44:114--116, 1978.
[19]
K. Morozov and G. Savvides. Computational oblivious transfer and interactive hashing. Cryptology ePrint Archive, February 2009. Available at: http://eprint.iacr.org/2009/074.pdf.
[20]
M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. J. Cryptology, 11(2):87--108, 1998.
[21]
R. Ostrovsky, R. Venkatesan, and M. Yung. Fair games against an all-powerful adversary. In AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 155--169, 1993.
[22]
M. O. Rabin. How to exchange secrets by oblivious transfer. Technical report, Aiken Computation Laboratory, Harvard University, 1981. TR-81.
[23]
G. Savvides. Interactive Hashing and reductions between Oblivious Transfer variants. PhD thesis, School of Computer Science, McGill University, Montreal, Canada, 2007.
[24]
N. Sendrier. On the security of the McEliece public-key cryptosystem. In M. Blaum, P. G. Farrell, and H. C. A. van Tilborg, editors, Information, Coding and Mathematics, pages 141--163. Kluwer, 2002. Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday.
[25]
S. Wiesner. Conjugate coding. SIGACT News, 15(1):78--88, 1983.

Cited By

View all
  • (2012)A code-based 1-out-of-n oblivious transfer based on mceliece assumptionsProceedings of the 8th international conference on Information Security Practice and Experience10.1007/978-3-642-29101-2_10(144-157)Online publication date: 9-Apr-2012

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASIACCS '11: Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
March 2011
527 pages
ISBN:9781450305648
DOI:10.1145/1966913
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 March 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. McEliece cryptosystem
  2. interactive hashing
  3. oblivious transfer
  4. trapdoor permutation

Qualifiers

  • Short-paper

Conference

ASIA CCS '11
Sponsor:

Acceptance Rates

ASIACCS '11 Paper Acceptance Rate 35 of 217 submissions, 16%;
Overall Acceptance Rate 418 of 2,322 submissions, 18%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2012)A code-based 1-out-of-n oblivious transfer based on mceliece assumptionsProceedings of the 8th international conference on Information Security Practice and Experience10.1007/978-3-642-29101-2_10(144-157)Online publication date: 9-Apr-2012

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media