Sciweavers

46 search results - page 4 / 10
» Dynamic Byzantine Quorum Systems
Sort
View
STOC
1997
ACM
131views Algorithms» more  STOC 1997»
15 years 3 months ago
Byzantine Quorum Systems
Dahlia Malkhi, Michael K. Reiter
ICPADS
2008
IEEE
15 years 6 months ago
Integrity-Preserving Replica Coordination for Byzantine Fault Tolerant Systems
The use of good random numbers is essential to the integrity of many mission-critical systems. However, when such systems are replicated for Byzantine fault tolerance, a serious i...
Wenbing Zhao
OSDI
2006
ACM
16 years 4 hour 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,...
FTCS
1997
115views more  FTCS 1997»
15 years 1 months ago
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts
This paper presents robust emulation of multi-writer/multi-reader registers in message-passing systems using dynamic quorum con gurations. In addition to processor and link failur...
Nancy A. Lynch, Alexander A. Shvartsman
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
15 years 5 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor