Sciweavers

148 search results - page 10 / 30
» Self-stabilization of Byzantine Protocols
Sort
View
EUROPAR
2004
Springer
14 years 1 months ago
Enhancing Efficiency of Byzantine-Tolerant Coordination Protocols via Hash Functions
Abstract. Distributed protocols resilient to Byzantine failures are notorious to be costly from the computational and communication point of view. In this paper we discuss the role...
Daniela Tulone
ICALP
2004
Springer
14 years 3 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
ICDCS
2006
IEEE
14 years 3 months ago
Tolerating Byzantine Faulty Clients in a Quorum System
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...
Barbara Liskov, Rodrigo Rodrigues
WDAG
2004
Springer
105views Algorithms» more  WDAG 2004»
14 years 3 months ago
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs
In a Byzantine agreement protocol, a synchronous network of n interconnected processes of which t may be faulty, starts with an initial binary value associated with each process; a...
D. V. S. Ravikant, Muthuramakrishnan Venkitasubram...
DSN
2000
IEEE
14 years 2 months ago
Dynamic Byzantine Quorum Systems
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
Lorenzo Alvisi, Evelyn Tumlin Pierce, Dahlia Malkh...