The DOI matches its Crossref record; 28 of the 28 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.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 1×
“Toaddressthepressingneedforprivacy-preservingaveragecon-sensus,onemayresorttoconventionalsecuremultipartycomputation approaches such as Yao’s Garbled Circuit [5], Shamir’s Secret Sharing algorithm [6], or many other recent advances.”
BackgroundConsensus 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
Degroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
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
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
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
Cyber-security enhancement of networked control systems using homomorphic encryption
Kogiso, K., & Fujita, T. (2015) · 2015 54th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7403296 · Cited by 253
Ad hoc peer-to-peer network architecture for vehicle safety communications
Chen, W., & Cai, S. (2005) · IEEE Communications Magazine · doi:10.1109/mcom.2005.1421912 · Cited by 221
ADMM Based Privacy-Preserving Decentralized Optimization
Zhang, C., Ahmad, M., & Wang, Y. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2855169 · Cited by 206
Self-citationDynamic 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
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
Privacy-aware quadratic optimization using partially homomorphic encryption
Shoukry, Y., Gatsis, K., Alanwar, A., Pappas, G. J., Seshia, S. A., Srivastava, M. B., & Paulo Tabuada, B. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7799042 · Cited by 103
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
Secure and Privacy-Preserving Average Consensus
Ruan, M., Ahmad, M., & Wang, Y. (2017) · Workshop on Cyber-Physical Systems Security and PrivaCy (CPS-SPC) · doi:10.1145/3140241.3140243 · Cited by 66
Self-citationDesign of communication networks for distributed computation with privacy guarantees
Pequito, S., Kar, S., Sundaram, S., & Aguiar, A. P. (2014) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2014.7039593 · Cited by 54
On privacy vs. cooperation in multi-agent systems
Katewa, V., Pasqualetti, F., & Gupta, V. (2017) · International Journal of Control · doi:10.1080/00207179.2017.1326632 · Cited by 44
Secure multi-party consensus gossip algorithms
Lazzeretti, R., Horn, S., Braca, P., & Willett, P. (2014) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2014.6855039 · Cited by 39
Distributed computing over encrypted data
Freris, N. M., & Patrinos, P. (2016) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2016.7852360 · Cited by 35
Adaptive communication networks with privacy guarantees
Alaeddini, A., Morgansen, K. A., & Mesbahi, M. (2017) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2017.7963642 · Cited by 32
Confidentiality in distributed average information consensus
Gupta, N., & Chopra, N. (2016) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2016.7799302 · Cited by 18
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
- 28
- 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
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.