Oblivious Computing

Bernoulli Types: Theory and Construction

Oblivious Computing: Privacy Through Approximation

Private Information Retrieval and Systems

Regular Types in the Bernoulli Model: When Equality Isn't Equal

Statistical Foundations and Empirical Validation

Two-Level Threshold Structures for Approximate Membership Testing

What I Learned by Analyzing My Own Research as Data

I asked an AI to analyze 140+ repos and 50+ papers as a dataset. The unifying thesis it found: compositional abstractions for computing under ignorance.

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

Maximizing Confidentiality in Encrypted Search Through Entropy Optimization

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

Time Series Analysis of Confidentiality Degradation in Encrypted Search Systems

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