Utility-Privacy Tradeoffs in Databases: An Information-Theoretic Approach
Reads0
Chats0
TLDR
This paper presents an information-theoretic framework that promises an analytical model guaranteeing tight bounds of how much utility is possible for a given level of privacy and vice-versa.Abstract:
Ensuring the usefulness of electronic data sources while providing necessary privacy guarantees is an important unsolved problem. This problem drives the need for an analytical framework that can quantify the privacy of personally identifiable information while still providing a quantifiable benefit (utility) to multiple legitimate information consumers. This paper presents an information-theoretic framework that promises an analytical model guaranteeing tight bounds of how much utility is possible for a given level of privacy and vice-versa. Specific contributions include: 1) stochastic data models for both categorical and numerical data; 2) utility-privacy tradeoff regions and the encoding (sanization) schemes achieving them for both classes and their practical relevance; and 3) modeling of prior knowledge at the user and/or data source and optimal encoding schemes for both cases.read more
Citations
More filters
Proceedings Article
Extremal Mechanisms for Local Differential Privacy
TL;DR: It is shown that for all information theoretic utility functions studied in this paper, maximizing utility is equivalent to solving a linear program, the outcome of which is the optimal staircase mechanism, which is universally optimal in the high and low privacy regimes.
Journal ArticleDOI
Technical Privacy Metrics: A Systematic Survey
Isabel Wagner,David Eckhoff +1 more
TL;DR: A survey of privacy metrics can be found in this article, where the authors discuss a selection of over 80 privacy metrics and introduce categorizations based on the aspect of privacy they measure, their required inputs, and the type of data that needs protection.
Proceedings ArticleDOI
From the Information Bottleneck to the Privacy Funnel
TL;DR: It is shown that the privacy-utility tradeoff under the log-loss can be cast as the non-convex Privacy Funnel optimization, and its connection to the Information Bottleneck is Leveraged, to provide a greedy algorithm that is locally optimal.
Journal ArticleDOI
Signal Processing and Machine Learning with Differential Privacy: Algorithms and Challenges for Continuous Data
TL;DR: Progress is described on differentially private machine learning and signal processing for privacy-preserving data analysis algorithms for signal processing.
Journal ArticleDOI
Increasing Smart Meter Privacy Through Energy Harvesting and Storage Devices
Onur Tan,Deniz Gunduz,H.V. Poor +2 more
TL;DR: In this paper, privacy in a smart metering system is studied from an information theoretic perspective in the presence of energy harvesting and storage units and it is shown that energy harvesting provides increased privacy by diversifying the energy source, while a storage device can be used to increase both the energy efficiency and the privacy of the user.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
k -anonymity: a model for protecting privacy
TL;DR: The solution provided in this paper includes a formal protection model named k-anonymity and a set of accompanying policies for deployment and examines re-identification attacks that can be realized on releases that adhere to k- anonymity unless accompanying policies are respected.
Proceedings ArticleDOI
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk,Rajeev Motwani +1 more
TL;DR: In this paper, the authors present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces, for data sets of size n living in R d, which require space that is only polynomial in n and d.