Skip to main content
SpringerLink
Log in

Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification

  • Conference paper
Information Theoretic Security (ICITS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5155))

Included in the following conference series:

  • 663 Accesses

Abstract

It is known that string (1,2)-OT and Rabin’s OT are equivalent. Actually, there have been many reductions between them. Many of them use the privacy amplification technique as a basic tool. The privacy amplification technique essentially involves some post-processing of sending random objects (e.g., random indices of pairwise independent hash functions) per each invocation of Rabin’s OT is necessary. In this paper, we show a simple direct reduction of string (1,2)-OT to Rabin’s OT by using a deterministic randomness extractor for bit-fixing sources. Our reduction can be realized without privacy amplification and thus our protocol is simpler and more efficient with respect to the communication complexity than the previous reductions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3(3), 289–304 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bennett, C.H., Brassard, G., Crépeau, C., Maurer, U.M.: Generalized privacy amplification. IEEE Transactions on Information Theory 41(6), 1915–1923 (1995)

    Article  MATH  Google Scholar 

  3. Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM Journal on Computing 17(2), 210–229 (1988)

    Article  MathSciNet  Google Scholar 

  4. Boyko, V.: On the security properties of OAEP as an all-or-nothing transform. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 503–518. Springer, Heidelberg (1999)

    Google Scholar 

  5. Brassard, G., Crépeau, C.: Oblivious transfers and privacy amplification. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 334–347. Springer, Heidelberg (1997)

    Google Scholar 

  6. Brassard, G., Crépeau, C., Robert, J.-M.: Information theoretic reductions among disclosure problems. In: Proc. 27th IEEE Symposium on Foundations of Computer Science, pp. 168–173 (1986)

    Google Scholar 

  7. Brassard, G., Crépeau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory 42(6), 1769–1780 (1996)

    Article  MATH  Google Scholar 

  8. Brassard, G., Crépeau, C., Wolf, S.: Oblivious transfers and privacy amplification. Journal of Cryptology 16(4), 219–237 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Cachin, C.: On the foundations of oblivious transfer. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 361–374. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453–469. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Chor, B., Goldreich, O., Håstad, J., Friedman, J., Rudich, R., Smolensky, R.: The bit extraction problem or t-resilient functions. In: Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 396–407 (1985)

    Google Scholar 

  12. Crépeau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350–354. Springer, Heidelberg (1988)

    Google Scholar 

  13. Crépeau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306–317. Springer, Heidelberg (1997)

    Google Scholar 

  14. Crépeau, C., Savvides, G., Schaffner, C., Wullschleger, J.: Information-theoretic conditions for two-party secure function evaluation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 538–554. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Damgård, I.B., Fehr, S., Salvail, L., Schaffner, C.: Oblivious transfer and linear functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 427–444. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Dodis, Y.: Exposure-Resilient Cryptography. PhD thesis, Dept. Electrical Engineering and Computer Science, MIT (2000)

    Google Scholar 

  17. Dodis, Y., Micali, S.: Lower bounds for oblivious transfer reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 42–55. Springer, Heidelberg (1999)

    Google Scholar 

  18. Dodis, Y., Sahai, A., Smith, A.: On perfect and adaptive security in exposure-resilient cryptography. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 299–322. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of ACM 28(6), 637–647 (1985)

    Article  MathSciNet  Google Scholar 

  20. Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM Journal on Computing 36(4), 1072–1094 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  21. Hoeffding, W.: Probability inequalities for sum of bounded random variables. Journal of the American Statistical Association 58, 13–30 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  22. Imai, H., Morozov, K., Nascimento, A.: On the oblivious transfer capacity of the erasure channel. In: Proc. 2006 IEEE International Symposium on Information Theory, pp.1428–1431 (2006)

    Google Scholar 

  23. Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing 36(5), 1231–1247 (2007)

    Article  MathSciNet  Google Scholar 

  24. Kurosawa, K., Johansson, T., Stinson, D.: Almost k-wise independent sample spaces and their cryptologic applications. Journal of Cryptology 14(4), 231–253 (2001)

    MATH  MathSciNet  Google Scholar 

  25. Kurosawa, K., Kishimoto, W., Koshiba, T.: A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions. IEEE Transactions on Information Theory 54(6), 2566–2571 (2008)

    Article  Google Scholar 

  26. Lee, C.-J., Lu, C.-J., Tsai, S.-C.: Deterministic extractors for independent-symbol sources. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 84–95. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  27. Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University (1981)

    Google Scholar 

  28. Rivest, R.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210–218. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  29. Wolf, S.: Reducing oblivious string transfer to universal oblivious transfer. In: Proc. 2000 IEEE International Symposium on Information Theory, p.465 (2000)

    Google Scholar 

  30. Wolf, S., Wullschleger, J.: New monotones and lower bounds in unconditional two-party computation. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 467–477. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki, 316-8511, Japan

    Kaoru Kurosawa

  2. Division of Mathematics, Electronics and Informatics, Graduate School of Science and Engineering, Saitama University, 255 Shimo-Okubo, Sakura, Saitama, 338-8570, Japan

    Takeshi Koshiba

Authors
  1. Kaoru Kurosawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takeshi Koshiba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Reihaneh Safavi-Naini

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurosawa, K., Koshiba, T. (2008). Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification. In: Safavi-Naini, R. (eds) Information Theoretic Security. ICITS 2008. Lecture Notes in Computer Science, vol 5155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85093-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85093-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85092-2

  • Online ISBN: 978-3-540-85093-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation