Encrypted Search

Boolean Encrypted Search with Approximate Sets: Error Propagation, Query Obfuscation, and Threshold-Based Retrieval

Cipher Maps: A Unified Framework for Oblivious Function Approximation Through Algebraic Structures and Bernoulli Models

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

Hash-Based Oblivious Sets: A Practical Framework for Privacy-Preserving Set Operations with Probabilistic Guarantees

Maximizing Confidentiality in Encrypted Search Through Entropy Optimization

Rethinking Encrypted Search: From Access Pattern Leakage to Information-Theoretic Privacy

Encrypted search has a fundamental problem: you can’t hide what you’re looking for. Even with the best encryption, search patterns leak information. My recent work develops a new approach using oblivious Bernoulli types to achieve …

Algebraic Cipher Types: A Functorial Framework for Secure Computation

Apertures: Coordinated Partial Evaluation for Distributed Computation

Time Series Analysis of Confidentiality Degradation in Encrypted Search Systems

Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

IEEE Paper: Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

Published IEEE paper on using bootstrap methods to estimate encrypted search confidentiality against frequency attacks.

Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

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