A and B are going to communicate via a virtual circuit. A already knows Bs public key KUB, and B already knows As public key KUA. After the virtual circuit has been set up, B needs to convince A that he is B, and A needs to convince B that he is A. You have to design a protocol to accomplish this task. This protocol should not assume that A and B share some secret information. There is no arbitrator or trusted third party i.e. all communication happens directly between A and B. After the virtual circuit has been set up (which happens before the protocol starts), this protocol should have only two rounds for authentication purposes, and these two rounds will be as follows: Round 1: B will send a single message to A which will convince A that it is B on the other end of the virtual circuit. Round 2: A will then reply with a single message to B which will convince B that it is A on the other end of the virtual circuit. The protocol should be designed so that it can be repeated many times i.e. A might want to communicate with B again in the future, and A, B should be able to prove their identities to each other using the same protocol again without having to change keys. The protocol should be resistant to replay attacks i.e. even if the public keys, private keys remain the same, the bad guy BG should not be able to obtain any information he gains from previous iterations of the protocol to masquerade as A or masquerade as B in the future. We are only interested in authentication, not confidentiality. You have to (a) State any assumptions you are making. (b) Give a short and clear description of the basic idea behind your protocol. (c) i. Show what B will transmit to A in round (1). ii. Explain what is the test A will run to make sure it is B on the other end (and not the BG). (d) i. Show what A will transmit to B in round (2). ii. Explain what is the test B will run to make sure it is A on the other end (and not the BG).