46 citations · 127 across the 25 of their papers we have counts for
32 papers
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…
Bankrupting DoS Attackers
Trisha Chakraborty, Abir Islam, Valerie King +3
Can we make a denial-of-service attacker pay more than the server and honest clients? Consider a model where a server sees a stream of jobs sent by either honest clients or an adve…
Bankrupting Sybil Despite Churn
Diksha Gupta, Jared Saia, Maxwell Young
A Sybil attack occurs when an adversary controls multiple identifiers (IDs) in a system. Limiting the number of Sybil (bad) IDs to a minority is critical to the use of well-establi…
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…
A Most Irrational Foraging Algorithm
Abhinav Aggarwal, William F. Vining, Diksha Gupta +2
We present a foraging algorithm, GoldenFA, in which search direction is chosen based on the Golden Ratio. We show both theoretically and empirically that GoldenFA is more efficient…