Privacy preserving data publishing: a coalitional game theory perspective
by Srinivasa L. Chakravarthy; V. Valli Kumari
International Journal of Computational Intelligence Studies (IJCISTUDIES), Vol. 3, No. 2/3, 2014

Abstract: k-anonymity is one of the most popular conventional techniques for protecting the privacy of an individual. In this process, the following limitations are observed: 1) The anonymisation is done based on an assumed value of k; 2) the information loss can be found only after the anonymisation is done; 3) if the information loss is found to be more than the affordable loss then another k is to be considered and the whole process has to be repeated. This paper discusses a novel approach using coalitional game theory (CGT) to overcome the limitations of k-anonymity. The approach helps fix up the privacy levels based on the information loss. To achieve anonymity, we establish coalitions between the tuples based on their payoffs which are assigned using concept hierarchy tree (CHT) of quasi identifiers (QID). In the process, an attempt has been made to obtain a relation between k and number of distinct tuples with respect to QID set. This helps to find the boundaries of k. The experimental results showing the practicality and scalability are presented.

Online publication date: Sat, 28-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Intelligence Studies (IJCISTUDIES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com