Privacy-preserving federated k-means for proactive caching in next generation cellular networks
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Abstract Proactive caching is a novel smart communication resource management method that can offer intelligent and economic networking services in the next generation cellular networks. In proactive caching, a common operation is using k-means to estimate content popularity. However, during the process, the base stations have to collect user’s location and content preference information to train a k-means model, which causes user privacy leakage. And current privacy-preserving k-means schemes usually suffer dramatic user quality of experience reduction, and cannot deal with the user dropout condition. Therefore, we propose a privacy-preserving federated k-means scheme (named PFK-means) for proactive caching in the next generation cellular networks. PFK-means is based on two privacy-preserving techniques, federated learning and secret sharing. In PFK-means, a suite of secret sharing protocols are designed to lightweight and efficient federated learning of k-means. These protocols allow privacy-preserving k-means training for proactive caching when there are dropout users. We seriously analyze the security of PFK-means and conduct comprehensive experiments to prove its security, effectiveness and efficiency. Through comparison, we can conclude that PFK-means outperforms other existing related schemes.
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
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
Practical Secure Aggregation for Privacy-Preserving Machine Learning
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3133982 · Cited by 3,956
Federated learning of predictive models from federated Electronic Health Records
Brisimi, T. S., Chen, R., Mela, T., Olshevsky, A., Paschalidis, I. C., & Shi, W. (2018) · International Journal of Medical Informatics · doi:10.1016/j.ijmedinf.2018.01.007 · Cited by 997
Beyond Inferring Class Representatives: User-Level Privacy Leakage From Federated Learning
Wang, Z., Song, M., Zhang, Z., Song, Y., Wang, Q., & Qi, H. (2019) · IEEE INFOCOM 2019 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2019.8737416 · Cited by 881
Self-citation
Cited by
Federated Learning for Internet of Things: Recent Advances, Taxonomy, and Open Challenges
Khan, L. U., Saad, W., Han, Z., Hossain, E., & Hong, C. S. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3090430 · Cited by 892
Yin, X., Zhu, Y., & Hu, J. (2022) · ACM Computing Surveys · doi:10.1145/3460427 · Cited by 638
Federated learning review: Fundamentals, enabling technologies, and future applications
Banabilah, S., Aloqaily, M., Alsayed, E., Malik, N., & Jararweh, Y. (2022) · Information Processing & Management · doi:10.1016/j.ipm.2022.103061 · Cited by 556
Metadata
- Authors
- Liu, Y., Ma, Z., Yan, Z., Wang, Z., Liu, X., & Ma, J.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2020-06
- Volume
- 521
- Pages
- 14-31
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W3006426012
- Cited by
- 55
- References
- 4
- FWCI
- 3.22
- 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
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.