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 BV]
卷期号: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
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
ECHO完成签到,获得积分20
1秒前
1秒前
完美世界应助猪猪猪采纳,获得30
1秒前
深海鳕鱼完成签到,获得积分10
2秒前
Joshua完成签到,获得积分10
2秒前
顾矜应助怕黑的盼烟采纳,获得10
2秒前
所所应助nnnd77采纳,获得10
3秒前
4秒前
5秒前
5秒前
ming完成签到 ,获得积分10
5秒前
Jasen发布了新的文献求助20
6秒前
zho发布了新的文献求助10
6秒前
qmhx发布了新的文献求助10
8秒前
夕诙发布了新的文献求助20
8秒前
草莓熊发布了新的文献求助10
8秒前
8秒前
陶以沫完成签到,获得积分10
9秒前
9秒前
柏林寒冬应助SimonHHH采纳,获得10
9秒前
pluto应助小猴儿采纳,获得10
10秒前
10秒前
两米七发布了新的文献求助20
10秒前
Lionel完成签到,获得积分20
10秒前
11秒前
清秀的天德完成签到,获得积分10
11秒前
共享精神应助renkemaomao采纳,获得10
11秒前
dua完成签到,获得积分20
11秒前
微笑的秀儿完成签到,获得积分10
12秒前
nnnd77应助文件撤销了驳回
12秒前
13秒前
13秒前
思源应助现实的小蚂蚁采纳,获得10
13秒前
sisii发布了新的文献求助10
14秒前
eui发布了新的文献求助10
14秒前
极品小亮发布了新的文献求助10
16秒前
情怀应助乐观寻绿采纳,获得10
16秒前
16秒前
听话的亦云完成签到,获得积分10
17秒前
Lucas应助25689采纳,获得10
18秒前
高分求助中
【重要!!请各位用户详细阅读此贴】科研通的精品贴汇总(请勿应助) 10000
植物基因组学(第二版) 1000
Plutonium Handbook 1000
Three plays : drama 1000
International Code of Nomenclature for algae, fungi, and plants (Madrid Code) (Regnum Vegetabile) 1000
Psychology Applied to Teaching 14th Edition 600
Robot-supported joining of reinforcement textiles with one-sided sewing heads 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4095334
求助须知:如何正确求助?哪些是违规求助? 3633450
关于积分的说明 11517212
捐赠科研通 3344230
什么是DOI,文献DOI怎么找? 1837950
邀请新用户注册赠送积分活动 905517
科研通“疑难数据库(出版商)”最低求助积分说明 823202