Prefix Siphoning - Exploiting LSM-Tree Range Filters for Information Disclosure

Prefix Siphoning - Exploiting LSM-Tree Range Filters for Information Disclosure

Explore a conference talk that delves into a novel key disclosure timing attack on LSM-tree based key-value stores. Learn about "prefix siphoning," a technique that exploits range filters like SuRF and prefix Bloom filter to reveal key information through benign queries. Understand how this attack circumvents read access controls and poses a security threat by identifying prefixes or even full keys in scenarios where brute force methods are impractical. Gain insights into the security implications of optimizing LSM-tree range queries and the potential vulnerabilities in key-value store mechanisms.