TY - GEN
T1 - Refine and Identify
T2 - 20th IEEE International Wireless Communications and Mobile Computing Conference, IWCMC 2024
AU - Gouissem, A.
AU - Chkirbene, Z.
AU - Khattab, T.
AU - Mabrok, M.
AU - Abdallah, M.
AU - Hamila, R.
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - The identification of malicious users within a large set of participants poses a significant challenge in the domains of cybersecurity, data integrity, user management, and particularly within federated learning (FL) environments. FL, a distributed machine learning approach, necessitates rigorous mechanisms for safeguarding data integrity, model accuracy by effectively managing and identifying malicious participants. Traditional methods require the sequential removal and evaluation of users to determine their impact on the system's overall error rate or loss function, fall short in terms of efficiency and scalability, especially in FL contexts where data is distributed across multiple clients. To address these limitations, we propose the Refine and Identify Algorithm, a two-phased approach that efficiently narrows the search space for identifying malicious users by initially evaluating users in groups rather than individually and iteratively focusing on those groups with the highest potential for containing malicious users. A rigorous mathematical framework, including a proof of convergence and a detailed analysis of iteration necessities, underpins the algorithm's efficacy. The convergence proof and analysis of iteration requirements provide a solid mathematical foundation for the proposed method's effectiveness, paving the way for further optimization and application-specific tuning. Simulation results depict the efficiency of the proposed technique and show a significant reduction in computational resources and time required for identifying malicious users.
AB - The identification of malicious users within a large set of participants poses a significant challenge in the domains of cybersecurity, data integrity, user management, and particularly within federated learning (FL) environments. FL, a distributed machine learning approach, necessitates rigorous mechanisms for safeguarding data integrity, model accuracy by effectively managing and identifying malicious participants. Traditional methods require the sequential removal and evaluation of users to determine their impact on the system's overall error rate or loss function, fall short in terms of efficiency and scalability, especially in FL contexts where data is distributed across multiple clients. To address these limitations, we propose the Refine and Identify Algorithm, a two-phased approach that efficiently narrows the search space for identifying malicious users by initially evaluating users in groups rather than individually and iteratively focusing on those groups with the highest potential for containing malicious users. A rigorous mathematical framework, including a proof of convergence and a detailed analysis of iteration necessities, underpins the algorithm's efficacy. The convergence proof and analysis of iteration requirements provide a solid mathematical foundation for the proposed method's effectiveness, paving the way for further optimization and application-specific tuning. Simulation results depict the efficiency of the proposed technique and show a significant reduction in computational resources and time required for identifying malicious users.
KW - Byzantine attack
KW - FL
KW - computational complexity
KW - convergence analysis
KW - security
UR - http://www.scopus.com/inward/record.url?scp=85199966473&partnerID=8YFLogxK
U2 - 10.1109/IWCMC61514.2024.10592366
DO - 10.1109/IWCMC61514.2024.10592366
M3 - Conference contribution
AN - SCOPUS:85199966473
T3 - 20th International Wireless Communications and Mobile Computing Conference, IWCMC 2024
SP - 1767
EP - 1772
BT - 20th International Wireless Communications and Mobile Computing Conference, IWCMC 2024
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 27 May 2024 through 31 May 2024
ER -