Tazza: Shuffling Neural Network Parameters for Secure and Private Federated Learning
Kichang Lee, Jaeho Jin, JaeYeon Park, Songkuk Kim, JeongGil Ko
TL;DR
This work tackles dual security goals in federated learning—privacy of client data and integrity of the global model—by exploiting permutation properties of neural networks. It introduces Tazza, a framework that securely shuffles model weights at the client side and validates shuffled outputs at the server, enabling detection of poisoning and data leakage without sacrificing accuracy. Core contributions include a PBFT-based shuffling-rule exchange, layer-wise weight shuffling with Gaussian perturbations, shuffled-model validation, and cluster-aware aggregation to isolate malicious updates; these are supported by theoretical insights on permutation equivariance/invariance and extensive experiments across datasets and embedded platforms. The results show that Tazza delivers strong defense while maintaining high performance, achieving up to $6.7\times$ speedups over prior schemes and demonstrating practicality for mobile and IoT deployments.
Abstract
Federated learning enables decentralized model training without sharing raw data, preserving data privacy. However, its vulnerability towards critical security threats, such as gradient inversion and model poisoning by malicious clients, remain unresolved. Existing solutions often address these issues separately, sacrificing either system robustness or model accuracy. This work introduces Tazza, a secure and efficient federated learning framework that simultaneously addresses both challenges. By leveraging the permutation equivariance and invariance properties of neural networks via weight shuffling and shuffled model validation, Tazza enhances resilience against diverse poisoning attacks, while ensuring data confidentiality and high model accuracy. Comprehensive evaluations on various datasets and embedded platforms show that Tazza achieves robust defense with up to 6.7x improved computational efficiency compared to alternative schemes, without compromising performance.
