Submitted:
29 September 2026
Posted:
30 September 2026
You are already at the latest version
Abstract
Cross-silo deepfake speech detection must accommodate organizations that observe different attack profiles and channel conditions while avoiding routine centralization of raw speech. We study federated learning (FL) for a compact detector combining linear-frequency cepstral coefficients (LFCCs) with frozen WavLM representations over heterogeneous partitions derived from ASVspoof 2019 and 2021. An official-metadata audit of the historical seed-42 Client-C split reproduces the reported 2,572/3,655 (70.37%) bona-fide source overlap; a stricter unified-source audit against the complete A+B+C fit pool finds still greater dependence. We therefore repeat the principal audio evaluation with five source-disjoint splits whose holdouts are independently verified against the complete fit pool. Mean equal error rate (EER) is 3.836% for pooled centralized training, 4.622% for Federated Averaging (FedAvg), 4.095% for local C, 21.883% for local A, and 33.398% for local B. On the common Client-C holdout, A-only and B-only models transfer poorly, while FedAvg is on average 0.787 percentage points worse than pooled training and 0.527 points worse than local C; these comparisons do not establish native-domain benefit for A or B. Separately, a 20-seed controlled stress test examines integrity mechanisms under malicious participation. Increasing untargeted label-flip compromise produces progressively more negative benign--malicious update alignment and stronger aggregate-step attenuation; the signature persists across four classifier topologies and FedProx settings. Additional tests cover targeted label poisoning, a controlled trigger backdoor, zero-update free riding, and coordinated sign-flip model poisoning. We frame the contribution as an auditable experimental protocol and a bounded set of observations, not as a new detector, optimizer, attack, aggregator, or universal defense.
Keywords:
federated learning
; voice deepfake detection
; audio anti-spoofing
; non-IID data
; data poisoning
; robust aggregation
; WavLM
; ASVspoof
; update geometry
; cybersecurity
1. Introduction
Voice synthesis and voice conversion have become sufficiently accessible that spoofed speech is now relevant to remote authentication, call-center fraud, social engineering, and misinformation. Humans cannot reliably identify all modern synthetic speech without technical assistance [1], and recent audio-forensics research continues to report sensitivity to attack families, codecs, compression, and other distribution shifts [2,3,4,5]. A recent review by the present authors similarly identified cross-dataset generalization, channel noise, and computational cost as persistent challenges in deepfake speech detection [6].
A practical deployment creates a second problem. Useful evidence is naturally distributed across organizations. To make this heterogeneity interpretable without implying that the public benchmark recordings came from real institutions, we use three illustrative archetypes throughout the paper: a TTS-heavy (bank-inspired) silo, a VC-heavy (operator-inspired) silo, and a channel-degraded (VoIP-inspired) silo. The labels are mnemonic deployment scenarios, not empirical models of banks, operators, or VoIP providers. Pooling raw conversations across organizations can conflict with data-minimization, confidentiality, organizational-governance, and privacy requirements. Federated learning (FL) offers an architectural alternative in which raw recordings remain local and participating organizations exchange model parameters or updates instead [7]. This reduces the need for raw-data exchange, although FL alone is not a cryptographic privacy guarantee.
The difficulty is that real cross-silo FL is neither statistically homogeneous nor fully trusted. Client datasets can differ simultaneously in attack families, channel conditions, class proportions, and size. Malicious or compromised participants may additionally poison local learning. These two factors interact: benign statistical heterogeneity can make honest updates look anomalous, while poisoning can exploit the same variation to evade simple defenses [8,9,10,11,12]. Consequently, a defense that is effective under one evaluation domain or one client composition may impose a substantial clean-data cost or fail after the channel distribution changes.
Federated speech and deepfake learning are no longer novel by themselves. Federated speaker verification has been studied for privacy-preserving voice authentication [13]; backdoor attacks have been demonstrated against federated automatic speaker verification [14]; and recent work has extended FL to multimodal, communication-efficient, and audio-specific deepfake detection [15,16,17]. In particular, FLADD combines Res2Net and Rawformer branches with adaptive aggregation and prototype guidance for audio deepfake detection [17], while FedMaxAdapt targets bandwidth-efficient sparse multimodal FL [16]. A relevant conceptual precursor is the physics-guided voice-authentication framework of Mohammadi et al. [18], which connects deepfake detection, uncertainty, edge deployment, and control-plane poisoning. These studies make clear that applying FL to deepfake detection is not, by itself, the contribution claimed here.
The contribution is deliberately empirical and methodological. We do not propose a new acoustic detector, federated optimizer, attack, aggregation rule, or deployable poisoning detector. Instead, we define an auditable cross-silo experimental protocol and report bounded observations about (i) collaboration under strongly imbalanced heterogeneous silos, (ii) failure modes caused by source dependence in audio splitting, and (iii) how malicious participation alters optimization geometry and defense interpretation. The LFCC+frozen-WavLM detector is a reproducible acoustic case-study vehicle; the illustrative silo archetypes separate attack-family and channel heterogeneity; and the controlled synthetic experiments isolate mechanisms that cannot be cleanly varied in the archived audio workflow.
This article makes four contributions. First, it independently audits the archived ASVspoof construction at the source/provenance level, confirms substantial dependence in the historical seed-42 holdout, and replaces the principal audio comparison with five source-disjoint splits verified against the complete A+B+C fit pool. Second, it performs a matched multi-seed comparison of pooled training, FedAvg, and local-only A/B/C baselines using the same architecture, initialization per seed, fit-data pool for pooled/FedAvg, global class weights, batch size, learning rate, data-pass budget, and fixed endpoint; because all five models are evaluated on the same Client-C holdout, the local A/B rows are interpreted as cross-domain transfer baselines rather than as native-domain collaboration gains. Third, it evaluates poisoning and robust aggregation with a diagnostic set that separates deployable server-observable quantities from oracle/post-hoc quantities requiring known malicious identities. Fourth, it tests the stability and limits of the update-cancellation mechanism in reproducible 20-seed controlled experiments spanning IID/non-IID conditions, four classifier topologies, FedProx sensitivity, fixed-identity malicious-weight controls, defense-parameter sensitivity, and five adversarial behaviors. These experiments strengthen mechanism-level inference but do not establish external acoustic generalization or a new universal defense.
Two corrections to the historical audio interpretation are explicit. First, the official ASVspoof 2019/2021-to-VCTK/VCC mapping reproduces the reported 70.37% bona-fide source dependence in the historical Client-C row split. When bona-fide and voice-conversion derivatives are placed in one shared audio-source namespace and the complete A+B+C fit pool is audited, dependence is still stronger: 74.72% of historical bona-fide holdout files and 99.80% of spoof holdout files share a canonical source/provenance key with fit data. The historical 1.923% FedAvg EER is therefore retained only as workflow provenance and is not used to establish independent-recording performance. Second, ASVspoof 2021 Logical Access (LA) is historically linked to the ASVspoof 2019 LA evaluation lineage and retains the A07–A19 spoofing algorithms while adding telephony and Voice over Internet Protocol (VoIP) transmission conditions [19,20]. Consequently, post-federation 2019 scores are diagnostic only. The principal audio evidence is the new five-seed source-disjoint, protocol-matched 2021 evaluation; external-corpus generalization remains outside the claims.
2. Related Work
2.1. Audio Deepfake Detection Under Distribution and Channel Shift
The ASVspoof challenges established common datasets and metrics for automatic speaker verification spoofing countermeasures [19,21,22,23]. Modern detectors span raw-waveform architectures such as RawNet2 [24], spectro-temporal graph models such as Audio Anti-Spoofing using Integrated Spectro-Temporal Graph Attention Networks (AASIST) [25], handcrafted spectral representations, and large self-supervised speech models. WavLM [26] is particularly attractive as a frozen representation backbone because it provides a high-dimensional speech representation without requiring every federated participant to fine-tune a large transformer.
Strong in-domain performance does not imply reliable cross-condition operation. Spectral and hybrid detectors remain sensitive to codec mismatch, unseen generators, noise, and adversarial manipulation [2,3,4,5]. This motivates evaluating attack-family and channel heterogeneity separately instead of treating all non-IID variation as one abstract statistical parameter.
2.2. Federated Speech, Voice Security, and Deepfake Detection
Federated Speaker Verification with Personal Privacy Preservation (FedSP) demonstrates privacy-oriented federated speaker verification [13]. Subsequent work has shown that federated voice systems are themselves attack targets: Meng et al. demonstrate stealthy backdoor attacks on federated automatic speaker verification [14], and related speech-security research continues to explore channel-aware and privacy-aware federated settings [27,28].
Federated deepfake detection has also expanded beyond speech-only scenarios. Blfgeh and Ardah [15] propose a privacy-preserving multimodal framework spanning audio, video, and text. Manzoor et al.’s FedMaxAdapt focuses on gradient-guided adaptive sparsity and communication efficiency across audio and video modalities [16]. Most directly, Fan et al. propose FLADD, an audio-specific federated deepfake detector combining Res2Net and Rawformer branches with Multi-Factor Adaptive Weighting and dual prototypes [17]. These systems establish strong detection-oriented FL baselines. Their objectives and evaluation protocols, however, differ from the present integrity-focused question: none is a drop-in, same-protocol comparator for the archived cross-silo poisoning experiment. We therefore report their published numerical results explicitly, avoid cross-paper ranking, and complement that context with protocol-matched controlled architecture and attack ablations.
2.3. Poisoning and Byzantine-Robust Federated Learning
The federated-learning security literature covers data poisoning, model poisoning, backdoors, Byzantine clients, and privacy leakage [29]. Classical defenses include Krum [30], clipping and smoothing strategies such as Certifiably Robust Federated Learning (CRFL) [31], coordinate-wise robust statistics, and secure-aggregation-compatible methods such as the Robust Federated Learning Framework Against Poisoning Attacks with Secure Aggregation (RFLPA) [32]. Jeong et al. [33] use representational similarity to identify malicious updates in a robust model-poisoning defense.
Recent work has increasingly focused on the interaction between poisoning and non-IID data. Dynamic Byzantine-Robust Privacy-Preserving Federated Learning (DBFL) combines Byzantine robustness and privacy mechanisms under heterogeneous distributions [9]; Cross-Silo Privacy-Preserving Federated Prototype Learning Against Data Poisoning Attacks (PPFPL) addresses poisoned non-IID clients [10]; Fang et al. explicitly target poisoning under non-IID edge data [11]; Wang et al. combine secure aggregation with gradient-median and layer-wise cosine signals [34]; Khang et al. emphasize false positives caused by benign heterogeneity [12]; and Latif et al. use density/cosine-distance structure against colluding model-poisoning clients [35]. Update magnitude and conflicting directions have also been connected to instability in federated intrusion detection [36,37,38].
These studies motivate two choices in the present work: defenses are evaluated for both attacked utility and clean-data distortion, and update geometry is treated as an integrity diagnostic rather than relying only on terminal classification performance.
2.4. Positioning
Table 1 compares the nearest federated speech/deepfake lines of work at the level of experimental purpose rather than a wide set of binary flags. Table 2 then provides quantitative published-results context. The values in Table 2 are not a common leaderboard: the studies use different datasets, partitions, modalities, architectures, client constructions, training budgets, and metrics. In particular, the source-disjoint 4.622% FedAvg mean EER is measured on five source-disjoint splits of a repurposed ASVspoof 2021 LA client domain and cannot be equated with an official challenge evaluation. The table is included to make the detection-performance context transparent, while the protocol-matched experiments in Section 5.5 and Section 5.6 test the present mechanism under controlled alternatives. No literal head-to-head reproduction of FLADD or FedMaxAdapt is claimed: both methods couple their reported performance to architectures, modalities, aggregation rules, and raw-data protocols that are not represented by the present cached 808-dimensional feature pipeline. A faithful common-protocol reproduction is therefore treated as a remaining limitation rather than approximated with a methodologically different surrogate.
3. System Model and Research Questions
3.1. Cross-Silo Communication Scenario
The target is cross-silo FL among a small number of administrative domains rather than cross-device FL among thousands of consumer devices. Three illustrative profiles motivate the partition: a TTS-heavy (bank-inspired) domain, a VC-heavy (operator-inspired) domain, and a channel-degraded (VoIP-inspired) domain. They are mnemonic archetypes constructed from public ASVspoof data to expose semantically different sources of non-IID behavior; they are not statistical models of actual institutions and no proprietary institutional recordings are used.
The system is server-coordinated. A coordinator broadcasts the current trainable classifier, each client performs local optimization, and the coordinator aggregates returned parameters or updates. In the target deployment, raw audio is intended to remain local. The reported experiments emulate this workflow over client-assigned cached features in a shared research environment rather than over physically separate organizational infrastructure. The coordinator is trusted to execute the declared aggregation rule but can observe plaintext classifier updates; cryptographic secure aggregation is outside the implemented system.
3.2. Detection and Heterogeneity Model
For an audio sample x, the detector outputs the probability of bona fide or spoofed speech. Client k has local distribution
where denotes its attack-family profile and its channel/codec profile. The setting is non-IID—that is, not independent and identically distributed—when for at least some clients .
3.3. Threat Model
A fraction of clients can be compromised and intentionally distort local learning. The archived audio experiment implements untargeted label flipping, , before every local-training round; it is retained because its trajectory is directly recoverable from the archived artifacts. To test whether the diagnostics are informative only for that single attack, four additional controlled adversarial behaviors are evaluated at 30% compromised clients: (i) targeted spoof-to-bona-fide label poisoning; (ii) a trigger backdoor that shifts one surrogate feature coordinate for 30% of malicious-client spoof samples and relabels them bona fide; (iii) zero-update free riding; and (iv) coordinated sign-flip model poisoning in which compromised clients submit a common update equal to times their pre-attack mean update. These mechanisms span untargeted/targeted data poisoning, a targeted trigger, low-quality/non-contributing clients, and coordinated model poisoning. They are deliberately transparent stressors, not claims to reproduce every adaptive real-world attack.
The study still excludes adaptive defense-aware optimization, identity proliferation by a real Sybil mechanism, coordinator compromise, model inversion, gradient inversion, and cryptographic privacy attacks. The coordinated sign-flip condition models colluding malicious updates but not the process of creating additional identities. Accordingly, the scope is broadened beyond one poisoning mechanism while universal Byzantine, backdoor, Sybil, or privacy robustness remains explicitly outside the claims.
Figure 1.
Target cross-silo system model. Raw audio is intended to remain local in deployment; the reported experiments emulate the workflow using client-assigned cached features. The ten-client poisoning experiments are shards of the three domain profiles, not ten independent organizations.
Figure 1.
Target cross-silo system model. Raw audio is intended to remain local in deployment; the reported experiments emulate the workflow using client-assigned cached features. The ten-client poisoning experiments are shards of the three domain profiles, not ten independent organizations.

3.4. Research Questions
The article is organized around four research questions (RQs):
- RQ1.
- After enforcing source-disjoint audio splits and matching training protocols, how does FedAvg compare with pooled centralized training and local-only A/B/C baselines on the common Client-C holdout, and what does this reveal about cross-domain transfer under severe client imbalance?
- RQ2.
- What does the official source/provenance audit reveal about the archived audio evaluation, and how does the 2019–2021 dataset lineage constrain interpretation of historical channel-shift and post-federation scores?
- RQ3.
- How do malicious participation and aggregation defense interact under heterogeneous clients across several adversarial behaviors, including clean-data cost, malicious aggregation weight, structural versus excess client exclusion, and attack-specific failure modes?
- RQ4.
- Does update-level geometry explain the non-monotonic or transient global EER observed under poisoning, and does the cancellation signature persist across alternative classifier topologies and FedProx regularization?
Figure 2.
Evidence flow used in the journal version. The controlled surrogate experiment isolates the mechanism suggested by the audio case study; it is not treated as a replacement for external audio validation.
Figure 2.
Evidence flow used in the journal version. The controlled surrogate experiment isolates the mechanism suggested by the audio case study; it is not treated as a replacement for external audio validation.

4. Materials and Methods
4.1. Detector Architecture
The archived feature-extraction notebook specifies the detector pipeline. Audio is read at 16 kHz and normalized to 64,600 samples (approximately 4.04 s): longer recordings are truncated and shorter recordings are repeat-padded. The first branch computes 20 linear-frequency cepstral coefficients (LFCCs) with spafe.features.lfcc.lfcc using fs=16000 and num_ceps=20. No other LFCC arguments are passed, so they inherit the spafe defaults of the historical environment; because the exact installed spafe version was not recorded, those secondary defaults are not reconstructed post hoc. Mean and standard-deviation pooling over time produces a 40-dimensional LFCC vector.
The second branch uses the frozen Hugging Face model microsoft/wavlm-base-plus [26]. The notebook takes last_hidden_state and mean-pools it over time, producing a 768-dimensional WavLM representation. WavLM parameters are frozen, so only the task classifier is trained and exchanged during FL. The model identifier is preserved, but the historical Hugging Face revision hash was not pinned. The fused feature vector is
The multilayer perceptron (MLP) classifier has topology , rectified linear unit activations, dropout probability , and a two-class softmax output. It contains 223,682 trainable parameters. The archived 2019-only centralized training uses class-weighted cross-entropy with class weight for class c, Adam with learning rate , training batch size 64, development/evaluation batch size 128, and 30 epochs; the checkpoint with the lowest development-set EER is retained. Exact historical package versions were not recorded by the notebook and are therefore not reconstructed post hoc.
Figure 3 makes explicit which components are frozen, trainable, communicated, and observed by the integrity diagnostics. Only the 223,682-parameter MLP classifier is optimized and exchanged; LFCC extraction and WavLM are representation stages. This distinction matters for interpreting both communication cost and the scope of the poisoning analysis.
4.2. ASVspoof Data and Institution-Inspired Partition
The archived client-construction notebook constructs three deterministic public-data silos. Clients A and B use the official ASVspoof 2019 Logical Access (LA) training and development partitions [21]. Four text-to-speech (TTS) systems (A01–A04) form the TTS-heavy (bank-inspired) spoof profile and two voice-conversion (VC) systems (A05–A06) form the VC-heavy (operator-inspired) profile. Bona-fide samples are divided reproducibly between A and B by alternating their order. Client C uses the complete released ASVspoof 2021 LA evaluation feature cache [19]; it is repurposed as a labeled channel-degraded (VoIP-inspired) client domain rather than used in its original challenge-test role.
The historical workflow applied torch.manual_seed(42), randomly permuted Client C at the file-row level, allocated files to a holdout, and used the remainder for local training. An independent source-level audit identified that this row-wise split can place channel/codec-derived variants of the same underlying source on both sides. We therefore retain that split only as historical provenance and replace the principal evaluation with the source-disjoint protocol in Section 4.5.
Table 3.
Institution-inspired non-IID partition generated by the archived client-construction notebook.
Table 3.
Institution-inspired non-IID partition generated by the archived client-construction notebook.
| Client | Source | Profile | Bona fide | Spoof | Total |
|---|---|---|---|---|---|
| TTS-heavy, bank-inspired (A) | ASVspoof 2019 LA train+dev | TTS only (A01–A04) | 2,564 | 30,064 | 32,628 |
| VC-heavy, operator-inspired (B) | ASVspoof 2019 LA train+dev | VC only (A05–A06) | 2,564 | 15,032 | 17,596 |
| Channel-degraded, VoIP-inspired (C) | ASVspoof 2021 LA | Mixed A07–A19 lineage with telephony/VoIP degradation | 18,452 | 163,114 | 181,566 |
This construction introduces attack-profile heterogeneity, channel heterogeneity, class imbalance, and client-size imbalance. Before any Client-C holdout, C is approximately 5.6 times larger than A and 10.3 times larger than B. In the corrected five-seed protocol its training share varies from 74.19% to 74.40% of the pooled A+B+C fit data (mean 74.32%), making a local-C baseline essential for distinguishing cross-domain transfer effects from simple dominance by the largest silo.
4.3. Dataset-Lineage and Source-Dependence Audit
The official ASVspoof 2019/2021-to-VCTK/VCC mapping [20] was parsed by utterance identifier and linked to the exact Client-C cache. For bona-fide trials, provenance is the original VCTK recording. For VC spoof trials, provenance is the source VCTK recording. For TTS spoof trials, for which no source recording exists, provenance is the normalized source text, hashed after deterministic normalization. This deliberately conservative grouping keeps related channel/codec variants and related generated derivatives on the same side of a split.
Reconstructing the archived seed-42 row-wise split reproduces the reported direct bona-fide audit exactly: 2,572 of 3,655 holdout files (70.37%) share their original VCTK recording with Client-C training files. We then apply a stricter unified-source audit in which a bona-fide recording and every VC derivative of that same recording share one AUDIO_SOURCE:<VCTK-ID> key, while TTS trials use a TEXT_SOURCE_SHA256 key derived from normalized input text. Against the complete A+B+C fit pool, 2,731/3,655 historical bona-fide holdout files (74.72%) and 32,593/32,658 spoof holdout files (99.80%) share a canonical source/provenance key. These are related variants, not necessarily byte-identical files. The historical 1.923% FedAvg holdout EER therefore cannot establish performance on independent recordings and is moved to Appendix A as a provenance result only.
The stricter audit also shows that 39,439 of 181,566 Client-C rows (21.72%) have a canonical source key already present in the fixed A+B fit data, involving 1,009 shared source keys. The corrected split procedure therefore forbids such rows from entering the holdout and verifies the holdout against the complete A+B+remaining-C fit pool, not only against Client-C training. ASVspoof 2021 LA is historically linked to the 2019 LA evaluation lineage and retains A07–A19 while adding telephony/VoIP conditions [19]. Consequently, post-federation 2019 scores remain diagnostic rather than evidence of unseen-attack generalization. The corrected evaluation rules are: (i) primary audio comparisons use source-disjoint Client-C holdouts verified against the complete fit pool; (ii) historical row-wise results are labeled non-independent; (iii) post-federation 2019 scores are lineage diagnostics; and (iv) no external-corpus generalization to ASVspoof 5 [22] or in-the-wild audio is claimed.
4.4. Archived Audio Pipeline and Artifact Verification
The reproducibility package contains the recovered feature-extraction/training notebooks, client-construction and federated-training notebooks, poisoning/defense workflow, checkpoints, histories, and archived score files. These files preserve the historical experiment and make the origin of the historical results auditable.
Verification claims are now separated by what can actually be recomputed. Archived EERs for the released score files are independently recomputed from per-example scores. Checkpoint tensor shapes, parameter counts, and stored training histories are checked structurally. Historical t-DCF values are retained as notebook-output provenance; matching a saved notebook value is not described as an independent predictive verification because the complete external ASV-score input required for a fresh t-DCF recomputation is not released in the archived package. The newly corrected audio experiment closes this reproducibility gap for its principal EER comparisons by releasing every split assignment, per-example score file, exact checkpoint, SHA-256 checkpoint–score linkage, and an executable script that recomputes EER directly from those scores.
4.5. Corrected Source-Disjoint Matched Audio Evaluation
Five corrected Client-C splits are generated with seeds 42, 123, 2026, 31415, and 65537. Bona-fide and VC-derived trials that resolve to the same original VCTK recording use one shared AUDIO_SOURCE key; TTS trials are grouped by a SHA-256 hash of normalized source text. Before splitting, every Client-C row whose canonical key already occurs in the fixed A+B fit data is forced to training. This rule affects 39,439 of 181,566 Client-C rows (21.72%) spanning 1,009 canonical source keys. Stratified group splitting is then applied to the remaining eligible Client-C source groups. For each seed, candidate StratifiedGroupKFold partitions with are enumerated, and the holdout fold is selected by minimizing the sum of relative deviations from the pre-specified 20% targets for total, bona-fide, and spoof holdout counts. Model outputs, EER, or any other performance metric are not used to select a split. An independent verifier reparses the official ASVspoof metadata and confirms, for every seed, zero canonical-source overlap, zero audio-source overlap, and zero TTS-source-text overlap between the holdout and the complete A+B+remaining-C fit pool. Holdout sizes range from 35,630 to 37,236 files, including 4,442–4,713 bona-fide and 31,081–32,588 spoof trials. Exact utterance identifiers, labels, source types/keys, attack labels, codecs, transmission conditions, and train/holdout assignments are released for all five splits.
For each seed we compare five models: pooled centralized training, FedAvg over A/B/C, local A only, local B only, and local C only. All use the same 808-dimensional LFCC+WavLM input and the same classifier. For pooled and FedAvg training, the fit-data pool is identical: all A and B examples plus only the Client-C training rows for that seed. The model initialization is shared across methods within a seed. All methods use globally computed class weights, Adam with learning rate , batch size 256, 15 rounds of three epochs (45 data passes per example), and a fixed final endpoint; no validation-based checkpoint selection is used. Pooled training deliberately resets Adam at each matched round, paralleling the local-optimizer reset in FedAvg. Local-only baselines use the same initialization, optimizer settings, global class weights, and 45-pass budget on their own silo data. All five models are evaluated on the same Client-C holdout. Consequently, the local-A and local-B rows quantify transfer from A/B into the C evaluation domain; they do not measure whether federation improves performance on the native A or B domains.
Across the five seeds we report the mean EER, sample standard deviation, and two-sided Student-t 95% CI. Paired FedAvg-minus-baseline EER differences are also summarized across the same seeds. This design does not transform the repurposed 2021 domain into an external benchmark, but it removes the identified source dependence against the full fit pool and the major optimization/model-selection mismatches that invalidated causal interpretation of the historical FedAvg-versus-pooled comparison.
4.6. Federated Optimization
Let be the global classifier at communication round t, K the number of participating clients, the local dataset, , and the locally optimized classifier returned by client k. The archived federated-training implementation creates deterministic shuffled loaders with generator seed 42 and batch size 64 for each client. Each client performs local epochs with Adam at learning rate and class-weighted cross-entropy. For FedAvg, the coordinator computes [7]
FedProx adds [39]
to the local loss. The archived audio comparison uses 15 rounds and .
The historical pooled/FedAvg/FedProx comparison used unequal protocols: the pooled model reserved 10% for validation, trained for 20 epochs with batch size 128 and best-validation checkpoint selection, whereas FedAvg/FedProx used all local fit data, client-specific class weights, three local epochs per round, and a fixed 15-round endpoint. Those archived values are therefore treated only as historical provenance in Appendix A. The corrected matched protocol is specified separately in Section 4.5. Because the archived FedProx run also used only one and one horizon, FedProx generalization is examined in the controlled mechanism experiment rather than inferred from that single historical audio run.
4.7. Audio Poisoning Experiment and Update Diagnostics
The archived poisoning/defense notebook subdivides the three source domains into ten emulated clients while preserving their parent-domain profiles: A into two shards, B into two, and the Client-C training subset into six. Sharding uses generator seed 42. This construction permits 10%, 20%, and 30% compromised-client fractions; the ten shards are an experimental device, not ten independent institutions. For each experiment, Python’s random.Random(123) defines a reproducible malicious-client ordering. In the archived audio tensors, label 1 denotes bona fide and label 0 denotes spoof; compromised clients apply label flipping, , while leaving the rest of local training unchanged.
Four archived aggregation modes are available. Unprotected training uses size-weighted FedAvg. Norm clipping limits the norm of a client’s model update to 20.0; the notebook records three clean probe norms of 21.412, 19.096, and 14.403 (mean 18.304) used to motivate that scale. Coordinate-wise trimmed mean removes the two largest and two smallest client values independently for every parameter coordinate () and averages the remaining six. The uncertainty-screening prototype performs 10 Monte Carlo Dropout passes on a coordinator-side reference slice, computes the mean sample-wise standard deviation of bona-fide probabilities, and flags a client when its deviation from the median exceeds 2.5 median absolute deviations (MADs). The reference slice is the first 2,000 ASVspoof 2019 evaluation embeddings. This archived audio rule is not the same defense as the synthetic uncertainty rule below: it uses mean sample-wise probability standard deviation and a 2.5-MAD rejection threshold, whereas the synthetic prototype uses epistemic uncertainty (predictive entropy minus expected entropy), a 3.5-MAD threshold, and an additional minimum-client safety rule. Their results are therefore reported as two distinct exploratory screening prototypes, not as direct replications of one defense.
That last design choice creates an important evaluation coupling: the 2019 evaluation set is partly used by the uncertainty defense itself. Consequently, 2019-domain EER values for the uncertainty-screening rows are reported only as exploratory diagnostics and are not interpreted as independent evaluation. The 2021 held-out subset is not used by the screening rule. For every poisoning/defense condition, the archived summary reports the mean EER over the final five of 15 rounds; honest-client FPR is reported for uncertainty screening.
For update geometry, the notebook computes the cosine similarity between size-weighted mean benign and malicious update directions,
and compares the norm of the aggregate update from all clients with the aggregate from benign clients only. Negative cosine similarity indicates directional opposition. A norm ratio below one means that the all-client aggregate step is attenuated relative to the benign-only aggregate; directional cancellation is inferred only when attenuation is accompanied by negative benign–malicious alignment or other directional evidence.
4.8. Controlled Mechanism-Replication Stress Test
A separate surrogate experiment tests RQ3–RQ4 under a fully specified and executable setting. It is not an audio-detector benchmark and is not used to claim ASVspoof generalization. Its purpose is to isolate update cancellation, quantify random-seed uncertainty beyond the single archived audio trajectory, and stress-test defense-rule assumptions under controlled variations that were not part of the original audio experiment.
Each sample is a 32-dimensional Gaussian embedding generated deterministically from a recorded seed; coordinates are dimensionless and have no acoustic interpretation. Three domains differ in feature shifts, Gaussian scale, spoof-class directions, and class proportions, with the exact generator parameterization reported in Appendix E. Client sizes are scaled from the audio-partition proportions , where the last value approximates 80% of Client C. Exactly 4,000 training samples are allocated across ten clients in the 2/2/6 pattern, with client counts . Three balanced domain test sets contain 900 samples each and are concatenated into an equally domain-weighted pooled test set. A separately generated balanced reference set contains 192 samples (64 per domain) and is used only by the synthetic uncertainty rule. For implementation convenience in this surrogate, label 1 denotes spoof and label 0 denotes bona fide; score orientation is handled consistently in EER computation. The surrogate classifier is an MLP with dropout 0.3. It uses three full-batch local Adam epochs at learning rate 0.01 for 15 rounds.
A heterogeneity coefficient interpolates between shared client distributions (, IID with respect to the modeled domain parameters) and the full three-domain shifts (, the primary non-IID condition); provides an intermediate ablation. Client-size imbalance is retained in all three conditions so that statistical heterogeneity can be separated from size-weighting effects.
Label flipping is applied to 0%, 10%, 20%, or 30% of clients. In addition to the compromised-client fraction, we record the malicious aggregation-weight fraction, i.e., the sum of FedAvg sample weights assigned to malicious clients. The primary random-client experiment evaluates six aggregation configurations:
- 1.
- size-weighted FedAvg;
- 2.
- -norm clipping with fixed to the median clean round-1 client-update norm;
- 3.
- coordinate-wise trimmed mean with values removed from each tail;
- 4.
- coordinate median;
- 5.
- Multi-Krum using the declared number f of compromised clients and selecting updates after Krum scoring [30];
- 6.
- uncertainty screening using a trusted 192-sample balanced reference set, 10 Monte Carlo Dropout passes, epistemic uncertainty (predictive entropy minus expected entropy), a median-absolute-deviation robust z threshold of 3.5, and a safety rule retaining all clients if fewer than three would remain.
Norm clipping retains the FedAvg sample-size weights, whereas trimmed mean, coordinate median, and Multi-Krum aggregate coordinates/selected updates without those weights, following the implemented baselines. The Multi-Krum setting with the true f is an oracle/favorable knowledge assumption, not a realistic guarantee that the server knows the number of compromised clients. We therefore additionally test at an actual 30% compromise rate. Trimmed mean is similarly tested with . The uncertainty rule explicitly assumes access to a small trusted coordinator-side reference set; this is an operational assumption of the defense rather than a property of FL itself.
Four additional controls are used. First, the IID/mild/full non-IID ablation is run at 20% compromise for unprotected FedAvg, Multi-Krum, and uncertainty screening. Second, to distinguish poisoning from simple client absence, the same randomly selected clients are removed rather than label-flipped at 10% and 30% selection levels. Third, because the archived low-weight/random/high-weight client-selection comparison changed both client identity/domain and aggregation weight, it is no longer used to isolate the causal effect of malicious mass. The fixed-identity control instead holds the same malicious clients and their local data and rescales only their total server aggregation mass to 15%, 30%, or 45%, with benign weights renormalized correspondingly. Fourth, Multi-Krum honest-client FPR is decomposed into the structural exclusion floor implied by the fixed selection quota (assuming all malicious clients are rejected) and any excess honest exclusion beyond that floor.
All primary controlled experiments use 20 seed-specific runs (seeds 0–19). For each seed/configuration, the main EER is the mean of the final five rounds. Across seeds, we compute the mean, sample standard deviation, and two-sided 95% confidence interval (CI) based on Student’s t distribution, . Tables report the mean ± CI half-width; the package retains the corresponding standard deviations. For transient-trajectory analysis, the seed—not an individual communication round—is the inferential unit: the fraction of rounds with poisoned EER below the seed-matched clean EER is computed within each seed and summarized across seeds. Seed–round counts are reported only descriptively.
The same generator is used for a clean FedProx sensitivity sweep with 30 rounds for every , ensuring an equal optimization horizon. Monte Carlo uncertainty evaluation saves and restores the pseudo-random-number-generator state so that the defense evaluation does not alter subsequent stochastic training draws. All scripts, seeds, configurations, generated result tables, and figure-generation code are included in the reproducibility package.
4.8.1. Additional Architecture, Optimizer, and Multi-Threat Analyses
To test architecture dependence without conflating the question with a separate raw-audio architecture reproduction, the same 20-seed generator, client allocations, local epochs, learning rate, round count, malicious-client selection, and full non-IID condition are reused with four trainable classifiers: a linear model (66 parameters), an MLP (282 parameters), the reference MLP (562 parameters), and a deeper MLP (1,618 parameters). Each architecture is evaluated clean and under 30% random-client untargeted label flipping. Because the data and attack are fixed, differences isolate classifier topology rather than a changed benchmark protocol.
A second sensitivity study repeats the 30% untargeted-label-flip condition with FedProx coefficients over the same 15-round horizon. A third study evaluates the five attack families defined in Section 3.3 under unprotected FedAvg, coordinate-wise trimmed mean (), and Multi-Krum with the declared . The backdoor condition additionally reports attack success rate (ASR), defined as the percentage of triggered spoof test samples classified as bona fide. All additional controlled experiments use 20 seed-specific runs and the same final-five-round / Student-t summary rule as the primary controlled experiment. Exact scripts and per-round outputs are included in the reproducibility package.
4.9. Evaluation Metrics
The main detector metric is equal error rate (EER), the operating point at which false acceptance rate and false rejection rate are equal. The corrected matched-audio analysis in Table 4 uses the released receiver-operating-characteristic (ROC) point evaluator on source-disjoint per-example score files, and the accompanying executable script recomputes every reported EER directly from those files. The historical Appendix B retains the archived ASVspoof 2019 EER and minimum tandem detection cost function (t-DCF) values [23] as provenance rather than as the principal federation comparison. For those historical artifacts, EERs are independently recomputed where score files are available; archived t-DCF values are not described as independently recomputed because the external ASV-score input required for a fresh t-DCF calculation is not contained in the original release. The archived federated-training notebook constructs an ROC curve with sklearn.metrics.roc_curve, selects the sampled threshold minimizing the absolute difference between the false positive rate (FPR) and false negative rate (FNR), and reports the FPR at that point. The official ASVspoof/AASIST evaluation script instead reports the mean of false rejection and false acceptance rates at the closest discrete operating point [25]; this implementation difference explains the few-thousandths-of-a-percentage-point discrepancies retained in the historical audit for the same checkpoints.
For client-selection defenses in the controlled stress test, malicious-client true positive rate (TPR) is the proportion of malicious clients excluded, and honest-client false positive rate (FPR) is the proportion of honest clients excluded. For coordinate-wise aggregation methods, a client-level TPR/FPR is not defined because the rule does not accept or reject a client as a whole. The malicious aggregation-weight fraction is the sum of the size weights assigned to malicious clients and is reported because equal client counts need not imply equal influence under FedAvg. These quantities do not all have the same deployment status. Benign–malicious cosine, benign-only aggregate norm, malicious aggregation weight, and client-selection TPR/FPR require ground-truth knowledge of which clients are malicious and are therefore oracle/post-hoc audit variables in the present experiments. By contrast, the norm of the actual aggregate update is observable to a plaintext-update server, but a small aggregate norm is nonspecific: it can arise from cancellation, convergence, benign disagreement, or scaling and is not treated as a standalone attack detector. For the controlled trigger-backdoor extension, attack success rate (ASR) is the percentage of triggered spoof samples classified as bona fide; ASR is reported separately from clean pooled EER so that targeted behavior is not hidden by an aggregate classification metric.
5. Results
5.1. RQ1: Provenance-Disjoint Matched Audio Comparison
The source audit invalidates the historical 1.923% FedAvg EER as evidence of independent-recording performance. The direct historical Client-C audit reproduces the 70.37% bona-fide source overlap, while the stricter unified-source audit against the complete fit pool finds 74.72% bona-fide and 99.80% spoof overlap. Table 4 therefore reports only the corrected five-seed source-disjoint experiment as the principal audio comparison.
Under matched training, pooled centralized learning reaches mean EER 3.836% (95% CI half-width 0.567), FedAvg 4.622% (0.420), and local C 4.095% (0.352). Local A and local B transfer much less effectively to the Client-C holdout, reaching 21.883% (1.451) and 33.398% (0.783), respectively. Across paired seeds, FedAvg-minus-local-A is percentage points on average (95% CI ), and FedAvg-minus-local-B is points (). These contrasts demonstrate a large cross-domain transfer gap between A/B-only training and models that include Client C; they do not establish that federation improves the native A or B domains because those domains are not independently held out here. FedAvg is consistently worse than local C by 0.527 points on average (95% CI ) and worse than pooled centralized training by 0.787 points () across the five matched splits.
This distinction matters because Client C contributes on average 74.32% of the corrected pooled fit data and also supplies the source-disjoint evaluation domain. The supported systems observation is therefore that A-only and B-only models generalize poorly to C, whereas adding A/B through FedAvg does not improve C-domain EER over local-C or pooled training in these five splits. The experiment does not establish a general federated-performance advantage or native-domain collaboration benefit for A/B.
5.2. RQ2: Channel-Domain Shift and Dataset Lineage
The archived 2019-only checkpoint still provides a historical channel-shift diagnostic: it records 4.563% EER on ASVspoof 2019 LA evaluation and 23.079% on the archived 36,313-file 2021 row-wise holdout. However, the source audit now prevents interpreting that contrast as an independent-recording generalization test. The two corpora are historically linked and the 2021 row-wise holdout itself contains extensive related-source variants. We therefore retain the approximately 5.06-fold EER increase only as evidence that the historical checkpoint is sensitive to the changed telephony/VoIP condition within this linked benchmark lineage, not as an estimate of external deployment degradation.
Table 5.
Checkpoint-linked channel-domain diagnostic for the archived 2019-only model used by the federated-training notebook.
Table 5.
Checkpoint-linked channel-domain diagnostic for the archived 2019-only model used by the federated-training notebook.
| Test condition | EER (%) | Relative to 2019 eval |
|---|---|---|
| ASVspoof 2019 LA eval | 4.563 | |
| ASVspoof 2021 LA held-out subset | 23.079 |
5.3. RQ3–RQ4: Audio Poisoning Case and Update Cancellation
The archived audio poisoning trajectory is retained only as historical mechanism motivation, not as evidence of independent-recording acoustic robustness, because its original row-wise holdout is source-dependent as established in RQ2. In that archived experiment, the relationship between compromise fraction and detector EER is non-monotonic (Appendix B). The clearest mechanistic evidence is the unprotected 30% run: benign and malicious mean-update directions are negatively aligned in the representative recorded rounds, and the full ten-client aggregate has a smaller norm than the benign-only aggregate (Table 6). The same historical scenario includes a transient 2021-holdout EER spike to 39.4%, although other rounds and conditions can look deceptively favorable in aggregate EER.
The archived poisoning/defense notebook also contains a same-client removal control: with A1, A2, and C1 excluded rather than label-flipped, the trajectory ends at 3.598% EER on the 2021 holdout without the corresponding extreme excursion, whereas the matched label-flip run contains the 39.402% transient spike. This distinguishes directional poisoning from simply reducing the active-client set. The controlled experiment below then isolates the mechanism across 20 independent seeds and broader client selections.
5.4. Controlled 20-Seed Replication of Update Cancellation
Table 7 reports the unprotected controlled experiment under full non-IID heterogeneity. As the compromised-client fraction rises from 10% to 30%, the cosine similarity between benign and malicious updates becomes progressively more negative. At the same time, the ratio of the aggregate update norm to the benign-only update norm falls from 0.822 to 0.499. Mean pooled EER worsens rather than improves. The mechanism is therefore directional cancellation and trajectory distortion, not a general beneficial effect of poisoning.
Table 7.
Controlled update-geometry replication. Values are final-five-round means ± Student-t 95% CI half-widths across 20 seeds. Geometry and utility are separated into two tables for readability.
Table 7.
Controlled update-geometry replication. Values are final-five-round means ± Student-t 95% CI half-widths across 20 seeds. Geometry and utility are separated into two tables for readability.
| Compromised clients (%) | Malicious weight (%) | Benign–malicious cosine | Aggregate/benign norm ratio |
|---|---|---|---|
| 10 | 10.59 ± 1.28 | -0.395 ± 0.029 | 0.822 ± 0.022 |
| 20 | 20.17 ± 1.94 | -0.566 ± 0.037 | 0.658 ± 0.036 |
| 30 | 29.98 ± 2.14 | -0.702 ± 0.031 | 0.499 ± 0.036 |
Table 8.
Pooled utility for the same unprotected controlled runs. Values are final-five-round means ± Student-t 95% CI half-widths across 20 seeds.
Table 8.
Pooled utility for the same unprotected controlled runs. Values are final-five-round means ± Student-t 95% CI half-widths across 20 seeds.
| Compromised clients (%) | Pooled EER (%) |
|---|---|
| 10 | 9.45 ± 0.32 |
| 20 | 9.60 ± 0.34 |
| 30 | 10.36 ± 0.47 |
Figure 4.
Benign–malicious update cosine similarity in the unprotected controlled experiment. Error bars are Student-t 95% CI half-widths across 20 seeds.
Figure 4.
Benign–malicious update cosine similarity in the unprotected controlled experiment. Error bars are Student-t 95% CI half-widths across 20 seeds.

Figure 5.
Aggregate-to-benign update-norm ratio in the unprotected controlled experiment. Values below one indicate attenuation of the all-client step relative to the benign-only step; by itself this is not a specific indicator of directional cancellation. Error bars are Student-t 95% CIs across 20 seeds.
Figure 5.
Aggregate-to-benign update-norm ratio in the unprotected controlled experiment. Values below one indicate attenuation of the all-client step relative to the benign-only step; by itself this is not a specific indicator of directional cancellation. Error bars are Student-t 95% CIs across 20 seeds.

Transient metric improvement remains possible but is secondary. Using each seed as the inferential unit, the mean within-seed fraction of rounds in which poisoned EER is below the seed-matched clean EER is 9.33% (95% CI half-width 5.94 percentage points) at 10% compromise and 8.33% (half-width 5.25 percentage points) at 20%, with none observed at 30%. The 28/300 and 25/300 seed–round counts in Table 9 are descriptive only because rounds within a seed are correlated.
5.5. Architecture and FedProx Sensitivity of the Cancellation Mechanism
Table 10 addresses whether the cancellation result is an incidental property of the reference MLP. Under the same 30% untargeted-label-flip condition, all four tested classifier topologies produce strongly negative benign–malicious alignment and aggregate-step shrinkage. Mean cosine similarity ranges only from to , and the aggregate-to-benign norm ratio from 0.486 to 0.514, despite clean and attacked EER differences across architectures. The mechanism-level conclusion therefore survives substantial variation in trainable topology within this controlled setting; this does not imply that every acoustic backbone will have identical utility.
The equal-horizon poisoned FedProx sweep gives the same qualitative result (Appendix D). For , 0.01, 0.1, and 1, pooled EER is 10.36±0.47%, 10.37±0.45%, 10.39±0.45%, and 11.07±0.59%, respectively; cosine alignment becomes more negative from to and the norm ratio decreases from 0.499 to 0.436. FedProx regularization therefore does not remove the directional-cancellation mechanism in this stress test.
5.6. Multi-Threat Controlled Stress Test
Table 11 broadens the adversarial scope beyond the archived untargeted label flip. The two label-poisoning attacks retain the strong cancellation signature of the primary experiment. The trigger backdoor has a less extreme but still negative alignment and reaches 52.2±8.3% ASR under unprotected FedAvg. Zero-update free riding has undefined benign–malicious cosine by construction because the malicious update norm is zero; its aggregate/benign norm ratio of approximately 0.70 directly reflects lost contribution weight. Coordinated sign-flip model poisoning is qualitatively different and severe: unprotected pooled EER rises to 62.6±7.0% while cosine reaches .
For the trigger backdoor, ASR is 52.2±8.3% under unprotected FedAvg, 48.9±6.8% under trimmed mean, and 39.8±7.9% under Multi-Krum. Thus, a defense can preserve global EER while leaving substantial targeted vulnerability. Multi-Krum also exhibits attack-dependent honest-client exclusions: for example, it rejects all coordinated sign-flip malicious clients but structurally excludes 28.6% of honest clients, while under the free-rider condition it rejects none of the malicious zero updates and excludes 71.4% of honest clients. These results support a narrower and more useful claim than universal robustness: the diagnostic suite distinguishes materially different failure modes, but defense behavior must be audited per threat.
5.7. Controlled Robust-Aggregation Comparison
Table 13 and Figure 6 compare the fully specified defenses. At 30% compromise, unprotected FedAvg reaches 10.36±0.47% pooled EER, versus 9.77±0.37% for trimmed mean and 9.71±0.35% for Multi-Krum with oracle . Several confidence intervals overlap and no multiplicity-adjusted pairwise ranking was prespecified, so these results are comparative stress-test evidence rather than a universal ordering of defenses.
The client-selection diagnostics show a marked trade-off. Under the oracle-f setting, Multi-Krum excludes 100.0%, 96.5%, and 80.3% of malicious clients at 10%, 20%, and 30% compromise, but also excludes 22.2%, 25.9%, and 37.0% of honest clients. The uncertainty rule preserves almost all honest clients but has approximately zero TPR against label flipping. Norm clipping changes little under the calibrated threshold, indicating that this attack is driven more by update direction than extreme update magnitude.
For Multi-Krum, honest-client exclusion must be separated from attack discrimination because the implementation always selects updates. If all malicious clients were perfectly rejected, that quota alone would force honest-client FPR floors of 22.2%, 25.0%, and 28.6% at 10%, 20%, and 30% compromise. The observed FPRs are 22.2%, 25.9%, and 37.0%, corresponding to excess honest exclusion of 0.0, 0.9, and 8.4 percentage points. We therefore report the quota floor separately rather than treating every rejected honest client as evidence of failed attack discrimination. The synthetic uncertainty prototype’s near-zero malicious-client TPR is likewise a negative result: under label flipping it is not a practically useful client detector at the tested threshold.
Table 12.
Multi-Krum honest-client exclusion decomposed into the structural quota floor and excess exclusion beyond that floor. Values are percentages.
Table 12.
Multi-Krum honest-client exclusion decomposed into the structural quota floor and excess exclusion beyond that floor. Values are percentages.
| Compromise | Observed honest FPR | Structural floor | Excess FPR |
|---|---|---|---|
| 10% | 22.2 | 22.2 | 0.0 |
| 20% | 25.9 | 25.0 | 0.9 |
| 30% | 37.0 | 28.6 | 8.4 |
Table 13.
Controlled defense comparison. Pooled EER is mean ± Student-t 95% CI half-width over 20 seeds. TPR/FPR are malicious-client true positive rate / honest-client false positive rate (%) for client-selection defenses. Main Multi-Krum uses the declared true f and therefore benefits from oracle knowledge.
Table 13.
Controlled defense comparison. Pooled EER is mean ± Student-t 95% CI half-width over 20 seeds. TPR/FPR are malicious-client true positive rate / honest-client false positive rate (%) for client-selection defenses. Main Multi-Krum uses the declared true f and therefore benefits from oracle knowledge.
| Compromised (%) | Aggregation | Pooled EER (%) | TPR / FPR (%) |
|---|---|---|---|
| 0 | FedAvg (none) | 9.20 ± 0.32 | – |
| 0 | Norm clipping | 9.21 ± 0.32 | – |
| 0 | Trimmed mean () | 9.10 ± 0.28 | – |
| 0 | Coordinate median | 9.28 ± 0.29 | – |
| 0 | Multi-Krum | 9.15 ± 0.30 | – / 20.0 |
| 0 | Uncertainty screening | 9.21 ± 0.32 | – / 0.5 |
| 10 | FedAvg (none) | 9.45 ± 0.32 | – |
| 10 | Norm clipping | 9.42 ± 0.32 | – |
| 10 | Trimmed mean () | 9.20 ± 0.32 | – |
| 10 | Coordinate median | 9.64 ± 0.30 | – |
| 10 | Multi-Krum | 9.25 ± 0.30 | 100.0 / 22.2 |
| 10 | Uncertainty screening | 9.45 ± 0.32 | 0.0 / 1.1 |
| 20 | FedAvg (none) | 9.60 ± 0.34 | – |
| 20 | Norm clipping | 9.58 ± 0.32 | – |
| 20 | Trimmed mean () | 9.34 ± 0.35 | – |
| 20 | Coordinate median | 9.81 ± 0.30 | – |
| 20 | Multi-Krum | 9.40 ± 0.32 | 96.5 / 25.9 |
| 20 | Uncertainty screening | 9.57 ± 0.33 | 0.0 / 0.8 |
| 30 | FedAvg (none) | 10.36 ± 0.47 | – |
| 30 | Norm clipping | 10.33 ± 0.45 | – |
| 30 | Trimmed mean () | 9.77 ± 0.37 | – |
| 30 | Coordinate median | 10.40 ± 0.43 | – |
| 30 | Multi-Krum | 9.71 ± 0.35 | 80.3 / 37.0 |
| 30 | Uncertainty screening | 10.36 ± 0.47 | 0.0 / 0.4 |
5.8. Malicious Aggregation Weight with Fixed Client Identities
The archived low-weight/random/high-weight comparison confounded aggregation weight with client identity and domain, because the smallest clients originated from the A/B profiles while the largest originated from C. We therefore retain that comparison only as exploratory provenance and use a new fixed-identity control for causal interpretation. The same malicious clients, local samples, label-flip attack, and 20 seeds are held fixed; only their total server aggregation mass is rescaled to 15%, 30%, or 45%, with benign weights renormalized.
The result is monotone and mechanistically coherent (Table 14). Raising malicious mass from 15% to 45% increases pooled EER from 9.58% to 22.66%, makes benign–malicious cosine more negative from to , and reduces the aggregate-to-benign norm ratio from 0.752 to 0.316. Because identities and local data are unchanged, this control isolates aggregation mass rather than domain composition. The same-client removal experiment remains complementary evidence that directional poisoning is more damaging than simply reducing participation.
5.9. Assumption and Sensitivity Checks
The controlled ablations in Appendix C separate assumptions that could otherwise be conflated with the cancellation result. Increasing statistical heterogeneity raises task difficulty, while the explicit quota decomposition in Table 12 shows that much of Multi-Krum’s honest-client FPR is structural to selection rather than evidence of attack discrimination. At 30% actual compromise, varying Multi-Krum’s assumed adversarial count trades malicious rejection against honest exclusion, while trimmed mean changes more modestly over . A clean 30-round FedProx sweep over produces strongly overlapping EER intervals. These checks bound the interpretation of individual defense settings rather than supplying a universal ranking.
5.10. Serialized Communication Payload
The trainable classifier contains 223,682 single-precision parameters, corresponding to 894,728 raw parameter bytes. The recorded PyTorch state_dict size is 897,557 bytes (approximately 876.5 KiB). For three institutional clients, a full round with one server-to-client model transmission and one client-to-server return per client is approximately
Fifteen rounds correspond to approximately 77 MiB of serialized model payload. This is a payload estimate, not a measured network-cost result: transport security, framing, retransmission, latency, packet loss, and systems overhead are excluded. The calculation therefore supports only the narrower observation that exchanging the compact classifier entails a modest serialized model payload; it is not an end-to-end comparison against transferring raw-audio corpora.
6. Discussion
6.1. What Is Essential and What Is Incidental in the Framework
The additional controlled experiments separate the framework’s intended methodological core from implementation choices. LFCC plus frozen WavLM is a computationally economical acoustic representation used by the archived case study; it is not asserted to be the unique or state-of-the-art detector architecture. Likewise, the particular surrogate MLP is incidental to the update-cancellation claim: four substantially different trainable topologies reproduce the same negative-alignment and aggregate-step-shrinkage signature under the matched stress test. The essential elements are instead the cross-silo separation of heterogeneous domains, explicit accounting for adversarial aggregation weight, and joint reporting of utility, selection errors, and update geometry. Published results from FLADD, FedMaxAdapt, and multimodal federated deepfake systems establish the broader detection-performance context, whereas the present contribution is the auditable integrity analysis under malicious participation.
6.2. What the Combined Evidence Supports
The corrected audio rerun changes what can be said about detector utility. The historical 1.923% result was optimistic under a source-dependent split and is no longer principal evidence. With source-disjoint splitting and matched training on the common Client-C holdout, pooled training reaches 3.836% mean EER, local C 4.095%, and FedAvg 4.622%, whereas A-only and B-only models reach 21.883% and 33.398%. The useful systems observation is therefore a large A/B-to-C cross-domain transfer gap and no C-domain EER advantage for FedAvg over pooled or local-C training in these five splits. Because A and B have no native-domain holdout in this experiment, the results do not establish that collaboration improves their own domains.
The strongest security conclusion is likewise mechanistic rather than a new defense claim. The archived poisoning case motivates a failure mode in which global EER can look temporarily favorable while malicious updates oppose benign optimization and the training trajectory becomes unstable. The controlled 20-seed replication preserves directional opposition and aggregate-step shrinkage while showing that average EER worsens with attack strength. Update cancellation is therefore the robust explanatory mechanism; persistent “beneficial poisoning” is not.
For a defender, the implication must distinguish observable signals from experimental explanations. Aggregate validation EER can miss a poisoning episode when cancellation slows or redirects optimization without immediately worsening the selected metric. A server can observe the actual aggregate-update norm when updates are plaintext, but norm shrinkage is nonspecific and is not a standalone attack indicator. Benign–malicious alignment, benign-only norms, malicious aggregation weight, and client-selection TPR/FPR are valuable post-hoc/oracle audit variables in this study because they require malicious-identity ground truth. They explain why an episode occurred and can be used to validate future detectors, but they are not themselves claimed as deployable detectors. Domain-specific validation and attack-specific metrics provide complementary server-side evidence where such validation data are legitimately available. Recent robust-FL methods increasingly combine geometric or behavioral signals for the same reason [34,35,36,40,41].
6.3. Heterogeneity and Defense-Rule Effects Are Separable
The controlled ablation (Appendix C) shows that increasing statistical heterogeneity degrades utility but does not, by itself, explain Multi-Krum’s honest-client FPR. The explicit quota decomposition sharpens this point: at 10%, 20%, and 30% compromise, 22.2%, 25.0%, and 28.6% honest-client FPR would occur even under perfect malicious rejection simply because Multi-Krum selects only updates. Only exclusion beyond that floor should be interpreted as additional discrimination error. Heterogeneity still matters because it changes the geometry and utility landscape, but defense-rule design must be analyzed separately.
The uncertainty defense illustrates a different failure mode. Its trusted-reference assumption keeps honest-client FPR below roughly 1.3% in the controlled experiments, yet label flipping rarely increases the chosen epistemic-uncertainty score enough to identify malicious clients. Low false alarms therefore do not imply useful attack sensitivity.
6.4. Client Count Is Not Attack Mass
A fixed compromised-client fraction can correspond to very different effective influence under weighted aggregation. The archived client-selection comparison mixed this effect with domain identity, so the fixed-identity causal control holds malicious clients and data constant and varies only their server aggregation mass. Moving from 15% to 45% malicious mass more than doubles pooled EER and produces systematically stronger directional opposition and aggregate-step shrinkage. This directly supports malicious aggregation mass as an explanatory variable independent of which domain was selected.
The same-client removal controls answer a different question: poisoned participation is not equivalent to missing participation. Removing selected clients reduces data availability but does not reproduce the same directional opposition or extreme trajectory behavior. Together, the two controls separate “which clients”, “how much weight”, and “whether the update is malicious” more cleanly than the historical design.
6.5. Robust Aggregation Requires Assumption Audits
The main Multi-Krum comparison supplies the true number of malicious clients f, a favorable oracle assumption. Sensitivity analysis shows that larger raises malicious-client rejection but also increases honest-client exclusion and does not necessarily minimize EER; the separate quota-floor calculation prevents structural exclusion from being misread as attack discrimination. Trimmed mean likewise depends on its tail parameter k. The audio and synthetic uncertainty screens are distinct prototypes and should not be compared as replications; notably, the synthetic rule has approximately zero TPR against label flipping, which limits its practical value at the tested setting. Robust-aggregation results are therefore reported with threat-bound, parameter, and attack assumptions rather than as parameter-free guarantees.
6.6. Privacy Boundary
The architecture keeps raw audio local, supporting data minimization and organizational autonomy. It does not provide end-to-end privacy by itself because plaintext classifier updates are visible to the coordinator. Secure-aggregation-compatible methods such as RFLPA and recent privacy-preserving federated schemes illustrate how robustness and update confidentiality can be combined [32,34,42]. The supported claim is therefore that the workflow reduces the need to exchange raw audio; it is not proof of compliance with the General Data Protection Regulation (GDPR) or immunity to gradient inversion and membership inference [43].
6.7. Relevance to Future Connected Systems
The International Telecommunication Union Telecommunication Standardization Sector (ITU-T) has issued architectural and management guidance for federated machine learning in International Mobile Telecommunications 2020 (IMT-2020) networks and beyond [44,45,46,47]. The present experimental framework exposes a closely related systems problem: independently governed domains collaborate through model exchange while having unequal data volumes, heterogeneous channels, and asymmetric trust. Deepfake speech is a concrete application in which communication-channel effects form part of the learning distribution rather than incidental noise.
7. Limitations and Threats to Validity
7.1. Construct and Data Validity
The silo labels are illustrative archetypes, not observations from real institutions. “TTS-heavy (bank-inspired)”, “VC-heavy (operator-inspired)”, and “channel-degraded (VoIP-inspired)” denote deterministic public-ASVspoof partitions selected to expose qualitatively different attack/channel profiles. They should not be read as empirical distributions of banks, operators, or VoIP providers.
The source audit corrects a major limitation of the historical evaluation: the row-wise 2021 split placed related source variants on both sides, and some Client-C sources were already present in the fixed A+B fit pool. The new five-seed evaluation uses a unified audio-source namespace for bona-fide and VC-derived trials plus normalized source-text hashes for TTS trials. Each holdout is independently verified to have zero canonical-source, audio-source, and TTS-source-text overlap with the complete A+B+remaining-C fit pool. This resolves the identified source dependence for the reported principal comparison, but it still uses a repurposed ASVspoof 2021 client domain rather than a genuinely external corpus. ASVspoof 2019 and 2021 also share historical lineage. Accordingly, the results support source-disjoint evaluation within the constructed 2021 domain, not deployment-level external generalization.
7.2. Internal, Statistical, and Reproducibility Validity
The principal audio comparison matches the architecture, initialization within seed, pooled/FedAvg fit-data pool, global class weights, batch size, learning rate, 45-pass budget, and fixed endpoint over five source-disjoint seeds. Local-only baselines use the same optimization budget on each silo. This design removes the main protocol confound of the historical pooled-versus-FedAvg comparison. However, all five models are evaluated only on the Client-C holdout; local A/B results therefore measure cross-domain transfer to C and cannot establish native-domain benefit from collaboration. Five seeds also provide limited precision; the reported Student-t intervals should be interpreted as uncertainty summaries rather than definitive population estimates.
The historical 1.923% FedAvg and 2.358% pooled values remain in the appendix because they document the archived workflow, but they are explicitly non-independent and protocol-unmatched and are not used to infer a federation effect. Historical t-DCF values are provenance from saved notebook output rather than independently recomputed predictive metrics. In contrast, the corrected experiment releases exact split identifiers, per-example scores, exact checkpoints, SHA-256 checkpoint–score linkage, and an executable EER recomputation script; rerunning that script reproduces all 25 reported per-seed EERs from released score files.
The controlled Gaussian generator is synthetic. Its purpose is mechanism isolation: client weight, heterogeneity, architecture, attack type, and aggregation rule can be changed independently. Agreement with the archived cancellation direction and stability across four classifier topologies strengthen mechanism plausibility, but synthetic embeddings do not validate acoustic robustness.
7.3. Threat-Model and Defense-Assumption Validity
The controlled threat model covers untargeted and targeted label poisoning, a feature-level trigger backdoor, zero-update free riding, and coordinated sign-flip model poisoning. These stressors span qualitatively different behaviors but do not implement adaptive defense-aware optimization, genuine Sybil identity creation, stealth-optimized model replacement, coordinator compromise, or privacy-inference attacks. The backdoor trigger is a surrogate feature intervention rather than an acoustic trigger. The evidence therefore supports differentiated stress testing, not comprehensive Byzantine robustness.
Several reported diagnostics are explanatory rather than deployable. Benign–malicious cosine, benign-only aggregate norm, malicious aggregation weight, and client-selection TPR/FPR require malicious-identity ground truth. Aggregate-update norm is server-observable with plaintext updates but nonspecific. Multi-Krum additionally has a structural honest-client exclusion floor imposed by its selection quota, which is reported separately from excess discrimination error. The audio and synthetic uncertainty rules use different statistics and thresholds and are treated as distinct exploratory prototypes; the near-zero synthetic TPR against label flipping is explicitly a failure mode.
7.4. Deployment, Privacy, and Systems Validity
The target architecture reduces the need to exchange raw audio, but FL alone is not a cryptographic privacy guarantee. The coordinator observes plaintext classifier updates; secure aggregation, differential privacy, gradient-inversion resistance, and membership-inference resistance are not implemented. Likewise, the communication calculation is a serialized-model payload estimate, not a packet-level or wall-clock network experiment. Transport security, framing overhead, retransmission, latency, packet loss, asynchronous participation, client dropout, and resource-constrained edge execution remain outside the evidence.
Finally, the LFCC+frozen-WavLM+MLP detector is deliberately compact. Recent systems such as FLADD use more elaborate acoustic architectures, and FedMaxAdapt optimizes a different multimodal/sparsity setting. Their published results are reported only as quantitative context, not as a common-protocol leaderboard. A literal head-to-head reproduction was not performed because a faithful comparison would require reproducing their raw-data architectures, client construction, and aggregation/training protocols rather than substituting the present cached-feature classifier. The present article does not claim a new state-of-the-art acoustic backbone or a new defense; its contribution is an auditable experimental protocol and bounded evidence about collaboration, provenance, and integrity mechanisms under heterogeneous cross-silo participation.
8. Conclusions
This study examines federated deepfake speech detection as a cross-silo integrity problem under simultaneous domain heterogeneity and malicious participation. An official-metadata audit confirms that the historical seed-42 row-wise split was source dependent: the reported direct audit gives 2,572/3,655 (70.37%) bona-fide overlap within Client C, while a stricter unified-source audit against the complete A+B+C fit pool gives 74.72% bona-fide and 99.80% spoof overlap. The historical 1.923% FedAvg EER therefore remains only as provenance and does not establish independent-recording performance.
With five source-disjoint splits and matched training on the common Client-C holdout, mean EER is 3.836% for pooled centralized training, 4.622% for FedAvg, 4.095% for local C, 21.883% for local A, and 33.398% for local B. A-only and B-only models therefore transfer poorly to C. FedAvg is, however, worse than local C by 0.527 percentage points on average and worse than pooled training by 0.787 points across the five matched splits. Given that C supplies about 74.32% of the corrected fit data and the evaluation domain, the supported systems conclusion is a strong cross-domain transfer asymmetry and no demonstrated C-domain advantage for federation. Native-domain collaboration benefit for A/B is not established by this evaluation.
The principal security finding is mechanistic. In the 20-seed controlled stress test, increasing untargeted label-flip compromise produces progressively more negative benign–malicious alignment and stronger aggregate-step shrinkage while average EER worsens. The signature persists across four classifier topologies and FedProx settings. A fixed-identity control further shows that increasing only malicious aggregation mass from 15% to 45% raises pooled EER from 9.58% to 22.66%, drives cosine from to , and lowers the norm ratio from 0.752 to 0.316. Broader threat testing shows attack-dependent signatures rather than a universal defense response.
The diagnostics must be interpreted according to deployment observability. Benign–malicious geometry, malicious weight, and TPR/FPR are post-hoc/oracle variables requiring malicious-identity ground truth; aggregate norm is observable but nonspecific. Multi-Krum honest-client exclusion is partly structural to its fixed quota, and the synthetic uncertainty rule’s near-zero label-flip TPR limits its practical value at the tested threshold. Thus, the work offers an auditable protocol for explaining and stress-testing integrity behavior, not a deployable poisoning detector.
Future work should repeat the corrected protocol on genuinely external or in-the-wild audio, reproduce recent audio-FL architectures under a common raw-audio protocol, evaluate acoustic backdoors and adaptive/Sybil adversaries, and add secure aggregation and measured edge/network deployment.
Author Contributions
Conceptualization, I.O.S. and V.O.A.; methodology, I.O.S. and V.O.A.; software, I.O.S. and V.O.A.; validation, I.O.S. and V.O.A.; formal analysis, I.O.S. and V.O.A.; investigation, I.O.S. and V.O.A.; resources, V.O.A.; data curation, I.O.S. and V.O.A.; writing—original draft preparation, I.O.S. and V.O.A.; writing—review and editing, I.O.S. and V.O.A.; visualization, I.O.S. and V.O.A.; supervision, V.O.A.; project administration, V.O.A.; funding acquisition, V.O.A. All authors have read and agreed to the published version of the manuscript.
Funding
Research was supported by the U.S. National Academy of Sciences (NAS) and the Office of Naval Research Global (ONRG) through the Science and Technology Center in Ukraine (STCU) under STCU contract number 7126 in the framework of the International Multilateral Partnerships for Resilient Education and Science System in Ukraine (IMPRESS-U).
Institutional Review Board Statement
Not applicable. Ethical review and approval were not required for this study because it analyzes previously released public benchmark data and synthetic data and involves no new recruitment of or interaction with human participants.
Informed Consent Statement
Not applicable. No new participant data were collected for this study.
Data Availability Statement
The audio experiments use the public ASVspoof 2019 and ASVspoof 2021 datasets; copyrighted audio and large derived feature caches are not redistributed. The reproducibility package includes the recovered historical notebooks and artifacts, the controlled 20-seed analyses, the fixed-identity malicious-weight and Multi-Krum quota controls, and the corrected five-seed audio rerun. For the corrected audio comparison it releases exact source-disjoint split manifests, per-example scores for all 25 method–seed runs, exact checkpoints, SHA-256 checkpoint–score linkage, run configuration, and an executable script that recomputes EER from the released scores. The reproducibility package (version 1.3.0) is deposited on Zenodo under DOI https://doi.org/10.5281/zenodo.22914235. The package includes the official ASVspoof LA source-mapping metadata used by the independent verifier under the source package’s original attribution license, together with the mapping license/readme and the exact A/B fit identifiers needed to reproduce the full-fit-pool source audit.
Acknowledgments
During the preparation of this manuscript/study, the authors used OpenAI ChatGPT (GPT-5.6 Sol) for manuscript restructuring, assistance with the design and coding of controlled experiments and the source-independence rerun, LaTeX preparation, and interpretation checks. The authors reviewed and edited the outputs and take full responsibility for the content of this publication. All newly reported numerical results were obtained by executing the released scripts; the corrected audio EERs are independently recomputable from released per-example score files. No experimental value was generated or estimated by the language model.
Conflicts of Interest
The authors declare no conflicts of interest. The funding sponsors had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.
Abbreviations
The following abbreviations are used in this manuscript:
| AASIST | Audio Anti-Spoofing using Integrated Spectro-Temporal Graph Attention Networks |
| ASV | Automatic Speaker Verification |
| CI | Confidence Interval |
| CRFL | Certifiably Robust Federated Learning |
| DBFL | Dynamic Byzantine-Robust Privacy-Preserving Federated Learning |
| DOI | Digital Object Identifier |
| EER | Equal Error Rate |
| FL | Federated Learning |
| FNR | False Negative Rate |
| FPR | False Positive Rate |
| GDPR | General Data Protection Regulation |
| IID | Independent and identically distributed |
| IMPRESS-U | International Multilateral Partnerships for Resilient Education and Science System in Ukraine |
| IMT-2020 | International Mobile Telecommunications 2020 |
| ITU-T | International Telecommunication Union Telecommunication Standardization Sector |
| LA | Logical Access |
| LFCC | Linear-Frequency Cepstral Coefficient |
| MAD | Median Absolute Deviation |
| MLP | Multilayer Perceptron |
| NAS | U.S. National Academy of Sciences |
| non-IID | Not independent and identically distributed |
| ONRG | Office of Naval Research Global |
| PPFPL | Cross-Silo Privacy-Preserving Federated Prototype Learning Against Data Poisoning Attacks |
| RFLPA | Robust Federated Learning Framework Against Poisoning Attacks with Secure Aggregation |
| ROC | Receiver Operating Characteristic |
| STCU | Science and Technology Center in Ukraine |
| t-DCF | tandem detection cost function |
| TPR | True Positive Rate |
| TTS | Text-to-Speech |
| VC | Voice Conversion |
| VoIP | Voice over Internet Protocol |
Appendix A. Historical Dependent-Split Audio Results and Corrected Split Audit
The table below preserves the historical single-seed pooled/FedAvg/FedProx comparison for auditability. It is no longer principal evidence because the row-wise 2021 holdout is source dependent and the pooled/federated training protocols are unmatched. The old 1.923% FedAvg value must therefore not be interpreted as independent-recording performance or as evidence that federation outperforms pooled training.
Table A1.
Historical audio comparison retained for provenance only.
| Approach | EER, 2019 LA eval (%) | min t-DCF, 2019 LA | EER, row-wise 2021 holdout (%) |
|---|---|---|---|
| Pooled centralized reference | 0.979 | 0.02879 | 2.358 |
| FedAvg, 15 rounds | 1.091 | 0.03212 | 1.923 |
| FedProx, , 15 rounds | 4.541 | 0.13560 | 11.529 |
Table A2.
Corrected Client-C source-disjoint split sizes. Every row has zero canonical-source, audio-source, and TTS-source-text overlap between the holdout and the complete A+B+C fit pool.
Table A2.
Corrected Client-C source-disjoint split sizes. Every row has zero canonical-source, audio-source, and TTS-source-text overlap between the holdout and the complete A+B+C fit pool.
| Seed | Train | Holdout | Train bona fide | Holdout bona fide | Train spoof | Holdout spoof |
|---|---|---|---|---|---|---|
| 42 | 145,364 | 36,202 | 13,938 | 4,514 | 131,426 | 31,688 |
| 123 | 145,233 | 36,333 | 13,739 | 4,713 | 131,494 | 31,620 |
| 2026 | 144,330 | 37,236 | 13,804 | 4,648 | 130,526 | 32,588 |
| 31415 | 145,925 | 35,641 | 13,892 | 4,560 | 132,033 | 31,081 |
| 65537 | 145,936 | 35,630 | 14,010 | 4,442 | 131,926 | 31,188 |
Table A3.
Per-seed EERs (%) for the corrected matched audio comparison.
| Seed | Pooled | FedAvg | Local A | Local B | Local C |
|---|---|---|---|---|---|
| 42 | 3.612 | 4.099 | 20.428 | 33.086 | 3.808 |
| 123 | 3.230 | 4.637 | 21.198 | 33.014 | 3.776 |
| 2026 | 3.851 | 4.539 | 23.543 | 33.605 | 4.367 |
| 31415 | 4.449 | 4.911 | 22.095 | 34.411 | 4.321 |
| 65537 | 4.036 | 4.926 | 22.154 | 32.871 | 4.205 |
Appendix B. Archived Audio Poisoning Grid
Table A4 reproduces the complete poisoning/defense grid from the archived poisoning/defense CSV and histories. Values are means over the final five of 15 rounds. The original defense settings are now recoverable: clipping threshold 20.0, trimmed-mean , and uncertainty screening with 10 Monte Carlo Dropout passes and a 2.5-MAD threshold. The uncertainty rule uses the first 2,000 ASVspoof 2019 evaluation embeddings as its coordinator-side reference slice; therefore, its 2019-domain EER values are exploratory diagnostics rather than independent evaluation.
Table A4.
Audio poisoning/defense grid recorded in the original case study. The 2019 column is diagnostic after 2021 training.
Table A4.
Audio poisoning/defense grid recorded in the original case study. The 2019 column is diagnostic after 2021 training.
| Compromised | Defense | EER 2019 (%) | EER 2021 holdout (%) | Honest FPR (%) |
|---|---|---|---|---|
| 0% | None | 2.02 | 4.03 | – |
| 0% | Norm clipping | 2.15 | 4.16 | – |
| 0% | Trimmed mean | 2.30 | 5.56 | – |
| 0% | Uncertainty screening | 2.02 | 4.09 | 10.0 |
| 10% | None | 2.83 | 4.50 | – |
| 10% | Norm clipping | 3.31 | 4.74 | – |
| 10% | Trimmed mean | 3.85 | 5.90 | – |
| 10% | Uncertainty screening | 3.45 | 5.15 | 26.7 |
| 20% | None | 3.83 | 3.42 | – |
| 20% | Norm clipping | 5.92 | 5.52 | – |
| 20% | Trimmed mean | 3.32 | 1.68 | – |
| 20% | Uncertainty screening | 2.59 | 4.43 | 17.5 |
| 30% | None | 1.37 | 8.54 | – |
| 30% | Norm clipping | 1.91 | 0.96 | – |
| 30% | Trimmed mean | 0.20 | 12.51 | – |
| 30% | Uncertainty screening | 3.63 | 4.64 | 2.9 |
A deterministic post-hoc summary across attacked levels (10–30%) and both evaluation domains is provided in the reproducibility package. It is descriptive rather than inferential because the audio grid is not a multi-seed experiment.
Appendix C. Controlled Assumption and Sensitivity Analyses
The following controlled analyses support the main-text interpretation but are secondary to the primary update-cancellation and malicious-weight results. They use the same 20-seed protocol and Student-t confidence intervals described in Section 4.8.
Appendix C.1. IID/Non-IID Heterogeneity Ablation
The IID/non-IID ablation in Table A5 corrects an overly simple interpretation that Multi-Krum’s honest-client exclusions are caused by non-IID data alone. Increasing heterogeneity clearly makes the classification problem harder: unprotected pooled EER rises from 8.41% at to 9.60% at . However, at 20% compromise the Multi-Krum honest-client FPR remains near 25–26% across all three heterogeneity levels. Much of that exclusion is therefore structural to the chosen output cardinality rather than a direct consequence of non-IID data.
Table A5.
Heterogeneity ablation at 20% compromised clients. Values are mean ± Student-t 95% CI half-width across 20 seeds. TPR/FPR are shown for client-selection defenses.
Table A5.
Heterogeneity ablation at 20% compromised clients. Values are mean ± Student-t 95% CI half-width across 20 seeds. TPR/FPR are shown for client-selection defenses.
| Condition | FedAvg EER | Multi-Krum EER | TPR/FPR | Uncertainty EER | TPR/FPR |
|---|---|---|---|---|---|
| IID () | 8.41 ± 0.25 | 8.28 ± 0.25 | 99.5/25.1 | 8.40 ± 0.25 | 0.5/1.2 |
| Mild () | 8.80 ± 0.32 | 8.64 ± 0.32 | 96.0/26.0 | 8.80 ± 0.32 | 0.0/0.8 |
| Full non-IID () | 9.60 ± 0.34 | 9.40 ± 0.32 | 96.5/25.9 | 9.57 ± 0.33 | 0.0/0.8 |
Appendix C.2. Defense-Parameter Sensitivity
At an actual 30% compromise rate, changing the assumed adversarial count in Multi-Krum changes the balance between malicious rejection and honest exclusion (Table A6). Using the true rejects the largest malicious fraction but also removes 37.0% of honest clients and does not minimize EER. Trimmed mean similarly changes modestly across . These results show that robust-aggregation performance depends on defense hyperparameters and on information that may be unavailable to a real coordinator.
Table A6.
Defense-parameter sensitivity at 30% actual compromise. EER is mean ± Student-t 95% CI half-width across 20 seeds.
Table A6.
Defense-parameter sensitivity at 30% actual compromise. EER is mean ± Student-t 95% CI half-width across 20 seeds.
| Defense | Setting | Pooled EER (%) | TPR / FPR (%) |
|---|---|---|---|
| Trimmed mean | 9.93 ± 0.36 | – | |
| Trimmed mean | 9.77 ± 0.37 | – | |
| Trimmed mean | 9.76 ± 0.39 | – | |
| Multi-Krum | 9.51 ± 0.35 | 73.7 / 11.3 | |
| Multi-Krum | 9.59 ± 0.36 | 77.3 / 24.0 | |
| Multi-Krum | 9.71 ± 0.35 | 80.3 / 37.0 |
Appendix C.3. FedProx Sensitivity under an Equal Training Horizon
The clean 30-round synthetic sweep addresses the interpretive weakness of the single 15-round audio FedProx comparison. Pooled EER means remain within a narrow range and all Student-t confidence intervals overlap substantially. The lowest mean occurs at (9.08±0.34%), but this does not establish an audio-task optimum; it only shows that the earlier FedProx gap cannot be generalized from one and one short horizon.
Table A7.
Clean FedProx sensitivity over an equal 30-round horizon. Values are mean ± Student-t 95% CI half-width across 20 seeds.
Table A7.
Clean FedProx sensitivity over an equal 30-round horizon. Values are mean ± Student-t 95% CI half-width across 20 seeds.
| Pooled EER (%) | TTS-heavy EER (%) | VC-heavy EER (%) | Channel-degraded EER (%) | |
|---|---|---|---|---|
| 0 (FedAvg) | 9.18 ± 0.28 | 5.65 ± 0.41 | 8.65 ± 0.42 | 11.34 ± 0.46 |
| 0.001 | 9.17 ± 0.28 | 5.68 ± 0.39 | 8.66 ± 0.44 | 11.30 ± 0.45 |
| 0.01 | 9.16 ± 0.28 | 5.70 ± 0.42 | 8.66 ± 0.42 | 11.33 ± 0.49 |
| 0.1 | 9.20 ± 0.29 | 5.67 ± 0.43 | 8.74 ± 0.44 | 11.39 ± 0.47 |
| 1 | 9.08 ± 0.34 | 5.71 ± 0.44 | 8.36 ± 0.45 | 11.28 ± 0.59 |
Figure A1.
Equal-horizon FedProx sensitivity in the controlled clean surrogate. Error bars are Student-t 95% CI half-widths across 20 seeds.
Figure A1.
Equal-horizon FedProx sensitivity in the controlled clean surrogate. Error bars are Student-t 95% CI half-widths across 20 seeds.

