This paper presents new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using n = 3f + 1 replicas. We improve the Byzantine fault tolerance to n = 2f + 1 by utilizing the synchrony assumption. Our protocol also solves synchro...

Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. We define the class 3S(Byz) of eventually strong Byzantine fault detectors and the class 3W(Byz) of eventually weak Byzantine fault detectors and show that any B...

Abstract In the traditional digital identity authentication, there are potential security threats caused by user’s personal privacy data being too centralized and vulnerable to attack, centralization will lead redundancy, poor permeability, lack of master control, high overall cost, abuse central rights. The authentication technology based on block chain can perfectly solve problem appeal. main...

Distributed algorithms for multi-agent resource allocation can provide privacy and scalability over centralized in many cyber-physical systems. However, the distributed nature of these render systems vulnerable to man-in-the-middle attacks that lead non-convergence infeasibility schemes. In this paper, we propose attack-resilient based on primal-dual optimization when Byzantine attackers are pr...

byzantine iconography, due to the theoretical content ruling on it, has provided a close and fundamental link with christian theology and the resolutions ruling on it, especially the most fundamental ones, namely incarnation of word in the form of picture. however, this artistic form has been able to show a good reflection of many aspects of the social life and even the popular beliefs of its s...

Abstract Cooperative spectrum sensing (CSS) is a process of achieving spatial diversity gain to make global decision for cognitive radio networks (CRNs). However, the accuracy effects owing presence Byzantine during cooperative sensing, therefore causing severe performance degradation CSS. In front malicious users (MUs) launching attack, robust defense framework proposed defend against attack a...

Throughout the literature on reliable distributed systems there is much coverage of systems which maintain correct operations in the face of fail-stop or non-Byzantine failures. What are less represented are methods for dealing with the harder problem of Byzantine failures. This paper proposes a method for dealing with these sort of failures. Fail-stop or non-Byzantine failures typically are ch...

Byzantine music is a cover term for the liturgical music used in the Orthodox Church within the Byzantine Empire and the Churches regarded as continuing that tradition. This music is monophonic (with drone notes), exclusively vocal, and almost entirely sacred: very little secular music of this kind has been preserved, although we know that court ceremonial music in Byzantium was similar to the ...

Unreliable fault detectors can be defined in terms of completeness and accuracy properties and can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. First, we define and categorize Byzantine faults. We then define two new completeness propert...