Skip to main content

Founding Cryptography on Oblivious Transfer

  • Chapter
  • First Online:
Hiding Data - Selected Topics

Part of the book series: Foundations in Signal Processing, Communications and Networking ((SIGNAL,volume 12))

  • 843 Accesses

Abstract

In cryptography, an oblivious transfer protocol (abbreviated OT) is a fundamental protocol in which a sender transfers one of potentially many pieces of information to a receiver, but remains oblivious as to what piece has been transferred.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

References

  1. R. Alhswede, I. Csiszár, Common randomness in Information Theory and Cryptography, Part I. IEEE Trans. Inf. Theory 39, 1121–1132 (1993)

    Article  MATH  Google Scholar 

  2. R. Alhswede, I. Csiszár, On the oblivious transfer capacity, in Proceedings of the IEEE International Symposium on Information Theory, ISIT (2007), pp. 2061–2064

    Google Scholar 

  3. R. Alicki, M. Fannes, Continuity of quantum conditional information. J. Phys. A: Math. Gen. 37, L55–L57 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. I. Csiszár, P. Narayan, Secrecy capacities for multiterminal channel models. IEEE Trans. Inf. Theory 54(6), 2437–2452 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. J. Kilian, Founding cryptography on oblivious transfer, in Proceedings of the STOC 1998 (1988), pp. 20–31

    Google Scholar 

  6. U. Maurer, Secret key agreement by public discussion. IEEE Trans. Inf. Theory 39, 733–742 (1993)

    Article  MATH  Google Scholar 

  7. U. Maurer, The strong secret key rate of discrete random triples, in Communications and Cryptography: Two sides of One Tapestry, ed. by R.E. Blahut, et al. (Springer, Boston, 1994), pp. 271–285

    Chapter  Google Scholar 

  8. A. Nascimento, A. Winter, On the oblivious transfer capacity of noisy correlations, in Proceedings of the ISIT 2006 (Seattle, 2006), pp. 1871–1875

    Google Scholar 

  9. A. Winter, A. Nascimento, H. Imai, Commitment capacity of discrete memoryless channels, Cryptography and Coding, vol. 2898, LNCS (Springer, Berlin, 2003), pp. 35–51

    Chapter  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rudolf Ahlswede .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ahlswede, R. (2016). Founding Cryptography on Oblivious Transfer. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Hiding Data - Selected Topics. Foundations in Signal Processing, Communications and Networking, vol 12. Springer, Cham. https://doi.org/10.1007/978-3-319-31515-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31515-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31513-3

  • Online ISBN: 978-3-319-31515-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics