Further, the resulting designs tend to be overly conservative in their attack mitigation strategy, limiting the innocent traffic that the NF can serve under common-case operation. Today, network functions (NFs) on the Internet must be painstakingly designed and engineered on a case-by-case basis to mitigate the debilitating impact of ACAs. ACAs are particularly dangerous because, unlike volumetric DoS attacks, ACAs don't require a significant network bandwidth investment from the attacker. Nirav Atre, Hugo Sadok, Erica Chiang, Weina Wang, and Justine SherryĪlgorithmic complexity attacks (ACAs) are a class of denial-of-service (DoS) attacks where an attacker uses a small amount of adversarial traffic to induce a large amount of work in the target system, pushing the system into overload and causing it to drop packets from innocent users. SurgeProtector: Mitigating Temporal Algorithmic Complexity Attacks using Adversarial Scheduling at ACM SIGCOMM, 2022.In my spare time, I enjoy reading (fiction, philosophy), imbibing copious amounts of espresso, and playing chess, golf, and soccer. Despite my apparent penchant for cold, capricious weather, I spent most of life in Mumbai, India. Prior to starting graduate school, I completed my undergraduate degree (B.A.Sc.) in Computer Engineering at the University of Toronto, Canada, in 2018. building high-performance networked systems and proving theoretical properties about their performance and stability). My research interests broadly lie at the intersection of systems and performance modeling ( i.e. My research area is Networking, and I’m part of the Systems, Networking, and Performance Lab (SNAP) at CMU I’m secondarily affiliated with CONIX and CMU’s Parallel Data Lab (PDL). student in the Computer Science Department (CSD) at Carnegie Mellon University (CMU), where I’m fortunate to be advised by Prof.
0 Comments
Leave a Reply. |