Sciweavers

148 search results - page 6 / 30
» Self-stabilization of Byzantine Protocols
Sort
View
PODC
2012
ACM
12 years 7 days ago
On the (limited) power of non-equivocation
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
Allen Clement, Flavio Junqueira, Aniket Kate, Rodr...
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 10 months ago
On Byzantine Containment Properties of the $min+1$ Protocol
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
EUROSYS
2011
ACM
13 years 1 months ago
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
Tobias Distler, Rüdiger Kapitza
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
14 years 10 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin