Efficient cryptographic primitives for private data mining

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn , Issue , 2010, Pages

  Shaneck, Mark ^a   Kim, Yongdae ^b  

^a LIBERTY UNIVERSITY   (United States)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; MINING ACTIVITIES; PRIVACY CONCERNS; PRIVACY LAW; PRIVACY PRESERVING DATA MINING; PRIVATE DATA; THIRD PARTIES; TRUST MODELS;

DATA MINING; MINING;

DATA PRIVACY;

EID: 77951750318     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2010.172     Document Type: Conference Paper

References (49)

1. Bill Aiello, Yuval Ishai, and Omer Reingold. Priced Oblivious Transfer: How to Sell Digital Goods. In Proceedings of Advances in Cryptology - Eurocrypt, 2001.
2. Joy Algesheimer, Jan Camenisch, and Victor Shoup. Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology, 2002.
3. Sunil Arya and Theocharis Malamatos. Linear-Size Approximate Voronoi Diagrams. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2002.
4. Sunil Arya, Theocharis Malamatos, and David Mount. Space-Efficient Approximate Voronoi Diagrams. In Proceedings of the Symposium on Theory of Computing, 2002.
5. Sunil Arya and David Mount. Approximate Nearest Neighbor Queries in Fixed Dimensions. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1993.
6. Sunil Arya, David Mount, Nathan Netanyahu, Ruth Silverman, and Angela Wu. An Optimal Algorithm for Approximate Neaest Neighbor Searching in Fixed Dimensions. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1994.
7. Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, and Angela Y. Wu. An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. Journal of the ACM, 45(6):891-923, 1998.
8. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness Theorems for Non-Cryptographic Fault- Tolerant Distributed Computation. In Proceedings of the 20th Annual Symposium on the Theory of Computing, 1988.
9. Ian Blake and Vladimir Kolesnikov. Conditional Encrypted Mapping and Comparing Encrypted Numbers. In Proceedings of Financial Cryptography, 2006.
10. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. OPTICS-OF: Identifying Local Outliers. In Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery, 1999.
11. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. LOF: Identifying Density-Based Local Outliers. In Proceedings of the ACM International Conference on Management of Data, 2000.
12. Coalition Against Insurance Fraud. http://www. insurancefraud.org, 2007.
13. Centers for Disease Control and Prevention. http:// www.cdc.gov/, 2007.
14. Kenneth Clarkson. An Algorithm for Approximate Closestpoint Queries. In Proceedings of the ACM Symposium on Computational Geometry, 1994.
15. T.M. Cover and P.E. Hart. Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1):21-27, 1967.
16. Claude Crépeau. Equivalence Between Two Flavours of Oblivious Transfer. In Proceedings of Advances in Cryptology, 1987.
17. Wenliang Du and Mikhail Atallah. Privacy-Preserving Cooperative Statistical Analysis. In Proceedings of the 17th Annual Computer Security Applications Conference, 2001.
18. Wenliang Du and Zhijun Zhan. A Practical Approach to Solve Secure Multi-party Computation Problems. In Proceedings of the 2002 Workshop on New Security Paradigms, 2002.
19. Wenliang Du and Zhijun Zhan. Building Decision Tree Classifier on Private Data. In Proceedings of the Workshop on Privacy, Security, and Data Mining at The 2002 IEEE International Conference on Data Mining, 2002.
20. Levent Ertöchael Steinbach, and Vipin Kumar. A New Shared Nearest Neighbor Clustering Algorithm and its Applications. In Workshop on Clustering High Dimensional Data and its Applications, Proceedings of Text Mine '01, First SIAM International Conference on Data Mining, 2001.
21. Levent Ertöchael Steinbach, and Vipin Kumar. Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data. In Proceedings of the SIAM International Conference on Data Mining, 2003.
22. S. Even, O. Goldreich, and A. Lempel. A Randomized Protocol for Signing Contracts. Communications of the ACM, 28(6):637-647, 1985.
23. Rosario Gennaro, Michael Rabin, and Tal Rabin. Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, 1998.
24. GNU Multiple Precision Arithmetic Library. http:// www.swox.com/gmp/, 2007.
25. Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikë On Private Scalar Product Computation for Privacy-Preserving Data Mining. In Proceedings of the 7th Annual International Conference in Information Security and Cryptology, 2004.
26. Oded Goldreich. The Foundations of Cryptography, volume 2. Cambridge University Press, 2004.
27. Piotr Indyk and Rajeev Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proceedings of the Symposium on Theory of Computing, 1998.
28. Ioannis Ioannidis and Ananth Grama. An Efficient Protocol for Yao's Millionaire's Problem. In Proceedings of the Hawaii International Conference on System Sciences, 2003.
29. Ioannis Ioannidis, Ananth Grama, and Mikhail Atallah. A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments. In Proceedings of the 31st International Conference on Parallel Processing, 2002.
30. R. A. Jarvis and E. A. Patrick. Clustering Using a Similarity Measure Based on Shared Nearest Neighbors. IEEE Transactions on Computers, C22(11):1025-1034, 1973.
31. Eike Kiltz, Ivan Damgaard, Matthias Fitzi, Jesper Buus Nielsen, and Tomas Toft. Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation. In Proceedings of the third Theory of Cryptography Conference, 2006.
32. Jon Kleingberg. Two Algorithms for Nearest-Neighbor Search in High Dimensions. In Proceedings of The ACM Symposium on Theory of Computing, 1997.
33. Eyal Kushlevitz, Rafail Ostrovsky, and Yuval Rabani. Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. In Proceedings of The ACM Symposium on Theory of Computing, 1998.
34. Sven Laur and Helger Lipmaa. On Private Similarity Search Protocols. In Proceedings of the 9th Nordic Workshop on Secure IT Systems, 2004.
35. Hsiao-Ying Lin andWen-Guey Tzeng. An Efficient Solution to the Millionaires' Problem Based on Homomorphic Encryption. In Proceedings of the Third International Conference on Applied Cryptography and Network Security, 2005.
36. Helger Lipmaa. An Oblivious Transfer Protocol with Log-Squared Communication. In Proceedings of the 8th Information Security Conference, 2005.
37. Moni Naor and Benny Pinkas. Oblivious Transfer and Polynomial Evaluation. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999.
38. Moni Naor and Benny Pinkas. Efficient Oblivious Transfer Protocols. In Proceedings of the 12th Annual Symposium on Discrete Algorithms, 2001.
39. Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Proceedings of Eurocrypt, 1999.
40. Michael Rabin. How to Exchange Secrets by Oblivious Transfer. Technical Report Technical Report TR-81, Harvard University, 1981.
41. Pradeep Ravikumar, William W. Cohen, and Stephen E. Fienberg. A Secure Protocol for Computing String Distance Metrics. In Proceedings of the ICDM Workshop on Privacy and Security Aspects of Data Mining, 2004.
42. Adi Shamir. How to Share a Secret. Communications of the ACM, 22(11):512-613, 1979.
43. Mark Shaneck, Yongdae Kim, and Vipin Kumar. Privacy Preserving Nearest Neighbor Search. Technical Report 06-014, University of Minnesota, 2006.
44. Wen-Guey Tzeng. Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters. IEEE Transactions on Computers, 53(2):232-240, 2004.
45. Jaideep Vaidya and Chris Clifton. Privacy-Preserving Association Rule Mining in Vertically Partitioned Data. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining, 2002.
46. Jaideep Vaidya and Chris Clifton. Leveraging the "Multi" in Secure Multi-Party Computation. In Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, 2003.
47. Jaideep Vaidya and Chris Clifton. Privacy-Preserving Outlier Detection. In Proceedings of the Fourth IEEE International Conference on Data Mining, 2004.
48. Zhiqiang Yang, Rebecca Wright, and Hiranmayee Subramaniam. Experimental Analysis of a Privacy-Preserving Scalar Product Protocol. International Journal of Computer Systems Science and Engineering, 21(1):47-52, 2006.
49. A. C. Yao. How to Generate and Exchange Secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986.