Defending Hash Tables from Subterfuge with Depth Charge. (arXiv:2308.04305v1 [cs.DC])

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

charge defending defense deletion hash network operations performance problem query request resources tables