Defending Hash Tables from Subterfuge with Depth Charge

Trisha Chakraborty, Jared Saia, Maxwell Young

Type: Article

Publication Date: 2024-01-04

Citations: 0

DOI: https://doi.org/10.1145/3631461.3631550

Locations

arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Defending Hash Tables from Subterfuge with Depth Charge	2023	Trisha Chakraborty Jared Saia Maxwell Young
+	Optimally Hiding Object Sizes with Constrained Padding	2021	Andrew C. Reed Michael K. Reiter
+	Resource-Competitive Sybil Defenses	2019	Diksha Gupta Jared Saia Maxwell Young
+ PDF Chat	Optimally Hiding Object Sizes with Constrained Padding	2023	Andrew C. Reed Michael K. Reiter
+ PDF Chat	Deviation results for sparse tables in hashing with linear probing	2022	Thierry Klein Agnès Lagnoux P. Petit
+	ToGCom: An Asymmetric Sybil Defense	2020	Diksha Gupta Jared Saia Maxwell Young
+	The Harder You Try, The Harder You Fail: The KeyTrap Denial-of-Service Algorithmic Complexity Attacks on DNSSEC	2024	Elias Heftrig Haya Schulmann Niklas Vogel Michael Waidner
+ PDF Chat	εpsolute: Efficiently Querying Databases While Providing Differential Privacy	2021	Dmytro Bogatov Georgios Kellaris George Kollios Kobbi Nissim Adam O’Neill
+ PDF Chat	Lightweight Techniques for Private Heavy Hitters	2021	Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa Yuval Ishai
+	Grafite: Taming Adversarial Queries with Optimal Range Filters	2023	Marco Costa Paolo Ferragina Giorgio Vinciguerra
+	Adversarial Correctness and Privacy for Probabilistic Data Structures	2022	Mia Filić Kenneth G. Paterson Anupama Unnikrishnan Fernando Virdia
+	Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard	2012	Jonathan Ullman
+ PDF Chat	Bloom Filters, Adaptivity, and the Dictionary Problem	2018	Michael A. Bender Martı́n Farach-Colton Mayank Goswami Rob Johnson Samuel McCauley Shikha Singh
+ PDF Chat	Improving Query Efficiency of Black-Box Adversarial Attack	2020	Yang Bai Yuyuan Zeng Yong Jiang Yisen Wang Shu‐Tao Xia Weiwei Guo
+	Answering n^{2+o(1)} Counting Queries with Differential Privacy is Hard	2012	Jonathan Ullman
+	Bankrupting DoS Attackers	2022	Trisha Chakraborty Abir Islam Valerie King Daniel Rayborn Jared Saia Maxwell Young
+	Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version)	2023	Adi Kafuman Moshik Hershcovitch Adam Morrison
+ PDF Chat	Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs	2024	Sara Ahmadian Edith Cohen
+	Lightweight Techniques for Private Heavy Hitters.	2020	Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa Yuval Ishai
+	Cuckoo Hashing in Cryptography: Optimal Parameters, Robustness and Applications	2023	Kevin Yeo

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (4)

Action	Title	Year	Authors
+ PDF Chat	Security of HyperLogLog (HLL) Cardinality Estimation: Vulnerabilities and Protection	2020	Pedro Reviriego Daniel Ting
+ PDF Chat	Foundations, Properties, and Security Applications of Puzzles	2020	Isra Mohamed Ali Maurantonio Caprolu Roberto Di Pietro
+ PDF Chat	Bankrupting Sybil Despite Churn	2021	Diksha Gupta Jared Saia Maxwell Young
+ PDF Chat	Static Analysis for Regular Expression Denial-of-Service Attacks	2013	James Kirrage Asiri Rathnayake Hayo Thielecke