46 citations · 127 across the 25 of their papers we have counts for
13 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…
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…
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…
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols
John Augustine, Valerie King, Anisur R. Molla +2
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 estab…