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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 1014; s. 114762
Hlavní autori: Chakraborty, Trisha, Saia, Jared, Young, Maxwell
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 27.10.2024
Predmet:
Algorithmic complexity attack
Hash table
Resource burning
Hash table
Algorithmic complexity attack
Resource burning
ISSN:0304-3975
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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