Privacy-preserving classification of customer data without loss of accuracy

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 92-102

  Yang, Zhiqiang ^a   Zhong, Sheng ^a,b   Wright, Rebecca N ^a  

^a Stevens Institute of Technology   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); CLASSIFIERS; CRYPTOGRAPHY; DATA MINING; MINERS; SALES; SPACE DIVISION MULTIPLE ACCESS;

CLASSIFICATION RULES; CRYPTOGRAPHIC PROTOCOLS; NAIVE BAYES CLASSIFIERS; PRIVACY-PRESERVING CLASSIFICATION; PRIVATE INFORMATION; RANDOMIZATION TECHNIQUES; SENSITIVE ATTRIBUTE; TECHNICAL CONTRIBUTION;

DATA PRIVACY;

EID: 84880121624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.9     Document Type: Conference Paper

References (35)

1. D. Agrawal and C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Proc. of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 247-255. ACM Press, 2001.
2. A. Ambainis, M. Jakobsson, and H. Lipmaa. Cryptographic randomized response techniques. In Proc. of the 2004 International Workshop on Practice and Theory in Public Key Cryptography (PKC), pages 425-438. Springer, 2004.
3. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 439-450. ACM Press, May 2000.
4. N. Adam and J. Worthmann. Security-control methods for statistical databases: a comparative study. ACM Comput. Surv., 21(4):515-556, 1989.
5. M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. of the 20th Annual ACM Symposium on Theory of Computing, pages 1-10. ACM Press, 1988.
6. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.
7. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections (extended abstract). In Proc. of the 26th Annual ACM symposium on Theory of Computing, pages 544-553. ACM Press, 1994.
8. L. Cranor, editor. Comm. ACM 42(2), Special Issue on Internet Privacy, 1999.
9. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proc. of the 22nd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 202-210. ACM Press, 2003.
10. C. Dwork and K. Nissim. Privacy-preserving data-mining on vertically partitioned databases. In Advances in Cryptology - Proceedings of CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, Santa Barbara, California, August 2004.
11. P. Domingos and M. Pazzani. On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning, 29(2-3):103-130, 1997.
12. W. Du and Z. Zhan. Using randomized response techniques for privacy-preserving data mining. In Proc. of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 505-510. ACM Press, 2003.
13. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In Proc. of the 22nd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 211-222. ACM Press, 2003.
14. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In Proc. of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 217-228. ACM Press, 2002.
15. S. Goldwasser and S. Micali. Probabilistic encryption. J. Computer and System Sciences, 28:270-299, 1984.
16. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. of the 19th Annual ACM Conference on Theory of Computing, pages 218-229. ACM Press, 1987.
17. O. Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004.
18. Martin Hirt and Kazue Sako. Efficient receipt-free voting based on homomorphic encryption. Lecture Notes in Computer Science, 1807:539+, 2000.
19. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In The ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02), pages 24-31, June 2002.
20. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar. On the privacy preserving properties of random data perturbation techniques. In The Third IEEE International Conference on Data Mining, 2003.
21. M. Kantarcioglu and J. Vaidya. An architecture for privacy-preserving mining of client information. In IEEE ICDM Workshop on Privacy, Security and Data Mining, pages 37-42, 2002.
22. M. Kantarcioglu and J. Vaidya. Privacy preserving naive Bayes classifier for horizontally partitioned data. In IEEE Workshop on Privacy Preserving Data Mining, 2003.
23. Y. Lindell and B. Pinkas. Privacy preserving data mining. J. Cryptology, 15(3):177-206, 2002.
24. T. Mitchell. Machine Learning. McGraw-Hill, 1997.
25. S. Rizvi and J. Haritsa. Maintaining data privacy in association rule mining. In Proc. of the 28th VLDB Conference, 2002.
26. Bruce Schneier. Applied Cryptography. John Wiley & Sons, second edition, 1996.
27. H. Subramaniam, R. N. Wright, and Z. Yang. Experimental analysis of privacy-preserving statistics computation. In Proc. of the VLDB Worshop on Secure Data Management, pages 55-66, August 2004.
28. Y. Tsiounis and M. Yung. On the security of ElGamal-based encryption. In Public Key Cryptog-raphy'98, volume 1431 of Lecture Notes in Computer Science, pages 117-134, 1998.
29. J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In Proc. of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 639-644. ACM Press, 2002.
30. J. Vaidya and C. Clifton. Privacy-preserving k-means clustering over vertically partitioned data. In Proc. of the Ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 206-215. ACM Press, 2003.
31. J. Vaidya and C. Clifton. Privacy preserving naive Bayes classifier on vertically partitioned data. In 2004 SIAM International Conference on Data Mining, 2004.
32. S. L. Warner. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60(309):63-69, 1965.
33. A. Westin. Freebies and privacy: What net users think. Technical report, Opinion Research Corporation, 1999.
34. R. N. Wright and Z. Yang. Privacy-preserving Bayesian network structure computation on distributed heterogeneous data. In Proc. of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 713-718. ACM Press, 2004.
35. A. Yao. How to generate and exchange secrets. In Proc. of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.