Privacy-preserving data mining: Why, how, and when

IEEE Security and Privacy

Volumn 2, Issue 6, 2004, Pages 19-27

  Vaidya, Jaideep ^a,c   Clifton, Chris ^b  

^a RUTGERS UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUSTOMER PRIVACY; DATA PERTURBATIONS; EXPLORATORY DATA ANALYSIS (EDA); SECURE MULTIPARTY COMPUTATION (SMC);

ALGORITHMS; CRYPTOGRAPHY; CUSTOMER SATISFACTION; DATA PRIVACY; INFORMATION RETRIEVAL; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; PROBLEM SOLVING; SECURITY OF DATA; SEMANTICS;

DATA MINING;

EID: 10944270172     PISSN: 15407993     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2004.108     Document Type: Review

References (17)

1. D. Struck, "Don't Store My Data, Japanese Tell Government," Int'l Herald Tribune, 25 Aug. 2002, p. 1.
2. D. Hand, H. Mannila, and P. Smyth, Principles of Data Mining, MIT Press, 2001.
3. L. Sweeney, Computational Disclosure Control: A Primer on Data Privacy Protection, PhD dissertation, Computer Science Dept., Massachusetts Inst. of Technology, 2001.
4. R.A. Moore Jr., Controlled Data-Swapping Techniques for Masking Public Use Microdata Sets, Statistical Research Division Report Series RR 96-04, US Bureau of the Census, 1996; www.census.gov/srd/papers/pdf/rr96-4.pdf.
5. V. Estivill-Castro and L. Brankovic, "Data Swapping: Balancing Privacy Against Precision in Mining for Logic Rules," Proc. 1st Conf. Data Warehousing and Knowledge Discovery (DaWaK-99), LNCS 1676, Springer-Verlag, 1999, pp. 389-398.
6. R. Agrawal and R. Srikant, "Privacy-Preserving Data Mining," Proc. ACM SIGMOD Conf. Management of Data, ACM Press, 2000, pp. 439-450; http://doi.acm.org/10.1145/342009.335438.
7. A.C. Yao, "How to Generate and Exchange Secrets," Proc. 27th IEEE Symp. Foundations of Computer Science, IEEE CS Press, 1986, pp. 162-167.
8. O. Goldreich, S. Micali, and A. Wigderson, "How to Play any Mental Game: A Completeness Theorem for Protocols with Honest Majority," Proc. 19th ACM Symp. Theory of Computing, ACM Press, 1987, pp. 218-229; http://doi.acm.org/10.1145/28395.28420.
9. M. Franklin and M. Yung, "Varieties of Secure Distributed Computing," Proc. Sequences II, Methods in Communications, Security and Computer Science, Springer-Verlag, 1991, pp. 392-417.
10. M. Kantarcioǧlu and C. Clifton, "Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data," IEEE Trans. Knowledge Data Eng., vol. 16, no. 9, 2004, pp. 1026-1037; http://csdl.computer.org/comp/trans/tk/2004/09/k1026abs.htm.
11. J. Vaidya and C. Clifton, "Secure Set Intersection Cardinality with Application to Association Rule Mining," to be published in J. Computer Security, 2005.
12. Y. Lindell and B. Pinkas, "Privacy Preserving Data Mining," J. Cryptology, vol. 15, no. 3, 2002, pp. 177-206; http://www.cs.biu.ac.il/~lindell/abstracts/id3_abs.html.
13. C. Clifton et al., "Tools for Privacy Preserving Distributed Data Mining," SICKDD Explorations, vol. 4, no. 2, 2003, pp. 28-34; www.acm.org/sigs/sigkdd/explorations/issue4-2/contents.htm.
14. N.R. Adam and J.C. Wortmann, "Security-Control Methods for Statistical Databases: A Comparative Study," ACM Computing Surveys, vol. 21, no. 4, 1989, pp. 515-556; http://doi.acm.org/10.1145/76894.76895.
15. T.H. Hinke, H.S. Delugach, and R.P. Wolf, "Protecting Databases from Inference Attacks," Computers and Security, vol. 16, no. 8, 1997, pp. 687-708.
16. S.R.M. Oliveira and O.R. Zaiane, "Protecting Sensitive Knowledge by Data Sanitization," Proc. 3rd IEEE Int'l Conf. Data Mining (ICDM 03), IEEE CS Press, 2003, pp. 613-616.
17. S. Goldwasser, S. Micali, and C. Rackoff, "The Knowledge Complexity of Interactive Proof Systems," Proc. 17th Ann. ACM Symp. Theory of Computing (STOC 85), ACM Press, 1985, pp. 291-304.