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 …

To defend against denial-of-service (DoS) attacks, we employ a technique called resource
burning (RB). RB is the verifiable expenditure of a resource, such as computational power …

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 last decade has seen substantial progress on designing Byzantine agreement
algorithms which do not require all-to-all communication. However, these protocols do …

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 …

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 …

Allocating resources in computer systems is a significant challenge due to constraints on
resources, coordinating access to those resources, and tolerating malicious behavior. This …

Motivated, in part, by the rise of permissionless systems such as Bitcoin where arbitrary
nodes (whose identities are not known apriori) can join and leave at will, we extend …

Abstract In 1993, Dwork and Naor proposed using computational puzzles, a resource
burning mechanism, to combat spam email. In the ensuing three decades, resource burning …

Distributed systems are ubiquitous today: from the Internet used by billions of people around
the world to the small scale IoT devices. With this rapidly increasing need to perform …