The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Privacy-Preserving Average Consensus via State Decomposition
Open accessAbstract
Average consensus underpins key functionalities of distributed systems ranging from distributed information fusion, decision-making, distributed optimization, to load balancing and decentralized control. Existing distributed average consensus algorithms require each node to exchange and disclose state information to its neighbors, which is undesirable in cases where the state is private or contains sensitive information. In this paper, we propose a novel approach that avoids disclosing individual state information in average consensus by letting each node decompose its state into 2 substates. For each node, one of the two substates involves in computation and internode interactions as if it were the original state, while the other substate interacts only with the first substate of the same node, being completely invisible to other nodes. The initial values of the two substates are chosen randomly but with their mean fixed to the initial value of the original state, which is key to guarantee convergence to the desired consensus value. In direct contrast to differential-privacy based privacy-preserving average-consensus approaches, which enable privacy by compromising accuracy in the consensus value, the proposed approach can guarantee convergence to the exact desired value without any error. Not only is the proposed approach able to prevent the disclosure of a node's initial state to honest-but-curious neighbors, it can also provide protection against inference by external eavesdroppers able to wiretap communication links. Numerical simulations demonstrate the effectiveness of the approach and its advantages over state-of-the-art counterparts.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
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
Smart Grid — The New and Improved Power Grid: A Survey
Fang, X., Misra, S., Xue, G., & Yang, D. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.101911.00087 · Cited by 3,405
Protocols for secure computations
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.38 · Cited by 3,306
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
(1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61769-8 · Cited by 1,865
Privacy Preserving Average Consensus
Mo, Y., & Murray, R. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2564339 · Cited by 521
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
Self-citationLagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
Metadata
- Authors
- Wang, Y.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2019-11
- Volume
- 64
- Issue
- 11
- Pages
- 4711-4716
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2916583047
- Cited by
- 334
- References
- 27
- FWCI
- 11.57
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Privacy-Preserving Average Consensus via State Decomposition. https://app.cochat.ai/papers/10.1109/tac.2019.2902731
- The paper
- Wang, Y. (2019). Privacy-Preserving Average Consensus via State Decomposition. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2019.2902731
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.