Show how native authentication and authorization services are implemented step-by-step when a web client wants to access a web server's protected resources. Layered protocols are mostly supported by these two groups: the You may demonstrate the veracity of what you are saying by giving instances.

Public Key Authority is one such instance. The Public Key Authority must prepare a request for B's public key before delivering a message to A (E(PRauth[PUB || Request || Time 1]). It is debated if the letter A should be used to decipher the message.

Here's how to secure your bike: Only things with a higher number may be locked again after being unlocked. Locks may be unlocked at any moment. All the locks are X-locks. Demonstrate how serializability is not ensured by the protocol.

2.  Recall the concept of Physically Unclonable Functions, which are an importantcomponent of hardware based security. Here is a simple scenario and simple protocol usingPUFs for authenticating a tag. In the protocol below, the Reader stores ALL possiblecombinations of Challenge-Response pairs for every tag it needs to authenticate. Duringauthentication, the Reader broadcasts the ID of the tag, and a greeting (Gn ). Every tag maysee this message, but only the one with the right ID will process the message. The right tagwith the ID in the message will then feed the greeting to its PUF and compute the responseSn. The response is then sent to the Reader. This should be clear from the Figure below. Forthe next round of authenticating the same Tag, the process repeats with a new Greeting(G n+1 ). Since the Reader has the responses, authentication is straightforward. Recall thatChallenges and Responses are typically 128 or 256 bit strings for RFIDs.From the protocol, and class, it should be…