CoChat

Privacy-preserving federated k-means for proactive caching in next generation cellular networks

Liu, Yang, Ma, Zhuo, Yan, Zheng, Wang, Zhuzhu, Liu, Ximeng, Ma, Jianfeng · 2020 · Information Sciences
Cited by 55

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.ins.2020.02.042

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 4 references

Cited by

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.