Abstract
Recently, there has been much interest in the data mining and other communities for secure protocols for a wide variety of tasks. This interest exists not only in academic circles, but also in industry, in part due to the growing conflict between the privacy concerns of citizens and the homeland security needs of governments. In this chapter we focus on search problems involving two parties; a client that is interested in performing a search in a database that is being held by a server. The (informal) security requirements for search problems assert that the server should not learn any useful information regarding the search conducted by the client, while the client should learn the search result but nothing more.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. P. Pedersen. Non-interactive and Information-Theoretical Secure Verifiable Secret Sharing. In CRYPTO’91, Springer-Verlag (LNCS 576) pp. 129–140, 1991.
B. Pinkas, T. Schneider, N. P. Smart and S. C. Williams. Secure Two- Party Computation Is Practical. In ASIACRYPT 2009, Springer- Verlag (LNCS 5912), pages 250–267, 2009.
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 O. Reingold. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. In 38th FOCS, pages 231–262, 1997.
C. Hazay and Y. Lindell. Constructions of Truly Practical Secure Protocols Using Standard Smartcards. In ACM CCS, pages 491–500, 2008.
M. Witteman. Advances in Smartcard Security. In Information Security Bulletin, pages 11–22, July 2002.
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). Search Problems. In: Efficient Secure Two-Party Protocols. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14303-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-14303-8_9
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)