The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
ADMM Based Privacy-Preserving Decentralized Optimization
Open accessAbstract
Privacy preservation is addressed for decentralized optimization, where $N$ agents cooperatively minimize the sum of $N$ convex functions private to these individual agents. In most existing decentralized optimization approaches, participating agents exchange and disclose states explicitly, which may not be desirable when the states contain sensitive information of individual agents. The problem is more acute when adversaries exist which try to steal information from other participating agents. To address this issue, we propose a privacy-preserving decentralized optimization approach based on alternating direction method of multipliers (ADMM) and partially homomorphic cryptography. To the best of our knowledge, this is the first time that cryptographic techniques are incorporated in a fully decentralized setting to enable privacy preservation in decentralized optimization in the absence of any third party or aggregator. To facilitate the incorporation of encryption in a fully decentralized manner, we introduce a new ADMM, which allows time-varying penalty matrices and rigorously prove that it has a convergence rate of $O(1/t)$ . Numerical and experimental results confirm the effectiveness and low-computational complexity of the proposed 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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Public-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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806 · cited 1×
“However, despite successful applications in cloud based control and optimization [26]–[29], conventional cryptographic techniques cannot be applied directly in a completely decentralized setting without the assistance of aggregators/third parties (note that traditional secure multi-party computation schemes like fully…”
BackgroundDegroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
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
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-citationLearning Privately over Distributed Features: An ADMM Sharing Approach
Hu, Y., Liu, P., Kong, L., & Niu, D. (2019) · arXiv · doi:10.48550/arxiv.1907.07735 · Cited by 30
Harnessing wireless channels for scalable and privacy-preserving federated learning
Elgabli, A., Park, J., Issaid, C. B., & Bennis, M. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3078783 · Cited by 14
Metadata
- Authors
- Zhang, C., Ahmad, M., & Wang, Y.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2019-03
- Volume
- 14
- Issue
- 3
- Pages
- 565-580
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2810524107
- Cited by
- 206
- References
- 7
- FWCI
- 9.90
- 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: ADMM Based Privacy-Preserving Decentralized Optimization. https://app.cochat.ai/papers/10.1109/tifs.2018.2855169
- The paper
- Zhang, C., Ahmad, M., & Wang, Y. (2019). ADMM Based Privacy-Preserving Decentralized Optimization. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2018.2855169
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.