The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Secure and Privacy-Preserving Consensus
Open accessAbstract
Consensus is fundamental for distributed systems since it underpins key functionalities of such systems ranging from distributed information fusion, decision making, to decentralized control. In order to reach an agreement, existing consensus algorithms require each agent to exchange explicit state information with its neighbors. This leads to the disclosure of private state information, which is undesirable in cases where privacy is of concern. In this paper, we propose a novel approach for undirected networks, which can enable secure and privacy-preserving average consensus in a decentralized architecture in the absence of an aggregator or third party. By leveraging partial homomorphic cryptography to embed secrecy in pairwise interaction dynamics, our approach can guarantee convergence to the consensus value (subject to a quantization error) in a deterministic manner without disclosing a node's state to its neighbors. We provide a new privacy definition for dynamical systems, and give a new framework to rigorously prove that a node's privacy can be protected as long as it has at least one legitimate neighbor, which follows the consensus protocol faithfully without attempts to infer other nodes' states. In addition to enabling resilience to passive attackers aiming to steal state information, the approach also allows easy incorporation of defending mechanisms against active attackers who try to alter the content of exchanged messages. Furthermore, in contrast to existing noise-injection-based privacy-preserving mechanisms that have to reconfigure the entire network when the topology or number of nodes varies, our approach is applicable to dynamic environments with time-varying coupling topologies. This secure and privacy-preserving approach is also applicable to weighted average consensus as well as maximum/minimum consensus under a new update rule. Numerical simulations and comparison with existing approaches confirm the theoretical results. Experimental results on a Raspberry-Pi board based microcontroller network are also presented to verify the effectiveness and efficiency of the approach.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
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 · cited 4×
“According to [4], weighted average consensus can be achieved by using the following update rule:”
BackgroundMethodInfluentialA public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 2×
“Most popular cryptosystems such as RSA [24], ElGamal [25], and Paillier [26] are public-key cryptosystems.”
BackgroundPublic-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Degroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
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
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
Cao, N., Wang, C., Li, M., Ren, K., & Lou, W. (2014) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.45 · Cited by 1,259
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069 · cited 1×
“To analyze the convergence speed of our approach, following the convergence definition in [31] and [32], we define the convergence rate as at least γ ∈ (0, 1) if there exists a positive constant C such that ∥∥x[k]−α1∥∥ ≤ Cγ holds for all k, where α is the average value of the initial states of all nodes in (15).”
MethodLiu, K., Kargupta, H., & Ryan, J. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.14 · Cited by 554
Privacy Preserving Average Consensus
Mo, Y., & Murray, R. M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2564339 · Cited by 521
Lagendijk, 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
Problems in Decentralized Decision making and Computation.
Tsitsiklis, J. N. (1984) · Defense Technical Information Center (DTIC) · Cited by 288
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
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
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
Incremental cost consensus algorithm in a smart grid environment
Zhang, Z., & Chow, M. (2011) · IEEE Power Engineering Society General Meeting · doi:10.1109/pes.2011.6039422 · Cited by 160
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
Distributed Privacy-Preserving Data Aggregation Against Dishonest Nodes in Network Systems
He, J., Cai, L., Cheng, P., Pan, J., & Shi, L. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2834544 · Cited by 73
Privacy-Preserving Gradient-Descent Methods
Han, S., Ng, W. K., Wan, L., & Lee, V. C. S. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.153 · Cited by 70
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 58
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
Distributed Cooperative Spectrum Sensing Based on Weighted Average Consensus
Zhang, W., Wang, Z., Guo, Y. P., Liu, H., Chen, Y. J., & Mitola, J. (2011) · Globecom · doi:10.1109/glocom.2011.6134149 · Cited by 44
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
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
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
A geometrically convergent method for distributed optimization over time-varying graphs
Nedić, A., Olshevsky, A., & Shi, W. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798402 · Cited by 25
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
Cited by
Privacy-Preserving Average Consensus via State Decomposition
Wang, Y. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2902731 · Cited by 334
Self-citationAntwi-Boasiako, E., Zhou, S., Liao, Y., Liu, Q., Wang, Y., & Owusu-Agyemang, K. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102949 · Cited by 31
Self-citation
Metadata
- Authors
- Ruan, M., Gao, H., & Wang, Y.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2019-10
- Volume
- 64
- Issue
- 10
- Pages
- 4035-4049
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2964008526
- Cited by
- 347
- References
- 39
- FWCI
- 15.97
- 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.