Introduction to modern cryptography

Cover -- Half Title -- Series Page -- Title Page -- Copyright Page -- Dedication -- Table of Contents -- Preface -- I: Introduction and Classical Cryptography -- 1: Introduction -- 1.1 Cryptography and Modern Cryptography -- 1.2 The Setting of Private-Key Encryption -- 1.3 Historical Ciphers and Their Cryptanalysis -- 1.4 Principles of Modern Cryptography -- 1.4.1 Principle 1 { Formal De nitions -- 1.4.2 Principle 2 { Precise Assumptions -- 1.4.3 Principle 3 { Proofs of Security -- 1.4.4 Provable Security and Real-World Security -- References and Additional Reading -- Exercises -- 2: Perfectly Secret Encryption -- 2.1 Defnitions -- 2.2 The One-Time Pad -- 2.3 Limitations of Perfect Secrecy -- 2.4 *Shannon's Theorem -- References and Additional Reading -- Exercises -- II: Private-Key (Symmetric) Cryptography -- 3: Private-Key Encryption -- 3.1 Computational Security -- 3.1.1 The Concrete Approach -- 3.1.2 The Asymptotic Approach -- 3.2 Defining Computationally Secure Encryption -- 3.2.1 The Basic Definition of Security (EAV-Security) -- 3.2.2 *Semantic Security -- 3.3 Constructing an EAV-Secure Encryption Scheme -- 3.3.1 Pseudorandom Generators -- 3.3.2 Proofs by Reduction -- 3.3.3 EAV-Security from a Pseudorandom Generator -- 3.4 Stronger Security Notions -- 3.4.1 Security for Multiple Encryptions -- 3.4.2 Chosen-Plaintext Attacks and CPA-Security -- 3.4.3 CPA-Security for Multiple Encryptions -- 3.5 Constructing a CPA-Secure Encryption Scheme -- 3.5.1 Pseudorandom Functions and Permutations -- 3.5.2 CPA-Security from a Pseudorandom Function -- 3.6 Modes of Operation and Encryption in Practice -- 3.6.1 Stream Ciphers -- 3.6.2 Stream-Cipher Modes of Operation -- 3.6.3 Block Ciphers and Block-Cipher Modes of Operation -- 3.6.4 *Nonce-Based Encryption -- References and Additional Reading -- Exercises -- 4: Message Authentication Codes