The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Privacy Preserving Average Consensus
Abstract
Average consensus is a widely used algorithm for distributed computing and control, where all the agents in the network constantly communicate and update their states in order to achieve an agreement. This approach could result in an undesirable disclosure of information on the initial state of an agent to the other agents. In this paper, we propose a privacy preserving average consensus algorithm to guarantee the privacy of the initial state and asymptotic consensus on the exact average of the initial values, by adding and subtracting random noises to the consensus process. We characterize the mean square convergence rate of our consensus algorithm and derive the covariance matrix of the maximum likelihood estimate on the initial state. Moreover, we prove that our proposed algorithm is optimal in the sense that it does not disclose any information more than necessary to achieve the average consensus. A numerical example is provided to illustrate the effectiveness of the proposed design.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Self-citationCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
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
Degroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
Kalman Filtering With Intermittent Observations
Sinopoli, B., Schenato, L., Franceschetti, M., Poolla, K., Jordan, M. I., & Sastry, S. S. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834121 · Cited by 2,544
A survey of consensus problems in multi-agent coordination
Ren, W., Beard, R. W., & Atkins, E. M. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470239 · Cited by 1,344
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
Dynamic load balancing for distributed memory multiprocessors
Cybenko, G. (1989) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(89)90021-x · Cited by 997
Gossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M. G., & Scaglione, A. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2052531 · Cited by 741
Gossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M., & Scaglione, A. (2018) · doi:10.1184/r1/6468842.v1 · Cited by 692
Consensus Computation in Unreliable Networks: A System Theoretic Approach
Pasqualetti, F., Bicchi, A., & Bullo, F. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2158130 · Cited by 541
(2012) · SpringerReference · doi:10.1007/springerreference_205634 · Cited by 526
The multi-agent rendezvous problem
Lin, J., Morse, A. S., & Anderson, B. D. O. (2004) · 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475) · doi:10.1109/cdc.2003.1272825 · Cited by 408
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
Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies
Sundaram, S., & Hadjicostis, C. N. (2007) · 2007 American Control Conference · doi:10.1109/acc.2007.4282726 · Cited by 227
Differentially private filtering
Le Ny, J., & Pappas, G. J. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426355 · Cited by 188
Privacy-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
Kalman Filtering With Intermittent Observations: Tail Distribution and Critical Value
Mo, Y., & Sinopoli, B. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2166309 · Cited by 170
Self-citationDecentralised minimum-time consensus
Yuan, Y., Stan, G.-B. V., Shi, L., Barahona, M., & Gonçalves, J. M. (2013) · Automatica · doi:10.1016/j.automatica.2013.02.015 · Cited by 144
Security concepts for the dynamics of autonomous vehicle networks
Xue, M., Wang, W., & Roy, S. (2014) · Automatica · doi:10.1016/j.automatica.2013.12.001 · Cited by 63
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
Self-citation
Cited by
A systems and control perspective of CPS security
Dibaji, S. M., Pirani, M., Flamholz, D. B., Annaswamy, A. M., Johansson, K. H., & Chakrabortty, A. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.04.011 · Cited by 559
Secure and Privacy-Preserving Consensus
Ruan, M., Gao, H., & Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2890887 · Cited by 347
Differentially private average consensus: Obstructions, trade-offs, and optimal algorithm design
Nozari, E., Tallapragada, P., & Cortés, J. (2017) · Automatica · doi:10.1016/j.automatica.2017.03.016 · Cited by 334
Privacy-Preserving Average Consensus via State Decomposition
Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2902731 · Cited by 334
Metadata
- Authors
- Mo, Y., & Murray, R. M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2017-02
- Volume
- 62
- Issue
- 2
- Pages
- 753-765
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W1998345701
- Cited by
- 521
- References
- 23
- FWCI
- 41.69
- Type
- journal article
- Language
- en
- Open access
- closed
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.