The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A Privacy-Aware and Incremental Defense Method Against GAN-Based Poisoning Attack
Abstract
Federated learning is usually utilized as a fraud detection framework in the domain of financial risk management, which promotes the model accuracy without training data exchange. One of the challenges in federated learning is the GAN-based poisoning attack. The GAN-based poisoning attack is a type of intractable poisoning attack that causes global model accuracy degradation and privacy leak. Most of the existing defenses for GAN-based poisoning attack have the three problems: 1) dependence on validation datasets; 2) incompetence of dealing with incremental poisoning attack; and 3) privacy leak. To address the above problems, we present a privacy-aware and incremental defense (PID) method to detect malicious participants and protect privacy. In PID, we design a method to accumulate the offset of model parameters from participants in all current epochs to represent the moving tendency for model parameters. Thus, we can distinguish the adversaries from normal participants based on the accumulations in this incremental poisoning attack. We also use multiple trust domains to reduce the rate of misjudging benign participants as adversaries. Moreover, a differentiated differential privacy is utilized before the global model sending to protect the privacy of participants’ training datasets in PID. The experiments conducted on two real-world datasets under financial fraud detection scenario demonstrate that the PID reduces the fallout of adversaries detection (the rate of misjudging benign participants as adversaries) by at least 51.1% and improve the speed of detecting all malicious participants by at least 33.4% compared with two popular defense methods. Besides, the privacy preserving of PID is also effective.
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
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975749 · Cited by 6,210 · cited 1×
“Though federated learning has made extraordinary progress in training financial risk control model, there are still a series of concerns [8].”
BackgroundHow to backdoor federated learning
Bagdasaryan, E., Veit, A., Hua, Y., Estrin, D., & Shmatikov, V. (2018) · arXiv · doi:10.48550/arxiv.1807.00459 · Cited by 1,495 · cited 1×
“While data poisoning attacks [24] are easier to launch but difficult to defense.”
BackgroundByzantine-Robust Distributed Learning: Towards Optimal Statistical Rates
Yin, D., Chen, Y., Ramchandran, K., & Bartlett, P. (2018) · arXiv · doi:10.48550/arxiv.1803.01498 · Cited by 1,130
Local Model Poisoning Attacks to Byzantine-Robust Federated Learning
Fang, M., Cao, X., Jia, J., & Gong, N. Z. (2019) · arXiv · doi:10.48550/arxiv.1911.11815 · Cited by 828 · cited 1×
“In federated learning, model poisoning attackers poison model parameters directly to launch attacks [23].”
BackgroundAttack of the tails: Yes, you really can backdoor federated learning
Wang, H., Sreenivasan, K., Rajput, S., Vishwakarma, H., Agarwal, S., Sohn, J.-Y., Lee, K., & Papailiopoulos, D. (2020) · arXiv · doi:10.48550/arxiv.2007.05084 · Cited by 406
Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
Chen, Y., Su, L., & Xu, J. (2017) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3154503 · Cited by 390
Privacy-Enhanced Federated Learning Against Poisoning Adversaries
Liu, X., Li, H., Xu, G., Chen, Z., Huang, X., & Lu, R. (2021) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2021.3108434 · Cited by 351 · cited 1×
“Liu et al. [28] utilize homomorphic encryption and extract the gradient of the logarithmic function to detect and penalize poisoners.”
BackgroundPoisonGAN: Generative Poisoning Attacks Against Federated Learning in Edge Computing Systems
Zhang, J., Chen, B., Cheng, X., Binh, H. T. T., & Yu, S. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3023126 · Cited by 291
Fed-IIoT: A Robust Federated Malware Detection Architecture in Industrial IoT
Taheri, R., Shojafar, M., Alazab, M., & Tafazolli, R. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3043458 · Cited by 218 · cited 6×
“Moreover, we also added the experiments compared with the algorithms in [15] and [16].”
BackgroundMethodInfluential
Research works printed but not linked: 34
- 10.1109/tnnls.2022.3208967 · DOI
- 10.1109/tcss.2022.3158318 · DOI
- 10.1109/TCSS.2020.2970805 · DOI
- 10.1109/TCSS.2020.3017013 · DOI
- 10.1109/TCSS.2018.2856910 · DOI
- Long, 2021, Federated learning for open banking, arXiv:2108.10749 · arXiv
- 10.1145/3387107 · DOI · Paper page
- 10.1109/TrustCom/BigDataSE.2019.00057 · DOI · Paper page
- 10.1609/aaai.v35i10.17118 · DOI · Paper page
- 10.1007/978-3-030-92708-0_8 · DOI
- 10.1109/COMST.2015.2422735 · DOI · Paper page
- 10.1109/GLOBECOM42002.2020.9322591 · DOI
- Jianxiong, 2022, GAN-based information leakage attack detection in federated learning, Secur. Commun. Netw., 2022, 1
- 10.1109/ICC42927.2021.9500657 · DOI
- Zhang, 2020, Exploiting defenses against GAN-based feature inference attacks in federated learning, arXiv:2004.12571 · arXiv
- 10.1109/MSN53354.2021.00036 · DOI
- 10.1155/2022/1615476 · DOI
- Blanchard, Machine learning with adversaries: Byzantine tolerant gradient descent, 30, 1
- 10.1109/MWC.001.1900119 · DOI · Paper page
- 10.1109/TDSC.2021.3135422 · DOI
- 10.1109/tdsc.2022.3168556 · DOI
- 10.1007/s11432-019-2739-2 · DOI
- 10.1145/3068335 · DOI · Paper page
- 10.1126/science.1136800 · DOI · Paper page
- 10.1145/2976749.2978318 · DOI · Paper page
- 10.1561/9781601988195 · DOI · Paper page
- 2022, Credit Card Fraud Detection
- 2022, Ccfraud
- 10.1109/SERVICES48979.2020.00021 · DOI
- 10.1109/JIOT.2018.2816007 · DOI · Paper page
- 10.1016/j.eswa.2021.114750 · DOI · Paper page
- 10.1016/j.neucom.2020.04.078 · doi:10.1016/j.neucom.2020.04.078
- 10.1016/0047-259X(82)90077-X · DOI · Paper page
- Balle, Improving the Gaussian mechanism for differential privacy: Analytical calibration and optimal denoising, 394
Cited by
(1996) · Institutional Research Information System University of Turin (University of Turin) · doi:10.1111/j · Cited by 5,486
A Novel Blockchain-Based Deepfake Detection Method Using Federated and Deep Learning Models
Heidari, A., Navimipour, N. J., Dag, H., Talebi, S., & Unal, M. (2024) · Cognitive Computation · doi:10.1007/s12559-024-10255-7 · Cited by 164
Metadata
- Authors
- Qiao, F., Li, Z., & Kong, Y.
- Venue
- IEEE Transactions on Computational Social Systems
- Published
- 2024-04
- Volume
- 11
- Issue
- 2
- Pages
- 1708-1721
- ISSN
- 2329-924X (ISSN-L)
- 2373-7476
- OpenAlex
- W4365790357
- Cited by
- 221
- References
- 13
- FWCI
- 3.07
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Funders
- National Natural Science Foundation of China (61972080)
- Natural Science Foundation of Shanghai (23ZR1401000)
- Shanghai Science and Technology Innovation Action Plan Project (22511100700)
- Open Foundation of the Key Laboratory of the Ministry of Education for Embedded System and Service Computing, Tongji University (ESSCKF2021-01)
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: A Privacy-Aware and Incremental Defense Method Against GAN-Based Poisoning Attack. https://app.cochat.ai/papers/10.1109/tcss.2023.3263241
- The paper
- Qiao, F., Li, Z., & Kong, Y. (2024). A Privacy-Aware and Incremental Defense Method Against GAN-Based Poisoning Attack. IEEE Transactions on Computational Social Systems. https://doi.org/10.1109/tcss.2023.3263241
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.