Skip to main content

Oblivious Transfer and Applications

  • Chapter
  • First Online:
Efficient Secure Two-Party Protocols

Part of the book series: Information Security and Cryptography ((ISC))

  • 2706 Accesses

Abstract

In this chapter we carry out an in-depth study of the problem of constructing efficient protocols for oblivious transfer (as introduced in Section 3.2.2). Oblivious transfer is one of the most important building blocks in cryptography, and is very useful for constructing secure protocols. We demonstrate this by showing how to achieve secure pseudorandom function evaluation using oblivious transfer.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover 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. C. Peikert, V. Vaikuntanathan and B. Waters. A Framework for Efficient and Composable Oblivious Transfer. In CRYPTO’08, Springer- Verlag (LNCS 5157), pages 554–571, 2008.

    Google Scholar 

  2. U. Feige and A. Shamir. Zero Knowledge Proofs of Knowledge in Two Rounds. In CRYPTO’89, Springer-Verlag (LNCS 435), pages 526–544, 1989.

    Google Scholar 

  3. W. Aiello, Y. Ishai and O. Reingold. Priced Oblivious Transfer: How to Sell Digital Goods. In EUROCRYPT’01, Springer-Verlag (LNCS 2045), pages 110–135, 2001.

    Google Scholar 

  4. S. Halevi and Y. Tauman-Kalai. Smooth Projective Hashing and Two-Message Oblivious Transfer. Cryptology ePrint Archive, Report 2007/118, 2007.

    Google Scholar 

  5. Y. Lindell, B. Pinkas and N. Smart. Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries. In Conference on Security and Cryptography for Networks, pages 2–20, 2008.

    Google Scholar 

  6. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT’99, Springer-Verlag (LNCS 1592), pages 223–238, 1999.

    Google Scholar 

  7. M. J. Freedman, Y. Ishai, B. Pinkas and O. Reingold. Keyword Search and Oblivious Pseudorandom Functions. In 2nd TCC, Springer- Verlag (LNCS 3378), pages 303–324, 2005.

    Google Scholar 

  8. J. Katz and Y. Lindell. Introduction to Modern Cryptography. Chapman and Hall/CRC Press, 2007.

    Google Scholar 

  9. M. Naor and B. Pinkas. Efficient Oblivious Transfer Protocols. In 12th SODA, pages 448–457, 2001.

    Google Scholar 

  10. M. Naor and O. Reingold. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. In 38th FOCS, pages 231–262, 1997.

    Article  MathSciNet  Google Scholar 

  11. O. Goldreich. Foundations of Cryptography: Volume 1 – Basic Tools. Cambridge University Press, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carmit Hazay .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hazay, C., Lindell, Y. (2010). Oblivious Transfer and Applications. In: Efficient Secure Two-Party Protocols. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14303-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14303-8_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14302-1

  • Online ISBN: 978-3-642-14303-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics