Sciweavers

60 search results - page 10 / 12
» Self-stabilizing byzantine agreement
Sort
View
ICDCS
2009
IEEE
14 years 4 months ago
Distributed Key Generation for the Internet
Although distributed key generation (DKG) has been studied for some time, it has never been examined outside of the synchronous setting. We present the first realistic DKG archit...
Aniket Kate, Ian Goldberg
DSN
2006
IEEE
14 years 1 months ago
Randomized Intrusion-Tolerant Asynchronous Services
Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities, they ha...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
ISPDC
2006
IEEE
14 years 1 months ago
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
Piotr Zielinski
FORMATS
2004
Springer
13 years 11 months ago
A Unified Fault-Tolerance Protocol
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...
Paul S. Miner, Alfons Geser, Lee Pike, Jeffrey Mad...
DSN
2002
IEEE
14 years 13 days ago
Secure Intrusion-tolerant Replication on the Internet
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
Christian Cachin, Jonathan A. Poritz