- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
SCARFL simplifies AegisFL by letting the server derive the second ciphertext view from the first using a Galois automorphism. This removes a duplicate client upload and the associated consistency exchange while keeping the existing encrypted statistics interface. The paper also proposes GHARC, a robust aggregation rule based on historical-reference similarity, clustering, clipping, and conditional core expansion. Experiments with 30 clients on MNIST and HAR report 43.0-45.7% less round traffic and 9.2-11.0% less round processing time. Robustness is evaluated against random updates, label flipping, and a triggered scaling attack.
Critical strengths
-
The communication savings come from a well-controlled comparison. Single-CT and Dual-CT use the same cryptographic parameters and downstream operations. The measurements include the extra Galois computation and its numerical error. This makes the reported protocol savings convincing.
-
GHARC works within the available encrypted operations. Its decisions require only norms and inner products, so it fits the retained protocol interface. The ablations also show that clustering, clipping, ranking, and core expansion have distinct effects on attack success and training progress.
Critical weaknesses
-
The main protocol contribution is fairly narrow. The main change is to derive AegisFL's second ciphertext view at the server using a standard Galois automorphism. The encrypted statistics interface, key conversion, and overall protocol structure are largely retained. The communication savings are useful, but this is a fairly narrow optimization.
-
The two-server trust assumption limits practical deployment. Privacy relies on the aggregation server and the key-holding server never colluding. This is a strong requirement, if they collude, they can combine the ciphertexts and the secret key to recover individual client updates.
-
The evaluation relies on simple datasets and basic attack settings. The experiments use MNIST and HAR with 30 clients and test Gaussian random updates, label flipping, and a fixed scaling attack. These are established baseline attacks, but they are not enough to assess a new Byzantine defense.
Questions for authors
-
Can SCARFL be adapted to a single-server architecture while preserving update privacy and Byzantine robustness?
-
Could you evaluate the method on more challenging datasets and larger client populations, including stronger coordinated or adaptive attacks that take GHARC's reference and selection rules into account?