Abstract
We examine a recent proposal for data-privatization by testing it against well-known attacks; we show that all of these attacks successfully retrieve a relatively large (and unacceptable) portion of the original data. We then indicate how the data-privatization method examined can be modified to assist it to withstand these attacks and compare the performance of the two approaches. We also show that the new method has better privacy and lower information loss than the former method.
Chapter PDF
Similar content being viewed by others
Keywords
References
Agrawal, R., Srikant, R.: Privacy-Preserving Data Mining. In: Proceedings of the ACM SIGMO Conference on Management of Data, pp. 439–450. ACM Press, Dallas (2000)
Datta, S.: On Random Additive Perturbation for Privacy Preserving Data Mining. Thesis report (2004)
Liu, K.: Multiplicative Data Perturbation for Privacy Preserving Data Mining. Thesis report (2007)
Singh, K., Zhong, J., Batten, L., Bertok, P.: An Efficient Solution for Privacy Preserving, Secure Remote Access to Sensitive Data. In: International Conference of Advanced Computer Science and Information Technology, pp. 173–191 (2012)
Du, W., Zhan, Z.: Using Randomized Response Techniques for Privacy-Preserving Data Mining. In: Proceedings of The 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, pp. 505–510 (2003)
Du, W., Atallah, M.: Secure Multi-Party Computation Problems and Their Applications: A Review and Open Problems. In: New Security Paradigms Workshop, pp. 11–20 (2001)
Agrawal, D., Aggarwal, C.: On The Design and Quantification of Privacy Preserving Data Mining Algorithms. In: Proccedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, California, USA, pp. 247–255 (2001)
Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On The Privacy Preserving Properties of Random Data Perturbation Techniques. In: Proc. of the 3rd Int’l Conf. on Data Mining, pp. 99–106 (2003)
Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: Proceedings of the 2005 ACM SIGMOD Conference, Baltimroe, MD, pp. 37–48 (June 2005)
Sramka, M., Safavi-Naini, R., Denzinger, J.: An Attack on The Privacy of Sanitized Data That Fuses the Outputs of Multiple Data Miners. In: PADM, pp. 130–137 (2009)
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA Data Mining Software: An Update. SIGKDD Explorations 11(1) (2009)
Singh, K.: Recovering Private Data: A Comparision of Three Methods. In: Poster in Proceedings of ATIS 2012, pp. 24–25 (2012)
Mason, J.C., Handscomb, D.C.: Chebyshev Polynomials. Prentice Hall, SIAM (2002)
Franco-Pereira, A.: An introductory course in MATLAB: MATLAB for beginners. Universidad Carlos III de Madrid (2010), http://webs.uvigo.es/alba.franco/eng/Tutorial_completo.pdf
Pandya, B., Singh, U., Bunkar, K., Dixit, K.: An Overview of Traditional Multiplicative Data Perturbation. International Journal of Advanced Research in Computer Science and Software Engineering 2(3), 424–429 (2012)
Liu, K., Kargupta, K., Ryan, J.: Random Projection-Based Multiplicative Data Perturbation for Privacy Preserving Distributed Data Mining. IEEE Transaction on Knowledge and Data Engineering 18(1), 92–106 (2006)
McMullen, C.: Probability Theory. Harvard University (2011), http://www.math.harvard.edu/~ctm/papers/home/text/class/harvard/154/course/course.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Singh, K., Batten, L. (2013). An Attack-Resistant Hybrid Data-Privatization Method with Low Information Loss. In: Fernández-Gago, C., Martinelli, F., Pearson, S., Agudo, I. (eds) Trust Management VII. IFIPTM 2013. IFIP Advances in Information and Communication Technology, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38323-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-38323-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38322-9
Online ISBN: 978-3-642-38323-6
eBook Packages: Computer ScienceComputer Science (R0)