Cooperative privacy game: a novel strategy for preserving privacy in data publishing

Abstract

AbstractAchieving data privacy before publishing has been becoming an extreme concern of researchers, individuals and service providers. A novel methodology, Cooperative Privacy Game (CoPG), has been proposed to achieve data privacy in which Cooperative Game Theory is used to achieve the privacy and is named as Cooperative Privacy (CoP). The core idea ofCoPis to play the best strategy for a player to preserve his privacy by himself which in turn contributes to preserving other players privacy.CoPconsiders each tuple as a player and tuples form coalitions as described in the procedure. The main objective of theCoPis to obtain individuals (player) privacy as a goal that is rationally interested in other individuals’ (players) privacy.CoPis formally defined in terms of Nash equilibria, i.e., all the players are in their best coalition, to achievek-anonymity. The cooperative values of the each tuple are measured using the characteristic function of theCoPGto identify the coalitions. As the underlying game is convex; the algorithm is efficient and yields high quality coalition formation with respect to intensity and disperse. The efficiency of anonymization process is calculated using information loss metric. The variations of the information loss with the parameters$$\alpha$$α(weight factor of nearness) and$$\beta$$β(multiplicity) are analyzed and the obtained results are discussed.