VPFL: Enabling verifiability and privacy in federated learning with zero-knowledge proofs

被引:0
|
作者
Ma, Juan [1 ]
Liu, Hao [2 ]
Zhang, Mingyue [1 ]
Liu, Zhiming [1 ]
机构
[1] Southwest Univ, Coll Comp & Informat Sci, Software Coll, Chongqing 400715, Peoples R China
[2] Guangzhou Univ, Cyberspace Inst Adv Technol, Guangzhou 510799, Peoples R China
关键词
Verifiable; Privacy-reserving; Security model; zero-knowledge range proofs; Federated learning; ATTACKS; SECURE; MEMBERSHIP; EFFICIENT;
D O I
10.1016/j.knosys.2024.112115
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Federated learning has become increasingly popular in recent years and is widely applied to various fields of machine learning. However, the localized execution of federated learning lacks visibility of the training process to a third party (e.g., the model user or auditor), which raises the need to verify the training process. Privacy concerns over the public release of sensitive data for verification purposes are a prominent issue. Therefore, enabling a public verification of the training process without revealing sensitive data is a challenge. In this paper, we focus on verifiability and privacy in federated learning and propose a verifiable and privacy -preserving federated learning scheme (VPFL). We first employ zero -knowledge proofs to allow a third party to publicly verify the training process, which enhances the transparency of the training process and the reliability of the model. Then, to further protect the privacy of sensitive data, we exploit a commitment scheme to ensure that no information about sensitive data is leaked to a third party. We conduct extensive experiments to evaluate the performance of our scheme. For federated learning with 100 clients, our scheme only takes 13.1s to generate evidence and 8.8s to verify it. In addition, we compared our scheme with other schemes, and we observed that our scheme satisfies both the security properties of verifiability and privacy.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] ON THE CONCRETE COMPLEXITY OF ZERO-KNOWLEDGE PROOFS
    BOYAR, J
    PERALTA, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 435 : 507 - 525
  • [22] Experimental relativistic zero-knowledge proofs
    Pouriya Alikhani
    Nicolas Brunner
    Claude Crépeau
    Sébastien Designolle
    Raphaël Houlmann
    Weixu Shi
    Nan Yang
    Hugo Zbinden
    Nature, 2021, 599 : 47 - 50
  • [23] MINIMUM RESOURCE ZERO-KNOWLEDGE PROOFS
    KILIAN, J
    MICALI, S
    OSTROVSKY, R
    30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 474 - 479
  • [24] zkDL: Efficient Zero-Knowledge Proofs of Deep Learning Training
    Sun, Haochen
    Bai, Tonghe
    Li, Jason
    Zhang, Hongyang
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2025, 20 : 914 - 927
  • [25] On the concurrent composition of zero-knowledge proofs
    Richardson, R
    Kilian, J
    ADVANCES IN CRYPTOLOGY - EUROCRYPT'99, 1999, 1592 : 415 - 431
  • [26] Zero-knowledge proofs for finite field arithmetic, or:: Can zero-knowledge be for free?
    Cramer, R
    Damgård, I
    ADVANCES IN CRYPTOLOGY - CRYPTO'98, 1998, 1462 : 424 - 441
  • [27] Maximizing privacy and security of collaborative indoor positioning using zero-knowledge proofs
    Casanova-Marques, Raul
    Torres-Sospedra, Joaquin
    Hajny, Jan
    Gould, Michael
    INTERNET OF THINGS, 2023, 22
  • [28] Zero-knowledge sets with short proofs
    Catalano, Dario
    Fiore, Dario
    Messina, Mariagrazia
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2008, 2008, 4965 : 433 - +
  • [29] Symbolic Malleable Zero-knowledge Proofs
    Backes, Michael
    Bendun, Fabian
    Maffei, Matteo
    Mohammadi, Esfandiar
    Pecina, Kim
    2015 IEEE 28TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM CSF 2015, 2015, : 412 - 426
  • [30] MINIMUM RESOURCE ZERO-KNOWLEDGE PROOFS
    KILIAN, J
    MICALI, S
    OSTROVSKY, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 435 : 545 - 557