FedMIA: An Effective Membership Inference Attack Exploiting "All for One" Principle in Federated Learning
원문 초록
Federated Learning (FL) is a promising approach for training machine learning models on decentralized data while preserving privacy. However, privacy risks, particularly Membership Inference Attacks (MIAs), which aim to determine whether a specific data point belongs to a target client's training set, remain a significant concern. Existing methods for implementing MIAs in FL primarily analyze updates from the target client, focusing on metrics such as loss, gradient norm, and gradient difference. However, these methods fail to leverage updates from non-target clients, potentially underutilizing available information. In this paper, we first formulate a one-tailed likelihood-ratio hypothesis test based on the likelihood of updates from non-target clients. Building upon this formulation, we introduce a three-step Membership Inference Attack (MIA) method, called FedMIA, which follows the "all for one"--leveraging updates from all clients across multiple communication rounds to enhance MIA effectiveness. Both theoretical analysis and extensive experimental results demonstrate that FedMIA outperforms existing MIAs in both classification and generative tasks. Additionally, it can be integrated as an extension to existing methods and is robust against various defense strategies, Non-IID data, and different federated structures. Our code is available in https://github.com/Liar-Mask/FedMIA.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Apollo: A Posteriori Label-Only Membership Inference Attack Towards Machine Unlearning
Orthogonal Soft Pruning for Efficient Class Unlearning
When Better Features Mean Greater Risks: The Performance-Privacy Trade-Off in Contrastive Learning
Membership Inference Attacks on Sequence Models
An Out-Of-Distribution Membership Inference Attack Approach for Cross-Domain Graph Attacks
Answer Complex Questions: Path Ranker Is All You Need
토론
이 논문과 연결된 포럼 글이 아직 없습니다.