Efficient Byzantine Fault-Tolerance

DOI10.1109/TC.2011.221MaRDI QIDQ5274264zbMATH OpenWikidataFDO

Authors Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, Paulo Veríssimo

Publication date 12 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2011.221

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cited in

(18)

• An efficient fault-tolerant decentralized commit protocol
• Order-fairness for Byzantine consensus
• A curvature-adapted anisotropic surface re-meshing method
• Hybrid fault-tolerant consensus in asynchronous and wireless embedded systems
• Byzantine Fault Tolerant Distributed Quickest Change Detection
• Euro-Par 2004 Parallel Processing
• Efficient Byzantine Sequential Change Detection
• Byzantine fault tolerant symmetric-persistent circle evacuation
• Byzantine fault tolerant symmetric-persistent circle evacuation
• On elapsed time consensus protocols
• Building blocks of sharding blockchain systems: concepts, approaches, and open problems
• On the Validity of Consensus
• Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
• Byzantine reliable broadcast and tendermint consensus with trusted components
• Consensus in the presence of overlapping faults and total omission
• All Byzantine agreement problems are expensive
• Randomized agreement, verifiable secret sharing and multi-party computation in granular synchrony
• Satrapy: from abstract to practical consensus for heterogeneous quorum systems

This page was built for publication: Efficient Byzantine Fault-Tolerance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5274264)