Table of ContentsHashing Cryptographic Protocols A sample protocol Cryptographic Primitives Implementation Overall Plan Old School: Authentic New Wave: Not Authentic Solution #1: E(D(M)) Solution #2: D(E(M)) Repudiation DES, I rebuke thee Repudiation: E(D(M)) Repudiation: D(E(M)) A general protocol Digital Signature Schemes Hash functions Hashing: Non-repudiation Strong Collision Resistance Hashing: Secretary Attack How many bits of security? Happy Birthday They say itís your birthday Hash, Paper, Scissors How do we hash? Hashing out the details A MoDESt Proposal |
Author: Sandy Kutin
Email: kutin@uchicago.edu Home Page: http://people.cs.uchicago.edu/~kutin/CSPP532 |