Added to Favorites

The Station-to-Station (STS) protocol is a cryptographic key agreement scheme based on classic Diffie-Hellman that provides mutual key and entity authentication.

In addition to protecting the established key from an attacker, the STS protocol uses no timestamps and provides perfect forward secrecy. It also entails two-way explicit key confirmation, making it an authenticated key agreement with key confirmation (AKC) protocol.

STS was originally presented in 1987 in the context of ISDN security , finalized in 1989 and generally presented by Whitfield Diffie, Paul C. van Oorschot and Michael J. Wiener in 1992. The historical context for the protocol is also discussed in .

Deployment of STS can take different forms depending on communication requirements and the level of prior communication between parties. The data described in STS Setup may be shared prior to the beginning of a session to lessen the impact of the session's establishment.

In the following explanations, exponential (Diffie-Hellman) operations provide the basis for key agreement, though this is not a requirement. The protocol may be modified, for example, to use elliptic curves instead.

The following data must be generated before initiating the protocol.

- ; An asymmetric signature keypair for each party : Required for authentication. The public portion of this keypair may be shared prior to session establishment.

- ; Key establishment parameters : The specification of a cyclic group p and a generator g for that group. These parameters may be public. note that for additional security each party may supply its own parameters.

Sharing this data prior to the beginning of the session lessens the complexity of the protocol.

Supposing all setup data has been shared, the STS protocol proceeds as follows (all exponentials are in the group specified by p). If a step cannot be completed, the protocol immediately stops.

- Alice generates a random number x and computes and sends the exponential g
^{x}to Bob. - Bob generates a random number y and computes the exponential g
^{y}. - Bob computes the shared secret key K = (g
^{x})^{y}. - Bob concatenates the exponentials (g
^{y}, g^{x}) (order is important), signs them using his asymmetric key B, and then encrypts them with K. He sends the ciphertext along with his own exponential g^{y}to Alice. - Alice computes the shared secret key K = (g
^{y})^{x}. - Alice decrypts and verifies Bob's signature.
- Alice concatenates the exponentials (g
^{x}, g^{y}) (order is important), signs them using her asymmetric key A, and then encrypts them with K. She sends the ciphertext to Bob. - Bob decrypts and verifies Alice's signature.

Alice and Bob are now mutually authenticated and have a shared secret. This secret, K, can then be used to encrypt further communication. The basic form of the protocol is formalized in the following three steps:

(1) Alice → Bob : g^{x}

(2) Alice ← Bob : g^{y}, E_{K}(S_{B}(g^{y}, g^{x}))

(3) Alice → Bob : E_{K}(S_{A}(g^{x}, g^{y}))

Setup data can also be incorporated into the protocol itself. Public key certificates may be sent in steps 2 and 3 if the keys are not known in advance.

(1) Alice → Bob : g^{x}

(2) Alice ← Bob : g^{y}, Cert_{B}, E_{K}(S_{B}(g^{y}, g^{x}))

(3) Alice → Bob : Cert_{A}, E_{K}(S_{A}(g^{x}, g^{y}))

If system-wide key establishment parameters are not used, the initiator and responder may create and send their own parameters. In this case, parameters should be sent with the exponential.

(1) Alice → Bob : g, p, g^{x}

They must also be verfied by Bob to prevent an active attacker from inserting weak parameters (and thus a weak key K). recommend against special checks to prevent this and instead suggest including the group parameters in Alice's certificate.

The variations mentioned here are from the original STS paper. See the following references for other, more significant variations.

- RFC 2412, "The OAKLEY Key Determination Protocol".
- ISO/IEC 117703, "Mechanisms Using Asymmetric Techniques", (1999).

A simplified form of STS is available that provides mutual authentication but does not produce a shared secret. It uses random number challenges instead of the above Diffie-Hellman technique.

- Alice generates a random number x sends it to Bob.
- Bob generates a random number y.
- Bob concatenates the random numbers (y, x) (order is important) and signs them using his asymmetric key B. He sends the signature along with his own random number to Alice.
- Alice verifies Bob's signature.
- Alice concatenates the random numbers (x, y) (order is important) and signs them using her asymmetric key A. She sends the signature to Bob.
- Bob verifies Alice's signature.

Formally:

`(1) Alice → Bob : x`

(2) Alice ← Bob : y, S_{B}(y, x)

(3) Alice → Bob : S_{A}(x, y)

This protocol can be extended to include certificates as in Full STS.

In cases where encryption is a not viable choice in session establishment, K can instead be used to create a MAC.

(1) Alice → Bob : g^{x}

(2) Alice ← Bob : g^{y}, S_{B}(g^{y}, g^{x}), MAC_{K}(S_{B}(g^{y}, g^{x}))

(3) Alice → Bob : Snote that this variation may be preferable to original STS ("STS-ENC") in any case because_{A}(g^{x}, g^{y}), MAC_{K}(S_{A}(g^{x}, g^{y}))

- .. the use of encryption to provide key confirmation in STS-ENC is questionable — traditionally the sole goal of encryption is to provide confidentiality and if an encryption scheme is used to demonstrate possession of a key then it is shown by decryption, not by encryption.

The paper goes on to counsel, however, that using K for both a MAC and as the session key violates the principle that keys should not be used for more than one purpose, and presents various workarounds.

STS-MAC is vulnerable to some unknown key-share attacks whereby an active attacker can inject her own identity into the session establishment procedure in place of either initiator or responder. present the vulnerabilities and some solutions.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Saturday September 27, 2008 at 04:26:23 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Saturday September 27, 2008 at 04:26:23 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.