Secure Federated Learning for Multi-Party Network Monitoring

被引:0
|
作者
Lytvyn, Oleksandr [1 ]
Nguyen, Giang [1 ,2 ]
机构
[1] Slovak Univ Technol Bratislava, Fac Informat & Informat Technol, Bratislava 84216, Slovakia
[2] Slovak Acad Sci, Inst Informat, Bratislava 84507, Slovakia
来源
IEEE ACCESS | 2024年 / 12卷
关键词
Monitoring; Data models; Federated learning; Computational modeling; Training; Security; Predictive models; Load modeling; Distributed databases; Context modeling; Network monitoring; federated learning; secret sharing; secure aggregation; time-series modeling; PRIVACY;
D O I
10.1109/ACCESS.2024.3486810
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network monitoring is essential for IT infrastructure health, enabling proactive threat detection, bandwidth optimization, and data analysis. Federated Learning facilitates collaboration and expands threat detection capabilities by allowing multiple clients to train models while preserving privacy and security without compromising sensitive information. This work explores the application of Federated Learning for secure network monitoring by investigating its use in various data partitioning settings to train Deep Learning models across multiple data partitions, incorporating secure aggregation to enhance data privacy. We propose an approach for multiparty training of deep neural networks for time series-based network load forecasting with secure aggregation. Our approach shows that a collaboratively trained model, on horizontal partitions, performs 11%-14% better than model training only on a single partition of that type. The model trained on vertical partitions achieved performance comparable to that of the models trained on a complete data set. Finally, examining the proposed approach on horizontal and vertical partitions proved its viability in both aggregation settings, regular and secure. These contributions demonstrate the feasibility of Federated Learning to improve interoperability between multiple organizations while addressing privacy and security concerns.
引用
收藏
页码:163262 / 163284
页数:23
相关论文
共 50 条
  • [21] Secure Multi-party Differential Privacy
    Kairouz, Peter
    Oh, Sewoong
    Viswanath, Pramod
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [22] Secure multi-party computational geometry
    Atallah, MJ
    Du, WL
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 165 - 179
  • [23] Heterogeneous Secure Multi-Party Computation
    Djatmiko, Mentari
    Cunche, Mathieu
    Boreli, Roksana
    Seneviratne, Aruna
    NETWORKING 2012, PT II, 2012, 7290 : 198 - 210
  • [24] Optimally Efficient Multi-party Fair Exchange and Fair Secure Multi-party Computation
    Alper, Handan Kilinc
    Kupcu, Alptekin
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2022, 25 (01)
  • [25] Quantum secure multi-party computational geometry based on multi-party summation and multiplication
    Dou, Zhao
    Wang, Yifei
    Liu, Zhaoqian
    Bi, Jingguo
    Chen, Xiubo
    Li, Lixiang
    QUANTUM SCIENCE AND TECHNOLOGY, 2024, 9 (02)
  • [26] Experimental realization of an entanglement access network and secure multi-party computation
    X.-Y. Chang
    D.-L. Deng
    X.-X. Yuan
    P.-Y. Hou
    Y.-Y. Huang
    L.-M. Duan
    Scientific Reports, 6
  • [27] Batch Secret Sharing for Secure Multi-party Computation in Asynchronous Network
    黄征
    龚征
    李强
    JournalofShanghaiJiaotongUniversity(Science), 2009, 14 (01) : 112 - 116
  • [28] Experimental realization of an entanglement access network and secure multi-party computation
    Chang, X. -Y.
    Deng, D. -L.
    Yuan, X. -X.
    Hou, P. -Y.
    Huang, Y. -Y.
    Duan, L. -M.
    SCIENTIFIC REPORTS, 2016, 6
  • [29] Batch secret sharing for secure multi-party computation in asynchronous network
    Huang Z.
    Gong Z.
    Li Q.
    Journal of Shanghai Jiaotong University (Science), 2009, 14 E (01) : 112 - 116
  • [30] Learning Without Peeking: Secure Multi-party Computation Genetic Programming
    Kim, Jinhan
    Epitropakis, Michael G.
    Yoo, Shin
    SEARCH-BASED SOFTWARE ENGINEERING, SSBSE 2018, 2018, 11036 : 246 - 261