8 citations · 20 across the 15 of their papers we have counts for
12 papers · 1 filter
Defending Hash Tables from Subterfuge with Depth Charge
Trisha Chakraborty, Jared Saia, Maxwell Young
We consider the problem of defending a hash table against a Byzantine attacker that is trying to degrade the performance of query, insertion and deletion operations. Our defense ma…
Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert +2
Contention resolution addresses the problem of coordinating access to a shared channel. Time proceeds in slots, and a packet transmission can be made in any slot. A packet is succe…
Windowed Backoff Algorithms for WiFi: Theory and Performance under Batched Arrivals
William C. Anderton, Trisha Chakraborty, Maxwell Young
Binary exponential backoff (BEB) is a decades-old algorithm for coordinating access to a shared channel. In modern networks, BEB plays an important role in WiFi (IEEE 802.11) and o…
Resource Burning for Permissionless Systems
Diksha Gupta, Jared Saia, Maxwell Young
Proof-of-work puzzles and CAPTCHAS consume enormous amounts of energy and time. These techniques are examples of resource burning: verifiable consumption of resources solely to con…
ToGCom: An Asymmetric Sybil Defense
Diksha Gupta, Jared Saia, Maxwell Young
Proof-of-work (PoW) is one of the most common techniques to defend against Sybil attacks. Unfortunately, current PoW defenses have two main drawbacks. First, they require work to b…
Resource-Competitive Sybil Defenses
Diksha Gupta, Jared Saia, Maxwell Young
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 that cor…