Privacy

Oblivious Computing: Privacy Through Approximation

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.

Bernoulli Types: A Foundation for Approximate and Oblivious Computing

A unified type-theoretic foundation for probabilistic data structures, approximate computing, and oblivious computation with information-theoretic privacy guarantees.

CTK: A Toolkit for Managing AI Conversations Across Platforms

A plugin-based system for importing, storing, searching, and exporting AI conversations from multiple providers in a unified tree format. Part of the Long Echo project.

Rank-Ordered Encrypted Search

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

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.