Encrypted Search

Trapdoor Computing

Computing on opaque encodings: the cipher map framework, its papers, and the monograph that unifies them.

Cipher Maps: Total Functions as Trapdoor Approximations

Encrypted Search with Oblivious Bernoulli Types: Information-Theoretic Privacy through Controlled Approximation

The Entropy Ratio: Quantitative Confidentiality for Trapdoor Computing

Algebraic Cipher Types: A Functorial Framework for Secure Computation

Apertures: Coordinated Partial Evaluation for Distributed Computation

Estimating Confidentiality of Encrypted Search Systems: A Probabilistic Framework

Boolean Algebra over Trapdoor Sets: A Practical Framework for Privacy-Preserving Set Operations with Probabilistic Guarantees

Rank-Ordered Encrypted Search

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

Time Series Analysis of Confidentiality Degradation in Encrypted Search Systems

Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

IEEE Paper: Estimating Encrypted Search Confidentiality via Bootstrap

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

Encrypted Search - Enabling Standard Information Retrieval Techniques for Several New Secure Index Types While Preserving Confidentiality Against an Adversary With Access to Query Histories and Secure Index Contents

Encrypted Search - Enabling Standard Information Retrieval Techniques for Several New Secure Index Types While Preserving Confidentiality Against an Adversary With Access to Query Histories and Secure Index Contents