Appendix D. Additional Architecture, Optimizer, and Threat Analyses
Appendix D.1. FedProx under 30% Untargeted Label Flipping
Table A8.
FedProx sensitivity under 30% untargeted label flipping over the same 15-round horizon. Values are mean ± Student-t 95% CI half-width across 20 seeds.
Table A8.
FedProx sensitivity under 30% untargeted label flipping over the same 15-round horizon. Values are mean ± Student-t 95% CI half-width across 20 seeds.
| Pooled EER (%) | Benign–malicious cosine | Aggregate/benign norm ratio | |
|---|---|---|---|
| 0 | 10.36 ± 0.47 | -0.702 ± 0.031 | 0.499 ± 0.036 |
| 0.01 | 10.37 ± 0.45 | -0.703 ± 0.030 | 0.498 ± 0.036 |
| 0.1 | 10.39 ± 0.45 | -0.715 ± 0.030 | 0.489 ± 0.036 |
| 1 | 11.07 ± 0.59 | -0.782 ± 0.025 | 0.436 ± 0.035 |
Appendix D.2. Additional Multi-Threat Selection Diagnostics
For Multi-Krum at 30% compromise, mean malicious-client TPR / honest-client FPR is 76.0/38.9% for untargeted label flipping, 50.0/50.0% for targeted spoof-to-bona-fide poisoning, 51.7/49.3% for the trigger backdoor, 0.0/71.4% for zero-update free riding, and 100.0/28.6% for coordinated sign flipping. These attack-dependent values illustrate why a single client-selection rate cannot characterize a robust aggregator. Complete per-seed values, standard deviations, and confidence intervals are retained in results/revision_threat/ in the reproducibility package.
Appendix E. Controlled Gaussian Generator Parameterization
The controlled surrogate uses independent Gaussian coordinates, , with 32 dimensions. At full heterogeneity (), the domain parameters are listed in Table A9. The common bona-fide base mean is the zero vector. The common spoof base mean adds 1.20 to dimensions 1–8. Domain shifts apply to both classes; additional spoof shifts apply only to spoof samples. At , all domain-specific shifts and additional spoof shifts are zero, the training spoof prior is the mean of the three target priors (0.8913667), and the Gaussian standard deviation is the mean target scale (1.1666667). For intermediate h, priors and scales are linearly interpolated between their common and domain-specific values, while all domain-specific mean shifts are multiplied by h. Test and trusted-reference sets use a 0.5 spoof prior regardless of h.
Table A9.
Exact full-heterogeneity () parameters of the controlled Gaussian generator. Dimension ranges are 1-indexed for readability.
Table A9.
Exact full-heterogeneity () parameters of the controlled Gaussian generator. Dimension ranges are 1-indexed for readability.
| Parameter | Bank-likedomain | Operator-likedomain | VoIP-likedomain |
|---|---|---|---|
| Training spoof prior | 0.9214 | 0.8543 | 0.8984 |
| Gaussian standard deviation | 1.00 | 1.15 | 1.35 |
| All-class domain shift | none | on dims. 1–5 | on dims. 6–10 |
| Additional spoof shift | none | on dims. 9–14 | on dims. 15–20 |
References
- Mai, K.T.; Bray, S.; Davies, T.; Griffin, L.D. Warning: Humans Cannot Reliably Detect Speech Deepfakes. PLOS ONE 2023, 18, e0285333. [CrossRef]
- Tahaoglu, G.; Baracchi, D.; Shullani, D.; Iuliani, M.; Piva, A. Deepfake Audio Detection with Spectral Features and ResNeXt-Based Architecture. Knowledge-Based Systems 2025, 323, 113726. [CrossRef]
- Liu, R.; Zhang, J.; Li, H. Hierarchical Multi-Source Cues Fusion for Mono-to-Binaural Based Audio Deepfake Detection. Information Fusion 2025, 120, 103097. [CrossRef]
- Han, S.; Seo, J.; Choi, S.; Kang, T.; Chung, S.; Lee, S.; Park, S.; Oh, S.; Kwak, I.Y. Enhancing Voice Spoofing Detection in Noisy Environments Using Frequency Feature Masking Augmentation. Engineering Science and Technology, an International Journal 2025, 63, 101972. [CrossRef]
- Tran, Q.M.; Zong, W.; Chow, Y.W.; Susilo, W. Evaluating Adversarial Robustness of Deepfake Audio Detectors and Vocoder Fingerprint Detectors Against Universal Adversarial Perturbations. Future Internet 2026, 18, 344. [CrossRef]
- Serhiienko, I.O.; Artemchuk, V.O. Review of Modern Approaches and Problems in Detecting Voice Deepfakes. Science and Technology Today 2025, 52, 2685–2705. [CrossRef]
- McMahan, H.B.; Moore, E.; Ramage, D.; Hampson, S.; Aguera y Arcas, B. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS), 2017, Vol. 54, pp. 1273–1282.
- Mei, H.; Li, G.; Wu, J.; Zheng, L. Privacy Inference-Empowered Stealthy Backdoor Attack on Federated Learning under Non-IID Scenarios. In Proceedings of the Proceedings of the International Joint Conference on Neural Networks, 2023, Vol. 2023-June. [CrossRef]
- Chen, X.; Tian, Y.; Wang, S.; Yang, K.; Zhao, W.; Xiong, J. DBFL: Dynamic Byzantine-Robust Privacy Preserving Federated Learning in Heterogeneous Data Scenario. Information Sciences 2025, 700. [CrossRef]
- Zhang, H.; Yu, J.; Xu, F.; Hu, C.; Zhang, Y.; Wang, X.; Yu, Z.; Zhang, X. PPFPL: Cross-Silo Privacy-Preserving Federated Prototype Learning Against Data Poisoning Attacks. IEEE Transactions on Artificial Intelligence 2026, 7, 3544 – 3560. [CrossRef]
- Fang, C.; Chang, D.; Li, Y.; Yang, F.; Liu, Y.; Ma, B. A Robust Privacy-Preserving Federated Learning Method Against Poisoning Attacks on Non-IID Data. IEEE Internet of Things Journal 2026, 13, 15943 – 15958. [CrossRef]
- Khang, T.T.; Duc, T.H.; Huynh, D.V.; Pham, V.H.; Duy, P.T. P4P: A probe-guided anti-poisoning defense for federated learning-based intrusion detection in IoT networks under non-IID data. Journal of Network and Computer Applications 2026, 251. [CrossRef]
- Wang, Y.; Song, Y.; Jiang, D.; Ding, Y.; Wang, X.; Liu, Y.; Liao, Q. FedSP: Federated Speaker Verification with Personal Privacy Preservation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2022, 13157 LNCS, 462 – 478. [CrossRef]
- Meng, D.; Wang, X.; Wang, J. Backdoor Attack Against Automatic Speaker Verification Models in Federated Learning. In Proceedings of the ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 2023, Vol. 2023-June. [CrossRef]
- Blfgeh, A.; Ardah, H. Cognitive-Inspired Multimodal Deepfake Detection Using Privacy-Preserving Federated Intelligence. Cognitive Computation 2026, 18. [CrossRef]
- Manzoor, H.U.; Javed, A.; Mir, J.; Yousaf, M.H.; Manzoor, S.; Zoha, A. FedMaxAdapt: Gradient-Guided Adaptive Sparsity for Scalable Multi-Modal Federated Deepfake Detection. In Proceedings of the 7th International Conference on Robotics and Automation in Industry, ICRAI 2026, 2026. [CrossRef]
- Fan, C.; Tang, Z.; Xue, J.; Cao, J.; Lv, Z.; Wen, Z.; Tao, J. FLADD: Federated Learning-Based Privacy Protection for Audio Deepfake Detection. IEEE Transactions on Audio, Speech and Language Processing 2026, 34, 4203–4215. [CrossRef]
- Mohammadi, A.; Sood, K.; Thiruvady, D.; Nazari, A. Physics-Guided Deepfake Detection for Voice Authentication Systems, 2025. arXiv:2512.06040.
- Yamagishi, J.; Wang, X.; Todisco, M.; Sahidullah, M.; Patino, J.; Nautsch, A.; Liu, X.; Lee, K.A.; Kinnunen, T.; Evans, N.; et al. ASVspoof 2021: Accelerating Progress in Spoofed and Deepfake Speech Detection. In Proceedings of the Proceedings of the 2021 Edition of the Automatic Speaker Verification and Spoofing Countermeasures Challenge, 2021, pp. 47–54. [CrossRef]
- ASVspoof Consortium. ASVspoof 2021: Challenge Data, Protocols, Keys and 2019–2021 Metadata Mapping. Available online: https://www.asvspoof.org/index2021.html, 2026. accessed on 30 August 2026.
- Wang, X.; Yamagishi, J.; Todisco, M.; Delgado, H.; Nautsch, A.; Evans, N.; Sahidullah, M.; Vestman, V.; Kinnunen, T.; Lee, K.A.; et al. ASVspoof 2019: A Large-Scale Public Database of Synthesized, Converted and Replayed Speech. Computer Speech & Language 2020, 64, 101114. [CrossRef]
- Wang, X.; Delgado, H.; Tak, H.; Jung, J.w.; Shim, H.j.; Todisco, M.; Kukanov, I.; Liu, X.; Sahidullah, M.; Kinnunen, T.; et al. ASVspoof 5: Design, Collection and Validation of Resources for Spoofing, Deepfake, and Adversarial Attack Detection Using Crowdsourced Speech. Computer Speech & Language 2026, 95, 101825. [CrossRef]
- Kinnunen, T.; Lee, K.A.; Delgado, H.; Evans, N.; Todisco, M.; Sahidullah, M.; Yamagishi, J.; Reynolds, D.A. t-DCF: A Detection Cost Function for the Tandem Assessment of Spoofing Countermeasures and Automatic Speaker Verification. In Proceedings of the Speaker Odyssey 2018: The Speaker and Language Recognition Workshop, 2018, pp. 312–319. [CrossRef]
- Tak, H.; Patino, J.; Todisco, M.; Nautsch, A.; Evans, N.; Larcher, A. End-to-End Anti-Spoofing with RawNet2. In Proceedings of the 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2021, pp. 6369–6373. [CrossRef]
- Jung, J.w.; Heo, H.S.; Tak, H.; Shim, H.j.; Chung, J.S.; Lee, B.J.; Yu, H.J.; Evans, N. AASIST: Audio Anti-Spoofing Using Integrated Spectro-Temporal Graph Attention Networks. In Proceedings of the 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2022, pp. 6367–6371. [CrossRef]
- Chen, S.; Wang, C.; Chen, Z.; Wu, Y.; Liu, S.; Chen, Z.; Li, J.; Kanda, N.; Yoshioka, T.; Xiao, X.; et al. WavLM: Large-Scale Self-Supervised Pre-Training for Full Stack Speech Processing. IEEE Journal of Selected Topics in Signal Processing 2022, 16, 1505–1518. [CrossRef]
- Meng, Y.; Li, J.; Zhu, H.; Tian, Y.; Chen, J. Privacy-Preserving Liveness Detection for Securing Smart Voice Interfaces. IEEE Transactions on Dependable and Secure Computing 2024, 21, 2900 – 2916. [CrossRef]
- Albathan, M. ForenVoice-Secure: Robust and Privacy-Aware Audio Data Mining for Forensic Speaker Identification. International Journal of Advanced Computer Science and Applications 2026, 17, 153 – 168. [CrossRef]
- Gong, X.; Chen, Y.; Wang, Q.; Kong, W. Backdoor Attacks and Defenses in Federated Learning: State-of-the-Art, Taxonomy, and Future Directions. IEEE Wireless Communications 2023, 30, 114 – 121. [CrossRef]
- Blanchard, P.; El Mhamdi, E.M.; Guerraoui, R.; Stainer, J. Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent. In Proceedings of the Advances in Neural Information Processing Systems, 2017, Vol. 30.
- Xie, C.; Chen, M.; Chen, P.Y.; Li, B. CRFL: Certifiably Robust Federated Learning Against Backdoor Attacks. In Proceedings of the Proceedings of the 38th International Conference on Machine Learning, 2021.
- Mai, P.; Yan, R.; Pang, Y. RFLPA: A Robust Federated Learning Framework Against Poisoning Attacks with Secure Aggregation. In Proceedings of the Advances in Neural Information Processing Systems, 2024, Vol. 37. [CrossRef]
- Jeong, H.; Son, H.; Lee, S.; Hyun, J.; Chung, T.M. FedCC: Robust Federated Learning Against Model Poisoning Attacks. In Security and Privacy in Communication Networks: 21st EAI International Conference, SecureComm 2025, Proceedings, Part II; Springer Nature Switzerland, 2026; pp. 180–201. Originally released as arXiv:2212.01976 in 2022, https://doi.org/. [CrossRef]
- Wang, J.; Wang, R.; Li, Z.; Zhang, F.; Li, J.; Li, X. A Byzantine-Robust Secure Federated Learning Scheme in Heterogeneous Data. IEEE Transactions on Information Forensics and Security 2026, 21, 7287 – 7300. [CrossRef]
- Latif, N.; Ma, W.; Ahmad, H.B. FedDBC: A density-based defense against collusion attacks in federated intrusion detection for IoT networks. Computer Networks 2026, 286. [CrossRef]
- Zukaib, U.; Cui, X.; Niaz, F.; Liang, D.; Zheng, C.; Din, S.U. Defending federated learning-based intrusion detection systems against model poisoning attacks. Neurocomputing 2026, 698. [CrossRef]
- Thein, T.T.; Shiraishi, Y.; Morii, M. Personalized federated learning-based intrusion detection system: Poisoning attack and defense. Future Generation Computer Systems 2024, 153, 182 – 192. [CrossRef]
- Ovi, P.R.; Gangopadhyay, A. Robust Federated Learning Against Data Poisoning Attacks: Prevention and Detection of Attacked Nodes. Electronics (Switzerland) 2025, 14. [CrossRef]
- Li, T.; Sahu, A.K.; Zaheer, M.; Sanjabi, M.; Talwalkar, A.; Smith, V. Federated Optimization in Heterogeneous Networks. Proceedings of Machine Learning and Systems 2020, 2, 429–450.
- Song, Z.; Tan, W.; Wang, H.; Zhang, G.; Weng, J. Dual-Factor Adaptive Robust Aggregation for Secure Federated Learning in IoT Networks. Future Internet 2026, 18, 201. [CrossRef]
- Liu, J.; Zeng, Y.; Wang, Z.; Zhang, W.; Tong, Y. Differentially Private Federated Learning with Adaptive Clipping Thresholds. Future Internet 2026, 18, 148. [CrossRef]
- Wang, S.; Tian, Y.; Xiong, J.; Bi, R.; Ma, J.; Zhang, Y. PriDFL: Computation-Optimized Secure Aggregation With Byzantine-Resilient in Decentralized Federated Learning. IEEE Transactions on Dependable and Secure Computing 2026, 23, 4447 – 4464. [CrossRef]
- European Parliament and Council of the European Union. Regulation (EU) 2016/679 (General Data Protection Regulation), 2016.
- ITU-T. Recommendation Y.3224: In-Network Aggregated Federated Machine Learning Framework in IMT-2020 Networks and Beyond, 2025. International Telecommunication Union Telecommunication Standardization Sector.
- ITU-T. Recommendation F.748.24: Evaluation of Contribution Degree for Federated Machine Learning, 2024. International Telecommunication Union Telecommunication Standardization Sector.
- ITU-T. Recommendation M.3387: Management Requirement for Federated Machine Learning Service, 2024. International Telecommunication Union Telecommunication Standardization Sector.
- ITU-T. Recommendation Y.3172: Architectural Framework for Machine Learning in Future Networks Including IMT-2020, 2019. International Telecommunication Union Telecommunication Standardization Sector.
Figure 3.
Detailed detector, local-training, pre-aggregation audit, and server-aggregation block diagram. Raw audio and frozen representations remain local; only the trainable classifier parameters are exchanged. The compromise point denotes controlled data- or model-update manipulations. Update geometry is computed from client updates before aggregation; quantities that separate benign and malicious subsets are explicitly post-hoc/oracle diagnostics requiring malicious-identity ground truth.
Figure 3.
Detailed detector, local-training, pre-aggregation audit, and server-aggregation block diagram. Raw audio and frozen representations remain local; only the trainable classifier parameters are exchanged. The compromise point denotes controlled data- or model-update manipulations. Update geometry is computed from client updates before aggregation; quantities that separate benign and malicious subsets are explicitly post-hoc/oracle diagnostics requiring malicious-identity ground truth.

Figure 6.
Controlled defense comparison across 20 seeds. Error bars are Student-t 95% CI half-widths. Norm clipping is omitted from the figure because it nearly overlaps unprotected FedAvg under the calibrated threshold.
Figure 6.
Controlled defense comparison across 20 seeds. Error bars are Student-t 95% CI half-widths. Norm clipping is omitted from the figure because it nearly overlaps unprotected FedAvg under the calibrated threshold.

Table 1.
Positioning relative to closely related federated speech/deepfake studies.
| Study | Task / setting | Primary FL contribution | Relation to the present integrity question |
|---|---|---|---|
| FedSP [13] | Speaker verification | Privacy-preserving federated speaker verification | Establishes federated speech authentication; does not study deepfake-detector poisoning/update cancellation. |
| Meng et al. [14] | Federated speaker verification | Backdoor attack | Establishes adversarial risk in federated voice systems; attack-oriented rather than a cross-silo detector/defense diagnostic framework. |
| Blfgeh and Ardah [15] | Multimodal deepfake detection | Federated multimodal fusion and privacy mechanisms | Detection/fusion emphasis; poisoning and update-geometry diagnostics are not the evaluation target. |
| FedMaxAdapt [16] | Audio/video deepfake detection | Gradient-guided adaptive sparsity | Communication-efficiency emphasis; provides a recent audio FL baseline but not a poisoning-integrity study. |
| FLADD [17] | Audio deepfake detection | Dual-branch detector, adaptive weighting, dual prototypes | Closest recent audio-FL detector; optimized for detection/privacy under its own protocol, not for malicious-client update diagnostics. |
| This study | Cross-silo deepfake speech detection | Heterogeneity-aware integrity diagnostics with archived provenance | Jointly evaluates domain heterogeneity, poisoning/robust aggregation, malicious weight, client-selection error, and update geometry. |
Table 2.
Quantitative context from recent federated deepfake-detection studies. Reported values are copied at the level supported by the cited publications and are not directly comparable across rows because evaluation protocols differ.
Table 2.
Quantitative context from recent federated deepfake-detection studies. Reported values are copied at the level supported by the cited publications and are not directly comparable across rows because evaluation protocols differ.
| Study | Published evaluation setting | Published detection result | Comparability note |
|---|---|---|---|
| Blfgeh and Ardah [15] | FoR audio component of a multimodal framework | 98.32% accuracy | Different dataset, metric, architecture, and multimodal objective. |
| FedMaxAdapt [16] | FoR audio, 10 clients | 91.0% accuracy; 94.5% for its FedAvg baseline | Different dataset/metric; method targets sparsity and reports a 40.3% audio-bandwidth reduction at 50% maximum sparsity. |
| FLADD [17] | ASVspoof 2019 LA and ASVspoof 2021 LA evaluations | Best EER 0.285% and 2.045%, respectively | Closest dataset family, but different architecture, aggregation, partition/training protocol, and official evaluation role. |
| This study | Five source-disjoint ASVspoof-2021 client-domain splits | FedAvg EER 4.622 ± 0.420% (95% CI half-width) | Matched five-seed protocol; still a repurposed within-corpus client-domain evaluation, not an official challenge test or head-to-head FLADD reproduction. |
Table 4.
Corrected source-disjoint matched audio comparison over five seeds on the common Client-C holdout. Values are mean EER ± Student-t 95% CI half-width. All methods use the same classifier, initialization within seed, global class weights, batch size, learning rate, 45-pass budget, and fixed endpoint; pooled/FedAvg use the same fit-data pool.
Table 4.
Corrected source-disjoint matched audio comparison over five seeds on the common Client-C holdout. Values are mean EER ± Student-t 95% CI half-width. All methods use the same classifier, initialization within seed, global class weights, batch size, learning rate, 45-pass budget, and fixed endpoint; pooled/FedAvg use the same fit-data pool.
| Approach | Mean EER (%) | 95% CI half-width | Interpretive role |
|---|---|---|---|
| Pooled centralized, matched | 3.836 | 0.567 | Matched non-federated reference |
| FedAvg, matched | 4.622 | 0.420 | Cross-silo collaboration |
| Local C only | 4.095 | 0.352 | Dominant channel-degraded silo |
| Local A only | 21.883 | 1.451 | A-only cross-domain transfer |
| Local B only | 33.398 | 0.783 | B-only cross-domain transfer |
Table 6.
Representative recorded update geometry for 30% compromised clients with unprotected FedAvg.
Table 6.
Representative recorded update geometry for 30% compromised clients with unprotected FedAvg.
| Round |
|
||
|---|---|---|---|
| 1 | 13.364 | 18.946 | |
| 8 | 1.841 | 2.540 | |
| 15 | 1.327 | 1.961 |
Table 9.
Transient pooled-EER behavior. Fractions and EER deltas are summarized as means ± Student-t 95% CI half-widths across 20 seeds; seed–round counts are descriptive. Positive EER delta denotes worse average performance under poisoning.
Table 9.
Transient pooled-EER behavior. Fractions and EER deltas are summarized as means ± Student-t 95% CI half-widths across 20 seeds; seed–round counts are descriptive. Positive EER delta denotes worse average performance under poisoning.
| Compromised (%) | Improved seed–rounds (descriptive) | Mean within-seed fraction (%) | Mean EER delta (p.p.) |
|---|---|---|---|
| 10 | 28/300 | 9.33 ± 5.94 | 0.87 ± 0.13 |
| 20 | 25/300 | 8.33 ± 5.25 | 2.04 ± 0.26 |
| 30 | 0/300 | 0.00 ± 0.00 | 4.53 ± 0.91 |
Table 10.
Architecture sensitivity at 30% random-client untargeted label flipping. Values are mean ± Student-t 95% CI half-width across 20 seeds.
Table 10.
Architecture sensitivity at 30% random-client untargeted label flipping. Values are mean ± Student-t 95% CI half-width across 20 seeds.
| Classifier | Clean EER (%) | Attacked EER (%) | Cosine | Norm ratio |
|---|---|---|---|---|
| Linear | 13.12 ± 0.54 | 14.29 ± 0.62 | -0.721 ± 0.024 | 0.486 ± 0.032 |
| MLP | 9.76 ± 0.36 | 11.52 ± 0.60 | -0.701 ± 0.028 | 0.504 ± 0.035 |
| MLP | 9.17 ± 0.33 | 10.32 ± 0.43 | -0.704 ± 0.029 | 0.497 ± 0.035 |
| MLP | 9.12 ± 0.25 | 10.07 ± 0.42 | -0.686 ± 0.037 | 0.514 ± 0.040 |
Table 11.
Multi-threat controlled stress test at 30% compromised clients. EER values are mean ± Student-t 95% CI half-width over 20 seeds. Geometry columns use the unprotected raw client updates before aggregation defense.
Table 11.
Multi-threat controlled stress test at 30% compromised clients. EER values are mean ± Student-t 95% CI half-width over 20 seeds. Geometry columns use the unprotected raw client updates before aggregation defense.
| Attack | FedAvg EER (%) | Trimmed-mean EER (%) | Multi-Krum EER (%) | Raw-update signature |
|---|---|---|---|---|
| Untargeted label flip | 10.40 ± 0.46 | 9.80 ± 0.35 | 9.70 ± 0.34 | ; ratio 0.500 |
| Targeted spoof→bona fide | 10.46 ± 0.47 | 9.78 ± 0.31 | 10.50 ± 0.31 | ; ratio 0.513 |
| Trigger backdoor | 9.60 ± 0.34 | 9.36 ± 0.35 | 9.94 ± 0.31 | ; ratio 0.633 |
| Zero-update free rider | 9.74 ± 0.33 | 9.49 ± 0.33 | 11.20 ± 0.47 | cosine undefined; ratio 0.700 |
| Coordinated sign flip | 62.61 ± 6.99 | 21.27 ± 1.14 | 9.58 ± 0.34 | ; ratio 0.591 |
Table 14.
Fixed-identity malicious-weight control. The same malicious clients and local data are used at all three settings; only their total server aggregation mass changes. Values are mean ± Student-t 95% CI half-width across 20 seeds.
Table 14.
Fixed-identity malicious-weight control. The same malicious clients and local data are used at all three settings; only their total server aggregation mass changes. Values are mean ± Student-t 95% CI half-width across 20 seeds.
| Malicious mass (%) | Pooled EER (%) | Benign–malicious cosine | Aggregate/benign norm ratio |
|---|---|---|---|
| 15 | 9.58 ± 0.35 | -0.473 ± 0.016 | 0.752 ± 0.007 |
| 30 | 10.17 ± 0.33 | -0.702 ± 0.011 | 0.499 ± 0.008 |
| 45 | 22.66 ± 1.46 | -0.826 ± 0.009 | 0.316 ± 0.008 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.