Introduction to Linear Optimization
Introduction to Linear Optimization
Revealing information while preserving privacy
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Practical privacy: the SuLQ framework
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 16th international conference on World Wide Web
Smooth sensitivity and sampling in private data analysis
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The price of privacy and the limits of LP decoding
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Privacy, accuracy, and consistency too: a holistic solution to contingency table release
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mechanism Design via Differential Privacy
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A learning theory approach to non-interactive database privacy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Robust De-anonymization of Large Sparse Datasets
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Differential privacy: a survey of results
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Calibrating noise to sensitivity in private data analysis
TCC'06 Proceedings of the Third conference on Theory of Cryptography
On the geometry of differential privacy
Proceedings of the forty-second ACM symposium on Theory of computing
Interactive privacy via the median mechanism
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Optimizing linear counting queries under differential privacy
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Universally optimal privacy mechanisms for minimax agents
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards an axiomatization of statistical privacy and utility
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate privacy: foundations and quantification (extended abstract)
Proceedings of the 11th ACM conference on Electronic commerce
Boosting the accuracy of differentially private histograms through consistency
Proceedings of the VLDB Endowment
Differentially private data cubes: optimizing noise sources and consistency
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
iReduct: differential privacy with reduced relative errors
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Proceedings of the 12th ACM conference on Electronic commerce
Personal privacy vs population privacy: learning to attack anonymization
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
On the relation between differential privacy and quantitative information flow
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Quantitative information flow and applications to differential privacy
Foundations of security analysis and design VI
Differentially private billing with rebates
IH'11 Proceedings of the 13th international conference on Information hiding
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
On communication protocols that compute almost privately
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
An adaptive mechanism for accurate query answering under differential privacy
Proceedings of the VLDB Endowment
Differential privacy in data publication and analysis
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Unconditional differentially private mechanisms for linear queries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Differentially private search log sanitization with optimal output utility
Proceedings of the 15th International Conference on Extending Database Technology
Differentially private summaries for sparse data
Proceedings of the 15th International Conference on Database Theory
Differentially private transit data publication: a case study on the montreal transportation system
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Differentially private continual monitoring of heavy hitters from distributed streams
PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
Fault-tolerant privacy-preserving statistics
PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
Differential privacy: on the trade-off between utility and information leakage
FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
On significance of the least significant bits for differential privacy
Proceedings of the 2012 ACM conference on Computer and communications security
Optimal lower bound for differentially private multi-party aggregation
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Worst- and average-case privacy breaches in randomization mechanisms
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Is privacy compatible with truthfulness?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Non-interactive differential privacy: a survey
Proceedings of the First International Workshop on Open Data
On differentially private frequent itemset mining
Proceedings of the VLDB Endowment
On optimal differentially private mechanisms for count-range queries
Proceedings of the 16th International Conference on Database Theory
A differentially private mechanism of optimal utility for a region of priors
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Secure multiparty aggregation with differential privacy: a comparative study
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Information preservation in statistical privacy and bayesian estimation of unattributed histograms
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Privacy-preserving data exploration in genome-wide association studies
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
The geometry of differential privacy: the sparse and approximate cases
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
UMicS: from anonymized data to usable microdata
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Pufferfish: A framework for mathematical privacy definitions
ACM Transactions on Database Systems (TODS)
Exact and efficient generation of geometric random variates and random graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A general framework for privacy preserving data publishing
Knowledge-Based Systems
| Hi-index | 0.00 |
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information maximizes utility while minimizing privacy, while publishing random noise accomplishes the opposite. Privacy can be rigorously quantified using the framework of differential privacy, which requires that a mechanism's output distribution is nearly the same whether or not a given database row is included or excluded. The goal of this paper is strong and general utility guarantees, subject to differential privacy. We pursue mechanisms that guarantee near-optimal utility to every potential user, independent of its side information (modeled as a prior distribution over query results) and preferences (modeled via a loss function). Our main result is: for each fixed count query and differential privacy level, there is a geometric mechanism M* -- a discrete variant of the simple and well-studied Laplace mechanism -- that is simultaneously expected loss-minimizing for every possible user, subject to the differential privacy constraint. This is an extremely strong utility guarantee: every potential user u, no matter what its side information and preferences, derives as much utility from M* as from interacting with a differentially private mechanism Mu that is optimally tailored to u. More precisely, for every user u there is an optimal mechanism Mu for it that factors into a user-independent part (the geometric mechanism M*) followed by user-specific post-processing that can be delegated to the user itself. The first part of our proof of this result characterizes the optimal differentially private mechanism for a fixed but arbitrary user in terms of a certain basic feasible solution to a linear program with constraints that encode differential privacy. The second part shows that all of the relevant vertices of this polytope (ranging over all possible users) are derivable from the geometric mechanism via suitable remappings of its range.