Home

Usable Secure Private Search

Mariana Petrova Raykova; Ang Cui; Binh D. Vo; Bin Liu; Tal G. Malkin; Steven Michael Bellovin; Salvatore Stolfo

Title:
Usable Secure Private Search
Author(s):
Raykova, Mariana Petrova
Cui, Ang
Vo, Binh D.
Liu, Bin
Malkin, Tal G.
Bellovin, Steven Michael
Stolfo, Salvatore
Date:
Type:
Articles
Department:
Computer Science
Volume:
10
Permanent URL:
Book/Journal Title:
IEEE Security & Privacy
Abstract:
Real-world applications commonly require untrusting parties to share sensitive information securely. This article describes a secure anonymous database search (SADS) system that provides exact keyword match capability. Using a new reroutable encryption and the ideas of Bloom filters and deterministic encryption, SADS lets multiple parties efficiently execute exact-match queries over distributed encrypted databases in a controlled manner. This article further considers a more general search setting allowing similarity searches, going beyond existing work that considers similarity in terms of error tolerance and Hamming distance. This article presents a general framework, built on the cryptographic and privacy-preserving guarantees of the SADS primitive, for engineering usable private secure search systems.
Subject(s):
Computer science
Publisher DOI:
http://dx.doi.org/10.1109/MSP.2011.155
Item views:
119
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use