#encryptedsearch

My first IEEE publication. Using bootstrap methods to estimate how many queries an adversary needs to break encrypted search.

Rank-ordered search over encrypted documents using oblivious entropy maps, enabling relevance scoring without revealing document contents.

Why naive encryption of temporal data leaks more than you'd expect, and what to do about it.