This is a brief post sketching out a synthetic style of cryptography. In this style, one doesn’t appeal to any kind of complexity theory, probability, or even adversary.

The typical presentation of theoretical cryptography has one central goal: defining what it means for cryptographic objects to be “secure”. I think this goal is misguided.

In this post, I’d like to provide a technical introduction to key encapsulation mechanisms (KEMs), with a focus on proving the security of various constructions.

This blog post is an introduction to state-separable proofs, a technique for proving the security of Cryptographic schemes.