research
∙
06/07/2023
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version)
Key-value stores typically leave access control to the systems for which...
share
research
∙
03/31/2022
Prefix Filter: Practically and Theoretically Better Than Bloom
Many applications of approximate membership query data structures, or fi...
research
∙
01/23/2022
Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing
We present the Cuckoo Trie, a fast, memory-efficient ordered index struc...
research
∙
06/29/2021
An Analysis of Speculative Type Confusion Vulnerabilities in the Wild
Spectre v1 attacks, which exploit conditional branch misprediction, are ...
research
∙
11/15/2020
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity
We present the first recoverable mutual exclusion (RME) algorithm that i...
research
∙
10/02/2020
Proving Highly-Concurrent Traversals Correct
Modern highly-concurrent search data structures, such as search trees, o...
research
∙
07/23/2020
Speculative Interference Attacks: Breaking Invisible Speculation Schemes
Recent security vulnerabilities that target speculative execution (e.g.,...
research
∙
08/04/2019
Programmable In-Network Security for Context-aware BYOD Policies
Bring Your Own Device (BYOD) has become the new norm in enterprise netwo...
research
∙
05/10/2018
