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

翻译：我们考虑在拜占庭攻击者试图降低查询、插入和删除操作性能的场景下，防御哈希表的问题。我们的防御方法采用了资源燃烧（RB）技术——即对网络资源的可验证消耗——要求请求的发起方承担一定的RB成本。所提出的算法"深度计费"（Depth Charge）根据对象在哈希表对应链表中的深度，为操作收取相应的RB费用。通过合理设置RB成本，该算法能够减轻攻击者对哈希表性能的影响。特别地，在遭受大规模攻击时，本算法的成本渐近地低于攻击者的成本。