2.793

2018影响因子

(CJCR)

  • 中文核心
  • EI
  • 中国科技核心
  • Scopus
  • CSCD
  • 英国科学文摘

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

基于门限和环签名的抗自适应攻击拜占庭容错共识算法

孙海锋 张文芳 王小敏 马征 黄路非 李暄

孙海锋, 张文芳, 王小敏, 马征, 黄路非, 李暄. 基于门限和环签名的抗自适应攻击拜占庭容错共识算法. 自动化学报, 2021, x(x): 1−12 doi: 10.16383/j.aas.c200694
引用本文: 孙海锋, 张文芳, 王小敏, 马征, 黄路非, 李暄. 基于门限和环签名的抗自适应攻击拜占庭容错共识算法. 自动化学报, 2021, x(x): 1−12 doi: 10.16383/j.aas.c200694
Sun Hai-Feng, Zhang Wen-Fang, Wang Xiao-Min, Ma Zheng, Huang Lu-Fei, Li Xuan. A robust byzantine fault-tolerant consensus algorithm against adaptive attack based on ring signature and threshold signature. Acta Automatica Sinica, 2021, x(x): 1−12 doi: 10.16383/j.aas.c200694
Citation: Sun Hai-Feng, Zhang Wen-Fang, Wang Xiao-Min, Ma Zheng, Huang Lu-Fei, Li Xuan. A robust byzantine fault-tolerant consensus algorithm against adaptive attack based on ring signature and threshold signature. Acta Automatica Sinica, 2021, x(x): 1−12 doi: 10.16383/j.aas.c200694

基于门限和环签名的抗自适应攻击拜占庭容错共识算法

doi: 10.16383/j.aas.c200694
基金项目: 国家自然科学基金(61872302), 四川省科技计划项目(2017SZYZF0002, 2019YFH0097), 四川省卫生信息学会科研课题(2018002)资助
详细信息
    作者简介:

    孙海锋:西南交通大学信息科学与技术学院硕士研究生. 主要研究方向为区块链信息安全及共识机制. E-mail: alvislly@163.com

    张文芳:西南交通大学信息科学与技术学院副教授. 主要研究方向为云计算和分布式系统信息安全, 区块链安全及共识, 轨道交通信息安全. E-mail: wfzhang@swjtu.edu.cn

    王小敏:西南交通大学信息科学与技术学院教授. 主要研究方向为信息安全和轨道交通安全工程. E-mail: xmwang@swjtu.edu.cn

    马征:西南交通大学信息科学与技术学院教授. 主要研究方向为信息和通信工程. E-mail: zma@swjtu.edu.cn

    黄路非:成都市第三人民医院高级工程师. 主要研究方向为信息和通信工程. E-mail: lhuang78@163.com

    李暄:成都市第三人民医院高级工程师. 主要研究方向为信息和通信工程. E-mail: ally.xuan@hotmail.com

A Robust Byzantine Fault-Tolerant Consensus Algorithm against Adaptive Attack Based on Ring Signature and Threshold Signature

