Resource-Efficient Byzantine Fault Tolerance

DOI10.1109/TC.2015.2495213MaRDI QIDQ2985296zbMATH OpenFDO

Authors Tobias Distler, Christian Cachin, Rüdiger Kapitza

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

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

Cited in

(8)

• An efficient fault-tolerant decentralized commit protocol
• Byzantine Fault Tolerant Distributed Quickest Change Detection
• Euro-Par 2004 Parallel Processing
• Byzantine disk paxos
• Byzantine fault tolerant symmetric-persistent circle evacuation
• Byzantine fault tolerant symmetric-persistent circle evacuation
• Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
• Wait-free regular storage from Byzantine components

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

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