A Simple Proof — IND$-NRCPA-Secure Nonce-Based Symmetric Encryption Scheme

As a warm-up, we'll consider a simple nonce-based symmetric encryption scheme for fixed-length messages.¹ Here, we assume some familiarity with cryptographic definitions and proofs.

📄️ Defining the Preliminaries/Context

We will start off by defining the preliminaries and context of our security proof,

📄️ Defining Security

Now that we have a scheme, we can define its security. For the time being,

📄️ Proving Security

Having formalized the relevant context and the more general security-related definitions

🗃️ Going Further

2 items

Footnotes

1. Note the similarities to The Joy of Cryptography's Construction 7.4. ↩