TR-CS _ 01 _ 07 A Game Theoretic Approach toward Multi-Party Privacy-Preserving Distributed Data Mining

Analysis of privacy-sensitive data in a multi-party enviro nment often assumes that the parties are well-behaved and they abide by the protocols. Parties compute whatever is needed, communicate correctly following the rules, and do not collude with other parties for exposing thi rd party sensitive data. This paper argues that most of these assumptions fall a part in real-life applications of privacy-preserving distributed data mini ng (PPDM). The paper offers a more realistic formulation of the PPDM problem a s a multi-party game where each party tries to maximize its own objectives. I t develops a game-theoretic framework for developing and analyzing PPD M algorithms. It also presents equilibrium-analysis of such PPDM-games a nd outlines a game-theoretic solution based on the concept of “cheap-tal k” borrowed from the economics and the game theory literature.

[1]  Keke Chen,et al.  Privacy preserving data classification with rotation perturbation , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[2]  H. Kunreuther,et al.  Interdependent Security , 2003 .

[3]  Kun Liu,et al.  Random projection-based multiplicative data perturbation for privacy preserving distributed data mining , 2006, IEEE Transactions on Knowledge and Data Engineering.

[4]  Danny Dolev,et al.  Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation , 2006, PODC '06.

[5]  Benny Pinkas,et al.  Cryptographic techniques for privacy-preserving data mining , 2002, SKDD.

[6]  Vassilios S. Verykios,et al.  Disclosure limitation of sensitive rules , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).

[7]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[8]  Luis E. Ortiz,et al.  Algorithms for Interdependent Security Games , 2003, NIPS.

[9]  Roberto J. Bayardo,et al.  Data privacy through optimal k-anonymization , 2005, 21st International Conference on Data Engineering (ICDE'05).

[10]  Philip S. Yu,et al.  A Condensation Approach to Privacy Preserving Data Mining , 2004, EDBT.

[11]  Qi Wang,et al.  On the privacy preserving properties of random data perturbation techniques , 2003, Third IEEE International Conference on Data Mining.

[12]  R. Hardin,et al.  Collective action as an agreeable N-prisoners''dilemma , 1971 .

[13]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[14]  Elchanan Ben-Porath,et al.  Cheap talk in games with incomplete information , 2003, J. Econ. Theory.

[15]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2002, Journal of Cryptology.

[16]  Joseph Y. Halpern,et al.  Rational secret sharing and multiparty computation: extended abstract , 2004, STOC '04.

[17]  Stephen E. Fienberg,et al.  Additive noise and multiplicative bias as disclosure limitation techniques for continuous microdata: A simulation study , 2004, J. Comput. Methods Sci. Eng..

[18]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Alexandre V. Evfimievski,et al.  Limiting privacy breaches in privacy preserving data mining , 2003, PODS.

[20]  Joseph Y. Halpern,et al.  Ra-tional secret sharing and multiparty computation , 2004, STOC 2004.

[21]  J. Morgan,et al.  Cheap Talk , 2005 .

[22]  Ramakrishnan Srikant,et al.  Privacy-preserving data mining , 2000, SIGMOD '00.

[23]  Jianer Chen,et al.  Performance Measurements for Privacy Preserving Data Mining , 2005, PAKDD.

[24]  Chris Clifton,et al.  Tools for privacy preserving distributed data mining , 2002, SKDD.

[25]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..