The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not the case of benign faults, which raises the following fundamental question: is it possible to design a deterministic Byzantine consensus alg...

We present an investigation of formant tuning in the context of the Byzantine Ecclesiastic chant voice. The recordings selected for the analysis are part of the DAMASKINOS prototype acoustic corpus of Byzantine Ecclesiastic voice. More specifically, we analyzed recordings from 10 different chanters in ascending musical scales of the diatonic genre, for the /a/ vowel. The method of analysis incl...

Byzantine Agreement introduced in [Pease, Shostak, Lamport, 80] is a widely used building block of reliable distributed protocols. It simulates broadcast despite the presence of faulty parties within the network, traditionally using only private unicast links. Under such conditions, Byzantine Agreement requires more than 2/3 of the parties to be compliant. [Fitzi, Maurer, 00], constructed a Byz...

Tolerating byzantine faults on a large scale is a challenge: in particular, Desktop Grid environments sustain large numbers of faults that range from crashes to byzantine faults. Solutions in the literature that address byzantine failures are costly and none of them scales to really large numbers of nodes. This paper proposes to distribute task scheduling on trusted nodes in a Cloud network and...

We present ASTRO, a Byzantine fault tolerant data sharing service for mobile computing environments. ASTRO is the first system to support disconnected operation and opportunistic data sharing among potentially Byzantine nodes while continuing to provide precise and useful consistency guarantees to correct nodes. Specifically, ASTRO supports fork-causal consistency, a new consistency semantics t...