CS 555: List of Topics
A * marks a topic already covered
A ">>>" marks topic to be continued (or started) next lecture
The following list is tentative --- we will probably not have enough
time to cover all topics, and I may change the ordering of the list:
* Building blocks (basic definitions and notation, not yet
how they are built, which comes later in the
course): 1-way hash functions, 1-key (symmetric)
crypto, 2-key (public key) crypto, notions of
security (info-theoretic, computational)
* Timestamping, Merkle trees
* Communications using symmetric crypto, using public key, signatures
* Interlock technique
* Bit commitment, coin-flipping
* Passwords - dictionary attack, salt (public, private), one-time passwords (SKEY)
* Key exchange (symmetric, public key), resend attack, person-in-the-middle
attack
Authentication and key exchange; subset of {* Wide-mouth frog, * Needham-Schroeder,
* Otway-Rees, Neuman-Stubblebine, * Denning-Sacco, DASS, Woo-Lam}
* Oblivious transfer protocol
* Blind signatures and their use
* Secret splitting
* Mental poker
* Interactive 0-knowledge pfs - isomorphism, Hamilton cycle, noninteractive proofs
* Anonymous message broadcasting, anonymous communication
* Digital cash
* Simultaneous contract signing
* Digital certified mail, simultaneous exchange of secrets
* 1-way accumulators
* Voting without a central tabulating facility
* Secure multi-party computation
* Homomorphic encryption and its use in computing with encrypted data
Block ciphers, stream ciphers (+ various usage modes of each)
* Review of elementary number theory & algorithms:
* Modular exponentiation algorithm
* Euclid algorithm,
* Extended Euclid algorithm, multiplicative inverse computation
* Euler's phi function
* Fermat's little theorem and its use in primality testing,
Carmichael numbers,
Chinese remainder
Square roots, quadratic residues
* RSA
* Diffie-Hellman key exchange,
some generalizations (multiparty, Hughes)
Shamir's 3-pass protocol
* ElGamal (signature, encryption)
Primality testing (Lehman), generators
* Rabin's oblivious transfer
* Feige-Fiat-Shamir identification, Fiat-Shamir signature
* Schnorr identification, signature
* Tamperproofing audits
DES, SHA, AES
* Secret sharing (Blakley, Shamir)
* Chaum's undeniable signature scheme
Sect 23.4 plus the disavowal protocol at:
http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/E90/458.PDF
For the original paper see
http://portal.acm.org/citation.cfm?id=112388
* Key derivation in access control
http://www.cse.nd.edu/~mblanton/papers/ccs05.pdf
* Bilinear maps and their use in aggregate signatures
http://crypto.stanford.edu/~dabo/papers/aggreg.pdf
* Information hiding (watermarking, fingerprinting, steganography)
* Quantitative risk analysis
http://www.cs.purdue.edu/homes/mja/Sec_Powerpoints/QuantRiskAnalysis.rtf
* Crypto and malware
http://portal.acm.org/citation.cfm?id=242869