SBFT: A scalable and decentralized trust infrastructure
GG Gueta, I Abraham, S Grossman… - 2019 49th Annual …, 2019 - ieeexplore.ieee.org
SBFT is a state of the art Byzantine fault tolerant state machine replication system that
addresses the challenges of scalability, decentralization and global geo-replication. SBFT is …
addresses the challenges of scalability, decentralization and global geo-replication. SBFT is …
Practical byzantine fault tolerance and proactive recovery
M Castro, B Liskov - ACM Transactions on Computer Systems (TOCS), 2002 - dl.acm.org
Our growing reliance on online services accessible on the Internet demands highly
available systems that provide correct service without interruptions. Software bugs, operator …
available systems that provide correct service without interruptions. Software bugs, operator …
Zyzzyva: speculative byzantine fault tolerance
We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the
design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a …
design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a …
[PDF][PDF] Making Byzantine fault tolerant systems tolerate Byzantine faults
This paper argues for a new approach to building Byzantine fault tolerant replication
systems. We observe that although recently developed BFT state machine replication …
systems. We observe that although recently developed BFT state machine replication …
Zyzzyva: Speculative byzantine fault tolerance
A longstanding vision in distributed systems is to build reliable systems from unreliable
components. An enticing formulation of this vision is Byzantine Fault-Tolerant (BFT) state …
components. An enticing formulation of this vision is Byzantine Fault-Tolerant (BFT) state …
Fast byzantine consensus
JP Martin, L Alvisi - IEEE Transactions on Dependable and …, 2006 - ieeexplore.ieee.org
We present the first protocol that reaches asynchronous Byzantine consensus in two
communication steps in the common case. We prove that our protocol is optimal in terms of …
communication steps in the common case. We prove that our protocol is optimal in terms of …
Separating agreement from execution for Byzantine fault tolerant services
J Yin, JP Martin, A Venkataramani, L Alvisi… - Proceedings of the …, 2003 - dl.acm.org
We describe a new architecture for Byzantine fault tolerant state machine replication that
separates agreement that orders requests from execution that processes requests. This …
separates agreement that orders requests from execution that processes requests. This …
Attested append-only memory: Making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized
and replicated systems against arbitrary (Byzantine) faults. However, there are hard limits to …
and replicated systems against arbitrary (Byzantine) faults. However, there are hard limits to …
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span
multiple administrative domains. In such environments, protocols must tolerate both …
multiple administrative domains. In such environments, protocols must tolerate both …
[HTML][HTML] CloudAV: N-Version Antivirus in the Network Cloud.
J Oberheide, E Cooke, F Jahanian - USENIX Security Symposium, 2008 - usenix.org
Antivirus software is one of the most widely used tools for detecting and stopping malicious
and unwanted files. However, the long term effectiveness of traditional host-based antivirus …
and unwanted files. However, the long term effectiveness of traditional host-based antivirus …