Funds: Supported by National Natural Science Foundation of P. R. China (61872302), Science and Technology Program of Sichuan Province (2017SZYZF0002, 2019YFH0097), Scientific Research Project of Health Information Association of Sichuan Province (2018002)
More Information
    Author Bio:

    SUN Hai-Feng Master student at the School of Information Science and Technology, Southwest Jiaotong University. His research interest covers information security and consensus mechanisms of blockchains

    ZHANG Wen-Fang Associate Professor at the School of Information Science and Technology, Southwest Jiaotong University. Her research interest covers information security of cloud computing and distributed systems, security and consensus mechanisms of blockchains, and information security of rail transport

    WANG Xiao-Min Professor at the School of Information Science and Technology, Southwest Jiaotong University. His research interest covers information security and safety engineering of rail transportation

    MA Zheng Professor at the School of Information Science and Technology, Southwest Jiaotong University. His research interest covers information and communication engineering

    HUANG Lu-Fei Senior Engineer of Chengdu Third People's Hospital. His research interest covers medical informatics engineering

    LI Xuan Senior Engineer of Chengdu Third People's Hospital. Her research interest covers medical informatics engineering

  • 摘要: 共识算法作为区块链底层关键技术, 可解决决策权分散的分布式系统中的一致性难题. 良好的共识算法可提升系统健壮性, 但大多数方案在网络故障或主动攻击下存在鲁棒性不可控、活性表现差、可扩展性不足等问题. 针对上述问题, 本文提出一种抗自适应攻击的健壮拜占庭容错共识算法. 该算法利用环签名的无条件强匿名性构造排序选主算法, 隐匿选举每一轮共识中的提案者, 进而达到模糊敌手攻击对象、有效抵抗自适应攻击的目的. 同时, 通过在多轮投票中合成代表法定人数投票意愿的门限签名, 将网络划分为众多最小连通性网络, 以保证在最小连通性网络环境中实现低延迟、高鲁棒性的拜占庭容错共识算法. 分析表明, 系统在提升可扩展性、减少视图更换、降低签名验证开销的同时, 能够有效保证系统活性.
  • 图  1  联盟链应用场景

    Fig.  1  Alliance chain application scenario

    图  2  RBFT算法示意图

    Fig.  2  RBFT algorithm diagram

    图  3  有序承诺序列

    Fig.  3  Ordered commitment sequence

    图  4  最小连通性网络

    Fig.  4  Minimum connectivity network

    图  5  状态一致性概率曲线

    Fig.  5  State consistency probability curve

    图  6  网络拓扑图

    Fig.  6  Network topology

    图  7  带宽占用量矩形图

    Fig.  7  Bandwidth occupation histogram

    图  8  带宽占用量变化曲线图

    Fig.  8  Bandwidth occupation curve figure

    图  9  吞吐率

    Fig.  9  throughput

    表  1  拜占庭容错算法性能对比

    Table  1  The performance comparison of Byzantine fault tolerant algorithm

    方案抗自适应攻击鲁棒性可扩展性通信复杂度
    PBFT[8]×××O(n2)
    Tendermint[16]×××O(n2)
    Algorand[19]×O(n2)
    SBFT[14]××O(n)
    HotStuff[15]××O(n)
    RBFTO((f+1)n)
    注: ×代表不支持该性能(或差), √代表支持该性能(或强).
    下载: 导出CSV

    表  2  链码接口

    Table  2  Chain code interface

    接口名接口功能接口接收参数
    Open开户账户名、金额
    Query查询账户名
    Invoke转账账户名、账户名、金额
    Delete销户账户名
    下载: 导出CSV
  • [1] 袁勇, 王飞跃. 区块链技术发展现状与展望. 自动化学报, 2016, 42(04): 481−494
    [2] Nakamoto S. Bitcoin: A peer-to-peer electronic cash system. http://www.bitcoin.org. 2008.
    [3] 袁勇, 倪晓春, 曾帅, 等. 区块链共识算法的发展现状与展望. 自动化学报, 2018, 44(11): 2011−2022
    [4] Gervais A, Karame G O, Wüst K, et al. On the security and performance of proof of work blockchains[C]. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, ACM, 2016: 3−16.
    [5] Vasin P. Blackcoin’s proof-of-stake protocol v2.[Online], https://blackcoin.co/blackcoin-pos-protocol-v2-whitepaper.pdf, 2014, 71.
    [6] Larimer D. Delegated proof-of-stake (DPOS). Bitshare whitepaper, 2014.
    [7] Lamport L, Shostak R, Pease M. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 1982, 4(3): 382−401 doi: 10.1145/357172.357176
    [8] Castro M, Liskov B. Practical Byzantine fault tolerance[C]. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans, USA, February 1999, 99: 173−186.
    [9] Kotla R, Alvisi L, Dahlin M, et al. Zyzzyva: speculative byzantine fault tolerance. ACM SIGOPS Operating Systems Review, 2007, 41(6): 45−58 doi: 10.1145/1323293.1294267
    [10] Hao X, Yu L, Zhiqiang L, et al. Dynamic Practical Byzantine Fault Tolerance[C]. 2018 IEEE Conference on Communications and Network Security (CNS). IEEE, 2018: 1−8.
    [11] Correia M, Neves N F, Verssimo P. How to Tolerate Half Less One Byzantine Nodes in Practical Distributed Systems[C]. In: Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, IEEE, 2004.
    [12] Veronese G S, Correia M, Bessani A N, et al. Efficient byzantine fault-tolerance. IEEE Transactions on Computers, 2013, 62(1): 16−30 doi: 10.1109/TC.2011.221
    [13] Cowling J, Myers D, Liskov B, et al. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance[C]. In: Proceedings of the 7th symposium on Operating systems design and implementation, USENIX Association, 2006: 177−190.
    [14] Gueta G G, Abraham I, Grossman S, et al. SBFT: a Scalable and Decentralized Trust Infrastructure[C]. In: Proceedings of 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), IEEE, 2019: 568−580.
    [15] Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. HotStuff: BFT Consensus with Linearity and Responsiveness[C]. In: Proceedings of 2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019: 347−356.
    [16] Jae K. Tendermint: Consensus without mining[Online]. http://diyhpl.us/~bryan/papers2/bitcoin/tendermint_v03.pdf, 2014.
    [17] Pass, Rafael, Elaine Shi. Hybrid consensus: Efficient consensus in the permissionless model[C]. In: Proceedings of 31st International Symposium on Distributed Computing. Dagstuhl Publishing, 2017, 39: 1−16.
    [18] Kogias E K, Jovanovic P, Gailly N, et al. Enhancing bitcoin security and performance with strong consistency via collective signing[C]. In: Proceedings of 25th USENIX Security Symposium (USENIX Security 16), 2016: 279−296.
    [19] Pass R, Shi E. Thunderella: Blockchains with optimistic instant confirmation[C]. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2018: 3−33.
    [20] Li P, Wang G, Chen X, et al. Gosig: Scalable Byzantine Consensus on Adversarial Wide Area Network for Blockchains. arXiv preprint, 2018, arXiv: 1802.01315.
    [21] Gilad Y, Hemo R, Micali S, et al. Algorand: Scaling byzantine agreements for cryptocurrencies[C]. In: Proceedings of the 26th Symposium on Operating Systems Principles, ACM, 2017: 51−68.
    [22] Rivest R L, Shamir A, Tauman Y. How to leak a secret[C]. In: Proceedings of the 7th International Conference on the Theory & Application of Cryptology & Information Security: Advances in Cryptology, 2001: 552−565.
    [23] Liu J K, Wei V K, Wong D S. Linkable Spontaneous Anonymous Group Signature for Ad Hoc Groups[C]. In: Proceedings of the 9th Australasian Conference on Information Security and Privacy (ACISP 2004), Sydney, Australia, 2004: 325−335.
    [24] Park C, Kurosawa K. New eigamal type threshold digital signature scheme. IEICE transactions on fundamentals of electronics, communications and computer sciences, 1996, 79(1): 86−93
  • 加载中
计量
  • 文章访问数:  34
  • HTML全文浏览量:  11
  • 被引次数: 0
出版历程
  • 收稿日期:  2020-08-28
  • 修回日期:  2020-12-14
  • 网络出版日期:  2021-03-29

目录

    /

    返回文章
    返回