MingledPie: A Cluster Mingling Approach for Mitigating Preference Profiling in CFL

Clustered federated learning (CFL) serves as a promising framework to address the challenges of non-IID (non-Independent and Identically Distributed) data and heterogeneity in federated learning.It involves grouping clients into clusters based on the similarity of their data distributions or model updates.However, classic CFL frameworks pose severe threats to clients' privacy since the honest-but-curious server can easily know the bias of clients' data distributions (its preferences).In this work, we propose a privacy-enhanced clustered federated learning framework, MingledPie, aiming to resist against servers' preference profiling capabilities by allowing clients to be grouped into multiple clusters spontaneously.Specifically, within a given cluster, we mingled two types of clients in which a major type of clients share similar data distributions while a small portion of them do not (false positive clients).Such that, the CFL server fails to link clients' data preferences based on their belonged cluster categories.To achieve this, we design an indistinguishable cluster identity generation approach to enable clients to form clusters with a certain proportion of false positive members without the assistance of a CFL server.Meanwhile, training with mingled false positive clients will inevitably degrade the performances of the cluster's global model.To rebuild an accurate cluster model, we represent the mingled cluster models as a system of linear equations consisting of the accurate models and solve it.Rigid theoretical analyses are conducted to evaluate the usability and security of the proposed designs.In addition, extensive evaluations of MingledPie on six open-sourced datasets show that it defends against preference profiling attacks with an accuracy of 69.4% on average.Besides, the model accuracy loss is limited to between 0.02% and 3.00%.

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.14722/ndss.2025.240195
Primary Topic
Web Applications and Data Management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MingledPie: A Cluster Mingling Approach for Mitigating Preference Profiling in CFL

Jihua Tan, Jin Wang, Cheng Zhang, Yang Xu et al.
Web Applications and Data Management
article

MingledPie: A Cluster Mingling Approach for Mitigating Preference Profiling in CFL

Jihua Tan, Jin Wang, Cheng Zhang, Yang Xu, Jing An
article en

Abstract

Clustered federated learning (CFL) serves as a promising framework to address the challenges of non-IID (non-Independent and Identically Distributed) data and heterogeneity in federated learning.It involves grouping clients into clusters based on the similarity of their data distributions or model updates.However, classic CFL frameworks pose severe threats to clients' privacy since the honest-but-curious server can easily know the bias of clients' data distributions (its preferences).In this work, we propose a privacy-enhanced clustered federated learning framework, MingledPie, aiming to resist against servers' preference profiling capabilities by allowing clients to be grouped into multiple clusters spontaneously.Specifically, within a given cluster, we mingled two types of clients in which a major type of clients share similar data distributions while a small portion of them do not (false positive clients).Such that, the CFL server fails to link clients' data preferences based on their belonged cluster categories.To achieve this, we design an indistinguishable cluster identity generation approach to enable clients to form clusters with a certain proportion of false positive members without the assistance of a CFL server.Meanwhile, training with mingled false positive clients will inevitably degrade the performances of the cluster's global model.To rebuild an accurate cluster model, we represent the mingled cluster models as a system of linear equations consisting of the accurate models and solve it.Rigid theoretical analyses are conducted to evaluate the usability and security of the proposed designs.In addition, extensive evaluations of MingledPie on six open-sourced datasets show that it defends against preference profiling attacks with an accuracy of 69.4% on average.Besides, the model accuracy loss is limited to between 0.02% and 3.00%.

Risun (China) (CN)
National Natural Science Foundation of China, Natural Science Foundation of Hunan Province, Hunan Provincial Innovation Foundation for Postgraduate, Training Program for Excellent Young Innovators of Changsha
Openalex Percentile: Top 94%
Web Applications and Data Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.