PRIVACY PRESERVING USING SENSITIVE ATTRIBUTE BASED GROUPING IN BIGDATA

Sukruti B.K, Sumukh J.K, Vinitha K, Srikanth H.B, Prof.Sujatha K

Abstract


There is a developing pattern towards assaults on database protection because of awesome estimation of security data put away in enormous informational collection. Open's protection is under dangers as foes are consistently breaking their well known targets, for example, ledgers. We discover a reality that current models, for example, K-obscurity, aggregate records in light of semi identifiers, which hurts the information utility a great deal. Propelled by this, we propound a touchy trait based protection display. Our model is the past work of collection records in light of touchy qualities rather than semi identifiers which is famous in current models. Arbitrary rearrange is utilized to expand data entropy inside a gathering while the peripheral dispersion keeps up the same when rearranging, in this way, our technique keeps up a superior information usage than existing models. We have led broad investigations which affirm that our pattern can accomplish a delightful protection level without relinquishing information utility while ensure a higher proficiency.


Keywords


There is a developing pattern towards assaults on database protection because of awesome estimation of security data put away in enormous informational collection.

Full Text:

PDF

References


V. Marx, “Biology: The big challenges of big data,” Nature, vol. 498, pp. 255–256, June, 2013.

S. David, M. Sergio, and D.-F. Josep, “Comment on unique in the shopping mall: On the reidentifiability of credit card metadata,” Science, vol. 351, pp. 1274–1276, March, 2016.

L. Xu, C. Jiang, J. Wang, J. Yuan, and Y. Ren, “Information security in big data: Privacy and data mining,” IEEE Access, vol. 2, pp. 1149–1176, 2014.




DOI: https://doi.org/10.26483/ijarcs.v9i3.6086

Refbacks

  • There are currently no refbacks.




Copyright (c) 2018 International Journal of Advanced Research in Computer Science