VDFChain: Secure and verifiable decentralized federated learning via committee-based blockchain

计算机科学 块链 正确性 可验证秘密共享 Byzantine容错 联合学习 方案(数学) 计算机安全 单点故障 分布式计算 容错 集合(抽象数据类型) 算法 数学分析 数学 程序设计语言
作者
Ming Zhou,Zhen Yang,Haiyang Yu,Shui Yu
出处
期刊:Journal of Network and Computer Applications [Elsevier]
卷期号:223: 103814-103814 被引量:1
标识
DOI:10.1016/j.jnca.2023.103814
摘要

Decentralized federated learning tries to address the single point of failure and privacy issue of federated learning by leveraging committee-based blockchain, which has been extensively studied among academic and industrial fields. The introduction of committees improves the efficiency of decentralized federated learning. However, it also is prone to attacks from Byzantine committee members, which interfere with the correctness of the global model by modifying aggregation results. Therefore, the security of committees is the key challenge for decentralized federated learning via committee-based blockchain. To solve this problem, in this paper, we propose VDFChain, a secure and verifiable decentralized federated learning scheme via committee-based blockchain. Specifically, based on the polynomial commitment technique, we propose a trusted committee mechanism, which can defend against attacks from Byzantine committee members and ensure the correctness of the aggregation model. Moreover, we use lossless masking techniques and committee mechanisms to effectively provide secure aggregation. For Byzantine attacks in decentralized federated learning, different from traditional defense methods against it, the VDFChain improves the fault tolerance of decentralized federated learning and provides a feasible and practical solution to build a secure decentralized federated learning. Security analysis shows that our scheme is provably secure. We have conducted extensive comparison experiments to evaluate the performance of the proposed framework, and experimental results show that our scheme has superior computational and communication performance compared to the state-of-the-art schemes.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
wali完成签到 ,获得积分10
刚刚
1秒前
JamesPei应助jiaxin采纳,获得10
2秒前
2秒前
橙子发布了新的文献求助10
5秒前
元谷雪应助专注刺猬采纳,获得10
6秒前
小机灵鬼发布了新的文献求助10
6秒前
木槿花难开完成签到,获得积分10
6秒前
7秒前
缥缈映安发布了新的文献求助10
7秒前
华仔应助梨卜橙采纳,获得10
8秒前
9秒前
葭月十七发布了新的文献求助10
12秒前
13秒前
大白发布了新的文献求助10
14秒前
14秒前
15秒前
cc20231022发布了新的文献求助10
16秒前
lhh0529yt完成签到,获得积分10
17秒前
www发布了新的文献求助10
18秒前
FelixFelicis完成签到 ,获得积分10
20秒前
单顺反子发布了新的文献求助10
20秒前
诚心的若南完成签到,获得积分10
21秒前
stephen_wang完成签到,获得积分10
22秒前
24秒前
冷酷紫南完成签到,获得积分10
26秒前
26秒前
ttxi完成签到,获得积分20
28秒前
28秒前
SciGPT应助lily88采纳,获得10
30秒前
30秒前
FashionBoy应助似画采纳,获得10
30秒前
鱼鱼完成签到 ,获得积分10
32秒前
cy关注了科研通微信公众号
33秒前
桐桐应助风的季节采纳,获得10
33秒前
aDou完成签到 ,获得积分10
34秒前
方方关注了科研通微信公众号
34秒前
pryturk发布了新的文献求助10
34秒前
春眠不觉小小酥完成签到,获得积分10
35秒前
英俊的铭应助小梦要科研采纳,获得10
36秒前
高分求助中
The Oxford Handbook of Social Cognition (Second Edition, 2024) 1050
Kinetics of the Esterification Between 2-[(4-hydroxybutoxy)carbonyl] Benzoic Acid with 1,4-Butanediol: Tetrabutyl Orthotitanate as Catalyst 1000
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
юрские динозавры восточного забайкалья 800
English Wealden Fossils 700
Handbook of Qualitative Cross-Cultural Research Methods 600
Chen Hansheng: China’s Last Romantic Revolutionary 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3140205
求助须知:如何正确求助?哪些是违规求助? 2790982
关于积分的说明 7797336
捐赠科研通 2447358
什么是DOI,文献DOI怎么找? 1301860
科研通“疑难数据库(出版商)”最低求助积分说明 626345
版权声明 601194