Defending hash tables from algorithmic complexity attacks with resource burning

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 makes use of resource burning (RB)—the verifiable expenditure of network resources—where the issuer of a request incurs so...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 1014; p. 114762
Main Authors:	Chakraborty, Trisha, Saia, Jared, Young, Maxwell
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.10.2024
Subjects:	Algorithmic complexity attack Hash table Resource burning Hash table Algorithmic complexity attack Resource burning
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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 makes use of resource burning (RB)—the verifiable expenditure of network resources—where the issuer of a request incurs some RB cost. Our algorithm, Depth Charge, charges RB costs for operations based on the depth of the appropriate object in the list that the object hashes to in the table. By appropriately setting the RB costs, our algorithm mitigates the impact of an attacker on the hash table's performance. In particular, in the presence of a significant attack, our algorithm incurs a cost which is asymptotically less that the attacker's cost.
ISSN:	0304-3975
DOI:	10.1016/j.tcs.2024.114762