Neuman–Stubblebine protocol
The Neuman–Stubblebine protocol is a computer network authentication protocol designed for use on insecure networks (e.g., the Internet). It allows individuals communicating over such a network to prove their identity to each other. This protocol utilizes time stamps, but does not depend on synchronized clocks.
The protocol
If Alice (A) initiates the communication to Bob (B) with S is a server trusted by both parties, the protocol can be specified as follows using security protocol notation:
- A and B are identities of Alice and Bob respectively
- M is a session identifier
- [math]\displaystyle{ K_{AS} }[/math] is a symmetric key known only to A and S
- [math]\displaystyle{ K_{BS} }[/math] is a symmetric key known only to B and S
- [math]\displaystyle{ N_A }[/math] and [math]\displaystyle{ N_B }[/math] are nonces generated by A and B respectively
- [math]\displaystyle{ T_A }[/math] and [math]\displaystyle{ T_B }[/math] are timestamps generated by A and B respectively
- [math]\displaystyle{ K_{AB} }[/math] is a generated symmetric key, which will be the session key of the session between A and B
[math]\displaystyle{ A \rightarrow B: A, N_A }[/math]
- Alice notified Bob of intent to initiate secure communication.
[math]\displaystyle{ B \rightarrow S: B, N_B, \{A, N_A, T_B\}_{K_{BS}} }[/math]
- Bob generates a times stamp and a nonce, and sends this to the trusted Server.
[math]\displaystyle{ S \rightarrow A: \{B, N_A, K_{AB}, T_B\}_{K_{AS}}, \{A, K_{AB}, T_B\}_{K_{BS}}, N_B }[/math]
- The trusted Server generates a session key and a message for Alice to forward to Bob.
- [math]\displaystyle{ A \rightarrow B: \{A, K_{AB}, T_B\}_{K_{BS}}, \{N_B\}_{K_{AB}} }[/math]
Alice forwards the message and verifies [math]\displaystyle{ N_A }[/math] is the same that she generated earlier. Bob will verify [math]\displaystyle{ T_B }[/math] and [math]\displaystyle{ N_B }[/math] have not changed when he receives the message.
Subsequent communications
An advantage provided by this protocol is that Alice can utilize the trusted Server's message to initiate authentication with Bob within some predetermined time limit without utilizing the trusted Server. The protocol proceeds as follows using the same definitions as above.
[math]\displaystyle{ A \rightarrow B: \{A, K_{AB}, T_B\}_{K_{BS}}, N'_A }[/math]
- Alice sends the message the trusted Server sent her previously when communication with Bob.
[math]\displaystyle{ B \rightarrow A: N'_B, \{N'_A\}_{K_{AB}} }[/math]
- Bob sends Alice a new nonce and her new nonce encrypted with session key that Alice resent from previous communication.
[math]\displaystyle{ A \rightarrow B: \{N'_B\}_{K_{AB}} }[/math]
- Alice returns Bob's nonce encrypted with the session key to allow him to verify the communication is successful.
Attack
Using the theorem prover SPASS it has been shown that this protocol can be attacked.[1] This attack and two more from [2] are outlined in [1].
See also
References
Schneier, Bruce (1996), Applied Cryptography, John Wiley & Sons, pp. 60–62, ISBN 0-471-12845-7
- ↑ Weidenbach, Christoph (1999), Towards an Automatic Analysis of Security Protocols in First-Order Logic, Saarbrücken, Germany, http://www.mpi-sb.mpg.de/~weidenb/publications/cade99prot.ps.gz
- ↑ Hwang, Tzonelih; Lee, Narn-Yih; Li, Chuan-Ming; Ko, Ming-Yung; Chen, Yung-Hsiang (1994), "Two attacks on Neuman-Stubblebine authentication protocols", Information Processing Letters (Tainan, Taiwan) 53 (2): 103–107, doi:10.1016/0020-0190(95)00177-E
 |  |
