Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a
computational cost on participating devices. Unfortunately, traditional PoW schemes require …

In interactive coding, Alice and Bob wish to compute some function f of their individual
private inputs x and y. They do this by engaging in a non-adaptive (fixed order, fixed length) …

Given a noiseless protocol π0 computing a function f (x, y) of Alice and Bob's private inputs
x, y, the goal of interactive coding is to construct an error-resilient protocol π computing f …

We address fully-defective asynchronous networks, in which all links are subject to an
unlimited number of alteration errors, implying that all messages in the network may be …

The point of adversarial analysis is to model the worst-case performance of an algorithm.
Unfortunately, this analysis may not always reect performance in practice because the …

On-demand provisioning in the cloud allows for services to remain available despite
massive denial-of-service (DoS) attacks. Unfortunately, on-demand provisioning is …

The last decade has seen substantial progress on designing Byzantine agreement
algorithms which do not require all-to-all communication. However, these protocols do …

A Sybil attack occurs when an adversary controls multiple system identifiers (IDs). Limiting
the number of Sybil (bad) IDs to a minority is critical for tolerating malicious behavior. A …

Consider a scenario where Alice wishes to send a message m to Bob in a time-slotted
wireless network. However, there exists an adversary, Carol, who aims to prevent the …

We consider distributed computations between two parties carried out over a noisy channel
that may erase messages. Following a noise model proposed by Dani et al.(2018), the noise …