一种可证安全的权益有向无环图共识机制

doi:10.19665/j.issn1001-2400.2023.02.013

Abstract

Abstract:

A provable secure consensus mechanism is proposed.The consensus mechanism consists of a committee agreement protocol and a transaction confirmation algorithm.Nodes with a strong initiative and more stakes are elected from consensus nodes through the committee agreement protocol,which form a dynamic and iterative committee to parallelly handle Normal Net Transactions (NNTs) generated by users in the blockchain.The transaction confirmation algorithm is based on a Directed Acyclic Graph (DAG) which is constructed from Chain Transactions (CTs) sent by committee members.The number of times that an NNT is confirmed by committee members is counted based on the direct and indirect references of a DAG.When an NNT is confirmed by at least two-thirds of the committee members,the transaction is welded in the chain.Under some accepted assumptions,the consensus mechanism is proven to have properties of consistency and termination.Further,a preliminarily blockchain system is built based on the consensus mechanism with the performance of the system tested.The test result is consistent with the theoretical estimation.When 16 committee members are deployed and the transaction batch is 10⁶,the transaction throughput of the system is about 17000 transactions per second;Compared with the current HoneyBadger BFT consensus protocol,under the same configuration,the transaction throughput of the HoneyBadger BFT consensus protocol is about 2600 transactions per second,which is about 1/6 that of the system.

Key words: directed acyclic graph, stake, consensus

CLC Number:

TP319

LUO Yuqin,GUAN Peidong,TIAN Haibo. Provable secure consensus mechanism based on the directed acyclic graph and stake[J].Journal of Xidian University, 2023, 50(2): 125-137.

Figures/Tables 7

References 19

[1]	高政风, 郑继来, 汤舒扬, 等. 基于 DAG 的分布式账本共识机制研究[J]. 软件学报, 2020, 31(4):1124-1142.
	GAO Zhengfeng, ZHENG Jilai, TANG Shuyang, et al. State-of-the-Art Survey of Consensus Mechanisms on DAG-Based Distributed Ledger[J]. Journal of Software, 2020, 31(4):1124-1142.
[2]	DATTA G K, ABDUR R, SUBASH P, et al. A Hybrid POW-POS Implementation Against 51 Percent Attack in Cryptocurrency System[C]//11th IEEE International Conference on Cloud Computing Technology and Science. Piscataway:IEEE, 2019:396-403.
[3]	AGGELOS K, ALEXANDER R, BERNARDO D, et al. Ouroboros:A Provably Secure Proof-of-Stake Blockchain Protocol[DB/OL].[2022-05-10]. https://eprint.iacr.org/2016/889.pdf.
[4]	BERNARDO D, PETER G, AGGELOS K, et al. Ouroboros Praos:An Adaptively-Secure,Semi-Synchronous Proof-of-Stake Blockchain[DB/OL].[2022-05-22]. https://eprint.iacr.org/2017/573.pdf.
[5]	YOSSI G, ROTEM H, SILVIO M, et al. Algorand:Scaling Byzantine Agreements for Cryptocurrencies[DB/OL].[2022-05-20]. https://people.csail.mit.edu/nickolai/papers/gilad-algorand-eprint.pdf.
[6]	ALEXANDER H, TANJA Z, JOACHIM F. BeaconBlocks:Augmenting Proof-of-Stake with On-Chain Time Synchronization[C]//2nd IEEE International Conference on Blockchain. Piscataway:IEEE, 2019:353-360.
[7]	THOMASK P. Alice in Blockchains:Surprising Security Pitfalls in POW and POS Blockchain Systems[C]//15th Annual Conference on Privacy,Security and Trust. Piscataway:IEEE, 2017:400-402.
[8]	BEN-ORM, CANETTIR, GOLDREICHO. Asynchronous Secure Computation[C]// Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing. New York: ACM, 1993:52-61.
[9]	CASTRO M, LISKOV B. Practical Byzantine Fault Tolerance and Proactive Recovery[J]. ACM Transactions on Computer Systems, 2002, 20(4):398-461. doi: 10.1145/571637.571640
[10]	MILLER A, XIA Y, CROMA K, et al. The Honey Badger of BFT Protocols[C]// Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2016:31-42.
[11]	GUO B Y, LU Z L, TANG Q, et al. Dumbo:Faster Asynchronous BFT Protocols[C]// Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2020:803-818.
[12]	LU Y, LU Z L, TANG Q, et al. Dumbo-MVBA:Optimal Multi-Valued Validated Asynchronous Byzantine Agreement[C]// Proceedings of the 39th Symposium on Principles of Distributed Computing. New York: ACM, 2020:129-138.
[13]	CACHIN C, KURSAWE K, PETZOLD F, et al. Secure and Efficient Asynchronous Broadcast Protocols[C/OL].[2022-05-16].DOI:10.1007/3-540-44647-8_31. doi: 10.1007/3-540-44647-8_31
[14]	LERNER S D. DagCoin:A Cryptocurrency without Blocks[DB/OL].[2002-05-12]. https://bitslog.files.wordpress.com/2015/09/dagcoin-v41.pdf.
[15]	POPOV S. The Tangle[DB/OL].[2022-05-16]. https://www.semanticscholar.org.
[16]	YONATAN S, AVIV Z. Secure High-Rate Transaction Processing in Bitcoin[C]//Proceedings of the International Conference on Financial Cryptography and Data Security. Heidelberg:Springer, 2015:507-527.
[17]	LI C X, LI P L, XU W, et al. Scaling Nakamoto Consensus to Thousands of Transactions Per Second[DB/OL].[2002-05-18]. https://arxiv.org/pdf/1805.03870.pdf.
[18]	CHURYUMOV A. Byteball:A Decentralized System for Storage and Transfer of Value[DB/OL].[2002-05-16]. https://byteball.org/Byteball.pdf.
[19]	TIAN H B, LIN H Z, ZHANG F G. Design a Proof of Stake Based Directed Acyclic Graph Chain[C]//3rd International Conference on Frontiers in Cyber Security. Heidelberg:Springer, 2020:150-165.

算法阶段	运行时间/ms
第③行	1.405
第④~⑤行	0.001
第⑦行	0.001
第⑧~⑨行	1.980
第?行	0.018
第?~?行	0.006

算法阶段	运行时间/ms
第③~④行	0.058
第⑤~⑦行	1.400
第⑨~?行	0.037
第?~?行	0.221
第?行	0.001

委员会成员数量	文中的协议处理时延	HoneyBadger BFT协议^[10]处理时延
4	3.012	266.172
8	3.221	588.291
12	4.347	689.590
16	5.021	903.906

Provable secure consensus mechanism based on the directed acyclic graph and stake

RichHTML

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 7

References 19

Related Articles 4

Metrics

Comments

Recommended 10

[1]	XIE Yixi,JI Lixin. Blockchain-based bio-inspired distributed detection approach [J]. Journal of Xidian University, 2020, 47(5): 70-76.
[2]	MA Shiyang,DONG Xuewen,QUAN Yining,TONG Wei,YANG Lingxiao. Method for evaluation of web services compatibility based on the blockchain’s consensus algorithm [J]. Journal of Xidian University, 2020, 47(5): 63-69.
[3]	LIU Naian,CHEN Zhihao,LIU Guokun,LI Yang. Mechanism for proof-of-reputation consensus for blockchain validator nodes [J]. Journal of Xidian University, 2020, 47(5): 57-62.
[4]	WAN Guoting;WANG Junping;CAO Honghua;WANG Song;WANG Le. Efficient algorithm for mismatching point elimination with interzone limited pre-testing [J]. J4, 2013, 40(5): 107-112+199.