1]
Alice
wants to talk to Bob, so she sends Bob a message saying, “Hi Bob, this is
Alice” and attaches Alice’s certificate. Mallory intercepts the
message and replays it to Bob. Bob thinks the message is from Alice and so
wants to verify, and generates a challenge and sends it to Mallory saying, “Prove
you are Alice”.
Mallory
sends the challenge to Alice, who responds correctly. Mallory forwards this
response to Bob. Bob is now convinced that Mallory is Alice.
The
above is a man-in-the-middle attack. Now that Mallory has proven to Bob that he
is Alice, Bob will talk to Mallory thinking Mallory is Alice. Note that we used
a certificate (signed by a trusted authority) to do the authentication.
How
can this be possible? We know that use of certificates makes m-i-t-m attacks not possible. Briefly show what is wrong
with the above logic. (That is, show how Alice and Bob can talk privately
in spite of Mallory)
2]
Suppose
Alice and Bob want to communicate (or rather set up a secret key) using the Merkle’s Puzzle algorithm. Alice has to send Bob a large
number of “puzzles”. Each puzzle must be solvable in a reasonable time and the
solution is a number.
3]
Alice
writes a digital check for $10 and signs it (using her private key). Then she
takes this check to the bank, which checks the check, and Alice’s signature and
then signs the check (along with Alice’s signature).
Now
Alice e-mails the check to Bob and Carol and Dave.