Search problems

Carmit Hazay; Yehuda Lindell

doi:10.1007/978-3-642-14303-8_9

Search problems

Carmit Hazay, Yehuda Lindell

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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.

Original language	English
Title of host publication	Information Security and Cryptography
Publisher	Springer International Publishing
Pages	227-254
Number of pages	28
DOIs	https://doi.org/10.1007/978-3-642-14303-8_9
State	Published - 2010

Publication series

Name	Information Security and Cryptography
Volume	15
ISSN (Print)	1619-7100
ISSN (Electronic)	2197-845X

Bibliographical note

Publisher Copyright:
© 2010, Springer-Verlag Berlin Heidelberg.

Access to Document

10.1007/978-3-642-14303-8_9

Cite this

@inbook{8a67df02f7694d01bae5e9ed775a35c0,

title = "Search problems",

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.",

author = "Carmit Hazay and Yehuda Lindell",

note = "Publisher Copyright: {\textcopyright} 2010, Springer-Verlag Berlin Heidelberg.",

year = "2010",

doi = "10.1007/978-3-642-14303-8_9",

language = "אנגלית",

series = "Information Security and Cryptography",

publisher = "Springer International Publishing",

pages = "227--254",

booktitle = "Information Security and Cryptography",

}

TY - CHAP

T1 - Search problems

AU - Hazay, Carmit

AU - Lindell, Yehuda

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85019743307&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14303-8_9

DO - 10.1007/978-3-642-14303-8_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:85019743307

T3 - Information Security and Cryptography

SP - 227

EP - 254

BT - Information Security and Cryptography

PB - Springer International Publishing

ER -

Search problems

Abstract

Publication series

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this