Needham–Schroeder protocol

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Symmetric Needham–Schroeder protocol scheme

The Needham–Schroeder protocol is one of the two key transport protocols intended for use over an insecure network, both proposed by Roger Needham and Michael Schroeder.[1] These are:

  • The Needham–Schroeder Symmetric Key Protocol, based on a symmetric encryption algorithm. It forms the basis for the Kerberos protocol. This protocol aims to establish a session key between two parties on a network, typically to protect further communication.
  • The Needham–Schroeder Public-Key Protocol, based on public-key cryptography. This protocol is intended to provide mutual authentication between two parties communicating on a network, but in its proposed form is insecure.

The symmetric protocol[edit]

Here, Alice initiates the communication to Bob . is a server trusted by both parties. In the communication:

  • and are identities of Alice and Bob respectively
  • is a symmetric key known only to and
  • is a symmetric key known only to and
  • and are nonces generated by and respectively
  • is a symmetric, generated key, which will be the session key of the session between and

The protocol can be specified as follows in security protocol notation:

Alice sends a message to the server identifying herself and Bob, telling the server she wants to communicate with Bob.

The server generates and sends back to Alice a copy encrypted under for Alice to forward to Bob and also a copy for Alice. Since Alice may be requesting keys for several different people, the nonce assures Alice that the message is fresh and that the server is replying to that particular message and the inclusion of Bob's name tells Alice who she is to share this key with.

Alice forwards the key to Bob who can decrypt it with the key he shares with the server, thus authenticating the data.

Bob sends Alice a nonce encrypted under to show that he has the key.

Alice performs a simple operation on the nonce, re-encrypts it and sends it back verifying that she is still alive and that she holds the key.

Attacks on the protocol[edit]

The protocol is vulnerable to a replay attack (as identified by Denning and Sacco[2]). If an attacker uses an older, compromised value for , he can then replay the message to Bob, who will accept it, being unable to tell that the key is not fresh.

Fixing the attack[edit]

This flaw is fixed in the Kerberos protocol by the inclusion of a timestamp. It can also be fixed with the use of nonces as described below.[3] At the beginning of the protocol:

Alice sends to Bob a request.
Bob responds with a nonce encrypted under his key with the Server.
Alice sends a message to the server identifying herself and Bob, telling the server she wants to communicate with Bob.
Note the inclusion of the nonce.

The protocol then continues as described through the final three steps as described in the original protocol above. Note that is a different nonce from . The inclusion of this new nonce prevents the replaying of a compromised version of since such a message would need to be of the form which the attacker can't forge since she does not have .

The public-key protocol[edit]

This assumes the use of a public-key encryption algorithm.

Here, Alice and Bob use a trusted server to distribute public keys on request. These keys are:

  • and , respectively public and private halves of an encryption key-pair belonging to ( stands for "secret key" here)
  • and , similar belonging to
  • and , similar belonging to . (Note that this key-pair will be used for digital signatures, i.e., used for signing a message and used for verification. must be known to and before the protocol starts.)

The protocol runs as follows:

requests 's public keys from

responds with public key alongside 's identity, signed by the server for authentication purposes.

chooses a random and sends it to .

now knows A wants to communicate, so requests 's public keys.

Server responds.

chooses a random , and sends it to along with to prove ability to decrypt with .

confirms to , to prove ability to decrypt with

At the end of the protocol, and know each other's identities, and know both and . These nonces are not known to eavesdroppers.

An attack on the protocol[edit]

This protocol is vulnerable to a man-in-the-middle attack. If an impostor can persuade to initiate a session with them, they can relay the messages to and convince that he is communicating with .

Ignoring the traffic to and from , which is unchanged, the attack runs as follows:

sends to , who decrypts the message with

relays the message to , pretending that is communicating

sends

relays it to

decrypts and confirms it to , who learns it

re-encrypts , and convinces that she's decrypted it

At the end of the attack, falsely believes that is communicating with him, and that and are known only to and .

The following example illustrates the attack. Alice (A) would like to contact her bank (B). We assume that an impostor (I) successfully convinces A that they are the bank. As a consequence A uses the public key of I instead of using the public key of B to encrypt the messages she intends to send to her bank. Therefore, A sends I her nonce encrypted with the public key of I. I decrypts the message using their private key and contacts B sending it the nonce of A encrypted with the public key of B. B has no way to know that this message was actually sent by I. B responds with their own nonce and encrypts the message with the public key of A. Since I is not in possession of the private key of A they have to relay the message to A without knowing the content. A decrypts the message with her private key and respond with the nonce of B encrypted with the public key of I. I decrypts the message using their private key and is now in possession of nonce A and B. Therefore, they can now impersonate the bank and the client respectively.

Fixing the man-in-the-middle attack[edit]

The attack was first described in a 1995 paper by Gavin Lowe.[4] The paper also describes a fixed version of the scheme, referred to as the Needham–Schroeder–Lowe protocol. The fix involves the modification of message six to include the responder's identity, that is we replace:

with the fixed version:

and the intruder cannot successfully replay the message because A is expecting a message containing the identity of I whereas the message will have identity of B.

See also[edit]

References[edit]

  1. ^ Needham, Roger; Schroeder, Michael (December 1978). "Using encryption for authentication in large networks of computers". Communications of the ACM. 21 (12): 993–999. CiteSeerX 10.1.1.357.4298. doi:10.1145/359657.359659. S2CID 7704786.
  2. ^ Denning, Dorothy E.; Sacco, Giovanni Maria (1981). "Timestamps in key distribution protocols". Communications of the ACM. 24 (8): 533–535. doi:10.1145/358722.358740. S2CID 3228356.
  3. ^ Needham, R. M.; Schroeder, M. D. (1987). "Authentication revisited". ACM SIGOPS Operating Systems Review. 21 (1): 7. doi:10.1145/24592.24593. S2CID 33658476.
  4. ^ Lowe, Gavin (November 1995). "An attack on the Needham-Schroeder public key authentication protocol". Information Processing Letters. 56 (3): 131–136. CiteSeerX 10.1.1.394.6094. doi:10.1016/0020-0190(95)00144-2. Retrieved 2008-04-17.

External links[edit]