Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2009.16C.5.563

An Algorithm for Improving the Accuracy of Privacy-Preserving Technique Based on Random Substitutions  

Kang, Ju-Sung (국민대학교 수학과)
Lee, Chang-Woo (국민대학교 수학과)
Hong, Do-Won (한국전자통신연구원 지식정보보안연구부)
Abstract
The merits of random substitutions are various applicability and security guarantee on the view point of privacy breach. However there is no research to improve the accuracy of random substitutions. In this paper we propose an algorithm for improving the accuracy of random substitutions by an advanced theoretical analysis about the standard errors. We examine that random substitutions have an unpractical accuracy level and our improved algorithm meets the theoretical results by some experiments for data sets having uniform and normal distributions. By our proposed algorithm, it is possible to upgrade the accuracy level under the same security level as the original method. The additional cost of computation for our algorithm is still acceptable and practical.
Keywords
Randomization; Random Substitutions; Privacy; Accuracy; Privacy Preserving Data Mining;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A. Evfimievski, J. Gehrke, and R. Srikant, “Limiting Privacy Breaches in Privacy Preserving Data Mining”, Proc. of ACM Symp. on Principles of Database Systems (PODS), 2003.   DOI
2 J. Dowd, S. Xu, and W. Zhang, “Privacy- Preserving Decision Tree Mining Based on Random Substitutions”, ETRICS2006, LNCS 3995, Springer-Verlag, pp.145-159, 2006.   DOI   ScienceOn
3 R. Agrawal, R. Srikant, “Privacy preserving data mining”, ACM SIGMOD Conference on Management of Data, Dallas, TX, 2000, pp.439-450.   DOI   ScienceOn
4 Y. Lindell, B. Pinkas, “Privacy preserving data mining”, CRYPTO 2000, pp.36-54.
5 J. Vaidya, C. Clifton, “Privacy-Preserving Data Mining:Why, How, and When”, IEEE Security & Privacy, 2004, www.computer.org/security/   DOI   ScienceOn
6 O. Goldreich, “Secure Multi-Party Computation (Final Draft, Version 1.4)”, http://www.wisdom.weizmann.ac.il /home/oded/public_html/foc.html, 2002.
7 S. Agrawal and J. Haritsa, “A Framework for High-Accuracy Privacy-Preserving Mining”, Proceedings of the 21st International Conference on Data Engineering (ICDE 2005), IEEE, 2005.   DOI
8 S. Agrawal and J. Haritsa, “A framework for high-accuracy privacy-preserving mining”, Tech- nical Report TR-2004-02, Database Systems Lab, Indian Institute of Science, 2004.
9 S. Agrawal, J. Haritsa, and B. Prakash, “FRAPP: a framework for high-accuracy privacy- preserving mining”, Data Mining and Knowledge Discovery, Springer, Vol.18, No.1, 2009, pp.101-139.   DOI
10 D. Agrawal and C. Agrawal, “On the design and quantification of privacy preserving data mining algorithms”, Proceedings of the 20th Symposium on Principles of Database Systems, May, 2001.   DOI
11 강주성, 안아론, 홍도원, “행렬기반 랜덤화를 적용한 프라이버시 보호 기술의 안전성 및 정확성 분석”, 한국정보보호학회논문지, 제18권 4호, pp.53-68, 2008.   과학기술학회마을