Providing Efficient Privacy Of Xml Data By Using Anonymity

A.Veera Lakshmi, P.Nanna Babu


Scientists mine the extensive information got from various sources having distinctive configurations like database information and XML. Protection is one of most critical component while exchanging the information to information mineworkers. Prior exploration on security concentrated just database table information. For this k-anonymity and l-diversity qualities procedures are accessible to avoid unveil of client information. Present center to giving security on tree structure information .however existing techniques can't give protection on tree organized information. We exhibit a novel security calculation termed as k(m;n)- anonymity Along with covetous anonymization heuristic which avoids personality divulgence of information.


GR Law. pageid=33,43560& dad=portal.

HIPAA act, US.

TPC-H Homepage.

G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy,D. Thomas, and A. Zhu. Approximation Algorithms for k-Anonymity. Journal of Privacy Technology, 2005.

R. J. Bayardo and R. Agrawal. Data Privacy through Optimal k-Anonymization. In ICDE, pages 217–228, 2005.

C. Clifton and T. Tassa. On syntactic anonymity and differential privacy. In PRIVDB, 2013.

G. Cormode. Personal privacy vs population privacy: learning to attackanonymization. In SIGKDD, pages 1253–1261, 2011.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at