Computer Science Homework Solutions
Problem
#33908

authentication protocol

Suppose we are using a three-message mutual authentication protocol, and Alice initiates contact with Bob. Suppose we wish Bob to be a stateless server, and therefore it is inconvenient to require him to remember the challenge he sent to Alice. Let's modify the exchange so that Alice sends the challenge back to Bob, along with the encrypted challenge. The protocol is:  (It is shown in the image attached)

Is this protocol secure? Justify your answer

Attached file(s):
Attachments
image003.jpg  View File
Solution
What is this?
By OTA - Overall OTA Rating
Farhan Chowdhury, MS - 4.4/5
Purchase Cost Now
$2.19 CAD (was ~$23.94)
Included in Download
  • Plain text response
  • Attached file(s):
    • mutual authentication.ppt
    • Authentication.pdf
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Network security - I need detailed answers for these 2 questions. 1.Suppose we wish to use Kerberos for securing electronic mail. The obvious way of accomplishing this is for Alice, when sending a message to Bob, to ...
  • Network security - One can simulate digital signatures using Kerberos. Explain how this can be achieved and carefully outline what functionality of digital signatures can (and cannot) be provided.
  • Assume that Alice shares a secret s with her company’s server computer. - Assume that Alice shares a secret s with her company’s server computer. When Alice is on a trip, she tries to store an important message in the CEO’s account directory. This message needn’t be encrypt ...
  • Data over Network - Should you allow data to be sent over the network unencrypted if it's stored in your database in encrypted form? Why? Please explain Why or why not?
  • Encrypted Database - Index - Why is it (more or less) impossible to make use of an index if you want to have an encrypted database?
Browse