Most Read Research Articles


Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79
Call for Paper - May 2015 Edition
IJCA solicits original research papers for the May 2015 Edition. Last date of manuscript submission is April 20, 2015. Read More

K-anonymity Model for Multiple Sensitive Attributes

Print
PDF
IJCA Special Issue on Optimization and On-chip Communication
© 2012 by IJCA Journal
ooc - Number 1
Year of Publication: 2012
Authors:
Nidhi Maheshwarkar
Kshitij Pathak
Narendra S. Choudhari

Nidhi Maheshwarkar, Kshitij Pathak and Narendra S Choudhari. Article: K-anonymity Model for Multiple Sensitive Attributes. IJCA Special Issue on Optimization and On-chip Communication ooc(1):51-56, February 2012. Full text available. BibTeX

@article{key:article,
	author = {Nidhi Maheshwarkar and Kshitij Pathak and Narendra S. Choudhari},
	title = {Article: K-anonymity Model for Multiple Sensitive Attributes},
	journal = {IJCA Special Issue on Optimization and On-chip Communication},
	year = {2012},
	volume = {ooc},
	number = {1},
	pages = {51-56},
	month = {February},
	note = {Full text available}
}

Abstract

In today’s era acquiring information about others is not difficult task but securing this data form interlopers is a big deal. K-anonymity model used to protect released data. Released data which is available for public used may contain sensitive and non-sensitive data. But K-anonymity model faces changes when set of sensitive attributes are present in the data set. To achieve K-anonymous table with diversity may causes distortion of data in some extent. This paper proposed a new concept to minimize this data distortion without using tuple suppression for M-SA K-anonymity Model.

References

  • Nidhi Maheshwarkar, Kshitij Pathak, Vivekanand Chourey, “Performance Issues of Various K-anonymity Strategies”, International Journal of Computer Technology and Electronics Engineering (IJCTEE), 2011, ISSN No. 2249-6343.
  • Nidhi Maheshwarkar, Kshitij Pathak, Vivekanand Chourey, “Privacy Issues for K-anonymity Model”, International Journal of Engineering Research and Application, 2011, ISSN No. 2248-9622.
  • V.Ciriani , S. De Capitani di Vimercati , S. Foresti ,P. Samarati,”K-Anonymity”,Springer US, Advances In Information Security (2007).
  • Latanya. Sweeney,”Achieving K-Anonymity privacy protection using generalization and suppression” International journal of Uncertainty,Fuzziness and Knowledge-based Systems,10(5), May 2002,571588.
  • Pierangela Samarati ,Latanya Sweeney,”Protecting Privacy when Disclosing Information: K-Anonymity and its enforcement through Generalization and Suppression.1998.
  • A. Machanavajjhala, J.Gehrke,D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In Proc.22nd International Conf. Data Engg. (ICDE), page 24 , 2006.
  • Xinping Hu Zhihui Sun Yingjie Wu Wenyu Hu , Jiancheng Dong ” K-Anonymity Based on Sensitive Tuples”, 2009 First International Workshop on Database Technology and Applications, 978-0-7695-3604-0/09 /2009 IEEE DOI 10.1109/DBTA.2009.74 M. Young, The Technical Writer's Handbook. Mill Valley, CA: University Science, 1989.
  • Yingjie Wu, Xiaowen Ruan,Shangbin Liao, Xiaodong Wang,” P-Cover K-anonymity model for Protecting Multiple Sensitive Attributes”, IEEE,The 5th International Conference onComputer Science & Education Hefei, China. August 24–27, 2010. 978-1-4244-6005-2/10/2010 IEEE.
  • Rinku Dewri, Indrajit Ray, Indrakshi Ray ,Darrell Whitley,” On the Optimal Selection of k in the k–Anonymity Problem”.
  • G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. k- Anonymity: Algorithms and hardness. Technical report, Stanford University, 2004.
  • R. J. Bayardo and R. Agrawal. Data privacy through optimal k - anonymization. In ICDE-2005, 2005
  • K. LeFevre, D. DeWitt, and R. Ramakrishnan. Incognito: Efficient fulldomain k-anonymity. In SIGMOD, 2005.
  • A. Meyerson and R. Williams. On the complexity of Optimal k anonymity. In PODS, 2004.
  • P. Samarati. Protecting respondents’ identities in microdata release.In IEEE Transaction s on Knowledge and Data Engineering, 2001.
  • L. Sweeney. K-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10(5):557–570, 2002.
  • S. Zhong, Z. Yang, and R. N. Wright. Privacy-enhancing kanonymization of customer data. In PODS, 2005
  • A. Dobra. Statistical Tools for Disclosure Limitation in Multiway Contingency Tables. PhD thesis , Carnegie Mellon University, 2002
  • S. L. Kullback and R. A. Leibler. On information and sufficiency. Ann. Math. Stat., 22:79–86, 1951.
  • Samarati P, Sweeney L (1998). Generalizing data to provide anonymitywhen disclosing information (Abstract). In Proc. of the 17th ACM-SIGMOD-