Cryptography
Browse posts by tag
Cipher Maps: A Unified Framework for Oblivious Function Approximation Through Algebraic Structures and Bernoulli Models
Cipher Maps: When Category Theory Meets Oblivious Computing
What if we could compute on encrypted data while preserving algebraic structure? Not through expensive homomorphic encryption, but through a principled mathematical framework that unifies oblivious computing, Bernoulli types, and categorical …
Encrypted Search with Oblivious Bernoulli Types: Information-Theoretic Privacy through Controlled Approximation
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
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
How do you store infinity in 256 bits? An exploration of the fundamental deception at the heart of cryptography: using finite information to simulate infinite randomness.
Known Plaintext Attacks on Time Series Encryption
Analysis of known plaintext attack vulnerabilities in time series encryption schemes.
Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security
What if a perfect hash function could simultaneously be: (1) cryptographically secure, (2) space-optimal, and (3) maximum-entropy encoded? This paper proves such a construction exists—and analyzes exactly what you sacrifice to get all three.
The …
The Beautiful Deception: How 256 Bits Pretend to be Infinity
The Beautiful Deception: How 256 Bits Pretend to be Infinity
Algebraic Hashing: Composable Hash Functions Through XOR
Most hash libraries treat hash functions as black boxes. Algebraic Hashing exposes their mathematical structure, letting you compose hash functions like algebraic expressions—with zero runtime overhead.
The Core Insight
Hash functions form an abelian …
Time Series Analysis of Confidentiality Degradation in Encrypted Search Systems
Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method
📄 PDF Document
This paper applies an approach of resilience engineering in studying how effective encrypted searches will be. One of the concerns on encrypted searches is frequency attacks. In frequency attacks, adversaries guess the …
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.
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
📄 PDF Document
Encrypted Search, a technique for securely searching documents on untrusted systems. The author designs and compares several secure index types to determine their performance in terms of time complexity, space complexity, …