Peer-to-peer networks based on distributed hash tables (DHTs) have received considerable
attention ever since their introduction in 2001. Unfortunately, DHT-based systems have been …

We present Brahms, an algorithm for sampling random nodes in a large dynamic system
prone to malicious behavior. Brahms stores small membership views at each node, and yet …

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 …

Performing computation in the presence of faulty and malicious nodes is a central problem
in distributed computing. Over 35 years ago, Dwork, Peleg, Pippenger, and Upfal [STOC …

This paper shows for the first time that distributed computing can be both reliable and
efficient in an environment that is both highly dynamic and hostile. More specifically, we …

We present commensal cuckoo,* a secure group partitioning scheme for large-scale
systems that maintains the correctness of many small groups, despite a Byzantine adversary …

Since the demise of the Overnet network, the Kad network has become not only the most
popular but also the only widely used peer-to-peer system based on a distributed hash …

Decentralized systems, such as structured overlays, are subject to the Sybil attack, in which
an adversary creates many false identities to increase its influence. This paper describes a …

There are several analytical results on distributed hash tables (DHTs) that can tolerate
Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and …

Interest in anonymous communication over distributed hash tables (DHTs) has increased in
recent years. However, almost all known solutions solely aim at achieving sender or …