EVFLR: Efficient Vertical Federated Logistic Regression Based on Batch Operations

被引:0
作者
Chen, Dong [1 ,2 ]
Qiu, Zhiyuan [3 ]
Xu, Guangwu [1 ,2 ,3 ,4 ]
机构
[1] Minist Educ, Key Lab Cryptol Technol & Informat Secur, Qingdao 266237, Peoples R China
[2] Shandong Univ, Sch Cyber Sci & Technol, Qingdao 266237, Peoples R China
[3] Shandong Inst Blockchain, Jinan 250101, Peoples R China
[4] Quan Cheng Lab, Jinan 250103, Peoples R China
来源
INFORMATION SECURITY AND CRYPTOLOGY, INSCRYPT 2023, PT II | 2024年 / 14527卷
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Vertical federated learning; Logistic regression; Homomorphic encryption; Chinese remainder representation; DIVISION;
D O I
10.1007/978-981-97-0945-8_4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Vertical federated learning (VFL), where multiple participants with non-overlapping features for the same set of instances jointly train models, plays an increasingly important role in federated learning. This paper discusses vertical federated logistic regression (VFLR), one of the most popular VFL models. In existing VFLR solutions, homomorphic encryption (HE) is widely used to guarantee privacy. However, HE also entails huge communication and computation burdens. To solve this problem, we propose a method of packaging data by applying the Chinese remainder representation (CRR) to encode multiple smaller numbers into a single larger number through modulo operations. The classical Chinese Remainder Theorem shows that this process of packaging is a one-toone correspondence in a certain range and preserves algebraic operations like addition and multiplication. Hence, it fits well with VFLR involving matrix multiplication. As far as we know, this is the first batch operation method that supports multiplication in federated learning. Additionally, the dACIQ clipping technique and the multiplicative symmetric quantization method are adopted to eliminate the obstacles in CRR application. The effectiveness of our method has also been confirmed through extensive experiments, showing a reduction in traffic between participants of 32-54 times while achieving a training speedup of 3.6-14.6 times.
引用
收藏
页码:53 / 72
页数:20
相关论文
共 38 条
  • [1] Banner R, 2019, ADV NEUR IN, V32
  • [2] Barker E., 2006, RECOMMENDATION KEY 1
  • [3] LOG DEPTH CIRCUITS FOR DIVISION AND RELATED PROBLEMS
    BEAME, PW
    COOK, SA
    HOOVER, HJ
    [J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (04) : 994 - 1003
  • [4] Practical Secure Aggregation for Privacy-Preserving Machine Learning
    Bonawitz, Keith
    Ivanov, Vladimir
    Kreuter, Ben
    Marcedone, Antonio
    McMahan, H. Brendan
    Patel, Sarvar
    Ramage, Daniel
    Segal, Aaron
    Seth, Karn
    [J]. CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 1175 - 1191
  • [5] Cai DQ, 2024, Arxiv, DOI arXiv:2207.11456
  • [6] Homomorphic Encryption for Arithmetic of Approximate Numbers
    Cheon, Jung Hee
    Kim, Andrey
    Kim, Miran
    Song, Yongsoo
    [J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT I, 2017, 10624 : 409 - 437
  • [7] Division in logspace-uniform NC
    Chiu, A
    Davida, G
    Litow, B
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (03): : 259 - 275
  • [8] Corrigan-Gibbs H, 2017, PROCEEDINGS OF NSDI '17: 14TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION, P259
  • [9] Fast arithmetics using Chinese remaindering
    Davida, George
    Litow, Bruce
    Xu, Guangwu
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (13) : 660 - 662
  • [10] de la Torre L., 2018, GUIDE CALIFORNIA CON, P1, DOI DOI 10.2139/SSRN.3275571