Approximately optimal auctions for selling privacy when costs are correlated with data

We consider a scenario in which a database stores sensitive data of users and an analyst wants to estimate statistics of the data. The users may suffer a cost when their data are used in which case they should be compensated. The analyst wishes to get an accurate estimate, while the users want to maximize their utility. We want to design a mechanism that can estimate statistics accurately without compromising users' privacy. Since users' costs and sensitive data may be correlated, it is important to protect the privacy of both data and cost. We model this correlation by assuming that a user's unknown sensitive data determines a distribution from a set of publicly known distributions and a user's cost is drawn from that distribution. We propose a stronger model of privacy preserving mechanism where users are compensated whenever they reveal information about their data to the mechanism. In this model, we design a Bayesian incentive compatible and privacy preserving mechanism that guarantees accuracy and protects the privacy of both cost and data.

[1]  Kobbi Nissim,et al.  Privacy-aware mechanism design , 2011, EC '12.

[2]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[3]  Shuchi Chawla,et al.  Multi-parameter mechanism design and sequential posted pricing , 2010, BQGT.

[4]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[5]  Cynthia Dwork,et al.  Differential Privacy: A Survey of Results , 2008, TAMC.

[6]  Kamalika Chaudhuri,et al.  When Random Sampling Preserves Privacy , 2006, CRYPTO.

[7]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[8]  Aaron Roth,et al.  Selling privacy at auction , 2010, EC '11.

[9]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[10]  David Xiao,et al.  Is privacy compatible with truthfulness? , 2013, ITCS '13.

[11]  Joan Feigenbaum,et al.  Approximate privacy: foundations and quantification (extended abstract) , 2010, EC '10.

[12]  Kunal Talwar,et al.  Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  Andrew V. Goldberg,et al.  Collusion-resistant mechanisms for single-parameter agents , 2005, SODA '05.

[14]  Kenneth Steiglitz,et al.  Frugality in path auctions , 2004, SODA '04.

[15]  R. Kaas,et al.  Mean, Median and Mode in Binomial Distributions , 1980 .

[16]  Stephen Chong,et al.  Truthful mechanisms for agents that value privacy , 2011, EC.

[17]  Marek Klonowski,et al.  Practical Universal Random Sampling , 2010, IWSEC.

[18]  Tim Roughgarden,et al.  Optimal mechanism design and money burning , 2008, STOC.