Preserving Data-Privacy With Added Noises: Optimal Estimation and Privacy Analysis
From MaRDI portal
Abstract: Networked system often relies on distributed algorithms to achieve a global computation goal with iterative local information exchanges between neighbor nodes. To preserve data privacy, a node may add a random noise to its original data for information exchange at each iteration. Nevertheless, a neighbor node can estimate other's original data based on the information it received. The estimation accuracy and data privacy can be measured in terms of -data-privacy, defined as the probability of -accurate estimation (the difference of an estimation and the original data is within ) is no larger than (the disclosure probability). How to optimize the estimation and analyze data privacy is a critical and open issue. In this paper, a theoretical framework is developed to investigate how to optimize the estimation of neighbor's original data using the local information received, named optimal distributed estimation. Then, we study the disclosure probability under the optimal estimation for data privacy analysis. We further apply the developed framework to analyze the data privacy of the privacy-preserving average consensus algorithm and identify the optimal noises for the algorithm.
Cited in
(25)- Assessing the effectiveness of the noise addition method of preserving confidentiality in the multivariate normal case
- Privacy-preserving weighted average consensus and optimal attacking strategy for multi-agent networks
- Enhancement of opacity for distributed state estimation in cyber-physical systems
- Secure consensus with partial public protocols
- A stealthy artificial noise strategy against eavesdropping for remote estimation sensor networks
- Privacy-preserved average consensus algorithms with edge-based additive perturbations
- An encoding mechanism for secrecy of remote state estimation
- Secure and privacy preserving consensus for second-order systems based on Paillier encryption
- Privacy protection with heavy-tailed noise for linear dynamical systems
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- scientific article; zbMATH DE number 2087732 (Why is no real title available?)
- Optimal Privacy-Aware Estimation
- Designing communication networks for discrete-time consensus for performance and privacy guarantees
- An efficient encoding mechanism against eavesdropper with side channel information
- Gradient-tracking based differentially private distributed optimization with enhanced optimization accuracy
- A survey on privacy-preserving control and filtering of networked control systems
- Anti-eavesdropping set-membership state estimation for networked systems: an encryption-decryption scheme
- An improved privacy-preserved consensus algorithm under an event-triggered prescribed-time mechanism
- False noise attack detection for differentially-private distributed control of microgrids
- Privacy preserving prescribed-time consensus in second-order nonlinear multi-agent systems
- Differentially private and communication-efficient distributed nonconvex optimization algorithms
- Binary mechanisms under privacy-preserving noise
- Optimal unpredictable control for linear systems
- A privacy-preserving scheme with system-dimension masking for cloud-based model predictive control
- Privacy protection and attack defense co-design for secure consensus: a digital twin framework
This page was built for publication: Preserving Data-Privacy With Added Noises: Optimal Estimation and Privacy Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682869)