Research Article
New Approach to Reduce the Data Loss in Privacy Preserving Data Analysis
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 155 - Issue 12 |
| Published: Dec 2016 |
| Authors: Kirti B. Sable, B. M. Patil |
10.5120/ijca2016912504
|
Kirti B. Sable, B. M. Patil . New Approach to Reduce the Data Loss in Privacy Preserving Data Analysis. International Journal of Computer Applications. 155, 12 (Dec 2016), 21-24. DOI=10.5120/ijca2016912504
@article{ 10.5120/ijca2016912504,
author = { Kirti B. Sable,B. M. Patil },
title = { New Approach to Reduce the Data Loss in Privacy Preserving Data Analysis },
journal = { International Journal of Computer Applications },
year = { 2016 },
volume = { 155 },
number = { 12 },
pages = { 21-24 },
doi = { 10.5120/ijca2016912504 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2016
%A Kirti B. Sable
%A B. M. Patil
%T New Approach to Reduce the Data Loss in Privacy Preserving Data Analysis%T
%J International Journal of Computer Applications
%V 155
%N 12
%P 21-24
%R 10.5120/ijca2016912504
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Recent advances in information and communication technologies shows that privacy is one of the important concept regarding the data sharing, maintaining the data confidentiality and data loss issues. This paper mainly focus on data loss issues and overcome some of the problems exist in pervious system of privacy preserving such as role base accessibility, high time complexity and privacy breaching issue. This uses different techniques such as slicing which is combined with C constraint. This will reduce the data loss and provide more privacy to the data. Here considered a health care system as a framework. SQL injection and Aho-Chorasick algorithm is used for database security.
References
- Murat Kantarcioglu and Wei Jiang, “Incentive Compatible Privacy-Preserving Data Analysis”, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 25, NO. 6, JUNE 2013
- W. Jiang and C. Clifton, “Privacy-preserving distributed k-anonymity, “in DBSec, vol. 3654, 2005, pp. 924–924
- 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.
- Andrew C. Yao. Protocols for secure computation. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 160–164. IEEE, 1982.
- Andrew 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.
- S. Goryczka, L. Xiong, and B. C. M. Fung, “m-Privacy for joint data publish,” in Proc. of the 7th Intl. Conf. on joint compute: Networking, Applications and Work sharing, 2011.
- A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam,“l-Diversity: Privacy beyond k-anonymity,” in ICDE, 2006,p. 24
- Tiancheng Li, Ninghui Li, Jian Zhang,Ian Molloy,”Slicing: A New Approach for Privacy Preserving Data Publishing” IEEE transactions on knowledge and data engineering, vol. 24, no. 3, March 2012.
- N. Mohammed, B. C. M. Fung, P. C. K. Hung, and C. Lee, “Centralized and distributed anonymization for high dimensional healthcare data,” ACM Trans. on Knowledge detection from Data, vol. 4, no. 4, pp. 18:1–18:33, October 2010.
Index Terms
Keywords