Privacy preserving data mining

Advances in Information Security

Volumn 19, Issue , 2006, Pages 1-115

  Vaidya, Jaideep ^a   Zhu, Yu Michael ^b   Clifton, Christopher W ^c  

^a RUTGERS UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

^c Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84882630942     PISSN: 15682633     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Article

References (92)

1. D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Proceedings of the Twentieth ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, pages 247-255, Santa Barbara, Cahfornia, May 21-23 2001. ACM.
2. R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, San Diego, California, June 9-12 2003.
3. R. Agrawal, T. Imiehnski, and A. N. Swami. Mining association rules between sets of items in large databases. In P. Buneman and S. Jajodia, editors. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, Washington, D.C., May 26-28 1993.
4. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, pages 439-450, Dallas, TX, May 14-19 2000. ACM.
5. M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. Verykios. Disclosure limitation of sensitive rules. In Knowledge and Data Engineering Exchange Workshop (KDEX'99), pages 25-32, Chicago, Illinois, Nov. 8 1999.
6. M. J. Atallah, M, Bykova, J. Li, and M. Karahan. Private collaborative forecasting and benchmarking. In Proc. 2d. ACM Workshop on Privacy in the Electronic Society (WPES), Washington, DC, Oct. 28 2004.
7. M. J. Atallah, H. G. Elmongui, V. Deshpande, and L. B. Schwarz. Secure supply-chain protocols. In IEEE International Conference on E-Commerce, pages 293-302, Newport Beach, Cahfornia, June 24-27 2003.
8. D. Barbara, N. Wu, and S. Jajodia. Detecting novel network intrusions using bayes estimators. In First SIAM International Conference on Data Mining, Chicago, Illinois, Apr. 5-7 2001.
9. V. Barnett and T. Lewis. Outliers in Statistical Data. John Wiley and Sons, 3rd edition, 1994.
10. J. Benaloh. Dense probabilistic encryption. In Proceedings of the Workshop on Selected Areas of Cryptography, pages 120-128, Kingston, Ontario, May 1994.
11. C. Cachin. EflBcient private bidding and auctions with an oblivious third party. In Proceedings of the 6th ACM conference on Computer and communications security, pages 120-127, Kent Ridge Digital Labs, Singapore, 1999. ACM Press.
12. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Toward privacy in public databases. In Theory of Cryptography Conference, Cambridge, MA, Feb. 9-12 2005.
13. D. W.-L. Cheung, J. Han, V. Ng, A. W.-C. Fu, and Y. Fu. A fast distributed algorithm for mining association rules. In Proceedings of the 1996 International Conference on Parallel and Distributed Information Systems (PDIS'96), pages 31-42, Miami Beach, Florida, USA, Dec. 1996. IEEE.
14. Y.-T. Chiang, D.-W. Wang, C.-J. Liau, and T. Sheng Hsu. Secrecy of twoparty secure computation. In Proceedings of the 19th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, pages 114-123, Storrs, Connecticut, Aug. 7-10 2005.
15. C. Clifton, M. Kantarcioglu, and J. Vaidya. Defining privacy for data mining. In H. Kargupta, A. Joshi, and K. Sivakumar, editors. National Science Foundation Workshop on Next Generation Data Mining, pages 126 133. Baltimore, MD, Nov. 1-3 2002.
16. G. Cooper and E. Herskovits. A bayesian method for the induction of probabilistic networks from data. Machine Learning, 9(4):309-347, 1992.
17. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum Hkelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society, B 39:1-38, 1977.
18. A. Dobra and S. E. Fienberg. Bounds for cell entries in contingency tables given marginal totals and decomposable graphs. In Proceedings of the National Academy of Sciences, number 97, pages 11885-11892, 2000.
19. P. Doyle, J. Lane, J. Theeuwes, and L. Zayatz, editors. Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies. Elsevier, Amsterdam, Holland, 2001.
20. W. Du and M. J. Atallah. Privacy-preserving statistical analysis. In Proceeding of the 17th Annual Computer Security Applications Conference, New Orleans, Louisiana, USA, December 10-14 2001.
21. W. Du, Y. S. Han, and S. Chen. Privacy-preserving multivariate statistical analysis: Linear regression and classification. In 2004 SI AM International Conference on Data Mining, Lake Buena Vista, Florida, Apr. 22-24 2004.
22. W. Du and Z. Zhan. Building decision tree classifier on private data. In C. Clifton and V. Estivill-Castro, editors, IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, volume 14, pages 1-8, Maebashi City, Japan, Dec. 9 2002. AustraUan Computer Society.
23. W. Du and Z. Zhan. Using randomized response techniques for privacypreserving data mining. In The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 505-510, Washington, DC, Aug. 24-27 2003.
24. W. K. Du and C. Chfton, editors. On Inverse Frequent Set Mining, Melbourne, Florida, Nov. 19 2003.
25. R. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, 1973.
26. Directive 95/46/EC of the European ParHament and of the Council of 24 October 1995 on the protection of individuals with regard to the processing of personal data and on the free movement of such data. Official Journal of the European Communities, No I.(281):31-50, Oct. 24 1995.
27. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In Proceedings of the 22nd ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (PODS 2003), pages 211-222, San Diego, CA, June 9-12 2003.
28. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association rules. In The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 217-228, Edmonton, Alberta, Canada, July 23-26 2002.
29. K. J. Ezawa and S. W. Norton. Constructing bayesian networks to predict uncollectible telecommunications accounts. IEEE Expert, 11(5):45-51, Oct. 1996.
30. Falcon fraud managerEA. http://www.fairisaac.com/Fairisaac/Solutions/Solutions+by+Function/Falcon+Fraud+Mcinager. htm, 2005.
31. M. Feingold, M. Corzine, M. Wyden, and M. Nelson. Data Mining Moratorium Act of 2003. U.S. Senate Bill (proposed), Jan. 16 2003.
32. M. Feingold, M. Jeffords, and M. Leahy. Data-mining reporting act of 2003. U.S. Senate Bill (proposed), July 31 2003. Also H.R. 4290.
33. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Eurocrypt 2004, Interlaken, Switzerland, May 2-6 2004. International Association for Cryptologic Research (lACR).
34. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, San Diego, CA, 1990.
35. B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen. On Secure Scalar Product Computation for Privacy-Preserving Data Mining. In C. Park and S. Ghee, editors. The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), volume 3506, pages 104-120, December 2-3, 2004.
36. O. Goldreich. The Foundations of Cryptography, volume 2, chapter General Cryptographic Protocols. Cambridge University Press, 2004.
37. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game-a completeness theorem for protocols with honest majority. In 19th ACM Symposium on the Theory of Computing, pages 218-229, 1987.
38. D. Goldschlag, M. Reed, and P. Syverson. Onion routing. Commun. ACM, 42(2):39-41, Feb. 1999.
39. H. Hamilton, E. Gurak, L. Findlater, and W. Olive. Computer science 831: Knowledge discovery in databases, Feb. 2002.
40. Standard for privacy of individually identifiable health information. Federal Register, 67(157):53181-53273, Aug. 14 2002.
41. Standard for privacy of individually identifiable health information. Technical report, U.S. Department of Health and Human Services Office for Civil Rights, Aug. 2003.
42. Z. Huang, W. Du, and B. Chen. Deriving private information from randomized data. In Proceedings of the 2005 ACM SICMOD International Conference on Management of Data, Baltimore, MD, June 13-16 2005.
43. I. loannidis, A. Grama, and M. Atallah. A secure protocol for computing dotproducts in clustered and distributed environments. In The 2002 International Conference on Parallel Processing, Vancouver, British Columbia, Aug. 18-21 2002.
44. G. Jagannathan and R. N. Wright. Privacy-preserving distributed/c-means clustering over arbitrarily partitioned data. In Proceedings of the 2005 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 593-599, Chicago, IL, Aug. 21-24 2005.
45. M. Kantarcioglu and J. Vaidya. Privacy preserving naive bayes classifier for horizontally partitioned data. In Workshop on Privacy Preserving Data Mining held in association with The Third IEEE International Conference on Data Mining, Melbourne, FL, Nov.19-22 2003.
46. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In The A CM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02), pages 24-31, Madison, Wisconsin, June 2 2002.
47. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowledge Data Eng., 16(9):1026-1037, Sept. 2004.
48. M. Kantarcioglu, J. Jin, and C. Clifton. When do data mining results violate privacy? In Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pe. ges 599-604, Seattle, WA, Aug. 22-25 2004.
49. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar. On the privacy preserving properties of random data perturbation techniques. In Proceedings of the Third IEEE International Conference on Data Mining (ICDM'03), Melbourne, Florida, Nov. 19-22 2003.
50. A. F. Karr, X. Lin, A. P. Sanil, and J. P. Reiter. Secure regressions on distributed databases. Journal of Computational and Graphical Statistics, 14:263-279, 2005.
51. E. M. Knorr and R. T. Ng. Algorithms for mining distance-based outliers in large datasets. In Proceedings of 24th International Conference on Very Large Data Bases (VLDB 1998), pages 392-403, New York City, NY, USA, Aug.24-27 1998.
52. E. M. Knorr, R. T. Ng, and V. Tucakov. Distance-based outliers: algorithms and apphcations. The VLDB Journal, 8(3-4):237-253, 2000.
53. A. Lazarevic, A. Ozgur, L. Ertoz, J. Srivastava, and V. Kumar. A comparative study of anomaly detection schemes in network intrusion detection. In SI AM International Conference on Data Mining (2003), San Francisco, California, May 1-3 2003.
54. M. Lewis. Department of defense appropriations act, 2004, July 17 2003. Title VIII section 8120. Enacted as Pubhc Law 108-87.
55. X. Lin, C. Clifton, and M. Zhu. Privacy preserving clustering with distributed EM mixture modeling. Knowledge and Information Systems, to appear 2004.
56. Y. Lindell and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology-CRYPTO 2000, pages 36-54. Springer-Verlag, Aug. 20-24 2000.
57. Y. Lindell and B. Pinkas. Privacy preserving data mining. Journal of Cryptology, 15(3):177-206, 2002.
58. Merriam-Webster online dictionary.
59. T. Mitchell. Machine Learning. McGraw-Hill Science/Engineering/Math, 1st edition, 1997.
60. R. A. Moore, Jr. Controlled data-swapping techniques for masking pubHc use microdata sets. Statistical Research Division Report Series RR 96-04, U.S. Bureau of the Census, Washington, DC, 1996.
61. D. Naccache and J. Stern. A new pubHc key cryptosystem based on higher residues. In Proceedings of the 5th ACM conference on Computer and communications security, pages 59-66, San Francisco, California, United States, 1998. ACM Press.
62. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing pages 245-254, Atlanta, Georgia, United States, 1999. ACM Press.
63. J. Neter, M. H. Kutner, W. Wasserman, and C. J. Nachtsheim. Applied Linear Regression Models. McGraw-Hill/Irwin, 3rd edition, 1996.
64. Toysmart bankruptcy settlement ensures comsumer privacy protection, Jan. 11 2001.
65. T. Okamoto and S. Uchiyama. A new public-key cryptosystem as secure as factoring. In Advances in Cryptology-Eurocrypt '98, LNCS 1403, pages 308-318. Springer-Verlag, 1998.
66. S. R. M. Oliveira and O. R. Zaiane. Achieving privacy preservation when sharing data for clustering. In Workshop on Secure Data Management in a Connected World (SDM'04) in conjunction with VLDB'2004, pages 67-82, Toronto, Canada, Aug. 30 2004.
67. S. R. M. Oliveira and O. R. Zaiane. Privacy-preserving clustering by object similarity-based representation and dimensionality reduction transformation. In Workshop on Privacy and Security Aspects of Data Mining (PSDM'04) in conjunction with the Fourth IEEE International Conference on Data Mining (ICDM'04), pages 21-30, Brighton, UK, Nov. 1 2004.
68. P. Paillier. PubHc key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology-Eurocrypt '99 Proceedings, LNCS 1592, pages 223-238. Springer-Verlag, 1999.
69. C. Palmeri. Believe in yourself, believe in the merchandise. Forbes Magazine, 160(5):118-124, Sept.8 1997.
70. D. Pelleg and A. Moore. X-means: Extending k-means with efficient estimation of the number of clusters. In Proceedings of the Seventeenth International Conference on Machine Learning, pages 727-734, San Francisco, 2000. Morgan Kaufmann.
71. J. M. Perry. Statement of John m. perry, president and ceo, cardsystems solutions, inc. before the united states house of representatives subcommittee on oversight and investigations of the committee on financial services. http://f inancialservices. house. gov/hearings. asp?f orinmode= detail&hearing=407&comm=4, July 21 2005.
72. J. R. Quinlan. Induction of decision trees. Machine Learning, 1(1):81-106, 1986.
73. S. Rametswamy, R. Rastogi, and K. Shim. Efficient algorithms for mining outliers from large data sets. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 427-438, Dallas, Texas, United States, 2000. ACM Press.
74. M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web transactions. ACM Transactions on Information and System Security, 1(1):66-92, Nov. 1998.
75. S. J. Rizvi and J. R. Haritsa. Maintaining data privacy in association rule mining. In Proceedings of 28th International Conference on Very Large Data Bases, pages 682-693, Hong Kong, Aug. 20-23 2002. VLDB.
76. P. Samarati. Protecting respondent's privacy in microdata release. IEEE Trans. Knowledge Data Eng., 13(6): 1010-1027, Nov./Dec. 2001.
77. A. P. Sanil, A. F. Karr, X. Lin, and J. P. Reiter. Privacy preserving regression modelling via distributed computation. In KDD '04-Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 677-682, New York, NY, USA, 2004. ACM Press.
78. Y. Saygm, V. S. Verykios, and C. Clifton. Using unknowns to prevent discovery of association rules. SIGMOD Record, 30(4):45-54, Dec. 2001.
79. L. Sweeney, k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, (5):557-570, 2002.
80. J. Vaidya and C. Clifton. Privacy preserving association rule mining in vertically partitioned data. In The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 639-644, Edmonton, Alberta, Canada, July 23-26 2002.
81. J. Vaidya and C. Clifton. Privacy-preserving/c-means clustering over vertically partitioned data. In The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 206-215, Washington, DC, Aug. 24-27 2003.
82. J. Vaidya and C. Clifton. Privacy preserving naiVe bayes classifier for vertically partitioned data. In 2004 SLAM International Conference on Data Mining, pages 522-526, Lake Buena Vista, Florida, Apr. 22-24 2004.
83. J. Vaidya and C. Clifton. Privacy-preserving outlier detection. In The Fourth IEEE International Conference on Data Mining, Brighton, UK, Nov. 1-4 2004.
84. J. Vaidya and C. Clifton. Secure set intersection cardinality with application to association rule mining. Journal of Computer Security, 13(4), Nov. 2005.
85. V. S. Verykios, A. K. Elmagarmid, B. Elisa, Y. Saygin, and D. Elana. Association rule hiding. IEEE Trans. Knowledge Data Eng., 16(4), 2004.
86. L. Wang, D. Wijesekera, and S. Jajodia. Cardinality-based inference control in data cubes. Journal of Computer Security, 12(5):655-692, 2005.
87. S. L. Warner. Randomized response: a survey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60(309):63-69, Mar. 1965.
88. L. Willenborg and T. D. Waal. Elements of Statistical Disclosure Control, volume 155 of Lecture Notes in Statistics. Springer Verlag, New York, NY, 2001.
89. R. Wright and Z. Yang. Privacy-preserving bayesian network structure computation on distributed heterogeneous data. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Seattle, WA, Aug.22-25 2004.
90. A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167. IEEE, 1986.
91. N. Zhang, S. Wang, and W. Zhao. A new scheme on privacy-preserving association rule mining. In The 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2004), Pisa, Italy, Sept. 20-24 2004.
92. Y. Zhu and L. Liu. Optimal randomization for privacy preserving data mining. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 761-766, New York, NY, USA, 2004. ACM Press.