loading...
Protecting Privacy in Key-Value Search Systems
Miami Beach, Florida, USA December 11-December 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ACSAC.2006.4322nd Annual Computer Security Applica ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yinglian Xie, Carnegie Mellon University, USA
Michael K. Reiter, Carnegie Mellon University, USA
David O'Hallaron, Carnegie Mellon University, USA
This paper investigates the general problem of efficiently performing key-value search at untrusted servers without loss of user privacy. Given key-value pairs from multiple owners that are stored across untrusted servers, how can a client efficiently search these pairs such that no server, on its own, can reconstruct the key-value pairs?

We propose a system, called Peekaboo, that is applicable and practical to any type of key-value search while protecting both data owner privacy and client privacy. The main idea is to separate the key-value pairs across different servers. Supported by access control and user authentication, Peekaboo allows search to be performed by only authorized clients without reducing the level of user privacy.

Citation:
Yinglian Xie, Michael K. Reiter, David O'Hallaron, "Protecting Privacy in Key-Value Search Systems," acsac, pp.493-504, 22nd Annual Computer Security Applications Conference (ACSAC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.