Sketching in Adversarial Environments

DOI10.1137/080733772zbMath1235.68072OpenAlexW2083100635MaRDI QIDQ3225174

Gil Segev, Moni Naor, Ilya Mironov

Publication date: 15 March 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080733772

zbMATH Keywords

communication complexitydata stream modelsketch model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Separating adaptive streaming from oblivious streaming using the bounded storage model ⋮ Bloom Filters in Adversarial Environments ⋮ A Framework for Adversarially Robust Streaming Algorithms ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols

This page was built for publication: Sketching in Adversarial Environments