Efficient Byzantine Fault-Tolerance

DOI10.1109/TC.2011.221zbMATH Open1365.68078WikidataQ56032164 ScholiaQ56032164MaRDI QIDQ5274264FDOQ5274264

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)

Mathematics Subject Classification ID

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

Cited In (13)

• Efficient Byzantine Sequential Change Detection
• Title not available (Why is that?)
• Order-fairness for Byzantine consensus
• A curvature-adapted anisotropic surface re-meshing method
• Building blocks of sharding blockchain systems: concepts, approaches, and open problems
• Zombies and ghosts: optimal Byzantine agreement in the presence of omission faults
• An efficient fault-tolerant decentralized commit protocol
• Euro-Par 2004 Parallel Processing
• Byzantine fault tolerant symmetric-persistent circle evacuation
• Byzantine fault tolerant symmetric-persistent circle evacuation
• On the Validity of Consensus
• On elapsed time consensus protocols
• Byzantine Fault Tolerant Distributed Quickest Change Detection

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)