Results 181 to 190 of about 3,561,066 (223)
Some of the next articles are maybe not open access.
Practical Byzantine Fault Tolerance Based Robustness for Mobile Crowdsensing
Distributed Ledger Technologies: Research and Practice, 2023Mobile crowdsensing (MCS) has become a prominent paradigm to collect and share data based on sensing devices with built-in sensors in the Internet of Things era. Nevertheless, conventional MCS confronts various security and privacy vulnerabilities in terms of decentralized, openness, and non-dedicated properties.
Zhiyan Chen +2 more
openaire +2 more sources
Concurrent Practical Byzantine Fault Tolerance for Integration of Blockchain and Supply Chain
ACM Transactions on Internet Technology, 2021Currently, the integration of the supply chain and blockchain is promising, as blockchain successfully eliminates the bullwhip effect in the supply chain. Generally, concurrent Practical Byzantine Fault Tolerance (PBFT) consensus method, named C-PBFT, is powerful to deal with the consensus inefficiencies, caused by the fast node expansion in the supply
Xiaolong Xu 0001 +5 more
openaire +1 more source
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems, 2002Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, Byzantine faults.
Miguel Castro 0001, Barbara Liskov
openaire +2 more sources
Research on an improved practical byzantine fault tolerance algorithm
2020 2nd International Conference on Advances in Computer Technology, Information Science and Communications (CTISC), 2020PBFT is a consensus algorithm based on Byzantine fault tolerance that is widely used in current systems like blockchains. However, this algorithm has some problems that slow down its use on a large scale. In the interest of solving its problems, we have combined it with the Distributed Proof of Stake (DPoS) algorithm and smart contract technology to ...
Seybou Sakho +5 more
openaire +1 more source
Towards a Practical Approach to Confidential Byzantine Fault Tolerance
2003As the world becomes increasingly interconnected, more and more important services such as business transactions are deployed as access-anywhere services - services that are accessible by remote devices through the Internet and mobile networks. Such services often must access confidential data to provide service.
Jian Yin 0002 +4 more
openaire +2 more sources
Dynamic Protocol Blockchain for Practical Byzantine Fault Tolerance Consensus
International Journal Of Scientific Advances, 2023This work details the byzantine fault-tolerant protocols that dynamically allow replicas to join and exit. Byzantine fault-tolerant (BFT) protocols and the blockchain now play an essential role in achieving consensus. There are numerous drawbacks to PBFT, despite its multiple positives.
Ali Asad Sarfraz +4 more
openaire +1 more source
On the Practicality to Implement Byzantine Fault Tolerant Services Based on Tuple Space
2014 IEEE 28th International Conference on Advanced Information Networking and Applications, 2014A major challenge of computer systems is making these more robust, reliable and secure. In recent years, it has been found that the state machine replication is one of the most common techniques for designing systems that need high reliability. This paper introduces a new architecture for replication of Byzantine fault tolerant service, based on the ...
Aldelir Fernando Luiz +2 more
openaire +1 more source
Research on Consensus Efficiency Based on Practical Byzantine Fault Tolerance
2018 10th International Conference on Modelling, Identification and Control (ICMIC), 2018Byzantine Fault Tolerance (BFT) will be increasingly important to provide reliability in distributed systems and various Byzantine fault-tolerant algorithms have been proposed to improve efficiency. However, the practicality of BFT is still limited by its cost of consensus.
Li Zhang, Qinwei Li
openaire +1 more source
QPBFT: Practical Byzantine Fault Tolerance Consensus Algorithm Based on Quantified-Role
2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2020Practical Byzantine Fault Tolerance (PBFT) is an optional consensus protocol for consortium blockchains scenarios where strong consistency is required. However, it also inevitably incurs high energy consumption, low efficiency and poor scalability. What is more, the reliability of the consensus node cannot be guaranteed by itself.
Zhujun Zhang, Dali Zhu, Wei Fan
openaire +2 more sources
Security-Aware GA Based Practical Byzantine Fault Tolerance for Permissioned Blockchain
2019 4th International Conference on Control, Robotics and Cybernetics (CRC), 2019Achieving good performance in terms of throughput and scalability, with high quality of security has always been a challenging problem in all sorts of scheduling. Permissioned blockchain allows multiple contracts of non-trusting peer organization to be deployed for working in consortium.
Rekha Kashyap +3 more
openaire +2 more sources