Paper discusses methods to measure privacy in synthetic tabular data.
problem Lack of standard methods to quantify privacy in synthetic data.
method Discusses proposed quantification approaches for synthetic data privacy.
result Contributes to SD privacy standards and stimulates discussion.
A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables (X,Y) governed by a given joint distribution, an agent observes Y and wants to convey to a potentially public user as much information about Y as possible without compromising the amount of …
The paper explores how to measure and optimize ad reach while maintaining user privacy.
problem Measuring ad reach while preserving user privacy in online advertising.
method Introduces k-anonymity and probabilistic discounting for frequency capping. result Privacy introduces a significant performance drop but with manageable costs.
A new privacy accountant for Gaussian differential privacy measures individual privacy losses.
problem Bounding differential privacy loss for each participant in data analysis.
method Developed a privacy accountant for adaptive compositions of randomised mechanisms using Gaussian differential privacy.
result Provided optimal bounds for the Gaussian mechanism and constructed an approximative individual privacy accountant.
This paper introduces a novel approach to measuring privacy risks in deep computer vision models based on intermediate outputs.
problem The exposure of intermediate results in hidden layers of deep computer vision models poses significant privacy concerns.
method The approach leverages Degrees of Freedom (DoF) to evaluate the amount of information retained in each layer and combines this with the rank of the Jacobian matrix to assess sensitivity to input variations.
result The proposed framework provides deeper insights into privacy risks associated with intermediate representations without requiring adversarial attack simulations.
Paper improves privacy-preserving measurement of advertising incrementality.
problem Privacy degradation in randomized lift tests for advertising measurement.
method Formulates a robust causal decision problem under signal losses, projecting clean worlds onto incrementality.
result Sharp decision frontier shows valid certification or rejection outside the frontier.
Many modern databases include personal and sensitive correlated data, such as private information on users connected together in a social network, and measurements of physical activity of single subjects across time. However, differential privacy, the current gold standard in data privacy, does not adequately address p…
We consider the problem of publicly releasing a dataset for support vector machine classification while not infringing on the privacy of data subjects (i.e., individuals whose private information is stored in the dataset). The dataset is systematically obfuscated using an additive noise for privacy protection. Motivate…
Differential privacy is a mathematical framework for privacy-preserving data analysis. Changing the hyperparameters of a differentially private algorithm allows one to trade off privacy and utility in a principled way. Quantifying this trade-off in advance is essential to decision-makers tasked with deciding how much p…
New MCMC method estimates differential privacy from multiple MIAs without worst-case assumptions.
problem Bayesian estimation of differential privacy from membership inference attacks.
method Bayesian estimation via MCMC algorithm (MCMC-DP-Est).
result More cautious privacy analysis with joint estimation of MIA strengths and privacy parameter.
This paper benchmarks privacy-preserving machine learning on medical images.
problem Ensuring privacy in medical image analysis while maintaining model accuracy.
method Comparing Local-DP and DP-SGD for differential privacy in medical imagery.
result Theoretical privacy guarantees do not fully align with real-world performance.
TVineSynth generates synthetic data to balance privacy and utility.
problem Balancing privacy and utility in synthetic data generation.
method Uses vine copula with truncation to control privacy and utility trade-off.
result Achieves superior privacy-utility balance compared to competitors.
Paper develops a new method for differential privacy sampling using Wasserstein distance.
problem Sampling from distributions under differential privacy constraints with geometric structure consideration.
method Develops a novel framework with Wasserstein Projection Mechanism (WPM) for minimax optimal mechanisms.
result Proposes efficient algorithms for approximate computation of the Wasserstein Projection Mechanism.
We study statistical risk minimization problems under a privacy model in which the data is kept confidential even from the learner. In this local privacy framework, we establish sharp upper and lower bounds on the convergence rates of statistical estimation procedures. As a consequence, we exhibit a precise tradeoff be…
This paper bounds min-entropy leakage for Blowfish privacy using graph symmetries.
problem Bounding min-entropy leakage for Blowfish privacy mechanisms.
method Organizing analysis over symmetrical partitions corresponding to orbits of graph automorphism groups.
result Demonstrates a construction meeting the bound with asymptotic equality, showing tightness.
Smart Meters (SMs) are able to share the power consumption of users with utility providers almost in real-time. These fine-grained signals carry sensitive information about users, which has raised serious concerns from the privacy viewpoint. In this paper, we focus on real-time privacy threats, i.e., potential attacker…
The remarkable success of machine learning, especially deep learning, has produced a variety of cloud-based services for mobile users. Such services require an end user to send data to the service provider, which presents a serious challenge to end-user privacy. To address this concern, prior works either add noise to …
Many privacy mechanisms reveal high-level information about a data distribution through noisy measurements. It is common to use this information to estimate the answers to new queries. In this work, we provide an approach to solve this estimation problem efficiently using graphical models, which is particularly effecti…
Paper evaluates and mitigates privacy risks in deep learning models.
problem Quantifying and defending against privacy attacks in deep learning.
method Quantitative evaluation of trade-offs, reformulating attacks, and proposing a novel SPN.
result Model accuracy improved by 5-20% while maintaining data privacy.
Iterative algorithms, like gradient descent, are common tools for solving a variety of problems, such as model fitting. For this reason, there is interest in creating differentially private versions of them. However, their conversion to differentially private algorithms is often naive. For instance, a fixed number of i…
First DP algorithm for Wasserstein barycenters on private data.
problem Computing Wasserstein barycenters on private datasets.
method Differentially private algorithms for Wasserstein barycenters.
result High-quality private barycenters with strong accuracy-privacy tradeoffs.
Differentially private GANs improve image privacy without significant quality loss.
problem Anonymizing image data sets while maintaining image quality.
method Training GANs with differential privacy on MNIST, analyzing privacy-utility trade-offs and explaining optimization methods.
result An increasing privacy budget adds little to generated image quality, revealing a saturated training regime.
Differential privacy, a notion of algorithmic stability, is a gold standard for measuring the additional risk an algorithm's output poses to the privacy of a single record in the dataset. Differential privacy is defined as the distance between the output distribution of an algorithm on neighboring datasets that differ …
Differential privacy is a strong notion for privacy that can be used to prove formal guarantees, in terms of a privacy budget, ε, about how much information is leaked by a mechanism. However, implementations of privacy-preserving machine learning often select large values of ε in order to get acceptable utility of …
Study privacy-utility trade-off in IoT time-series data sharing with RL.
problem Privacy concerns in IoT time-series data sharing with temporal correlations.
method Reformulated as MDP, solved with asynchronous actor-critic deep RL.
result Validated solution on synthetic and real GPS datasets.
New filters match advanced composition for adaptive privacy, with practical constants.
problem Limitations of existing adaptive composition methods.
method Constructed new filters and odometers that match advanced composition rates, including constants.
result Achieved fully adaptive privacy with practical filters and odometers.
This paper quantifies privacy-robustness and generalization-robustness trade-offs in adversarial training.
problem Privacy and generalization issues in adversarial training.
method Defines robustified intensity and empirical robustified intensity to measure robustness, proving differential privacy and generalization bounds.
result Proves adversarial training is (ε,δ)-differentially private and provides generalization bounds. The US Census Bureau corrupts data to protect privacy, but we show how to clean and analyze it effectively.
problem Analyzing Census data with intentional corruption to maintain privacy.
method Formulated a semiparametric model, proposed data cleaning, estimation, and inference procedures.
result Demonstrated that data cleaning can maintain precision and provided theoretical and empirical support.
Study privacy and accuracy in high-dimensional LASSO with perturbation mechanisms.
problem Privacy-preserving sparse linear regression in high dimensions.
method Analyzes output and objective perturbation mechanisms using AMP.
result Sparsity affects privacy-accuracy trade-off; stronger regularization improves privacy.
Sherpa.ai framework combines federated learning and differential privacy for edge AI services.
problem Protecting data privacy in edge AI services.
method Holistic federated learning and differential privacy approach with methodological guidelines.
result Demonstrated through classification and regression use cases.
Proposes a privacy-preserving system for federated learning of road networks.
problem Privacy and security of data shared between vehicles and infrastructure.
method Federated learning over V2V and V2N links, non-IID dataset modeling.
result Improves learning performance and prevents eavesdropping.
Differential privacy is a framework for privately releasing summaries of a database. Previous work has focused mainly on methods for which the output is a finite dimensional vector, or an element of some discrete set. We develop methods for releasing functions while preserving differential privacy. Specifically, we sho…
Researchers found PP-GANs can hide sensitive data in sanitized images, undermining privacy checks.
problem Lack of formal proofs of privacy in PP-GANs for image sanitization.
method Subverted PP-GANs for facial expression recognition to hide sensitive data in sanitized images.
result It is possible to hide sensitive identification data in sanitized PP-GAN output images, even allowing reconstruction of entire input images.
Fine-tuning LLMs on privacy-sensitive data introduces privacy risk, and synthetic data audits can quantify this risk.
problem Fine-tuning LLMs on privacy-sensitive data introduces privacy risk.
method Generate synthetic canaries via high-temperature sampling from LLMs.
result Synthetic canaries are high-influence outliers that ensure strong audits.
Log-Loss scores expose membership privacy breaches.
problem Privacy leakage from statistical aggregates like Log-Loss scores.
method Proved that Log-Loss scores enable full accuracy membership inference in a single query.
result Complete membership privacy breach is possible with Log-Loss scores.
Large capacity machine learning (ML) models are prone to membership inference attacks (MIAs), which aim to infer whether the target sample is a member of the target model's training dataset. The serious privacy concerns due to the membership inference have motivated multiple defenses against MIAs, e.g., differential pr…
Privacy affects fairness in classification models, but not drastically.
problem The impact of differential privacy on fairness in classification models.
method Theoretical analysis proving Lipschitz continuity of fairness measures and a non-asymptotic bound on fairness levels.
result Privacy impacts fairness, but not significantly as the number of samples increases.
Framework evaluates quality of synthetic data generated with differential privacy.
problem Ensuring synthetic data retains statistical quality after applying differential privacy.
method Developed a framework to evaluate synthetic data quality from a practical researcher's viewpoint.
result Synthetic data can be evaluated against training data or underlying populations, and for specific tasks like inference or prediction.
This work studies formal utility and privacy guarantees for a simple multiplicative database transformation, where the data are compressed by a random linear or affine transformation, reducing the number of data records substantially, while preserving the number of original input variables. We provide an analysis frame…
DP-NCB algorithm ensures privacy and fairness in bandit decisions.
problem Achieving both privacy and fairness in bandit algorithms.
method Differentially Private Nash Confidence Bound (DP-NCB) framework.
result DP-NCB achieves optimal Nash regret while maintaining privacy.
This paper improves privacy and fairness in federated learning by protecting sensitive data and ensuring group fairness.
problem Privacy and fairness issues in federated learning.
method Introduces group privacy through d-privacy, a localized form of differential privacy. result The method provides better group fairness than a global model in federated learning.
New method improves privacy risk evaluation of machine learning models.
problem Machine learning models can be vulnerable to membership inference attacks.
method Proposed new inference attack method based on prediction entropy, and introduced privacy risk score metric.
result Existing defense approaches are not as effective as previously reported.
The paper addresses learner privacy in convex optimization with feedback.
problem Privacy risks from eavesdropping adversaries observing learner's queries.
method Optimally obfuscating learner's queries to make their learned optimal value hard to estimate.
result Query complexity overhead is additive in L in the minimax formulation, multiplicative in L in the Bayesian formulation. Paper analyzes trade-offs between fairness, privacy, and accuracy using Chernoff Information.
problem The relationship between fairness and privacy in machine learning.
method Utilizes Chernoff Information to characterize trade-offs, proposes Chernoff Difference and Noisy Chernoff Difference, develops CINE for neural estimation.
result Shows three distinct behaviors of Noisy Chernoff Difference based on data distribution.
In this paper, we address the problem of data reconstruction from privacy-protected templates, based on recent concept of sparse ternary coding with ambiguization (STCA). The STCA is a generalization of randomization techniques which includes random projections, lossy quantization, and addition of ambiguization noise t…
This paper addresses privacy issues in personalized pricing using nonparametric demand models.
problem Privacy violation in personalized pricing algorithms with unknown nonparametric demand models.
method Develops algorithms to make pricing decisions and learn demand while ensuring central and local differential privacy.
result Proves near-optimal regret bounds for algorithms with CDP and LDP guarantees.
Paper improves privacy in SGD with low noise, achieving optimal risk rates.
problem Privacy-preserving machine learning with good performance.
method Differentially private SGD with low-noise analysis.
result Achieves optimal excess risk rates for non-smooth losses.
DP-CDA generates synthetic data to enhance privacy in high-dimensional datasets.
problem Privacy concerns in anonymized datasets, especially in high-dimensional data.
method Randomized mixing of privacy-sensitive data in a class-specific manner with carefully tuned randomness.
result DP-CDA provides stronger privacy guarantees compared to existing methods, maintaining utility.