VOSA: Verifiable and Oblivious Secure Aggregation for Privacy-Preserving Federated Learning

被引:18
作者
Wang, Yong [1 ]
Zhang, Aiqing [1 ]
Wu, Shu [2 ]
Yu, Shui [3 ]
机构
[1] Anhui Normal Univ, Sch Phys & Elect Informat, Anhui Prov Engn Lab Informat Fus & Control Intell, Wuhu 241002, Anhui, Peoples R China
[2] West Anhui Univ, Sch Elect & Informat Engn, Luan 237000, Anhui, Peoples R China
[3] Univ Technol Sydney, Sch Comp Sci, Sydney, NSW 2007, Australia
基金
中国国家自然科学基金;
关键词
Secure aggregation; federated learning; privacy preservation; data security;
D O I
10.1109/TDSC.2022.3226508
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Federated learning has emerged as a promising paradigm by collaboratively training a global model through sharing local gradients without exposing raw data. However, the shared gradients pose a threat to privacy leakage of local data. The central server may forge the aggregated results. Besides, it is common that resource-constrained devices drop out in federated learning. To solve these problems, the existing solutions consider either only efficiency, or privacy preservation. It is still a challenge to design a verifiable and lightweight secure aggregation with drop-out resilience for large-scale federated learning. In this article, we propose VOSA, an efficient verifiable and oblivious secure aggregation protocol for privacy-preserving federated learning. We exploit aggregator oblivious encryption to efficiently mask users' local gradients. The central server performs aggregation on the obscured gradients without revealing the privacy of local data. Meanwhile, each user can efficiently verify the correctness of the aggregated results. Moreover, VOSA adopts a dynamic group management mechanism to tolerate users' dropping out with no impact on their participation in future learning process. Security analysis shows that the VOSA can guarantee the security requirements of privacy-preserving federated learning. The extensive experimental evaluations conducted on real-world datasets demonstrate the practical performance of the proposed VOSA with high efficiency.
引用
收藏
页码:3601 / 3616
页数:16
相关论文
共 48 条
  • [1] [Anonymous], 2013, P INT C FIN CRYPT DA, DOI DOI 10.1007/978-3-642-39884-110
  • [2] [Anonymous], 2015, P 22 ACM SIGSAC C CO, DOI DOI 10.1145/2810103.2813677
  • [3] Bagdasaryan E, 2020, PR MACH LEARN RES, V108, P2938
  • [4] A New Framework for Privacy-Preserving Aggregation of Time-Series Data
    Benhamouda, Fabrice
    Joye, Marc
    Libert, Benoit
    [J]. ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2016, 18 (03)
  • [5] 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
  • [6] Chan T. H. H., 2012, FINANCIAL CRYPTOGRAP, DOI DOI 10.1007/978-3-642-32946-315
  • [7] Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables
    Choi, Bosu
    Iwen, Mark A.
    Krahmer, Felix
    [J]. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2021, 21 (02) : 275 - 329
  • [8] ELKHIYAOUI LK, 2015, P INT C CRYPT NETW S, P3
  • [9] ELKHIYAOUI LK, 2014, P INT C CRYPT NETW S, P305
  • [10] Privacy-Preserving Aggregation of Time-Series Data with Public Verifiability from Simple Assumptions
    Emura, Keita
    [J]. INFORMATION SECURITY AND PRIVACY, ACISP 2017, PT II, 2017, 10343 : 193 - 213