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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
U. Feige and A. Shamir. Zero Knowledge Proofs of Knowledge in Two Rounds. In CRYPTO’89, Springer-Verlag (LNCS 435), pages 526–544, 1989.
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.
S. Halevi and Y. Tauman-Kalai. Smooth Projective Hashing and Two-Message Oblivious Transfer. Cryptology ePrint Archive, Report 2007/118, 2007.
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.
P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT’99, Springer-Verlag (LNCS 1592), pages 223–238, 1999.
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.
J. Katz and Y. Lindell. Introduction to Modern Cryptography. Chapman and Hall/CRC Press, 2007.
M. Naor and B. Pinkas. Efficient Oblivious Transfer Protocols. In 12th SODA, pages 448–457, 2001.
M. Naor and O. Reingold. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. In 38th FOCS, pages 231–262, 1997.
O. Goldreich. Foundations of Cryptography: Volume 1 – Basic Tools. Cambridge University Press, 2001.
Author information
Authors and Affiliations
Corresponding author
Rights 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)