Raykova Mariana Petrova author Columbia University. Computer Science Cui Ang author Columbia University. Computer Science Vo Binh D. author Columbia University. Computer Science Liu Bin author Columbia University. Computer Science Malkin Tal G. author Columbia University. Computer Science Bellovin Steven Michael author Columbia University. Computer Science Stolfo Salvatore author Columbia University. Computer Science Columbia University. Computer Science originator text Articles 2012 manuscript version English 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. Computer science 10 5 53 60 2012 http://dx.doi.org/10.1109/MSP.2011.155 http://hdl.handle.net/10022/AC:P:14857 NNC NNC 2012-10-09 15:33:57 -0400 2012-10-10 16:18:49 -0400 8861 eng