Defending Hash Tables from Subterfuge with Depth Charge
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 …
trying to degrade the performance of query, insertion and deletion operations. Our defense …
Bankrupting DoS Attackers Despite Uncertainty
On-demand provisioning in the cloud allows for services to remain available despite
massive denial-of-service (DoS) attacks. Unfortunately, on-demand provisioning is …
massive denial-of-service (DoS) attacks. Unfortunately, on-demand provisioning is …
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 …
trying to degrade the performance of query, insertion and deletion operations. Our defense …
Plateau: a secure and scalable overlay network for large distributed trust applications
J Augustine, WG Bhat, S Nair - … on Stabilizing, Safety, and Security of …, 2022 - Springer
We propose a novel two-tiered overlay network design called plateau. It has two levels: a
small upper-level that regulates entry of new nodes into the network, and a lower-level …
small upper-level that regulates entry of new nodes into the network, and a lower-level …
Resource sharing in secure distributed systems
T Chakraborty - 2024 - scholarsjunction.msstate.edu
Allocating resources in computer systems is a significant challenge due to constraints on
resources, coordinating access to those resources, and tolerating malicious behavior. This …
resources, coordinating access to those resources, and tolerating malicious behavior. This …