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...

Wormhole attack is one of the most severe security threats in wireless mesh network that can disrupt majority of routing communications, when strategically placed. At the same time, most of the existing wormhole defence mechanisms are not secure against wormhole attacks that are launched in participation mode. In this paper, we propose WRSR, a wormhole-resistant secure routing algorithm that de...

COCA is a fault-tolerant and secure on-line certi cation authority that has been built and deployed both in a local area network and in the Internet. Extremely weak assumptions characterize environments in which COCA's protocols execute correctly: no assumption is made about execution speed and message delivery delays; channels are expected to exhibit only intermittent reliability; and with 3t ...

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...

It is useful to support Byzantine robustness in a Private Information Retrieval (PIR) protocol so that any database operators that are being used cannot maliciously affect the records that a client is looking for. We analyze the problem of Byzantine servers in Goldberg’s IT-PIR protocol and relate the problem to the well known stag hunt game. To make this game more applicable, we expand it to i...

The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes 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 Byzantine faults, where there is no mechanism for signatures (but the receiver of...