2. Suppose users A and B exchange message P in a public-key system (like RSA) using...

  

Transcribed Image Text:

2. Suppose users A and B exchange message P in a public-key system (like RSA) using the following protocol: A signs P using A's private key, Kad, and sends the message to B along with plaintext giving both A's and B's identity: (A, B, P, signKad (P)) = M. B verifies A's signature by using A's public key Ke and computing verKae (signKad (P)) = P and replies to A with (B, A, P, signKB (P)) where KB is B's private key. Explain why each of the following properties is either true or why it is false. If a property is false, suggest a way to fix it. You can assume that A and B can get each other's verification keys and that they can be sure that the keys are owned by the claimed owners. 1. The signatures are authentic (each user did sign the message). 2. The signatures are not reusable (cannot be replayed). 3. The signed document is unalterable (integrity). 2. Suppose users A and B exchange message P in a public-key system (like RSA) using the following protocol: A signs P using A's private key, Kad, and sends the message to B along with plaintext giving both A's and B's identity: (A, B, P, signKad (P)) = M. B verifies A's signature by using A's public key Ke and computing verKae (signKad (P)) = P and replies to A with (B, A, P, signKB (P)) where KB is B's private key. Explain why each of the following properties is either true or why it is false. If a property is false, suggest a way to fix it. You can assume that A and B can get each other's verification keys and that they can be sure that the keys are owned by the claimed owners. 1. The signatures are authentic (each user did sign the message). 2. The signatures are not reusable (cannot be replayed). 3. The signed document is unalterable (integrity).