The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Differentially private average consensus: Obstructions, trade-offs, and optimal algorithm design
Open accessAbstract
This paper studies the multi-agent average consensus problem under the requirement of differential privacy of the agents' initial states against an adversary that has access to all the messages. We first establish that a differentially private consensus algorithm cannot guarantee convergence of the agents' states to the exact average in distribution, which in turn implies the same impossibility for other stronger notions of convergence. This result motivates our design of a novel differentially private Laplacian consensus algorithm in which agents linearly perturb their state-transition and message-generating functions with exponentially decaying Laplace noise. We prove that our algorithm converges almost surely to an unbiased estimate of the average of agents' initial states, compute the exponential mean-square rate of convergence, and formally characterize its differential privacy properties. We show that the optimal choice of our design parameters (with respect to the variance of the convergence point around the exact average) corresponds to a one-shot perturbation of initial states and compare our design with various counterparts from the literature. Simulations illustrate our results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
Distributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
Mukherjee, A., Fakoorian, S. A. A., Huang, J., & Swindlehurst, A. L. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012314.00178 · Cited by 1,483
Input-to-state stability for discrete-time nonlinear systems
Jiang, Z.-P., & Wang, Y. (2001) · Automatica · doi:10.1016/s0005-1098(01)00028-0 · Cited by 1,424
Probability: Theory and Examples
Durrett, R. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511779398 · Cited by 1,251
Intercontinental, B. (1985) · Cited by 682
Privacy Preserving Average Consensus
Mo, Y., & Murray, R. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2564339 · Cited by 521
Discrete-time dynamic average consensus
Zhu, M., & Martínez, S. (2010) · Automatica · doi:10.1016/j.automatica.2009.10.021 · Cited by 488
Differentially Private Filtering
Le Ny, J., & Pappas, G. J. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2283096 · Cited by 341
Differentially private iterative synchronous consensus
Huang, Z., Mitra, S., & Dullerud, G. (2012) · Proceedings of the 2012 ACM workshop on Privacy in the electronic society · doi:10.1145/2381966.2381978 · Cited by 280
Differentially Private Distributed Optimization
Huang, Z., Mitra, S., & Vaidya, N. (2015) · Proceedings of the 16th International Conference on Distributed Computing and Networking · doi:10.1145/2684464.2684480 · Cited by 266
Dynamic average consensus under limited control authority and privacy requirements
Kia, S. S., Cortés, J., & Martínez, S. (2015) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.3178 · Cited by 199
Self-citationPrivacy-preserving asymptotic average consensus
Manitara, N. E., & Hadjicostis, C. N. (2013) · 2013 European Control Conference (ECC) · doi:10.23919/ecc.2013.6669251 · Cited by 185
Robust dynamic average consensus of time-varying inputs
Bai, H., Freeman, R. A., & Lynch, K. M. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717485 · Cited by 169
Differentially Private Average Consensus with Optimal Noise Selection
Nozari, E., Tallapragada, P., & Cortés, J. (2015) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2015.10.331 · Cited by 78
Self-citationSecure consensus averaging in sensor networks using random offsets
Kefayati, M., Talebi, M. S., Khalaj, B. H., & Rabiee, H. R. (2007) · International Conference on Telecommunications · doi:10.1109/ictmicc.2007.4448699 · Cited by 64
Privacy Preserving Maximum Consensus
Duan, X., He, J., Cheng, P., et al. (2015) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2015.7402925 · Cited by 43
On the cost of differential privacy in distributed control systems
Huang, Z., Wang, Y., Mitra, S., & Dullerud, G. E. (2014) · International Conference on High Confidence Networked Systems · doi:10.1145/2566468.2566474 · Cited by 41
Differentially private convex optimization with piecewise affine objectives
Han, S., Topcu, U., & Pappas, G. J. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039718 · Cited by 36
Privacy preserving average consensus
Mo, Y., & Murray, R. M. (2014) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2014.7039717 · Cited by 26
Source Coding under Secrecy Constraints
Gündüz, D., Erkip, E., & Poor, H. V. (2009) · Springer eBooks · doi:10.1007/978-1-4419-1385-2_8 · Cited by 11
Metadata
- Authors
- Nozari, E., Tallapragada, P., & Cortés, J.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2017-07
- Volume
- 81
- Pages
- 221-231
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2252776754
- Cited by
- 334
- References
- 24
- FWCI
- 14.13
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
