Privacy-Preserving Incentive Mechanism Design for Federated Cloud-Edge Learning
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
To avoid the original private data uploading in cloud-edgecomputing, the federated learning (FL) scheme is recently proposed which enhances the privacy preservation. However, the attacks against the uploaded model updates in FL can still cause private data leakage which demotivates the privacy-sensitive participating edge devices. To address this issue, we aim to design a privacy-preserving incentive mechanism for the federated cloud-edge learning (PFCEL) system such that 1) the privacy-sensitive edge devices are motivated to contribute to the local training and model uploading, 2) a trade-off between the private data leakage and the model accuracy is achieved. We first model the data leakage quantitatively from an adversarial perspective, and then formulate the incentive design problem as a three-layer Stackelberg game, where the interaction between the edge servers and edge devices is further formulated as an optimal contract design problem. Extensive theoretical analysis and numerical evaluations demonstrate the effectiveness of our designed mechanism in terms of privacy preservation and system utility.
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557
A guide to deep learning in healthcare
Esteva, A., Robicquet, A., Ramsundar, B., Kuleshov, V., DePristo, M., Chou, K., Cui, C., Corrado, G., Thrun, S., & Dean, J. (2019) · Nature Medicine · doi:10.1038/s41591-018-0316-z · Cited by 5,312
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Federated Learning With Differential Privacy: Algorithms and Performance Analysis
Wei, K., Li, J., Ding, M., Ma, C., Yang, H. H., Farokhi, F., Jin, S., Quek, T. Q. S., & Vincent Poor, H. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2988575 · Cited by 2,400
Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labels
Zhang, Z., & Sabuncu, M. R. (2018) · arXiv · doi:10.48550/arxiv.1805.07836 · Cited by 1,907
Zhu, L., & Han, S. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-63076-8_2 · Cited by 1,906
Deep Models Under the GAN: Information Leakage from Collaborative Deep Learning
Hitaj, B., Ateniese, G., & Perez-Cruz, F. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134012 · Cited by 1,377
Learning Differentially Private Recurrent Language Models
McMahan, H. B., Ramage, D., Talwar, K., & Zhang, L. (2017) · arXiv · doi:10.48550/arxiv.1710.06963 · Cited by 849
Cited by
Zhan, S., Huang, L., Luo, G., Zheng, S., Gao, Z., & Chao, H.-C. (2025) · Electronics · doi:10.3390/electronics14132512 · Cited by 82
Privacy-Preserving Federated Learning with Resource Adaptive Compression for Edge Devices
Hidayat, M. A., Nakamura, Y., & Arakawa, Y. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3347552 · Cited by 29
“Only three related works use the resource-adaptive approach, which are PFCEL [35], adaptive communication [31], and FedPARL [29]; however, none of those three works satisfy all the requirements defined in Table I. PFCEL lacks low TCC, adaptive communication lacks Low CO, and FedPARL lacks security…”
BackgroundA Novel Privacy-Preserving Incentive Mechanism for Multi-Access Edge Computing
You, F., Yuan, X., Ni, W., & Jamalipour, A. (2024) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2024.3391303 · Cited by 11
“The authors of [16] proposed a privacy-preserving incentive mechanism for a federated cloud-edge learning system, where DP was considered.”
Background
Metadata
- Authors
- Liu, T., Di, B., An, P., & Song, L.
- Venue
- IEEE Transactions on Network Science and Engineering
- Published
- 2021-07-01
- Volume
- 8
- Issue
- 3
- Pages
- 2588-2600
- ISSN
- 2327-4697 (ISSN-L)
- 2334-329X
- OpenAlex
- W3184402277
- Cited by
- 61
- References
- 14
- FWCI
- 3.62
- 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
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 Incentive Mechanism Design for Federated Cloud-Edge Learning. https://app.cochat.ai/papers/10.1109/tnse.2021.3100096
- The paper
- Liu, T., Di, B., An, P., & Song, L. (2021). Privacy-Preserving Incentive Mechanism Design for Federated Cloud-Edge Learning. IEEE Transactions on Network Science and Engineering. https://doi.org/10.1109/tnse.2021.3100096
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.