The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - Sept.-Oct. (2012 vol.10)
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
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.
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
CITATION
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
REFERENCES
1. B.H. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Comm. ACM, vol. 13, no. 7, 1970, pp. 422–426.
2. M. Bellare, A. Boldyareva, and A. O'Neill, “Deterministic and Efficiently Searchable Encryption,” Proc. Int'l Cryptology Conf. (Crypto 2007), Springer, 2007, pp. 535–552.
3. H.-A. Park et al., “Secure Similarity Search,” Proc. 2007 IEEE Int'l Conf. Granular Computing (GRC 07), IEEE CS, 2007, p. 598.
4. A. Sahai and B. Waters, “Fuzzy Identity-Based Encryption,” LNCS 3494, Springer, 2005, pp. 457–473.
5. M. Raykova et al., “Secure Anonymous Database Search,” Proc. ACM Cloud Computer Security Workshop (CCSW 09), ACM, 2009, pp. 115–126.
6. S. Goldwasser and S. Micali, “Probabilistic Encryption,” J. Computer and System Sciences, vol. 28, no. 2, 1984, pp. 270–299.
7. S. Pohlig and M. Hellman, “An Improved Algorithm for Computing Logarithms over gf(P) and Its Cryptographic Significance,” IEEE Trans. Information Theory, vol. 24, no. 1, 1978, pp. 106–110.
8. D. Boneh, “Simplified OAEP for the RSA and Rabin Functions,” LNCS 2139, Springer, 2001, pp. 275–291.
38 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool