Cryptography

Applied Cryptography

Foundations of Cryptography

Introduction to Cryptography with Coding Theory

Serious Cryptography

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

Cipher Maps: Category Theory Meets Oblivious Computing

Formalizing oblivious computing through cipher maps and algebraic cipher types, using category theory for functorial composition of privacy-preserving transformations.

Encrypted Search and Oblivious Types

Oblivious types give encrypted search information-theoretic privacy against access pattern leakage. No ORAM, no computational hardness assumptions. Here's how.

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

Algebraic Cipher Types: Computing on Encrypted Data While Preserving Structure

A functorial framework that lifts algebraic structures into the encrypted domain, enabling secure computation that preserves mathematical properties.

Algebraic Hashing A Modern C++20 Library for Composable Hash Functions Version 2.0

Apertures: Coordinated Partial Evaluation for Distributed Computation

Cryptographic perfect hash functions: A theoretical analysis on space efficiency, time complexity, and entropy

PFC: Zero-Copy Data Compression Through Prefix-Free Codecs and Generic Programming

The Beautiful Deception: How 256 Bits Pretend to be Infinity

Cryptographic theory assumes random oracles with infinite output. We have 256 bits. This paper explores how we bridge that gap, and what it means that we can.

Known Plaintext Attacks on Time Series Encryption

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

Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security

Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.

The Beautiful Deception: How 256 Bits Pretend to be Infinity

The Beautiful Deception: How 256 Bits Pretend to be Infinity

A Boolean Algebra Over Trapdoors

A Boolean algebra framework over trapdoors for cryptographic operations. Introduces a homomorphism from powerset Boolean algebra to n-bit strings via cryptographic hash functions, enabling secure computations with one-way properties.

Algebraic Hashing: Composable Hash Functions Through XOR

A C++ library for composable hash functions using algebraic structure over XOR, with template metaprogramming.

Time Series Analysis of Confidentiality Degradation in Encrypted Search Systems

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.

Random Oracles in Python

Three Python approximations of a random oracle, each showing a different tradeoff between true randomness, determinism, and composability.

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