This is just a synopsis of class activities. Not guaranteed to be complete or accurate. Not a substitute for class notes and attendance.

Class 1: Sept 9^th

Crypto and Distributed Systems

About Cryptography

• Encryption, obscurity, steganography
• Signatures, key Exchange, Secret sharing
• Timestamps, Bit commitment
• ZKP, Blind Signatures (melon story) Cash
• Stories of Phone Fraud,
• The need for crypto in distributed systems

About Distributed Systems

• Message passing, File sharing
• Commands form system to system
• Mutual trust – and addition of flexibility
• Power grid and telephone stories

Class 2: Sept 16^th

Encryption Technology

• Terminology
• One Time pad and XOR
• Keys – symmetric/asymmetric. Secret key and Public key
• DES, IDEA, PGP, bits and strength
• Clipper
• Communicating with Symmetric Cryptography
• Public key encryption
• RSA
• Find p q -> large prime numbers
• Choose e
• Find d, such that ed = 1 (mod(p-1)(q-1))
• Encrypt by m^e mod n
• Decrypt by m^d mod n
• Public key n and e. Private key d.
• Communicating with Public keys
• Man in the middle attack – foil with digital sigs from Trent
• Certificates and SSL
• One Way hash Functions

Class 3: Sept 23rd

PROTOCOLS
- arbitrated
- adjucated
- self enforcing

Attacks – evesdropping, malicious, replay, brute force, cheating.

The RESEND ATTACK – why not encrypt something without knowing what it is.

AUTHENTICATION
- one-way functions + Salt
- public key – challenge response – has resend attack possibility – fix has replay possibility
- SSL authentication
- SSL key exchange, and certificates and how to avoid resend/replay attacks
- Kerberos

More Protocols
- Secret Splitting
- Secret Sharing
- Sublmiminal Channels
- Fail Stop signatures: multiple private keys
- Computing with encrypted data
- Bit Commitment – symmetric and one way function
- Mental Poker (card dealing)
- Zero Knowledge Proofs - ZKP of graph isomorphiosm

Class 4: Sept 30

MORE PROTOCOLS….

• ZKP of isomorphism, non-interactive ZKP.

Revisiting Hashing RSA and encryption from a mathematical point of view (one way functions nad one way trapdoor functions). Also - why "very low probabilit" equals impossible, for all practical purposes.

• ZKP of identity is Authentication – suffers from man in the middle attacks.
• Hash functions, confidence, non-invertible, Trustable?
• Timestamps, (Trent with hash, Trent with link, Distributed)
• ANDOS/Oblivious Transfer (All or nothing disclosure of secrets)
• Blind signatures – completely blind or cut and choose
• Voting protocols
• Dining Cryptographers problem

Class 5: October 7^th

Digital Cash

Distributed Systems:

• what is a distributed system
• distributed applications
• security implications

Class 6: October 14:

Distributed Systems

• Message Passing
• Server Structure
• RPC
• Distributed Shared Memory
• Distributed algorithms

Rest of Semester is for student presentations.....
follow this link to all the talks.