Results 21 to 30 of about 2,103 (211)
Flexible Byzantine Fault Tolerance [PDF]
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019 This paper introduces Flexible BFT, a new approach for BFT consensus solution design revolving around two pillars, stronger resilience and diversity. The first pillar, stronger resilience, involves a new fault model called alive-but-corrupt faults. Alive-but-corrupt replicas may arbitrarily deviate from the protocol in an attempt to break safety of the
Dahlia Malkhi +2 more
openaire +2 more sources
Improved Multi-Storey Practical Byzantine Fault Tolerance Algorithm [PDF]
Jisuanji gongcheng, 2023 The Practical Byzantine Fault Tolerant(PBFT) consensus algorithm that is applied to alliance chains has poor efficiency for consensus node selection and multi-node consensus.
Chundong WANG, Xiangyu WANG
doaj +1 more source
An Intelligent Optimization Control Method for Enterprise Cost Under Blockchain Environment
IEEE Access, 2023 This paper uses blockchain technology to conduct in-depth research and analysis on enterprise cost optimization control. Based on the analysis of the cost control status in enterprises, the concept of target cost optimization control and specific control
Tao Liu, Yi Yuan, Zhongyang Yu
doaj +1 more source
On Probabilistic Byzantine Fault Tolerance
CoRR, 2020 Byzantine fault tolerance (BFT) has been extensively studied in distributed trustless systems to guarantee system's functioning when up to 1/3 Byzantine processes exist. Despite a plethora of previous work in BFT systems, they are mainly concerned about common knowledge deducible from the states of all participant processes.
Quan Hoang Nguyen 0001, Andre Cronje
openaire +2 more sources
Byzantine Fault-Tolerant Causal Ordering
Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023 Causal ordering in an asynchronous system has many applications in distributed computing, including in replicated databases and real-time collaborative software. Previous work in the area focused on ordering point-to-point messages in a fault-free setting, and on ordering broadcasts under various fault models.
Anshuman Misra, Ajay D. Kshemkalyani
openaire +2 more sources
Dynamic reputation–based consensus mechanism: Real-time transactions for energy blockchain
International Journal of Distributed Sensor Networks, 2020 The energy blockchain is a distributed Internet protocol for energy transactions between nodes in power systems. The consensus algorithm is the core component of the energy blockchain and has an essential impact on its application.
Wenjun Cai +5 more
doaj +1 more source
IEEE Access, 2022 The Practical Byzantine Fault Tolerant (PBFT) consensus algorithm has many advantages, which makes PBFT utilized widely. Nonetheless, PBFT is not suitable for large-scale node scenarios due to its high communication complexity and it also has an apparent
Yanhe Na +4 more
doaj +1 more source
Byzantine fault tolerance of regenerating codes [PDF]
2011 IEEE International Conference on Peer-to-Peer Computing, 2011 In The 11th IEEE International Conference on Peer-to-Peer Computing (P2P 2011)
Frédérique E. Oggier, Anwitaman Datta
openaire +3 more sources
Challenges of PBFT-Inspired Consensus for Blockchain and Enhancements over Neo dBFT
Future Internet, 2020 Consensus mechanisms are a core feature for handling negotiation and agreements. Blockchain technology has seen the introduction of different sorts of consensus mechanism, ranging from tasks of heavy computation to the subtle mathematical proofs of ...
Igor M. Coelho +4 more
doaj +1 more source
FP‐BFT: A fast pipeline Byzantine consensus algorithm
IET Blockchain, 2023 The Byzantine Fault Tolerant (BFT) consensus algorithms have been widely applied in the blockchain systems because of their fault tolerance capability to determine system consistency in the presence of malicious nodes.
Xinlei Liu +4 more
doaj +1 more source