This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan.

We illustrate in this paper a compositional and stepwise method for designing programs that ooer a potentially unique tolerance to each of their fault-classes. More speciically, our illustration is a design of a repetitive agreement program that ooers two tolerances: (a) it masks the eeects of Byzantine failures and (b) it is stabilizing in the presence of transient and Byzantine failures.

We propose the first deterministic algorithm that tolerates up to f byzantine faults in 3f + 1-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimens...

This chapter gives an introduction to protocols for state-machine replication in groups that are connected by asynchronous networks and whose members are subject to arbitrary or “Byzantine” faults. It explains the principles of such protocols and covers the following topics: broadcast primitives, distributed cryptosystems, randomized Byzantine agreement protocols, and atomic broadcast protocols.

We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block, called 1-regular register, which can be implemented from Byzantine fault-prone components with the same round complexity as a safe register, and with only a slight increase in storage space.

Large distributed systems contain multiple components that can interact in sometimes unforeseen and complicated ways; this emergent “vulnerability of complexity” increases the likelihood of cascading failures that might result in widespread disruption. Our research explores whether we can exploit the knowledge of the system’s topology, the application’s interconnections and the application’s no...

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; after exchanging messages, all correct processes must agree on one of the initial values of the non-faulty processes. If the network consists of only unicast channels (i.e. a 2-uniform hypergraph), then Byzantine agree...

Modern networks assemble an ever growing number of nodes. However, it remains difficult to increase the number of channels per node, thus the maximal degree of the network may be bounded. This is typically the case in grid topology networks, where each node has at most four neighbors. In this paper, we address the following issue: if each node is likely to fail in an unpredictable manner, how c...

recently, baghery et al. [1, 2] presented some attacks on two rfid protocols, namely yoon and jung et al. protocols, and proposed the improved version of them. however, in this note, we show that the improved version of the jung et al. protocol suffers from desynchronization attack and the improved version of the yoon's protocol suffers from secret disclosure attack. the success probabilit...