Sciweavers

231 search results - page 7 / 47
» A Byzantine Fault Tolerant Distributed Commit Protocol
Sort
View
OSDI
2006
ACM
15 years 12 months ago
HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
James A. Cowling, Daniel S. Myers, Barbara Liskov,...
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
15 years 5 months ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch
CHARME
2003
Springer
129views Hardware» more  CHARME 2003»
15 years 4 months ago
On the Correctness of an Intrusion-Tolerant Group Communication Protocol
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
Mohamed Layouni, Jozef Hooman, Sofiène Taha...
USENIX
2008
15 years 1 months ago
Diverse Replication for Single-Machine Byzantine-Fault Tolerance
New single-machine environments are emerging from abundant computation available through multiple cores and secure virtualization. In this paper, we describe the research challeng...
Byung-Gon Chun, Petros Maniatis, Scott Shenker
WDAG
2007
Springer
103views Algorithms» more  WDAG 2007»
15 years 5 months ago
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocol...
Michael G. Merideth, Michael K. Reiter