Cited by 50Privacy-Preserving Technologies in DataCryptography and Data SecurityCloud Data Security Solutions

RevFRF: Enabling Cross-Domain Random Forest Training With Revocable Federated Learning

Liu, Yang, Ma, Zhuo, Yang, Yilong, Liu, Ximeng, Ma, Jianfeng, Ren, Kui·2022·IEEE Transactions on Dependable and Secure Computing

Abstract

Random forest is one of the most heated machine learning tools in a wide range of industrial scenarios. Recently, federated learning enables efficient distributed machine learning without direct revealing of private participant data. In this article, we present a novel framework of federated random forest (RevFRF), and further emphatically discuss the participant revocation problem of federated learning based on RevFRF. Specifically, RevFRF first introduces a suite of homomorphic encryption based secure protocols to implement federated random forest (RF). The protocols cover the whole lifecycle of an RF model, including construction, prediction and participant revocation. Then, referring to the practical application scenarios of RevFRF, the existing federated learning frameworks ignore a fact that even every participant in federated learning cannot maintain the cooperation with others forever. In company-level cooperation, allowing the remaining companies to use a trained model that contains the memories from an off-lying company potentially leads to a significant conflict of interest. Therefore, we propose the revocable federated learning concept and illustrate how RevFRF implements participant revocation in applications. Through theoretical analysis and experiments, we show that the protocols can efficiently implement federated RF and ensure the memories of a revoked participant in the trained RF to be securely removed.

Integrity signals

Registry

Crossref · 10.1109/tdsc.2021.3104842

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • There are already some relevant schemes, such as the backdoor-based verification mechanism in Reference [44] and the encryption-based verification scheme in Reference [111].

    “There are already some relevant schemes, such as the backdoorbased verification mechanism in Reference [44] and the encryption-based verification scheme in Reference [111].”

    From Machine Unlearning: A Survey (2024) · cites this paper as [111]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Liu, Y., Ma, Z., Yang, Y., Liu, X., Ma, J., & Ren, K.
Affiliations
  • Xidian University (CN)
  • Fuzhou University (CN)
  • Zhejiang University (CN)
Venue
IEEE Transactions on Dependable and Secure Computing
Published
2022-11-01
Volume
19
Issue
6
Pages
3671-3685
ISSN
  • 1545-5971 (ISSN-L)
  • 1941-0018
  • 2160-9209
OpenAlex
W3193911850
Cited by
49
References
43
Citations by year
2026: 11 · 2025: 13 · 2024: 14 · 2023: 6 · 2022: 4 · 2021: 1
FWCI
2.21
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Dependable and Secure Computing (publishedVersion)
Funders
  • National Natural Science Foundation of China (61872283, U1764263, 62072109, U1804263)
  • CNKLSTISS through the China 111 (B16037)
  • Shaanxi Science & Technology Coordination & Innovation Project (2016TZCG-6-3)
  • Key R&D Program of Shaanxi Province (2019ZDLGY12-04, 2020ZDLGY09-06)
  • Natural Science Basic Research Program of Shaanxi (2021JC-22)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
Keywords
homomorphic encryption, secure multi-party computation, privacy-preserving machine learning, cross-domain learning, distributed training

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