This Article 
 Bibliographic References 
 Add to: 
Usable, Secure, Private Search
Sept.-Oct. 2012 (vol. 10 no. 5)
pp. 53-60
Mariana Raykova, IBM Research
Ang Cui, Columbia University
Binh Vo, Columbia University
Bin Liu, Columbia University
Tal Malkin, Columbia University
Steven M. Bellovin, Columbia University
Salvatore J. Stolfo, Columbia University
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.
Index Terms:
Feature extraction,Cryptography,Computer science,Educational institutions,Privacy,Databases,secure anonymous database search,database search,query processing,privacy,storage,retrieval,sorting,feature extraction,keyword matching,SADS
Mariana Raykova, Ang Cui, Binh Vo, Bin Liu, Tal Malkin, Steven M. Bellovin, Salvatore J. Stolfo, "Usable, Secure, Private Search," IEEE Security & Privacy, vol. 10, no. 5, pp. 53-60, Sept.-Oct. 2012, doi:10.1109/MSP.2011.155
Usage of this product signifies your acceptance of the Terms of Use.