8 citations · 20 across the 15 of their papers we have counts for
19 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…
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…
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…
A Policy Driven AI-Assisted PoW Framework
Trisha Chakraborty, Shaswata Mitra, Sudip Mittal +1
Proof of Work (PoW) based cyberdefense systems require incoming network requests to expend effort solving an arbitrary mathematical puzzle. Current state of the art is unable to di…
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…
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…