TY - JOUR
T1 - SMSS
T2 - Secure Member Selection Strategy in Federated Learning
AU - Zhao, Kun
AU - Xi, Wei
AU - Wang, Zhi
AU - Zhao, Jizhong
AU - Wang, Ruimeng
AU - Jiang, Zhiping
N1 - Publisher Copyright:
© 2001-2011 IEEE.
PY - 2020/7/1
Y1 - 2020/7/1
N2 - Data security and user privacy-issue have become an important field. As federated learning (FL) could solve the problems from data security and privacy-issue, it starts to be applied in many different applied machine learning tasks. However, FL does not verify the quality of the data from different parties in the system. Hence, the low-quality datasets with fewer common entities can be cotrained with others. This could result in a huge amount of computing-resources waste, and the attack on the FL model from malicious clients as federal members. To solve this problem, this article proposes a secure member selection strategy (SMSS), which can evaluate the data qualities of members before training. With SMSS, only datasets share more common entities than a certain threshold can be selected for learning, whereas malicious clients with fewer common objects cannot acquire any information about the model. This article implements SMSS, and evaluate its performance via several extensive experiments. Experimental results demonstrate that SMSS is safe, efficient, and effective.
AB - Data security and user privacy-issue have become an important field. As federated learning (FL) could solve the problems from data security and privacy-issue, it starts to be applied in many different applied machine learning tasks. However, FL does not verify the quality of the data from different parties in the system. Hence, the low-quality datasets with fewer common entities can be cotrained with others. This could result in a huge amount of computing-resources waste, and the attack on the FL model from malicious clients as federal members. To solve this problem, this article proposes a secure member selection strategy (SMSS), which can evaluate the data qualities of members before training. With SMSS, only datasets share more common entities than a certain threshold can be selected for learning, whereas malicious clients with fewer common objects cannot acquire any information about the model. This article implements SMSS, and evaluate its performance via several extensive experiments. Experimental results demonstrate that SMSS is safe, efficient, and effective.
KW - Federated learning
KW - PSI
KW - Shamir's secret sharing
KW - robust estimation
UR - https://www.scopus.com/pages/publications/85088807771
U2 - 10.1109/MIS.2020.3007207
DO - 10.1109/MIS.2020.3007207
M3 - 文章
AN - SCOPUS:85088807771
SN - 1541-1672
VL - 35
SP - 37
EP - 49
JO - IEEE Intelligent Systems
JF - IEEE Intelligent Systems
IS - 4
M1 - 9136885
ER -