Abstract
We review our recent work on privacy preserving data mining and present a new algorithm for association rules mining in vertically partitioned databases that doesnt use perturbation or secure computation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proc. of the ACM SIGMOD 2000, Dallas, Texas, USA, May 2000, pp. 439–450 (2000)
Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: Proc. of PODS 2003, June 2003, pp. 202–210 (2003)
Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: A review and open problems. In: Proceedings of the 2001 New Security Paradigms Workshop, Cloudcroft, New Mexico, September 11-13 (2001)
Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proc. of ACM SIGKDD 2002, Canada, July 2002, pp. 217–228 (2002)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: 19th ACM Symposium on the Theory of Computing (1987)
Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: Proc. of ACM SIGMOD 2005 (2005)
Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Proc. of ICDM 2003, Washington, DC, USA, p. 99 (2003)
Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security 13(4), 593–622 (2005)
Du, W., Atallah, M.J.: Secure multi-party computation problems and their applications: A review and open problems. In: Proceedings of the 2001 New Security Paradigms Workshop, Cloudcroft, New Mexico, September 11-13 (2001)
Vaidya, J., Clifton, C., Kantarcioglu, M.: Defining privacy for data mining. In: Kargupta, H., Joshi, A., Sivakumar, K. (eds.) National Science Foundation Workshop on Next Generation Data Mining, Baltimore, MD, November 1-3 (2002)
Rozenberg, B., Gudes, E.: Privacy Preserving Data Mining in Vertically Partitioned Databases. In: 7th Annual IFIP WG 11.3 Working Conference on Database and Applications Security, Estes Park, Colorado (2003)
Rozenberg, B., Gudes, E.: Analysis of Two Approaches for Association Rules Mining in Vertically Partitioned Databases. In: Proceedings of ICDM workshop on security and privacy, Brighton, UK (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gurevich, A., Gudes, E. (2006). Recent Research on Privacy Preserving Data Mining. In: Bagchi, A., Atluri, V. (eds) Information Systems Security. ICISS 2006. Lecture Notes in Computer Science, vol 4332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11961635_32
Download citation
DOI: https://doi.org/10.1007/11961635_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68962-1
Online ISBN: 978-3-540-68963-8
eBook Packages: Computer ScienceComputer Science (R0)