Byzantine Agreements were first formally proposed by Lamport [8], for use in finding faulty processors in distrubuted computer networks. In this article we will use the process of finding faults to uncover traitors in secure communications networks. Maintaining reliability in trusted networks is an important application of Byzantine Agreements. Thus by introducing the fundamentals of the Byzant...

The Chronicon Bruxellense does not simply provide useful information on the date of (year, month, and day) Rus’ attack Constantinople (18 June 860), but is crucial for a deeper understanding nature this chronicle his sources. article reveals important details about structure Bruxellense. It also offers sources description raid identifies George Monachus Continuatus’s as principal model. By seek...

This paper proposes the first implementation of a regular register by n servers that is tolerant to both mobile Byzantine agents, and transient failures (it is self-stabilizing) in a round-free synchronous model. We consider the most difficult model for mobile Byzantine agents to date where the message delay, δ, and the speed of mobile Byzantine agents, ∆, are completely decoupled. Moreover, se...

This paper considers the problem of sequential binary hypothesis testing based on observations from a network $m$ sensors where subset is compromised by malicious adversary. The asymptotic average sample number required to reach certain...

There is an abundance of writing about Token Circulation (or leader election). Much of the work is dedicated to self-stabilizing Token Circulation, ever since the publishing of Dijkstra’s seminal paper. Few of the papers focus on the Byzantine fault model and, to the best of our knowledge, there is no self-stabilizing Token Circulation algorithm that tolerates Byzantine faults. In this paper, w...

Consider an asynchronous network in a shared-memory environment consisting of n nodes. Assume that up to f of the nodes might be Byzantine (n > 12f), where the adversary is full-information and dynamic (sometimes called adaptive). In addition, the non-Byzantine nodes may undergo transient failures. Nodes advance in atomic steps, which consist of reading all registers, performing some calculatio...

In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent arbitrary failures in the system. This paper introduces a generalization of Byzantine agreement, where the input values of the nodes are preference rankings of three or more candidates. We show that consensus on pref...

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 Byzantine faulty clients. This paper presents novel protocols that provide atomic semantics despite Byzantine clients. Our protocols are the first to handle all problems caused by Byzantine clients. They prevent Byzantine c...

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f +1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance threshold to n =...

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f + 1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance to n = 2f + 1 b...