Security Analysis on dBFT Protocol of NEO

Wang, Qin; Yu, Jiangshan; Peng, Zhiniang; Bui, Van Cuong; Chen, Jinjun; Ding, Yong; Xiang, Yang

doi:10.1007/978-3-030-51280-4_2

Cited by 27 publications

(12 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…dBFT [24] and Tendermint select nodes based on PoS. dBFT is an algorithm proposed by the AntChain (Neo), which combines PoS with the PBFT mechanism.…”

Section: Comparison With Other Literature Studiesmentioning

confidence: 99%

GPBFT: A Practical Byzantine Fault-Tolerant Consensus Algorithm Based on Dual Administrator Short Group Signatures

Qin

Chen

2022

Security and Communication Networks

View full text Add to dashboard Cite

The practical Byzantine fault-tolerant consensus algorithm reduces the operational complexity of Byzantine protocols from an exponential level to a polynomial level, which makes it possible to apply Byzantine protocols in distributed systems. However, it still has some problems, such as high communication overhead, low security, poor scalability, and difficulty in tracking. In this article, we propose a Byzantine fault-tolerant consensus algorithm based on dual administrator short group signatures (GPBFT). Firstly, the certification authority chooses the master node and group administrators based on the credit value. The group administrators organize the nodes into a group, and the members generate the signatures by applying the short group signatures scheme, in which any group member can represent the group during the GroupSign phase. Additionally, the GPBFT algorithm adds the Trace phase. According to member and client authentication information, the group administrator can track the true identity of the malicious node, identify the malicious node, and revoke it. The experimental results show that compared with the PBFT algorithm, the GPBFT algorithm can reduce the network communication overhead, reduce the consensus delay, and greatly improve the security and stability of the system. The algorithm can effectively manage member nodes and enable the tracking of identified malicious nodes while maintaining anonymity in terms of node tracking.

show abstract

“…dBFT [24] and Tendermint select nodes based on PoS. dBFT is an algorithm proposed by the AntChain (Neo), which combines PoS with the PBFT mechanism.…”

Section: Comparison With Other Literature Studiesmentioning

confidence: 99%

GPBFT: A Practical Byzantine Fault-Tolerant Consensus Algorithm Based on Dual Administrator Short Group Signatures

Qin

Chen

2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…One major difference lies in their dynamic committees, where members can conditionally join and leave following predefined rules. Exemplified protocols include the PoA in Ethereum, dBFT in NEO [62], vote-based BFT in Algorand [63] and variant PBFT in Thunderella [64]. Meanwhile, many systems adopt a hybrid or two-layer architecture to further leverage advantages of both consensus such as PoS+PBFT in Tendermint [65], etc.…”

Section: Related Workmentioning

confidence: 99%

Exploring Unfairness on Proof of Authority: Order Manipulation Attacks and Remedies

Wang¹,

Li²,

Wang³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Proof of Authority (PoA) is a type of permissioned consensus algorithm with a fixed committee. PoA has been widely adopted by communities and industries due to its better performance and faster finality. In this paper, we explore the unfairness issue existing in the current PoA implementations. We have investigated 2,500+ in the wild projects and selected 10+ as our main focus (covering Ethereum, Binance smart chain, etc.). We have identified two types of order manipulation attacks to separately break the transaction-level (a.k.a. transaction ordering) and the block-level (sealer position ordering) fairness. Both of them merely rely on honest-but-profitable sealer assumption without modifying original settings. We launch these attacks on the forked branches under an isolated environment and carefully evaluate the attacking scope towards different implementations. To date (as of Nov 2021), the potentially affected PoA market cap can reach up to 681, 087 million USD. Besides, we further dive into the source code of selected projects, and accordingly, propose our recommendation for the fix. To the best of knowledge, this work provides the first exploration of the unfairness issue in PoA algorithms.

show abstract

“…PBFT [45] makes the BFT algorithm practical, and its variants are widely applied to blockchain systems. The solutions includes the dBFT of NEO [46], the BFT of Hotstuff [47], the PoS+PBFT of Tendermint [48], the vote-based BFT of Algorand [49], etc.…”

Section: Consortium Blockchainmentioning

confidence: 99%

“…2 provides a skeleton of the blockchain-based system. This is the most prevailing structure adopted by current blockchain systems [2][36] [46][47] [41]. Other structures such as DAG-based blockchains systems refer to [52].…”

Section: Proof For Theoremsmentioning

confidence: 99%

Anonymous Blockchain-based System for Consortium

Wang

Chen

Xiang

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Blockchain brings various advantages to online transactions. However, the total transparency of these transactions may leakage users' sensitive information. Requirements on both cooperation and anonymity for companies/organizations become necessary. In this paper, we propose a Multi-center Anonymous Blockchain-based (MAB) system, with joint management for the consortium and privacy protection for the participants. To achieve that, we formalize the syntax used by the MAB system and present a general construction based on a modular design. By applying cryptographic primitives to each module, we instantiate our scheme with anonymity and decentralization. Furthermore, we carry out a comprehensive formal analysis of the proposed solution. The results demonstrate our constructed scheme is secure and efficient.

show abstract

Security Analysis on dBFT Protocol of NEO

Cited by 27 publications

References 34 publications

GPBFT: A Practical Byzantine Fault-Tolerant Consensus Algorithm Based on Dual Administrator Short Group Signatures

GPBFT: A Practical Byzantine Fault-Tolerant Consensus Algorithm Based on Dual Administrator Short Group Signatures

Exploring Unfairness on Proof of Authority: Order Manipulation Attacks and Remedies

Anonymous Blockchain-based System for Consortium

Contact Info

Product

Resources

About