37 search results - page 2 / 8 » Tolerating Byzantine Faulty Clients in a Quorum System |
PODC
1998
ACM
13 years 9 months ago
1998
ACM
ÐIn this paper, we explore techniques to detect Byzantine server failures in asynchronous replicated data services. Our goal is to detect arbitrary failures of data servers in a s...
NSDI
2007
13 years 7 months ago
2007
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
DSN
2004
IEEE
13 years 9 months ago
2004
IEEE
We present a framework for transforming several quorum-based protocols so that they can dynamically adapt their failure threshold and server count, allowing them to be reconfigure...
OSDI
2006
ACM
14 years 5 months ago
2006
ACM
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...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...