Sciweavers

24 search results - page 4 / 5
» Proactive Byzantine Quorum Systems
Sort
View
DSN
2004
IEEE
13 years 9 months ago
A Framework for Dynamic Byzantine Storage
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...
Jean-Philippe Martin, Lorenzo Alvisi
OSDI
2000
ACM
13 years 6 months ago
Proactive Recovery in a Byzantine-Fault-Tolerant System
This paper describes an asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is t...
Miguel Castro, Barbara Liskov
ICALP
2004
Springer
13 years 11 months ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler
SOSP
2005
ACM
14 years 2 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
IPCCC
2006
IEEE
13 years 11 months ago
Maille authorization - a distributed, redundant authorization protocol
The Maille Authorization protocol provides flexible and reliable authorization in large distributed and pervasive computing systems. Service owners distribute their access control...
Andrew Fritz, Jehan-François Pâris