- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes VTR-FL, a federated learning framework addressing selection-censored trust, where excluded clients cannot provide new evidence to recover their reputation. The method separates trust verification from model aggregation through a zero-influence observation channel, recent-evidence-based recovery decisions, and cryptographic commitments for controlled client re-entry. The authors provide theoretical results concerning observability and verification guarantees, alongside experiments on CIFAR-10, Fashion-MNIST, and MNIST reporting improved client recovery and comparable classification accuracy under simulated poisoning scenarios.
Critical strengths
- The paper identifies a relevant problem in reputation-based federated learning, where excluding clients can prevent the collection of evidence needed to restore trust after temporary failures.
- Separating verification from aggregation is a reasonable design choice, and the experiments demonstrate improved client re-entry across multiple datasets under the evaluated recovery scenarios.
Critical weaknesses
- The theoretical novelty is limited. The main results largely formalize intuitive properties, such as the impossibility of detecting recovery without observations and the zero aggregation influence of clients explicitly assigned zero weight. The cryptographic guarantees are similarly conditional on standard assumptions, without establishing substantially new security properties.
- The experimental evaluation is overly simplified and does not convincingly demonstrate robustness in realistic adversarial settings. The main recovery experiment uses temporary label corruption that ends at a predetermined round, while the security evaluations cover relatively narrow attack strategies. Comparisons against simpler periodic auditing and re-entry mechanisms under identical verification budgets are missing, making it difficult to justify the complexity of the proposed framework.
- The claimed verifiability is not adequately demonstrated in practice. Cryptographic operations and certificate verification are simulated rather than implemented, updates are inspected in plaintext, and experiments rely on a fixed authenticated auditor pool and centralized validation data. These strong assumptions significantly limit the practical relevance of the security claims.
- The scalability and performance trade-offs remain insufficiently validated. Experiments use small client populations and relatively simple benchmarks, while verification incurs substantial computation and communication costs. The method also does not consistently outperform competing approaches in classification accuracy, raising questions about its practical advantages.
Questions for authors
- What fundamentally new theoretical guarantees does VTR-FL establish beyond standard observability arguments, inverse-propensity estimation, and cryptographic commitment properties?
- Can the authors compare against a simpler periodic verification and trust-recovery baseline using identical auditing budgets and recovery criteria?
- How would the proposed framework operate without a shared trusted validation pool, fixed authenticated auditors, and access to plaintext client updates? Can the authors demonstrate an actual implementation of the claimed verification protocol?
- How does the method perform against persistent adaptive attackers, colluding clients, and larger heterogeneous federations? Can the authors provide more realistic evaluations of security, communication overhead, and accuracy trade-offs?