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 clothing of Mexican indigenous origin is characterized primarily by the materials of which it is made, the type of fabric, the icons woven or embroidered therein and the colours applied in its composition. Defining their origin and visual identification based on the icons requires ethnographic, technical and historical knowledge. This work presents the analysis of images (icons) identified ...

This paper attempts to prove the significance of the viewing context and reception of an image for the developments in the modes of narration used to depict a scene and subsequently that scene’s iconography. In particular, it will examine the iconographic and narrative evolution of images depicting the vengeance of Achilles in Late Archaic black-figure vase-painting as well as in a series of Ro...

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

In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data. Our protocols tolerate f Byzantine failures with f fewer servers than existing solutions by eliminating nonessential work in the write protocol and by using read and write quorums of different sizes. In practice, however...

While swarm robotics systems are often claimed to be highly fault-tolerant, so far research has limited its attention to safe laboratory settings and has virtually ignored security issues in the presence of Byzantine robots—i.e., robots with arbitrarily faulty or malicious behavior. However, in many applications one or a few Byzantine robots might suffice to let current swarm coordination mecha...

This paper presents a new algorithm that reduces multivalued consensus to binary consensus in an asynchronous message-passing system made up of n processes where up to t may commit Byzantine failures. This algorithm has the following noteworthy properties: it assumes t < n/3 (and is consequently optimal from a resilience point of view), uses O(n) messages, has a constant time complexity, and do...