RFC 6358
Additional Master Secret Inputs for TLS
RFC 6358: Additional Master Secret Inputs for TLS πβ¨
Okay bestie, this one is from the IETF, and it was written by Paul Hoffman of the VPN Consortium π. It's dated January 2012 and it's an Experimental doc π§ͺ, which means it's published for people to try out and poke at, not as a full Internet Standard. It's a product of the IETF and went through the whole consensus and IESG approval thing π«Ά. The ISSN is 2070-1721 π. It doesn't obsolete anything and it doesn't update anything πΈ.
Abstract π¦
Here's the tea: this doc is about a way to use extra "additional master secret inputs" with Transport Layer Security (TLS) and Datagram TLS (DTLS) πβ¨. Iconic, right?
Status of This Memo π
Okay so, this is not an Internet Standards Track spec π ββοΈ. It's published for examination, experimental implementation, and evaluation π§ͺ. It defines an Experimental Protocol for the Internet community π. It's a product of the IETF, it reflects IETF consensus, it got public review, and the IESG approved it for publication π. Not every IESG-approved doc is a candidate for any level of Internet Standard, so check Section 2 of RFC 5741 for that π .
For the latest status, errata, and feedback info, you can look at http://www.rfc-editor.org/info/rfc6358 π.
Copyright Notice Β©οΈ
Copyright (c) 2012 IETF Trust and the persons identified as the document authors. All rights reserved π.
This doc is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) as of the publication date π. Read those carefully, bestie, because they explain your rights and restrictions π. Code pulled out of this doc has to include Simplified BSD License text, as described in Section 4.e of the Trust Legal Provisions, and it comes with no warranty π«§.
This doc might include material from IETF Documents or Contributions published before November 10, 2008 π°οΈ. Some of that copyright might belong to people who never gave the IETF Trust permission to allow changes outside the IETF Standards Process π. So without an adequate license from those copyright holders, this doc can't be modified outside the IETF Standards Process, and derivative works can't be made outside it either. The exceptions are formatting it as an RFC or translating it into languages other than English π.
1. Introduction π
Okay, so some TLS 1.2 [RFC5246] and DTLS 1.2 [RFC6347] extensions want to mix particular data into the calculation of the master secret π§. This mixing creates a cryptographic binding of the added material right into the secret that protects the TLS session π. For example, some systems want to be sure there's enough randomness in the TLS master secret, and adding it straight into the master secret calculation is how they get that π²β¨.
This doc describes a framework for TLS and DTLS extensions to meet these needs π . In an extension that uses this framework, a client and server provide data in the handshake using normal TLS extensions, and then that data gets combined with the ClientHello and ServerHello random values while the master_secret is derived π§.
Extensions that specify data to be added to the master secret are called "extensions with master secret input" π. An extension with master secret input MUST specify the additional input that comes from the client and/or the server π«Ά. The "and/or" is there on purpose, because the extension's definition might mean the input only comes from one of the two participants π.
Quick note, because it matters: extensions that don't say they're extensions with master secret input CANNOT be extensions with master secret input π«. So anything that doesn't call itself one is treated just like a normal extension π. Also, this doc only describes a framework π¦. If an extension uses it and both the client and server implement that extension, no signaling about master secret input is needed, because it comes as part of the extension definition itself β¨.
Using one or more of these extensions changes how the master secret gets calculated in TLS and DTLS πΈ. So if the handshake has no extensions, or only extensions that aren't extensions with master secret input, the master secret calculation stays exactly the same π.
1.1. Conventions Used in This Document π
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this doc are to be interpreted as described in [RFC2119] π π.
2. Master Secret Calculation Modifications for TLS and DTLS π
When an extension with master secret input is in the handshake, the additional master secret input values MUST be mixed into the pseudorandom function (PRF) calculation along with the client and server random values while the master secret is computed π§. For the master secret calculation, the extensions MUST be sorted by extension type order π. TLS 1.2 says there can only be one extension per type, and the extensions can show up in mixed order π.
Each extension with master secret input adds its own specified input π. It's called "additional_ms_input_1" for the extension with master secret input that has the lowest type number, "additional_ms_input_2" for the one with the second lowest type number, and so on π¦.
The master secret calculation becomes:
master_secret = PRF(pre_master_secret, "master secret",
ClientHello.random +
ClientHello.additional_ms_input_1 +
ClientHello.additional_ms_input_2 +
. . .
ClientHello.additional_ms_input_N +
ServerHello.random +
ServerHello.additional_ms_input_1 +
ServerHello.additional_ms_input_2 +
. . .
ServerHello.additional_ms_input_N +
)[0..47];
Using the specified order of the additional_ms_input_n fields in the master_secret is REQUIRED for interoperability π«Ά. Otherwise, a server and a client wouldn't know how to unambiguously calculate the same master_secret π.
Heads up, bestie: that order is a must-have. If the fields aren't in the specified order, the client and server won't land on the same master_secret π.
3. Security Considerations π‘οΈ
This modification to TLS and DTLS increases the amount of data an attacker can inject into the master secret calculation π±. That could potentially let an attacker who had partially compromised the inputs to the master secret calculation have a bigger say in the output π. Hash-based PRFs like the one used in TLS master secret calculations are designed to be pretty indifferent to input size π§ .
The additional master secret input might have no entropy at all; in fact, it could be completely predictable to an attacker π. TLS is designed to keep working even when the PRF used in the master secret calculation has a lot of predictable material, because the PRF generates distinct keying material for each connection π. So even with completely predictable additional master secret input values, no harm is done to the resulting PRF output π«§. When there is entropy in these values, that entropy shows up in the PRF output β¨.
4. Acknowledgments π·
Much of the text in this doc is derived from text written by Eric Rescorla, Margaret Salter, and Jerry Solinas π.
5. Normative References π
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC5246] Dierks, T. and E. Rescorla, "The Transport Layer Security
(TLS) Protocol Version 1.2", RFC 5246, August 2008.
[RFC6347] Rescorla, E. and N. Modadugu, "Datagram Transport Layer
Security version 1.2", RFC 6347, January 2012.
Author's Address π
Paul Hoffman VPN Consortium
EMail: paul.hoffman@vpnc.org π
π¦ where this page comes from
- ietf: rfc6358 2012-01
- π girlified by claude-haiku-5-5 on : a language model's rewrite of the original, under its terms