The Shadow Nemesis - Inference Attacks on Efficiently Deployable, Efficiently Searchable Encryption

Explore a conference talk on inference attacks against efficiently deployable and searchable encryption systems. Delve into the research presented by David Pouliot and Charles V. Wright from Portland State University at the 23rd ACM Conference on Computer and Communications Security. Learn about searchable encryption, Bloom filters, classical frequency analysis, and graph matching techniques. Examine the "Cold Currents" attack method, adjacency matrices, and experimental results. Gain insights into attack accuracy, search tags, and the impact of Bloom filter parameters on security. Understand the implications of this research for the design and implementation of secure searchable encryption systems.

Introduction
Searchable Encryption
Bloom Filters
Classical Frequency Analysis
Graph Matching
Cold Currents
Adjacency Matrix
Experiments
Attack Accuracy
Search Tags
Analysis
Graph
Bloom Filter Parameters
Bloom Filter Table
Experiment Results
Conclusion