Byzantine failure detectors provide an elegant abstraction for implementing Byzantine fault tolerance. However, as far as we know, there is no general solution for this problem in a dynamic distributed system over wireless networks with unknown membership. This paper presents thus a rst Byzantine failure detector for this context. The protocol has the interesting feature to be time-free, that i...

State machine replication is a common approach for making a distributed service highly available and resilient to failures, by replicating it on different processes. It is well-known, however, that the difficulty of ensuring the safety and liveness of a replicated service increases significantly when no synchrony assumptions are made, and when processes can exhibit Byzantine behaviors. The cont...

We present a new class of Byzantine-tolerant State Machine Replication protocols for asynchronous environments that we term Byzantine Chain Replication. We demonstrate two implementations that present different trade-offs between performance and security, and compare these with related work. Leveraging an external reconfiguration service, these protocols are not based on Byzantine consensus, do...

Our work presents the most recent developments in instrumental and DSP melodic reproduction of Byzantine music. This specific musical system is a Delta musical structure with a “thinner” microtonal scale partition of the well-known European scale and therefore new notes are involved. Apart from the tonality distribution, in Byzantine music Delta notation, transitional patterns appear stating qu...

The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes (1) authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption that the signature cannot be forged by any other process), and (2) Byzantine faults, where there is no mechanism for signatures (but the rec...

Byzantine chants constitute a form of monophonic vocal music characterized by lengthy phrases and by musical scales with intervals smaller than the western music semitones. Byzantine churches have extremely long Reverberation Time and their acoustics is dominated by the contributions of the diffuse sound field. Thus, the sound character of Byzantine chanting is closely linked to the acoustic re...

This paper is the outcome of a study for three algorithms that can be used to solve the Byzantine Generals/Agreement problem in sensor networks. Sensor networks are in this way different from the regular networks, where solutions have been proposed for, that they use broadcasting to communicate with other nodes. This paper presents one algorithm for reaching Byzantine Agreement in fully connect...

Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behaviorfrom faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems. Our results contradict the common belief that Byzantine fault tolerance is too slow ...

In this paper, we describe a lightweight solution for protecting real-time collaborative editing systems against Byzantine faults. We observe that a centralized coordination algorithm not only reduces the complexity of the editing system, it makes easier to harden the system with Byzantine fault tolerance. We perform a comprehensive analysis of the potential threats towards collaborative editin...

A trustworthy networked information system (NIS) must continue to operate correctly even in the presence of environmental disruptions, human errors, and hostile attacks [10]—in other words, it must be both faulttolerant and secure. Reasoning about such a system is, unfortunately, very hard. Our limited success to date in building reliable NISs is an indication of the complexity involved with gu...