MPCFL: Towards Multi-party Computation for Secure Federated Learning Aggregation

被引:2
|
作者
Kaminaga, Hiroki [1 ]
Awaysheh, Feras M. [2 ]
Alawadi, Sadi [3 ]
Kamm, Liina [1 ]
机构
[1] Cybernetica AS, Informat Secur Res Inst, Tallinn, Estonia
[2] Univ Tartu, Inst Comp Scince, Delta Ctr, Tartu, Estonia
[3] Blekinge Inst Technol, Dept Comp Sci, Karlskrona, Sweden
关键词
Federated Learning; Multi-party Computation; Secret Sharing; Privacy-preserving; Data Security;
D O I
10.1145/3603166.3632144
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In the rapidly evolving machine learning (ML) and distributed systems realm, the escalating concern for data privacy naturally comes to the forefront of discussions. Federated learning (FL) emerges as a pivotal technology capable of addressing the inherent issues of centralized data privacy. However, FL architectures with centralized orchestration are still vulnerable, especially in the aggregation phase. A malicious server can exploit the aggregation process to learn about participants' data. This study proposes MPCFL, a secure FL algorithm based on secure multi-party computation (MPC) and secret sharing. The proposed algorithm leverages the Sharemind MPC framework to aggregate local model updates for securely formulating a global model. MPCFL provides practical mitigation of trending FL concerns, e.g., inference attack, gradient leakage attack, model poisoning, and model inversion. The algorithm is evaluated on several benchmark datasets and shows promising results. Our results demonstrate that the proposed algorithm is viable for developing secure and privacy-preserving FL applications, significantly improving all performance metrics while maintaining security and reliability. This investigation is a precursor to deeper explorations to craft robust FL aggregation algorithms.
引用
收藏
页数:10
相关论文
共 50 条
  • [41] Rational protocol of quantum secure multi-party computation
    Dou, Zhao
    Xu, Gang
    Chen, Xiu-Bo
    Niu, Xin-Xin
    Yang, Yi-Xian
    QUANTUM INFORMATION PROCESSING, 2018, 17 (08)
  • [42] Application of Secure Multi-party Computation in Linear Programming
    Fu Zu-feng
    Wang Hai-ying
    Wu Yong-wu
    2014 IEEE 7TH JOINT INTERNATIONAL INFORMATION TECHNOLOGY AND ARTIFICIAL INTELLIGENCE CONFERENCE (ITAIC), 2014, : 244 - 248
  • [43] Rational protocol of quantum secure multi-party computation
    Zhao Dou
    Gang Xu
    Xiu-Bo Chen
    Xin-Xin Niu
    Yi-Xian Yang
    Quantum Information Processing, 2018, 17
  • [44] Secure multi-party computation protocol for sequencing problem
    ChunMing Tang
    GuiHua Shi
    ZhengAn Yao
    Science China Information Sciences, 2011, 54 : 1654 - 1662
  • [45] Round-Optimal Secure Multi-party Computation
    Shai Halevi
    Carmit Hazay
    Antigoni Polychroniadou
    Muthuramakrishnan Venkitasubramaniam
    Journal of Cryptology, 2021, 34
  • [46] Secure Multi-party Quantum Computation with a Dishonest Majority
    Dulek, Yfke
    Grilo, Alex B.
    Jeffery, Stacey
    Majenz, Christian
    Schaffner, Christian
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 729 - 758
  • [47] Secure multi-party computation protocol for sorting problem
    School of Computer Science, Shaanxi Normal University, Xi'an 710062, China
    不详
    Hsi An Chiao Tung Ta Hsueh, 2008, 2 (231-233+255): : 231 - 233
  • [48] Minimal complete primitives for secure multi-party computation
    Fitzi, M
    Garay, JA
    Maurer, U
    Ostrovsky, R
    JOURNAL OF CRYPTOLOGY, 2005, 18 (01) : 37 - 61
  • [49] Secure multi-party computation protocol for sequencing problem
    TANG ChunMing 1
    2State Key Laboratory of Information Security
    3 School of Mathematics and Computational Science
    ScienceChina(InformationSciences), 2011, 54 (08) : 1654 - 1662
  • [50] Round-Optimal Secure Multi-party Computation
    Halevi, Shai
    Hazay, Carmit
    Polychroniadou, Antigoni
    Venkitasubramaniam, Muthuramakrishnan
    JOURNAL OF CRYPTOLOGY, 2021, 34 (03)