This monograph surveys recent advances in adversarial robustness, including techniques for insertion-only streams, connections to differential privacy, and cryptographic methods that achieve adversarial robustness.
Abstract
Sketching and streaming algorithms are vital for handling massive datasets. While classical methods guarantee correctness on fixed inputs, they often fail with adaptive inputs, where future data depends on past algorithm outputs. This is common in settings such as optimization, databases, finance, and network monitoring. This monograph surveys recent advances in adversarial robustness, including techniques for insertion-only streams, connections to differential privacy, and cryptographic methods that achieve adversarial robustness. We also discuss fundamental limitations, especially for linear sketches and streams with insertions and deletions, where robustness often requires polynomial space or sketching dimension. Throughout, we explore core problems like adaptively answering queries for optimization problems, norm estimation, frequency moments, and heavy hitters, and highlight emerging tools and open challenges at the intersection of streaming, sketching, privacy, and adversarial robustness.
Recent advances in learning-augmented streaming show that access to an $\epsilon$-accurate oracle enables single-pass sublinear-space algorithms to surpass the classical 1/2 approximation barrier for MAX-CUT, achieving guarantees of $1 / 2+\Omega\left(\epsilon^{2}\right)$. However, existing formulations implicitly assu...
S. S, Matan P, Krithikha Sanju S et al.· International Conference Com...· 0 citations
This survey examines a recent class of adversarial efficiency degradation attacks that target these mechanisms to increase computation without necessarily degrading accuracy, and unify and compare two representative attacks across three popular token-pruning frameworks.
Anadi Goyal, Nandish Chattopadhyay, Anupam Chattopadhyay et al.· 0 citations
Federated learning is appealing for privacy-sensitive network systems, yet its practical deployment remains hindered by the following three recurring challenges: (1) client drift under non-IID data, (2) vulnerability to corrupted updates, and (3) the communication cost of repeated model exchange. Most existing approach...
Hua Kun, Wei Wang· 2026 International Conferenc...· 0 citations
Cloud-based Large Language Model (LLM) inference services typically require users to submit plain-text inputs, thereby posing severe privacy risks. Existing privacy-preserving paradigms are mostly task-specific and often necessitate pervasive modifications to the entire server-side model. This reliance introduces subst...
Wentao Zhong, Yu-Ting Li, Di-Cong Yu et al.· IEEE Transactions on Informa...· 0 citations
A set of robust features that capture stable domain characteristics, including lexical word validity, homoglyph disguises, brand impersonation, subdomain depth, character entropy, and transport-related signals are proposed, which substantially improves robustness under adversarial conditions.
This survey examines KD-based FL through a privacy and security lens, and provides a precise framework for evaluating what KD-FL methods actually guarantee and what they only make harder for an adversary.
Hamza Reguieg, Essaid Sabir, M. El Kamili· IEEE Access· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
