Efficient privacy-preserving k-nearest neighbor search

Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

Volumn , Issue , 2008, Pages 311-319

  Qi, Yinian ^a   Atallah, Mikhail J ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITIES; CORRECTNESS PROOFS; DISTRIBUTED COMPUTING SYSTEMS; INTERNATIONAL CONFERENCES; K-NEAREST NEIGHBOR; K-NEAREST NEIGHBOR SEARCH; K-NN SEARCH; MULTI-STEP; NN SEARCH; OUTLIER DETECTION; PRIVACY-PRESERVING; PRIVACY-PRESERVING DATA MINING; PRIVATE DATA; PROVABLY SECURE; QUADRATIC COMPLEXITY; SEQUENCE DATA; SINGLE-STEP;

CANNING; CHLORINE COMPOUNDS; CLASSIFICATION (OF INFORMATION); COMPUTER SYSTEMS; DECISION SUPPORT SYSTEMS; IMAGE RETRIEVAL; INFORMATION MANAGEMENT; LEARNING SYSTEMS; SEARCH ENGINES;

LAWS AND LEGISLATION;

EID: 51849139413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2008.79     Document Type: Conference Paper

References (32)

1. C. C. Aggarwal and P. S. Yu. Outlier detection for high dimensional data. In SIGMOD'01, 2001.
2. M. J. Atallah, F. Kerschbaum, and W. Du. Secure and private sequence comparisons. In WPES'03, pages 39-44, 2003.
3. S. Berchtold, B. Ertl, D. A. Keim, H.-P. Kriegel, and T. Seidl. Fast nearest neighbor search in high-dimensional space. In ICDE'98, pages 209-218, 1998.
4. R. Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptology, pages 143-202, 2000.
5. C. Clifton, M. Kantarcioglu, J. Vaidya, X. Lin, and M. Y. Zhu. Tools for privacy preserving data mining. SIGKDD Explorations, pages 28-34, 2002.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
7. T. Cover and P. Hart. Nearest neighbor pattern classification. Information Theory, 13:21-27, 1967.
8. I. Damgård, M. Fitzi, E. Kiltz, J. B. Nielsen, and T. Toft. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In TCC, pages 285-304, 2006.
9. W. Du and M. J. Atallah. Privacy-preserving statistical analysis. In Proceedings of the 17th Annual Computer Security Applications Conference, pages 102-110, 2001.
10. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikäinen. On private scalar product computation for privacy-preserving data mining. In ICISC, pages 104-120, 2004.
11. O. Goldreich. Foundations of Cryptography: Volume II Basic Application. Cambridge University Press, 2004.
12. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, pages 431-473, 1996.
13. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng., pages 1026-1037, 2004.
14. M. Kantarcioglu and C. Clifton. Privately computing a distributed k-nn classifier. In PKDD'04, pages 279-290, 2004.
15. J. M. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In STOC'97, pages 599-608, 1997.
16. Y. Lindell and B. Pinkas. Privacy preserving data mining. In CRYPTO, 2000.
17. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - secure two-party computation system. In USENIX Security Symposium, pages 287-302, 2004.
18. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol, pages 443-53, 1970.
19. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology: EUROCRYPT'99, pages 223-238. Springer, 1999.
20. S. Ramaswamy, R. Rastogi, and K. Shim. Efficient algorithms for mining outliers from large data sets. In SIGMOD'00, pages 427-438, 2000.
21. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD'95, pages 71-79, 1995.
22. T. Seidl and H.-P. Kriegel. Efficient user-adaptable similarity search in large multimedia databases. In VLDB'97, pages 506-515, 1997.
23. T. Seidl and H.-P. Kriegel. Optimal multi-step k-nearest neighbor search. In SIGMOD'98, pages 154-165, 1998.
24. M. Shaneck, Y. Kim, and V. Kumar. Privacy preserving nearest neighbor search. In ICDMW'06, pages 541-545, 2006.
25. Z. Teng and W. Du. A hybrid multi-group privacypreserving approach for building decision trees. In PAKDD, pages 296-307, 2007.
26. J. Vaidya and C. Clifton. Privacy-preserving k-means clustering over vertically partitioned data, 2003.
27. J. Vaidya and C. Clifton. Privacy-preserving outlier detection. In ICDM'04, pages 233-240, 2004.
28. V. S. Verykios, E. Bertino, I. N. Fovino, L. P. Provenza, Y. Saygin, and Y. Theodoridis. State-of-the-art in privacy preserving data mining. SIGMOD Rec., pages 50-57, 2004.
29. R. A. Wagner and M. J. Fischer. The string to string correction problem. J. ACM, pages 168-173, 1974.
30. L. Xiong, S. Chitti, and L. Liu. Mining multiple private databases using a knn classifier. In SAC'07, pages 435-440, 2007.
31. A. C. Yao. Protocols for secure computations. In Proceedings of the 23th IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982.
32. A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.