We address the problem of performing a multiparty computation when more than half of the processors are cooperating Byzantine faults. We show how to compute any boolean function of n inputs distributively, preserving the privacy of inputs held by nonfaulty processors, and ensuring that faulty processors obtain the function value “if and only if” the nonfaulty processors do. If the nonfaulty pro...

Several studies (see Swift et. al.’s study of Windows XP in SOSP 2003 and Chou et. al’s study of Linux in SOSP 2001) have attributed a large fraction of operating system failures to device driver flaws. Not only can driver errors cause kernel instability, but these errors can also be exploited for privilege escalation and access to kernel data structures. A search on securityfocus.com shows vul...

Diagnostic tasks involve identifying faulty components from observations of symptomatic device behavior. This paper presents a general diagnostic theory that uses the perspective of diagnosis as identifying consistent modes of behavior, correct or faulty. Our theory draws on the intuitions behind recent diagnostic theories to identify faulty components wi thout necessarily knowing how they fai ...

This paper presents a deadlock-free algorithm for multicast routing in a faulty hypercube when some of the links have failed. Wormhole routing is assumed for message communication and the number of faulty links is assumed to be fewer than the dimension of the hypercube to ensure the faulty network is not segmented. The performance of the algorithm is analyzed through simulation experiments whic...

Consider an n-dimensional SIMD hypercube Hn with 3n/2 − 1 faulty nodes. Given 2 operands, this paper presents an efficient algorithm for prefix computation on the faulty Hn. Employing the newly proposed delay-update technique and the subcube partition scheme, the proposed algorithm takes n+5logn+7 steps, and it tolerates n/2 more faulty nodes than does Raghavendra and Sridhar’s algorithm [4...

In this papel; by utilizing the circuit-switched communication modules of the hypercube nodes, we present a scheme where a (d 1)-dimensional subcube is allocated in afaulty d-dimensional hyperc,ube in the presence of up to 2(“-]) faulty nodes. The scheme is then extended to allocate a (d 1)-dimensional subcube in the presence of a combination of faulty node,s and faulty links. Theoretical and s...