Redrawing the boundaries on purchasing data from privacy-sensitive individuals

DOI10.1145/2554797.2554835MaRDI QIDQ2988895zbMATH OpenOpenAlexWikidataFDO

Authors Kobbi Nissim, David Xiao, Salil Vadhan

Publication date 19 May 2017

Published in Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.4092

zbMATH Keywords

differential privacymechanism design

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Authentication, digital signatures and secret sharing (94A62)

Abstract: We prove new positive and negative results concerning the existence of truthful and individually rational mechanisms for purchasing private data from individuals with unbounded and sensitive privacy preferences. We strengthen the impossibility results of Ghosh and Roth (EC 2011) by extending it to a much wider class of privacy valuations. In particular, these include privacy valuations that are based on ({epsilon}, {delta})-differentially private mechanisms for non-zero {delta}, ones where the privacy costs are measured in a per-database manner (rather than taking the worst case), and ones that do not depend on the payments made to players (which might not be observable to an adversary). To bypass this impossibility result, we study a natural special setting where individuals have mono- tonic privacy valuations, which captures common contexts where certain values for private data are expected to lead to higher valuations for privacy (e.g. having a particular disease). We give new mech- anisms that are individually rational for all players with monotonic privacy valuations, truthful for all players whose privacy valuations are not too large, and accurate if there are not too many players with too-large privacy valuations. We also prove matching lower bounds showing that in some respects our mechanism cannot be improved significantly.

Recommendations

• Buying data from privacy-aware individuals: the effect of negative payments
• Optimized, direct sale of privacy in personal data marketplaces
• Data, privacy, and the greater good
• On crossroads of privacy protection
• Data privacy: from technology to economics

Cites work

• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A hierarchy of polynomial time lattice basis reduction algorithms
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Bounds for Width Two Branching Programs
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Evaluating Branching Programs on Encrypted Data
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• New lattice-based cryptographic constructions
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public-key cryptosystems from the worst-case shortest vector problem
• Toward basing fully homomorphic encryption on worst-case hardness
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(5)

• Selling privacy at auction
• Accuracy for sale: aggregating data with a variance constraint
• Optimized, direct sale of privacy in personal data marketplaces
• The empirical implications of privacy-aware choice
• Buying data from privacy-aware individuals: the effect of negative payments

This page was built for publication: Redrawing the boundaries on purchasing data from privacy-sensitive individuals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988895)