1. Protocols Chapter 2 Protocol: A series of steps, involving two or more parties, designed to accomplish a task. All parties involved must know the protocol All parties must agree to follow it Must be unambiguous Must be complete

2. The Players dramatis personae Alice First participant Bob Second Carol Third Eve Eavesdropper Mallory Malicious attacker Trent Trusted arbitrator Peggy Prover Victor Verifier

3. Types of Protocols Arbitrated Protocols Intermediary trusted by all parties Lawyer is involved Adjudicated Protocols In case of a dispute a third party becomes involved Judge is involved Self-Enforcing Protocols The protocol itself guarantees fairness No third party is involved

4. Attacks against Protocols Passive attack Passive eavesdropper e.g. network sniffing Difficult to detect Active attack Alter protocol Pretend to be someone else Cheaters Not following the protocol Liars

5. Protocol Building Blocks Symmetric key cryptography One-Way Hash functions Public-key cryptography Digital signatures Random sequence generators

6. Symmetric Key Cryptography Secure communications Secure storage Computationally efficient Depends on a shared secret

7. Symmetric Key Cryptography Alice and Bob want to communicate securely. 1.Alice & Bob agree on a crypto algorithm 2.Alice & Bob agree on a key 3.Alice encrypts message with the key 4.Alice sends ciphertext to Bob 5.Bob decrypts with the key and reads the message

8. Symmetric Key Cryptography AliceBob Key: K Message: M Ciphertext: C = E K (M) Key: K Ciphertext: C Message: M = D K (C) = D K (E K (M)) C

9. Symmetric Key Cryptography Attacks Passive attack: Eve can only try a ciphertext only attack Eve can attempt to determine the key during the key exchange Active attack: Intercept Alice's message and substitute his own Break communication channel Cheaters: Alice can give the key to Eve, so Eve can read Bob's message

10. One-Way Hash functions One-way functions No inverse (known to exist) Hash function No known collisions Variable length inputs Fixed length outputs

11. Message Authentication Code Uses a secret key One-way hash of both the pre-image and the secret key K = symmetric key M = Message MAC = H(Enc K (M)) Only those who have the key K can calculate H(Enc K (M).

12. Public-Key Cryptography Public key and private key Each player has their own key pair Computationally intensive Vulnerable to chosen-plaintext attacks Very difficult to deduce the private key from the public key

13. Public-Key Cryptography Let: Pr = Alice's private key Pu = Alice's public key (Pr, Pu) is the key pair, and must go together. M = Plaintext from Bob Ciphertext C = E Pu (M) is calculated by Bob with Alice's public key. Only Alice has access to her private key. Thus only she can calculate the plaintext M = D Pr (E Pu (M)).

14. Public-Key Cryptography AliceBob Message: M Ciphertext: C = E BPu (M) Key pair: BPu, BPr Ciphertext: C Message: M = D BPr (C) = D BPr (E BPu (M)) C BPu

15. Digital Signatures Authentic Not forgeable Not reusable Unalterable Cannot be repudiated

16. Digital Signatures with Symmetric Crypto Alice wants to sign a digital message and send it to Bob with Trent's help. 1.Alice/Trent key, K A. Bob/Trent key, K B. 2.Alice encrypts her message to Bob with K A and sends it to Trent. 3.Trent decrypts the message with K A. 4.Trent encrypts Alice's message to Bob along with a message that it is from Alice. 5.Trent sends the encrypted bundle to Bob. 6.Bob decrypts the bundle with K B. Bob can read Alice's message along with Trent's certification.

17. Digital Signatures Public-Key Crypto Alice wants to sign a digital message and send it to Bob without Trent's help 1.Alice's public key, K A-pu, private key, K A-pr.. 2.Alice encrypts her document with her private key, K A-pr. 3.Alice sends the signed document to Bob. 4.Bob decrypts the document with K A-pu, thereby verifying the signature.

18. Digital Signatures Public-Key Crypto & Hash Functions Alice wants to sign a large digital message and send it to Bob without the public-key's compute hit. 1.Alice's public key, K A-pu, private key, K A-pr.. 2.Alice produces a one-way hash of her document. 3.Alice encrypts the hash with her private key, K A-pr. 4.Alice sends the document and the encrypted hash to Bob. 5.Bob decrypts the hash with K A-pu, calculates the hash of the document himself and compares them, thereby verifying the signature.

19. Digital Signatures Vulnerabilities Alice can cheat. She can sign a document. She can claim that her private key was compromised. Time stamps help. Escrow agents are expensive. Tamper resistant modules.

20. Random Sequence Generators Pseudo-random generator Looks random: Passes all of the statistical tests. Cryptographically Secure

21. Cryptographically Secure Random Sequence Generators It is unpredictable. Computationally infeasible to predict what the next random bit will be given complete knowledge of the algorithm and all previous bits. It cannot be reliably reproduced.

22. Basic Protocols Chapter 3 Protocols Key Exchange Authentication and key exchange Secret splitting Secret sharing

23. Key Exchange with Symmetric Crypto 1.Alice/Trent key, K A. Bob/Trent key, K B. 2.Alice calls Trent and requests a session key to communicate with Bob. 3.Trent generates a random session key. 4.Trent encrypts the session key with K A and encrypts another copy with K B. 5.Trent sends both copies to Alice. 6.Alice decrypts her copy with K A and sends Bob his copy. 7.Bob decrypts his copy with K B. 8.Alice and Bob can communicate securely with the shared session key.

24. Key Exchange with Public-Key Crypto 1.Bob sends Alice his public key, Pu. 2.Alice generates a random session key, K. 3.Alice encrypts K using Bob's public key, E Pu (K). 4.Alice sends E Pu (K) to Bob. 5.Bob decrypts Alice's message using his private key, D Pr (E Pu (K)) = K. 6.Alice and Bob encrypt their communications using the same session key, K.

25. Authentication Passwords and pass phrases Dictionary attacks Hashed passwords subject to dictionary attacks Salted passwords Public key encryption Requires key pairs Key management

26. Authentication Public Key Encryption 1. Host sends Alice a random string. 2. Alice encrypts with her private key and sends it back to the host along with her name. 3. Host looks up Alice's public key and decrypts the messsage. 4. If the message matches the string the host sent Alice then the host permits access to Alice.

27. Key Exchange with Authentication All involve a trust intermediary –Trent All subject to man in the middle attack Want to be sure you know who you are talking to.

28. Kerberos Guarding the Gates of Hell. No one leaves.

29. Authentication & Key Exchange Kerberos Maintained by MIT Up to version 5-1.10.3 - Release 1.9.4 Strong authentication Uses symmetric key encryption Uses a trusted intermediary

30. Authentication & Key Exchange Kerberos AliceBob Trent A = Alice's ID B = Bob's ID K AT = Alice/Trent symmetric key K BT = Bob/Trent symmetric key K AT K BT

31. Alice sends message to Trent AliceBob Trent A = Alice's ID B = Bob's ID A, B

32. Trent responds to Alice with info for Alice and Bob AliceBob Trent A = Alice's ID B = Bob's ID Trent generates: TS = Time stamp L = Lifetime for the key K AB = Session key M 1 = (TS, L, K AB, A) M 2 = (TS, L, K AB, B) E KAT (M 2 ) E KBT (M 1 )

33. Alice gets message from Trent AliceBob Trent A = Alice's ID B = Bob's ID Trent generates: TS = Time stamp L = Lifetime for the key K AB = Session key M 1 = (TS, L, K AB, A) M 2 = (TS, L, K AB, B) E KAT (M 2 ) E KBT (M 1 ) Alice calc's D KAT (E KAT (M 2 )). She now knows TS, L, K AB, B and E KBT (M 1 ) which she cannot decrypt. Alice also calc's E KAB (A, TS).

34. Alice sends message to Bob AliceBob Trent A = Alice's ID B = Bob's ID Trent generates: TS = Time stamp L = Lifetime for the key K AB = Session key M 1 = (TS, L, K AB, A) M 2 = (TS, L, K AB, B) E KAT (M 2 ) E KBT (M 1 ) Alice calc's D KAT (E KAT (M 2 )). She now knows TS, L, K AB, B and E KBT (M 1 ) which she cannot decrypt. Alice also calc's E KAB (A, TS). E KAB (A, TS), E KBT (M 1 ) Bob calc's D KBT (E KBT (M 1 )). He now knows TS, L, K AB, A. He can also calc D KAB (E KAB (A, TS)).

35. Bob gets message from Alice and replies to Alice AliceBob Trent A = Alice's ID B = Bob's ID Trent generates: TS = Time stamp L = Lifetime for the key K AB = Session key M 1 = (TS, L, K AB, A) M 2 = (TS, L, K AB, B) E KAT (M 2 ) E KBT (M 1 ) Alice calc's D KAT (E KAT (M 2 )). She now knows TS, L, K AB, B and E KBT (M 1 ) which she cannot decrypt. Alice also calc's E KAB (A, TS). E KAB (A, TS), E KBT (M 1 ) Bob calc's D KBT (E KBT (M 1 )). He now knows TS, L, K AB, A. He can also calc D KAB (E KAB (A, TS)). E KAB (A, TS + 1)

36. Secret Splitting Protocol Secret splitting Split a message up into n-pieces Give each to a person The message can be read only if all n-people put their pieces together

37. Secret Splitting Protocol 1.Trent wants send a message to Alice and Bob that they can only read together. 2.Trent generates a random bit string R, the same length as the message, M. 3.Trent XOR's M with R to generate S. M  R = S 4.Trent gives R to Alice and S to Bob. 5.Alice and Bob XOR their pieces together to reconstruct the message: R  S = R  M  R = M

38. Secret Splitting Protocol n – parties 1. Trent generates random bit strings R 1,... R n-1 the same length as the message, M. 2. Trent XOR's M with R 1,... R n-1 to generate R n. M + R 1 +... + R n-1 = R n 3. Trent gives R i to Alice i. 4. The Alice i 's XOR their pieces together to reconstruct the message: R 1 +... + R n = M

39. Secret Sharing Protocol n – parties Goal: To share a message among 5 people so that any 3 can reconstruct the message. Threshold Scheme: (m, n) – threshold scheme. A message is divided into n pieces called shadows or shares so that any m of them can be used to reconstruct the original message.

40. Intermedate Protocols Chapter 4 Time Stamping Subliminal Channels Bit Commitment

41. Time Stamping Goals: The document itself must be time stamped. Impossible to change any part of the document without it being apparent. Impossible to timestamp the document with a date/time different from the present one.

42. Time Stamping Arbitrated Solution: 1.Alice transmits a copy of the document to Trent 2.Trent records the date/time he received the document and retains a copy of the document for safekeeping. Storage problems Privacy problems

43. Time Stamping Improved Arbitrated Solution: 1.Alice produces a one-way hash of the document. 2.Alice transmits the hash to Trent 3.Trent appends the date/time he received the hash onto the hash. H(M) | dtg 4.Trent signs the rersult. E Tpri (H(M) | dtg) 5.Trent sends the result back to Alice.

44. Subliminal Channels Secret messages sent within other messages Often within the digital signature of an innocuous message Useful enough for a lot of work to be done in this area

45. Computing with Encrypted Data Alice wants to calculate f(x) on Bob's machine. Alice does not want Bob to know x. You want to know the value of your portfolio without the news service knowing what your portfolio is.

46. Bit Commitment Alice picks a winner for tomorrow's race. Alice doesn't want Bob to know. Bob doesn't want Alice to be able to change her choice tomorrow.

47. Bit Commitment 1.Bob generates a random-bit string, R, and sends it to Alice. 2.Alice creates a message of her commitment, b and R. 3.Alice generates a random key, K, and encrypts Rb with it and sends the result to Bob. Result is E K (R,b) 4.Later Alice sends Bob the key, K. 5.Bob decrypts the message and checks his random string.

48. Zero-Based Knowledge Problem Zero-Knowledge Protocol Alice knows a secret Alice wants to prove to Bob she knows the secret Alice does not want to reveal the secret to Bob.

49. Zero-Knowledge Protocol Alice claims she knows the secret combination to the door in the back of the cave. She wants to prove so to Bob. 1.Bob stands at point A. 2.Alice goes to point C or D. 3.Bob goes to B and asks Alice come out of the cave either on the left or the right. 4.Alice complies using her secret combination if she has to. 5.Repeat n times until Bob is convinced.

50. Zero-Knowledge Protocol A B C D