Ephemeral Diffie-Hellman Over COSE (EDHOC)

Ephemeral Diffie-Hellman Over COSE (EDHOC) Ericsson AB

SE-164 80 Stockholm Sweden goran.selander@ericsson.com

Ericsson AB

SE-164 80 Stockholm Sweden john.mattsson@ericsson.com

Ericsson AB

SE-164 80 Stockholm Sweden francesca.palombini@ericsson.com

SEC LAKE Working Group This document specifies Ephemeral Diffie-Hellman Over COSE (EDHOC), a very compact and lightweight authenticated Diffie-Hellman key exchange with ephemeral keys. EDHOC provides mutual authentication, forward secrecy, and identity protection. EDHOC is intended for usage in constrained scenarios and a main use case is to establish an OSCORE security context. By reusing COSE for cryptography, CBOR for encoding, and CoAP for transport, the additional code size can be kept very low.

Introduction

Motivation Many Internet of Things (IoT) deployments require technologies which are highly performant in constrained environments . IoT devices may be constrained in various ways, including memory, storage, processing capacity, and power. The connectivity for these settings may also exhibit constraints such as unreliable and lossy channels, highly restricted bandwidth, and dynamic topology. The IETF has acknowledged this problem by standardizing a range of lightweight protocols and enablers designed for the IoT, including the Constrained Application Protocol (CoAP, ), Concise Binary Object Representation (CBOR, ), and Static Context Header Compression (SCHC, ). The need for special protocols targeting constrained IoT deployments extends also to the security domain . Important characteristics in constrained environments are the number of round trips and protocol message sizes, which if kept low can contribute to good performance by enabling transport over a small number of radio frames, reducing latency due to fragmentation or duty cycles, etc. Another important criterion is code size, which may be prohibitively large for certain deployments due to device capabilities or network load during firmware update. Some IoT deployments also need to support a variety of underlying transport technologies, potentially even with a single connection. Some security solutions for such settings exist already. CBOR Object Signing and Encryption (COSE, ) specifies basic application-layer security services efficiently encoded in CBOR. Another example is Object Security for Constrained RESTful Environments (OSCORE, ) which is a lightweight communication security extension to CoAP using CBOR and COSE. In order to establish good quality cryptographic keys for security protocols such as COSE and OSCORE, the two endpoints may run an authenticated Diffie-Hellman key exchange protocol, from which shared secret keying material can be derived. Such a key exchange protocol should also be lightweight; to prevent bad performance in case of repeated use, e.g., due to device rebooting or frequent rekeying for security reasons; or to avoid latencies in a network formation setting with many devices authenticating at the same time. This document specifies Ephemeral Diffie-Hellman Over COSE (EDHOC), a lightweight authenticated key exchange protocol providing good security properties including forward secrecy, identity protection, and cipher suite negotiation. Authentication can be based on raw public keys (RPK) or public key certificates and requires the application to provide input on how to verify that endpoints are trusted. This specification emphasizes the possibility to reference rather than to transport credentials in order to reduce message overhead, but the latter is also supported. EDHOC does not currently support pre-shared key (PSK) authentication as authentication with static Diffie-Hellman public keys by reference produces equally small message sizes but with much simpler key distribution and identity protection. EDHOC makes use of known protocol constructions, such as SIGMA and Extract-and-Expand . EDHOC uses COSE for cryptography and identification of credentials (including COSE_Key, CBOR Web Token (CWT), CWT Claims Set (CCS), X.509, and CBOR encoded X.509 (C509) certificates, see ). COSE provides crypto agility and enables the use of future algorithms and credential types targeting IoT. EDHOC is designed for highly constrained settings making it especially suitable for low-power networks such as Cellular IoT, 6TiSCH, and LoRaWAN. A main objective for EDHOC is to be a lightweight authenticated key exchange for OSCORE, i.e., to provide authentication and session key establishment for IoT use cases such as those built on CoAP involving 'things' with embedded microcontrollers, sensors, and actuators. By reusing the same lightweight primitives as OSCORE (CBOR, COSE, CoAP) the additional code size can be kept very low. Note that while CBOR and COSE primitives are built into the protocol messages, EDHOC is not bound to a particular transport. A typical setting is when one of the endpoints is constrained or in a constrained network, and the other endpoint is a node on the Internet (such as a mobile phone). Thing-to-thing interactions over constrained networks are also relevant since both endpoints would then benefit from the lightweight properties of the protocol. EDHOC could, e.g., be run when a device connects for the first time, or to establish fresh keys which are not revealed by a later compromise of the long-term keys.

Message Size Examples Compared to the DTLS 1.3 handshake with ECDHE and connection ID, the EDHOC message size when transferred in CoAP can be less than 1/6 when RPK authentication is used, see . shows examples of EDHOC message sizes based on the assumptions in Section 2 of , comparing different kinds of authentication keys and COSE header parameters for identification: static Diffie-Hellman keys or signature keys, either in CBOR Web Token (CWT) / CWT Claims Set (CCS) identified by a key identifier using 'kid' , or in X.509 certificates identified by a hash value using 'x5t' .

Examples of EDHOC message sizes in bytes.

Document Structure The remainder of the document is organized as follows: outlines EDHOC authenticated with signature keys, describes the protocol elements of EDHOC, including formatting of the ephemeral public keys, specifies the key derivation, specifies message processing for EDHOC authenticated with signature keys or static Diffie-Hellman keys, describes the error messages, and shows how to transfer EDHOC with CoAP and establish an OSCORE security context.

Terminology and Requirements Language The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here. Readers are expected to be familiar with the terms and concepts described in CBOR , CBOR Sequences , COSE structures and processing , COSE algorithms , CWT and CWT Claims Set , and the Concise Data Definition Language (CDDL, ), which is used to express CBOR data structures. Examples of CBOR and CDDL are provided in . When referring to CBOR, this specification always refers to Deterministically Encoded CBOR as specified in Sections 4.2.1 and 4.2.2 of . The single output from authenticated encryption (including the authentication tag) is called "ciphertext", following .

EDHOC Outline EDHOC specifies different authentication methods of the ephemeral Diffie-Hellman key exchange: signature keys and static Diffie-Hellman keys. This section outlines the signature key based method. Further details of protocol elements and other authentication methods are provided in the remainder of this document. SIGMA (SIGn-and-MAc) is a family of theoretical protocols with a large number of variants . Like in IKEv2 and (D)TLS 1.3 , EDHOC authenticated with signature keys is built on a variant of the SIGMA protocol which provides identity protection of the Initiator (SIGMA-I) against active attackers, and like IKEv2, EDHOC implements the MAC-then-Sign variant of the SIGMA-I protocol shown in .

MAC-then-Sign variant of the SIGMA-I protocol used by EDHOC. | | | | G_Y, Enc( ID_CRED_R, Sig( R; MAC( CRED_R, G_X, G_Y ) ) ) | |<------------------------------------------------------------------+ | | | AEAD( ID_CRED_I, Sig( I; MAC( CRED_I, G_Y, G_X ) ) ) | +------------------------------------------------------------------>| | | ]]> The parties exchanging messages in an EDHOC session are called Initiator (I) and Responder (R). They exchange ephemeral public keys, compute a shared secret session key PRK_out, and derive symmetric application keys used to protect application data.

G_X and G_Y are the ECDH ephemeral public keys of I and R, respectively.
CRED_I and CRED_R are the authentication credentials containing the public authentication keys of I and R, respectively.
ID_CRED_I and ID_CRED_R are used to identify and optionally transport the credentials of the Initiator and the Responder, respectively.
Sig(I; . ) and Sig(R; . ) denote signatures made with the private authentication key of I and R, respectively.
Enc(), AEAD(), and MAC() denotes encryption, authenticated encryption with additional data, and message authentication code - crypto algorithms applied with keys derived from one or more shared secrets calculated during the protocol.

In order to create a "full-fledged" protocol some additional protocol elements are needed. EDHOC adds:

Transcript hashes (hashes of message data) TH_2, TH_3, TH_4 used for key derivation and as additional authenticated data.
Computationally independent keys derived from the ECDH shared secret and used for authenticated encryption of different messages.
An optional fourth message giving key confirmation to I in deployments where no protected application data is sent from R to I.
A keying material exporter and a key update function with forward secrecy.
Verification of the selected cipher suite.
Method types, error handling, and padding.
Selection of connection identifiers C_I and C_R which may be used in EDHOC to identify protocol state.
Transport of external authorization data.

EDHOC is designed to encrypt and integrity protect as much information as possible. Symmetric keys and random material derived using EDHOC-KDF are derived with as much previous information as possible, see . EDHOC is furthermore designed to be as compact and lightweight as possible, in terms of message sizes, processing, and the ability to reuse already existing CBOR, COSE, and CoAP libraries. Like in (D)TLS, authentication is the responsibility of the application. EDHOC identifies (and optionally transports) authentication credentials, and provides proof-of-possession of the private authentication key. To simplify for implementors, the use of CBOR and COSE in EDHOC is summarized in . Test vectors including CBOR diagnostic notation are provided in .

Protocol Elements

General The EDHOC protocol consists of three mandatory messages (message_1, message_2, message_3) between an Initiator and a Responder, an optional fourth message (message_4), and an error message. The roles have slightly different security properties which should be considered when the roles are assigned, see . All EDHOC messages are CBOR Sequences , and are deterministically encoded. illustrates an EDHOC message flow with the optional fourth message as well as the content of each message. The protocol elements in the figure are introduced in and . Message formatting and processing are specified in and . Application data may be protected using the agreed application algorithms (AEAD, hash) in the selected cipher suite (see ) and the application can make use of the established connection identifiers C_I and C_R (see ). Media types that may be used for EDHOC are defined in . The Initiator can derive symmetric application keys after creating EDHOC message_3, see . Protected application data can therefore be sent in parallel or together with EDHOC message_3. EDHOC message_4 is typically not sent.

Method The data item METHOD in message_1 (see ), is an integer specifying the authentication method. EDHOC supports authentication with signature or static Diffie-Hellman keys, as defined in the four authentication methods: 0, 1, 2, and 3, see . When using a static Diffie-Hellman key the authentication is provided by a Message Authentication Code (MAC) computed from an ephemeral-static ECDH shared secret which enables significant reductions in message sizes. The Initiator and the Responder need to have agreed on a single method to be used for EDHOC, see .

Authentication Keys for Method Types EDHOC does not have a dedicated message field to indicate the protocol version. Breaking changes to EDHOC can be introduced by specifying and registering new methods.

Connection Identifiers EDHOC includes the selection of connection identifiers (C_I, C_R) identifying a connection for which keys are agreed. Connection identifiers may be used to correlate EDHOC messages and facilitate the retrieval of protocol state during an EDHOC session (see ), or may be used in applications of EDHOC, e.g., in OSCORE (see ). The connection identifiers do not have any cryptographic purpose in EDHOC except facilitating the retrieval of security data associated with the protocol state. Connection identifiers in EDHOC are intrinsically byte strings. Most constrained devices only have a few connections for which short identifiers may be sufficient. In some cases minimum length identifiers are necessary to comply with overhead requirements. However, CBOR byte strings - with the exception of the empty byte string h'' which encodes as one byte (0x40) - are encoded as two or more bytes. To enable one-byte encoding of certain byte strings while maintaining CBOR encoding, EDHOC represents certain identifiers as CBOR integers on the wire, see .

Selection of Connection Identifiers C_I and C_R are chosen by I and R, respectively. The Initiator selects C_I and sends it in message_1 for the Responder to use as a reference to the connection in communication with the Initiator. The Responder selects C_R and sends it in message_2 for the Initiator to use as a reference to the connection in communications with the Responder. If connection identifiers are used by an application protocol for which EDHOC establishes keys then the selected connection identifiers SHALL adhere to the requirements for that protocol, see for an example.

Representation of Byte String Identifiers To allow identifiers with minimal overhead on the wire, certain byte strings are defined to have integer representations. The integers with one-byte CBOR encoding are -24, ..., 23, see .

One-Byte CBOR Encoded Integers The byte strings which coincide with a one-byte CBOR encoding of an integer MUST be represented by the CBOR encoding of that integer. Other byte strings are simply encoded as CBOR byte strings. For example:

0x21 is represented by 0x21 (CBOR encoding of the integer -2), not by 0x4121 (CBOR encoding of the byte string 0x21).
0x0D is represented by 0x0D (CBOR encoding of the integer 13), not by 0x410D (CBOR encoding of the byte string 0x0D).
0x18 is represented by 0x4118 (CBOR encoding of the byte string 0x18).
0x38 is represented by 0x4138 (CBOR encoding of the byte string 0x38).
0xABCD is represented by 0x42ABCD (CBOR encoding of the byte string 0xABCD).

One way to view this representation of byte strings as a transport encoding: a byte string which parses as the one-byte CBOR encoding of an integer (i.e., integer in the interval -24, ..., 23) is just copied directly into the message, a byte string which does not is encoded as a CBOR byte string during transport. Implementation Note: When implementing the byte string identifier representation, it can in some programming languages help to define a new type, or other data structure, which (in its user facing API) behaves like a byte string, but when serializing to CBOR produces a CBOR byte string or a CBOR integer depending on its value.

Use of Connection Identifiers with OSCORE For OSCORE, the choice of connection identifier results in the endpoint selecting its Recipient ID, see Section 3.1 of , for which certain uniqueness requirements apply, see Section 3.3 of . Therefore, the Initiator and the Responder MUST NOT select connection identifiers such that it results in the same OSCORE Recipient ID. Since the connection identifier is a byte string, it is converted to an OSCORE Recipient ID equal to the byte string. Examples:

A connection identifier 0xFF (represented in the EDHOC message as 0x41FF, see ) is converted to the OSCORE Recipient ID 0xFF.
A connection identifier 0x21 (represented in the EDHOC message as 0x21, see ) is converted to the OSCORE Recipient ID 0x21.

Transport Cryptographically, EDHOC does not put requirements on the lower layers. EDHOC is not bound to a particular transport layer and can even be used in environments without IP. In addition to the transport of messages including errors, the transport is responsible, where necessary, to handle:

message loss,
message reordering,
message duplication,
fragmentation and reassembly,
demultiplex EDHOC messages from other types of messages,
denial-of-service protection,
message correlation.

The Initiator and the Responder need to have agreed on a transport to be used for EDHOC, see .

Use of Connection Identifiers for EDHOC Message Correlation The transport needs to support the correlation between EDHOC messages and facilitate the retrieval of protocol state and security context during an EDHOC session, including an indication of a message being message_1. The correlation may reuse existing mechanisms in the transport protocol. For example, the CoAP Token may be used to correlate EDHOC messages in a CoAP response and an associated CoAP request. Connection identifiers may be used to correlate EDHOC messages and facilitate the retrieval of protocol state/security context during an EDHOC session. Transports that do not inherently provide correlation across all messages of an EDHOC session can send connection identifiers along with EDHOC messages to gain that required capability, e.g., by prepending the appropriate connection identifier (when available from the EDHOC protocol) to the EDHOC message. Transport of EDHOC in CoAP payloads is described in , which also shows how to use connection identifiers and message_1 indication with CoAP.

Authentication Parameters EDHOC supports various settings for how the other endpoint's authentication (public) key may be transported, identified, and trusted. EDHOC performs the following authentication related operations:

EDHOC transports information about credentials in ID_CRED_I and ID_CRED_R (described in ). Based on this information, the authentication credentials CRED_I and CRED_R (described in ) can be obtained. EDHOC may also transport certain authentication related information as External Authorization Data (see ).
EDHOC uses the authentication credentials in two ways (see and ):
- The authentication credential is input to the integrity verification using the MAC fields.
- The authentication key of the authentication credential is used with the Signature_or_MAC field to verify proof-of-possession of the private key.

Other authentication related verifications are out of scope for EDHOC, and is the responsibility of the application. In particular, the authentication credential needs to be validated in the context of the connection for which EDHOC is used, see . EDHOC MUST allow the application to read received information about credential (ID_CRED_R, ID_CRED_I). EDHOC MUST have access to the authentication key and the authentication credential. Note that the type of authentication key, authentication credential, and the identification of the credential have a large impact on the message size. For example, the Signature_or_MAC field is much smaller with a static DH key than with a signature key. A CCS is much smaller than a self-signed certificate/CWT, but if it is possible to reference the credential with a COSE header like 'kid', then that is in turn much smaller than a CCS.

Authentication Keys The authentication key (i.e., the public key used for authentication) MUST be a signature key or static Diffie-Hellman key. The Initiator and the Responder MAY use different types of authentication keys, e.g., one uses a signature key and the other uses a static Diffie-Hellman key. The authentication key algorithm needs to be compatible with the method and the selected cipher suite (see ). The authentication key algorithm needs to be compatible with the EDHOC key exchange algorithm when static Diffie-Hellman authentication is used, and compatible with the EDHOC signature algorithm when signature authentication is used. Note that for most signature algorithms, the signature is determined by the signature algorithm and the authentication key algorithm together. When using static Diffie-Hellman keys the Initiator's and Responder's private authentication keys are denoted as I and R, respectively, and the public authentication keys are denoted G_I and G_R, respectively. For X.509 certificates the authentication key is represented by a SubjectPublicKeyInfo field. For CWT and CCS (see )) the authentication key is represented by a 'cnf' claim containing a COSE_Key . In EDHOC, a raw public key (RPK) is an authentication key encoded as a COSE_Key wrapped in a CCS.

Authentication Credentials The authentication credentials, CRED_I and CRED_R, contain the public authentication key of the Initiator and the Responder, respectively. The authentication credential typically also contains other parameters that needs to be verified by the application, see , and in particular information about the identity ("subject") of the endpoint to prevent misbinding attacks, see . EDHOC relies on COSE for identification of credentials (see ), for example X.509 certificates , C509 certificates , CWTs and CWT Claims Sets (CCS) . When the identified credential is a chain or a bag, the authentication credential CRED_x is just the end entity X.509 or C509 certificate / CWT. The Initiator and the Responder MAY use different types of authentication credentials, e.g., one uses an RPK and the other uses a public key certificate. Since CRED_R is used in the integrity verification, see , it needs to be specified such that it is identical when used by Initiator or Responder. Similarly for CRED_I, see . The Initiator and Responder are expected to agree on the specific encoding of the credentials, see . It is RECOMMENDED that the COSE 'kid' parameter, when used to identify the authentication credential, refers to a specific encoding. The Initiator and Responder SHOULD use an available authentication credential (transported in EDHOC or otherwise provisioned) without re-encoding. If for some reason re-encoding of the authentication credential may occur, then a potential common encoding for CBOR based credentials is bytewise lexicographic order of their deterministic encodings as specified in Section 4.2.1 of .

When the authentication credential is an X.509 certificate, CRED_x SHALL be the DER encoded certificate, encoded as a bstr .
When the authentication credential is a C509 certificate, CRED_x SHALL be the C509Certificate .
When the authentication credential is a CWT including a COSE_Key, CRED_x SHALL be the untagged CWT.
When the authentication credential includes a COSE_Key but is not in a CWT, CRED_x SHALL be an untagged CCS. This is how RPKs are encoded, see for an example.
- Naked COSE_Keys are thus dressed as CCS when used in EDHOC, in its simplest form by prefixing the COSE_Key with 0xA108A101 (a map with a 'cnf' claim). In that case the resulting authentication credential contains no other identity than the public key itself, see .

An example of a CRED_x is shown below:

CWT Claims Set (CCS) containing an X25519 static Diffie-Hellman key and an EUI-64 identity.

Identification of Credentials ID_CRED_R and ID_CRED_I are transported in message_2 and message_3, respectively, see and . They are used to identify and optionally transport credentials:

ID_CRED_R is intended to facilitate for the Initiator to retrieve the authentication credential CRED_R and the authentication key of R.
ID_CRED_I is intended to facilitate for the Responder to retrieve the authentication credential CRED_I and the authentication key of I.

ID_CRED_x may contain the authentication credential CRED_x, but for many settings it is not necessary to transport the authentication credential within EDHOC. For example, it may be pre-provisioned or acquired out-of-band over less constrained links. ID_CRED_I and ID_CRED_R do not have any cryptographic purpose in EDHOC since the authentication credentials are integrity protected. EDHOC relies on COSE for identification of credentials and supports all credential types for which COSE header parameters are defined including X.509 certificates (), C509 certificates (), CWT () and CWT Claims Set (CCS) (). ID_CRED_I and ID_CRED_R are COSE header maps and contains one or more COSE header parameters. ID_CRED_I and ID_CRED_R MAY contain different header parameters. The header parameters typically provide some information about the format of the credential. Note that COSE header parameters in ID_CRED_x are used to identify the message sender's credential. There is therefore no reason to use the "-sender" header parameters, such as x5t-sender, defined in Section 3 of . Instead, the corresponding parameter without "-sender", such as x5t, SHOULD be used. Example: X.509 certificates can be identified by a hash value using the 'x5t' parameter:

ID_CRED_x = { 34 : COSE_CertHash }, for x = I or R,

Example: CWT or CCS can be identified by a key identifier using the 'kid' parameter:

ID_CRED_x = { 4 : kid_x }, where kid_x : kid, for x = I or R.

As stated in Section 3.1 of , applications MUST NOT assume that 'kid' values are unique and several keys associated with a 'kid' may need to be checked before the correct one is found. Applications might use additional information such as 'kid context' or lower layers to determine which key to try first. Applications should strive to make ID_CRED_x as unique as possible, since the recipient may otherwise have to try several keys. See for more examples.

Compact Encoding of ID_CRED for 'kid' To comply with the LAKE message size requirements, see , two optimizations are made for the case when ID_CRED_x contains a single 'kid' parameter.

The CBOR map { 4 : kid_x } is replaced by the byte string kid_x.
The representation of identifiers specified in is applied to kid_x.

These optimizations MUST be applied if and only if ID_CRED_x = { 4 : kid_x } and ID_CRED_x in PLAINTEXT_y of message_y, y = 2 or 3, see and . Note that these optimizations are not applied to instances of ID_CRED_x which have no impact on message size, e.g., context_y, or the COSE protected header. Examples:

For ID_CRED_x = { 4 : h'FF' }, the encoding in PLAINTEXT_y is not the CBOR map 0xA10441FF but the CBOR byte string h'FF', i.e., 0x41FF.
For ID_CRED_x = { 4 : h'21' }, the encoding in PLAINTEXT_y is neither the CBOR map 0xA1044121, nor the CBOR byte string h'21', i.e., 0x4121, but the CBOR integer 0x21.

Cipher Suites An EDHOC cipher suite consists of an ordered set of algorithms from the "COSE Algorithms" and "COSE Elliptic Curves" registries as well as the EDHOC MAC length. All algorithm names and definitions follow from COSE algorithms . Note that COSE sometimes uses peculiar names such as ES256 for ECDSA with SHA-256, A128 for AES-128, and Ed25519 for the curve edwards25519. Algorithms need to be specified with enough parameters to make them completely determined. The EDHOC MAC length MUST be at least 8 bytes. Any cryptographic algorithm used in the COSE header parameters in ID_CRED is selected independently of the selected cipher suite. EDHOC is currently only specified for use with key exchange algorithms of type ECDH curves, but any Key Encapsulation Method (KEM), including Post-Quantum Cryptography (PQC) KEMs, can be used in method 0, see . Use of other types of key exchange algorithms to replace static DH authentication (method 1,2,3) would likely require a specification updating EDHOC with new methods. EDHOC supports all signature algorithms defined by COSE. Just like in (D)TLS 1.3 and IKEv2 , a signature in COSE is determined by the signature algorithm and the authentication key algorithm together, see . The exact details of the authentication key algorithm depend on the type of authentication credential. COSE supports different formats for storing the public authentication keys including COSE_Key and X.509, which use different names and ways to represent the authentication key and the authentication key algorithm. An EDHOC cipher suite consists of the following parameters:

EDHOC AEAD algorithm
EDHOC hash algorithm
EDHOC MAC length in bytes (Static DH)
EDHOC key exchange algorithm (ECDH curve)
EDHOC signature algorithm
Application AEAD algorithm
Application hash algorithm

Each cipher suite is identified with a pre-defined integer label. EDHOC can be used with all algorithms and curves defined for COSE. Implementations can either use any combination of COSE algorithms and parameters to define their own private cipher suite, or use one of the pre-defined cipher suites. Private cipher suites can be identified with any of the four values -24, -23, -22, -21. The pre-defined cipher suites are listed in the IANA registry () with initial content outlined here:

Cipher suites 0-3, based on AES-CCM, are intended for constrained IoT where message overhead is a very important factor. Note that AES-CCM-16-64-128 and AES-CCM-16-128-128 are compatible with the IEEE CCM* mode.
- Cipher suites 1 and 3 use a larger tag length (128-bit) in EDHOC than in the Application AEAD algorithm (64-bit).
Cipher suites 4 and 5, based on ChaCha20, are intended for less constrained applications and only use 128-bit tag lengths.
Cipher suite 6, based on AES-GCM, is for general non-constrained applications. It consists of high performance algorithms that are widely used in non-constrained applications.
Cipher suites 24 and 25 are intended for high security applications such as government use and financial applications. These cipher suites do not share any algorithms. Cipher suite 24 consists of algorithms from the CNSA suite .

The different methods () use the same cipher suites, but some algorithms are not used in some methods. The EDHOC signature algorithm is not used in methods without signature authentication. The Initiator needs to have a list of cipher suites it supports in order of preference. The Responder needs to have a list of cipher suites it supports. SUITES_I contains cipher suites supported by the Initiator, formatted and processed as detailed in to secure the cipher suite negotiation. Examples of cipher suite negotiation are given in .

Ephemeral Public Keys The ephemeral public keys in EDHOC (G_X and G_Y) use compact representation of elliptic curve points, see . In COSE, compact representation is achieved by formatting the ECDH ephemeral public keys as COSE_Keys of type EC2 or OKP according to Sections 7.1 and 7.2 of , but only including the 'x' parameter in G_X and G_Y. For Elliptic Curve Keys of type EC2, compact representation MAY be used also in the COSE_Key. COSE always uses compact output for Elliptic Curve Keys of type EC2. If the COSE implementation requires a 'y' parameter, the value y = false or a calculated y-coordinate can be used, see .

External Authorization Data (EAD) In order to reduce round trips and the number of messages, or to simplify processing, external security applications may be integrated into EDHOC by transporting authorization related data in the messages. EDHOC allows processing of external authorization data (EAD) to be defined in a separate specification, and sent in dedicated fields of the four EDHOC messages (EAD_1, EAD_2, EAD_3, EAD_4). EAD is opaque data to EDHOC. Each EAD field, EAD_x for x = 1, 2, 3 or 4, is a CBOR sequence (see ) of one or more EAD items ead defined in . See for the CDDL definitions.

Definition of EAD item. A security application using external authorization data needs to register a positive ead_label and optionally an associated ead_value format, for each EAD item it uses (see ). Each application registers its own EAD items and describes the associated processing and security considerations. The application may define multiple uses of certain EAD items, e.g., the same EAD item may be used in different EDHOC messages with the same application. Multiple occurrences of an EAD item in one EAD field may also be specified. An EAD item can be either critical or non-critical, determined by the sign of the ead_label in the EAD item transported in the EDHOC message. A negative value indicates that the EAD item is critical and a non-negative value indicates that this EAD item is non-critical. The specification registering a new EAD label needs to describe under what conditions the EAD item is critical or non-critical, and thus whether the ead_label is used with negative or positive sign. ead_label = 0 is used for padding, see . If an endpoint receives a critical EAD item it does not recognize or a critical EAD item that contains information that it cannot process, then the endpoint MUST send an EDHOC error message back as defined in , and the protocol MUST be discontinued. The EAD specification must define the error processing. A non-critical EAD item can be ignored. The EAD fields of EDHOC must not be used for generic application data. Examples of the use of EAD are provided in .

Padding EDHOC message_1 and the plaintext of message_2, message_3 and message_4 can be padded with the use of the corresponding EAD_x field, for x = 1, 2, 3, 4. Padding is intended to be discarded by the receiving application. Padding is obtained by using an EAD item with ead_label = 0 and a randomly generated byte string of appropriate length as ead_value, noting that the ead_label and the CBOR encoding of ead_value also add bytes. Examples:

One byte padding is achieved by omitting the ead_value:
- EAD_x = 0x00
Two bytes padding using the empty byte string (0x40) as ead_value:
- EAD_x = 0x0040
Three bytes padding constructed from the randomly generated 0xe9 encoded as ead_value:
- EAD_x = 0x0041e9

Multiple occurrences of EAD items with ead_label = 0 are allowed. Certain padding lengths require the use of at least two such EAD items.

Application Profile EDHOC requires certain parameters to be agreed upon between Initiator and Responder. Some parameters can be negotiated through the protocol execution (specifically, cipher suite, see ) but other parameters are only communicated and may not be negotiated (e.g., which authentication method is used, see ). Yet other parameters need to be known out-of-band. The application decides which endpoint is Initiator and which is Responder. The purpose of an application profile is to describe the intended use of EDHOC to allow for the relevant processing and verifications to be made, including things like:

How the endpoint detects that an EDHOC message is received. This includes how EDHOC messages are transported, for example in the payload of a CoAP message with a certain Uri-Path or Content-Format; see .
- The method of transporting EDHOC messages may also describe data carried along with the messages that are needed for the transport to satisfy the requirements of , e.g., connection identifiers used with certain messages, see .
Authentication method (METHOD; see ).
Profile for authentication credentials (CRED_I, CRED_R; see ), e.g., profile for certificate or CCS, including supported authentication key algorithms (subject public key algorithm in X.509 or C509 certificate).
Type used to identify credentials (ID_CRED_I, ID_CRED_R; see ).
Use and type of external authorization data (EAD_1, EAD_2, EAD_3, EAD_4; see ).
Identifier used as the identity of the endpoint; see .
If message_4 shall be sent/expected, and if not, how to ensure a protected application message is sent from the Responder to the Initiator; see .

The application profile may also contain information about supported cipher suites. The procedure for selecting and verifying a cipher suite is still performed as described in and , but it may become simplified by this knowledge. An example of an application profile is shown in . For some parameters, like METHOD, ID_CRED_x, type of EAD, the receiver of an EDHOC message is able to verify compliance with the application profile, and if it needs to fail because of incompliance, to infer the reason why the protocol failed. For other parameters, like the profile of CRED_x in the case that it is not transported, it may not be possible to verify that incompliance with the application profile was the reason for failure: Integrity verification in message_2 or message_3 may fail not only because of wrong credential. For example, in case the Initiator uses a public key certificate by reference (i.e., not transported within the protocol) then both endpoints need to use an identical data structure as CRED_I or else the integrity verification will fail. Note that it is not necessary for the endpoints to specify a single transport for the EDHOC messages. For example, a mix of CoAP and HTTP may be used along the path, and this may still allow correlation between messages. The application profile may be dependent on the identity of the other endpoint, or other information carried in an EDHOC message, but it then applies only to the later phases of the protocol when such information is known. (The Initiator does not know the identity of the Responder before having verified message_2, and the Responder does not know the identity of the Initiator before having verified message_3.) Other conditions may be part of the application profile, such as what is the target application or use (if there is more than one application/use) to the extent that EDHOC can distinguish between them. In case multiple application profiles are used, the receiver needs to be able to determine which is applicable for a given session, for example based on URI to which the EDHOC message is sent, or external authorization data type.

Key Derivation

Keys for EDHOC Message Processing EDHOC uses Extract-and-Expand with the EDHOC hash algorithm in the selected cipher suite to derive keys used in message processing. This section defines Extract () and Expand (), and how to use them to derive PRK_out () which is the shared secret session key resulting from a successful EDHOC exchange. Extract is used to derive fixed-length uniformly pseudorandom keys (PRK) from ECDH shared secrets. Expand is used to define EDHOC-KDF for generating MACs and for deriving output keying material (OKM) from PRKs. In EDHOC a specific message is protected with a certain pseudorandom key, but how the key is derived depends on the method as detailed in .

Extract The pseudorandom keys (PRKs) used for EDHOC message processing are derived using Extract: where the input keying material (IKM) and salt are defined for each PRK below. The definition of Extract depends on the EDHOC hash algorithm of the selected cipher suite:

if the EDHOC hash algorithm is SHA-2, then Extract( salt, IKM ) = HKDF-Extract( salt, IKM )
if the EDHOC hash algorithm is SHAKE128, then Extract( salt, IKM ) = KMAC128( salt, IKM, 256, "" )
if the EDHOC hash algorithm is SHAKE256, then Extract( salt, IKM ) = KMAC256( salt, IKM, 512, "" )

The rest of the section defines the pseudorandom keys PRK_2e, PRK_3e2m and PRK_4e3m; their use is shown in .

PRK_2e The pseudorandom key PRK_2e is derived with the following input:

The salt SHALL be TH_2.
The IKM SHALL be the ephemeral-ephemeral ECDH shared secret G_XY (calculated from G_X and Y or G_Y and X) as defined in Section 6.3.1 of . The use of G_XY gives forward secrecy, in the sense that compromise of the private authentication keys does not compromise past session keys.

Example: Assuming the use of curve25519, the ECDH shared secret G_XY is the output of the X25519 function : Example: Assuming the use of SHA-256 the extract phase of HKDF produces PRK_2e as follows:

PRK_3e2m The pseudorandom key PRK_3e2m is derived as follows: If the Responder authenticates with a static Diffie-Hellman key, then PRK_3e2m = Extract( SALT_3e2m, G_RX ), where

SALT_3e2m is derived from PRK_2e, see , and
G_RX is the ECDH shared secret calculated from G_R and X, or G_X and R (the Responder's private authentication key, see ),

else PRK_3e2m = PRK_2e.

PRK_4e3m The pseudorandom key PRK_4e3m is derived as follows: If the Initiator authenticates with a static Diffie-Hellman key, then PRK_4e3m = Extract( SALT_4e3m, G_IY ), where

SALT_4e3m is derived from PRK_3e2m, see , and
G_IY is the ECDH shared secret calculated from G_I and Y, or G_Y and I (the Initiator's private authentication key, see ),

else PRK_4e3m = PRK_3e2m.

Expand and EDHOC-KDF The output keying material (OKM) - including keys, IVs, and salts - are derived from the PRKs using the EDHOC-KDF, which is defined through Expand: where info is encoded as the CBOR sequence where

info_label is an int
context is a bstr
length is the length of OKM in bytes

When EDHOC-KDF is used to derive OKM for EDHOC message processing, then context includes one of the transcript hashes TH_2, TH_3, or TH_4 defined in Sections and . The definition of Expand depends on the EDHOC hash algorithm of the selected cipher suite:

if the EDHOC hash algorithm is SHA-2, then Expand( PRK, info, length ) = HKDF-Expand( PRK, info, length )
if the EDHOC hash algorithm is SHAKE128, then Expand( PRK, info, length ) = KMAC128( PRK, info, L, "" )
if the EDHOC hash algorithm is SHAKE256, then Expand( PRK, info, length ) = KMAC256( PRK, info, L, "" )

where L = 8 length, the output length in bits. lists derivations made with EDHOC-KDF during message processing, where

hash_length - length of output size of the EDHOC hash algorithm of the selected cipher suite
key_length - length of the encryption key of the EDHOC AEAD algorithm of the selected cipher suite
iv_length - length of the initialization vector of the EDHOC AEAD algorithm of the selected cipher suite

Further details of the key derivation and how the output keying material is used are specified in .

Key derivations using EDHOC-KDF.

PRK_out The pseudorandom key PRK_out, derived as shown in is the output session key of a successful EDHOC exchange. Keys for applications are derived from PRK_out, see . For the purpose of using EDHOC-Exporter, an application only needs to store PRK_out or PRK_exporter. (Note that the word "store" used here does not imply that the application has access to the plaintext PRK_out since that may be reserved for code within a TEE, see ).

Keys for EDHOC Applications This section defines EDHOC-Exporter in terms of EDHOC-KDF and PRK_out. A key update function is defined in .

EDHOC-Exporter Keying material for the application can be derived using the EDHOC-Exporter interface defined as: where

exporter_label is a registered uint from the EDHOC Exporter Label registry ()
context is a bstr defined by the application
length is a uint defined by the application
PRK_exporter is derived from PRK_out:

where hash_length denotes the output size in bytes of the EDHOC hash algorithm of the selected cipher suite. The (exporter_label, context) pair used in EDHOC-Exporter must be unique, i.e., an (exporter_label, context) MUST NOT be used for two different purposes. However an application can re-derive the same key several times as long as it is done in a secure way. For example, in most encryption algorithms the same key can be reused with different nonces. The context can for example be the empty CBOR byte string. Examples of use of the EDHOC-Exporter are given in .

Message Formatting and Processing This section specifies formatting of the messages and processing steps. Error messages are specified in . Annotated traces of EDHOC protocol runs are provided in . An EDHOC message is encoded as a sequence of CBOR data items (CBOR Sequence, ). Additional optimizations are made to reduce message overhead. While EDHOC uses the COSE_Key, COSE_Sign1, and COSE_Encrypt0 structures, only a subset of the parameters is included in the EDHOC messages, see . The unprotected COSE header in COSE_Sign1, and COSE_Encrypt0 (not included in the EDHOC message) MAY contain parameters (e.g., 'alg').

Message Processing Outline This section outlines the message processing of EDHOC. For each new/ongoing session, the endpoints are assumed to keep an associated protocol state containing identifiers, keying material, etc. used for subsequent processing of protocol related data. The protocol state is assumed to be associated with an application profile () which provides the context for how messages are transported, identified, and processed. EDHOC messages SHALL be processed according to the current protocol state. The following steps are expected to be performed at reception of an EDHOC message:

Detect that an EDHOC message has been received, for example by means of port number, URI, or media type ().
Retrieve the protocol state according to the message correlation provided by the transport, see . If there is no protocol state, in the case of message_1, a new protocol state is created. The Responder endpoint needs to make use of available Denial-of-Service mitigation ().
If the message received is an error message, then process it according to , else process it as the expected next message according to the protocol state.

If the processing fails for some reason then, typically, an error message is sent, the protocol is discontinued, and the protocol state erased. After having successfully processed the last message (message_3 or message_4 depending on application profile) the protocol is completed, after which no error messages are sent and EDHOC session output MAY be maintained even if error messages are received. Further details are provided in the following subsections and in . Different instances of the same message MUST NOT be processed in one session. Note that processing will fail if the same message appears a second time for EDHOC processing in the same session because the state of the protocol has moved on and now expects something else. This assumes that message duplication due to re-transmissions is handled by the transport protocol, see . The case when the transport does not support message deduplication is addressed in .

EDHOC Message 1

Formatting of Message 1 message_1 SHALL be a CBOR Sequence (see ) as defined below where:

METHOD - authentication method, see .
SUITES_I - array of cipher suites which the Initiator supports in order of preference, the first cipher suite in network byte order is the most preferred by I, the last is the one selected by I for this session. If the most preferred cipher suite is selected then SUITES_I contains only that cipher suite and is encoded as an int. The processing steps are detailed below and in .
G_X - the ephemeral public key of the Initiator
C_I - variable length connection identifier. Note that connection identifiers are byte strings but certain values are represented as integers in the message, see .
EAD_1 - external authorization data, see .

Initiator Processing of Message 1 The Initiator SHALL compose message_1 as follows:

Construct SUITES_I complying with the definition in }, and furthermore:
- The Initiator MUST select its most preferred cipher suite, conditioned on what it can assume to be supported by the Responder.
- The selected cipher suite (i.e., the last cipher suite in SUITES_I) MAY be different between sessions, e.g., based on previous error messages (see next bullet), but all cipher suites which are more preferred by I than the selected cipher suite MUST be included in SUITES_I.
- If the Initiator previously received from the Responder an error message with error code 2 containing SUITES_R (see ) which indicates cipher suites supported by the Responder, then the Initiator SHOULD select its most preferred supported cipher suite among those (bearing in mind that error messages are not authenticated and may be forged).
- The Initiator MUST NOT change the supported cipher suites and the order of preference in SUITES_I based on previous error messages.
Generate an ephemeral ECDH key pair using the curve in the selected cipher suite and format it as a COSE_Key. Let G_X be the 'x' parameter of the COSE_Key.
Choose a connection identifier C_I and store it for the length of the protocol.
Encode message_1 as a sequence of CBOR encoded data items as specified in

Responder Processing of Message 1 The Responder SHALL process message_1 as follows:

Decode message_1 (see ).
Verify that the selected cipher suite is supported and that no prior cipher suite in SUITES_I is supported.
If EAD_1 is present then make it available to the application for EAD processing.

If any processing step fails, then the Responder MUST send an EDHOC error message back as defined in , and the protocol MUST be discontinued.

EDHOC Message 2

Formatting of Message 2 message_2 SHALL be a CBOR Sequence (see ) as defined below where:

G_Y_CIPHERTEXT_2 - the concatenation of G_Y (i.e., the ephemeral public key of the Responder) and CIPHERTEXT_2.
C_R - variable length connection identifier. Note that connection identifiers are byte strings but certain values are represented as integers in the message, see .

Responder Processing of Message 2 The Responder SHALL compose message_2 as follows:

Generate an ephemeral ECDH key pair using the curve in the selected cipher suite and format it as a COSE_Key. Let G_Y be the 'x' parameter of the COSE_Key.
Choose a connection identifier C_R and store it for the length of the protocol.
Compute the transcript hash TH_2 = H( G_Y, C_R, H(message_1) ) where H() is the EDHOC hash algorithm of the selected cipher suite. The input to the hash function is a CBOR Sequence. Note that H(message_1) can be computed and cached already in the processing of message_1.
Compute MAC_2 as in with context_2 = << ID_CRED_R, TH_2, CRED_R, ? EAD_2 >>
- If the Responder authenticates with a static Diffie-Hellman key (method equals 1 or 3), then mac_length_2 is the EDHOC MAC length of the selected cipher suite. If the Responder authenticates with a signature key (method equals 0 or 2), then mac_length_2 is equal to the output size of the EDHOC hash algorithm of the selected cipher suite.
- ID_CRED_R - identifier to facilitate the retrieval of CRED_R, see
- CRED_R - CBOR item containing the authentication credential of the Responder, see
- EAD_2 - external authorization data, see
If the Responder authenticates with a static Diffie-Hellman key (method equals 1 or 3), then Signature_or_MAC_2 is MAC_2. If the Responder authenticates with a signature key (method equals 0 or 2), then Signature_or_MAC_2 is the 'signature' field of a COSE_Sign1 object, computed as specified in Section 4.4 of using the signature algorithm of the selected cipher suite, the private authentication key of the Responder, and the following parameters as input (see for an overview of COSE and for notation):
- protected = << ID_CRED_R >>
- external_aad = << TH_2, CRED_R, ? EAD_2 >>
- payload = MAC_2
CIPHERTEXT_2 is calculated by using the Expand function as a binary additive stream cipher over the following plaintext:
- PLAINTEXT_2 = ( ID_CRED_R / bstr / -24..23, Signature_or_MAC_2, ? EAD_2 )
  - If ID_CRED_R contains a single 'kid' parameter, i.e., ID_CRED_R = { 4 : kid_R }, then the compact encoding is applied, see .
- Compute KEYSTREAM_2 as in , where plaintext_length is the length of PLAINTEXT_2. For the case of plaintext_length exceeding the EDHOC-KDF output size, see .
- CIPHERTEXT_2 = PLAINTEXT_2 XOR KEYSTREAM_2
Encode message_2 as a sequence of CBOR encoded data items as specified in .

Initiator Processing of Message 2 The Initiator SHALL process message_2 as follows:

Decode message_2 (see ).
Retrieve the protocol state using the message correlation provided by the transport (e.g., the CoAP Token, the 5-tuple, or the prepended C_I, see ).
Decrypt CIPHERTEXT_2, see .
Make ID_CRED_R and (if present) EAD_2 available to the application for authentication- and EAD processing.
Obtain the authentication credential (CRED_R) and the authentication key of R from the application (or by other means).
Verify Signature_or_MAC_2 using the algorithm in the selected cipher suite. The verification process depends on the method, see . Make the result of the verification available to the application.

If any processing step fails, then the Initiator MUST send an EDHOC error message back as defined in , and the protocol MUST be discontinued.

EDHOC Message 3

Formatting of Message 3 message_3 SHALL be a CBOR Sequence (see ) as defined below

Initiator Processing of Message 3 The Initiator SHALL compose message_3 as follows:

Compute the transcript hash TH_3 = H(TH_2, PLAINTEXT_2, CRED_R) where H() is the EDHOC hash algorithm of the selected cipher suite. The input to the hash function is a CBOR Sequence. Note that TH_3 can be computed and cached already in the processing of message_2.
Compute MAC_3 as in , with context_3 = << ID_CRED_I, TH_3, CRED_I, ? EAD_3 >>
- If the Initiator authenticates with a static Diffie-Hellman key (method equals 2 or 3), then mac_length_3 is the EDHOC MAC length of the selected cipher suite. If the Initiator authenticates with a signature key (method equals 0 or 1), then mac_length_3 is equal to the output size of the EDHOC hash algorithm of the selected cipher suite.
- ID_CRED_I - identifier to facilitate the retrieval of CRED_I, see
- CRED_I - CBOR item containing the authentication credential of the Initiator, see
- EAD_3 - external authorization data, see
If the Initiator authenticates with a static Diffie-Hellman key (method equals 2 or 3), then Signature_or_MAC_3 is MAC_3. If the Initiator authenticates with a signature key (method equals 0 or 1), then Signature_or_MAC_3 is the 'signature' field of a COSE_Sign1 object, computed as specified in Section 4.4 of using the signature algorithm of the selected cipher suite, the private authentication key of the Initiator, and the following parameters as input (see ):
- protected = << ID_CRED_I >>
- external_aad = << TH_3, CRED_I, ? EAD_3 >>
- payload = MAC_3
Compute a COSE_Encrypt0 object as defined in Sections 5.2 and 5.3 of , with the EDHOC AEAD algorithm of the selected cipher suite, using the encryption key K_3, the initialization vector IV_3 (if used by the AEAD algorithm), the plaintext PLAINTEXT_3, and the following parameters as input (see ):
- protected = h''
- external_aad = TH_3
- K_3 and IV_3 are defined in
- PLAINTEXT_3 = ( ID_CRED_I / bstr / -24..23, Signature_or_MAC_3, ? EAD_3 )
  - If ID_CRED_I contains a single 'kid' parameter, i.e., ID_CRED_I = { 4 : kid_I }, then the compact encoding is applied, see .
CIPHERTEXT_3 is the 'ciphertext' of COSE_Encrypt0.
Compute the transcript hash TH_4 = H(TH_3, PLAINTEXT_3, CRED_I) where H() is the EDHOC hash algorithm of the selected cipher suite. The input to the hash function is a CBOR Sequence. Note that TH_4 can be computed and cached already in the processing of message_3.
Calculate PRK_out as defined in . The Initiator can now derive application keys using the EDHOC-Exporter interface, see .
Encode message_3 as a CBOR data item as specified in .
Make the connection identifiers (C_I, C_R) and the application algorithms in the selected cipher suite available to the application.

The Initiator SHOULD NOT persistently store PRK_out or application keys until the Initiator has verified message_4 or a message protected with a derived application key, such as an OSCORE message, from the Responder. This is similar to waiting for an acknowledgement (ACK) in a transport protocol.

Responder Processing of Message 3 The Responder SHALL process message_3 as follows:

Decode message_3 (see ).
Retrieve the protocol state using the message correlation provided by the transport (e.g., the CoAP Token, the 5-tuple, or the prepended C_R, see ).
Decrypt and verify the COSE_Encrypt0 as defined in Sections 5.2 and 5.3 of , with the EDHOC AEAD algorithm in the selected cipher suite, and the parameters defined in .
Make ID_CRED_I and (if present) EAD_3 available to the application for authentication- and EAD processing.
Obtain the authentication credential (CRED_I) and the authentication key of I from the application (or by other means).
Verify Signature_or_MAC_3 using the algorithm in the selected cipher suite. The verification process depends on the method, see . Make the result of the verification available to the application.
Make the connection identifiers (C_I, C_R) and the application algorithms in the selected cipher suite available to the application.

After verifying message_3, the Responder can compute PRK_out, see , derive application keys using the EDHOC-Exporter interface, see , persistently store the keying material, and send protected application data. If any processing step fails, then the Responder MUST send an EDHOC error message back as defined in , and the protocol MUST be discontinued.

EDHOC Message 4 This section specifies message_4 which is OPTIONAL to support. Key confirmation is normally provided by sending an application message from the Responder to the Initiator protected with a key derived with the EDHOC-Exporter, e.g., using OSCORE (see ). In deployments where no protected application message is sent from the Responder to the Initiator, message_4 MUST be supported and MUST be used. Two examples of such deployments are:

When EDHOC is only used for authentication and no application data is sent.
When application data is only sent from the Initiator to the Responder.

Further considerations about when to use message_4 are provided in and .

Formatting of Message 4 message_4 SHALL be a CBOR Sequence (see ) as defined below

Responder Processing of Message 4 The Responder SHALL compose message_4 as follows:

Compute a COSE_Encrypt0 as defined in Sections 5.2 and 5.3 of , with the EDHOC AEAD algorithm of the selected cipher suite, using the encryption key K_4, the initialization vector IV_4 (if used by the AEAD algorithm), the plaintext PLAINTEXT_4, and the following parameters as input (see ):
- protected = h''
- external_aad = TH_4
- K_4 and IV_4 are defined in
- PLAINTEXT_4 = ( ? EAD_4 )
  - EAD_4 - external authorization data, see .
CIPHERTEXT_4 is the 'ciphertext' of COSE_Encrypt0.
Encode message_4 as a CBOR data item as specified in .

Initiator Processing of Message 4 The Initiator SHALL process message_4 as follows:

Decode message_4 (see ).
Retrieve the protocol state using the message correlation provided by the transport (e.g., the CoAP Token, the 5-tuple, or the prepended C_I, see ).
Decrypt and verify the COSE_Encrypt0 as defined in Sections 5.2 and 5.3 of , with the EDHOC AEAD algorithm in the selected cipher suite, and the parameters defined in .
Make (if present) EAD_4 available to the application for EAD processing.

If any processing step fails, then the Initiator MUST send an EDHOC error message back as defined in , and the protocol MUST be discontinued. After verifying message_4, the Initiator is assured that the Responder has calculated the key PRK_out (key confirmation) and that no other party can derive the key.

Error Handling This section defines the format for error messages, and the processing associated with the currently defined error codes. Additional error codes may be registered, see . There are many kinds of errors that can occur during EDHOC processing. As in CoAP, an error can be triggered by errors in the received message or internal errors in the receiving endpoint. Except for processing and formatting errors, it is up to the implementation when to send an error message. Sending error messages is essential for debugging but MAY be skipped if, for example, a session cannot be found or due to denial-of-service reasons, see . Error messages in EDHOC are always fatal. After sending an error message, the sender MUST discontinue the protocol. The receiver SHOULD treat an error message as an indication that the other party likely has discontinued the protocol. But as the error message is not authenticated, a received error message might also have been sent by an attacker and the receiver MAY therefore try to continue the protocol. An EDHOC error message can be sent by either endpoint as a reply to any non-error EDHOC message. How errors at the EDHOC layer are transported depends on lower layers, which need to enable error messages to be sent and processed as intended. error SHALL be a CBOR Sequence (see ) as defined below

EDHOC error message. where:

ERR_CODE - error code encoded as an integer. The value 0 is used for success, all other values (negative or positive) indicate errors.
ERR_INFO - error information. Content and encoding depend on error code.

The remainder of this section specifies the currently defined error codes, see . Additional error codes and corresponding error information may be specified.

Error codes and error information included in the EDHOC error message.

Success Error code 0 MAY be used internally in an application to indicate success, i.e., as a standard value in case of no error, e.g., in status reporting or log files. ERR_INFO can contain any type of CBOR item, the content is out of scope for this specification. Error code 0 MUST NOT be used as part of the EDHOC message exchange flow. If an endpoint receives an error message with error code 0, then it MUST discontinue the protocol and MUST NOT send an error message.

Unspecified Error Error code 1 is used for errors that do not have a specific error code defined. ERR_INFO MUST be a text string containing a human-readable diagnostic message written in English, for example "Method not supported". The diagnostic text message is mainly intended for software engineers that during debugging need to interpret it in the context of the EDHOC specification. The diagnostic message SHOULD be provided to the calling application where it SHOULD be logged.

Wrong Selected Cipher Suite Error code 2 MUST only be used when replying to message_1 in case the cipher suite selected by the Initiator is not supported by the Responder, or if the Responder supports a cipher suite more preferred by the Initiator than the selected cipher suite, see . In this case, ERR_INFO = SUITES_R and is of type suites, see . If the Responder does not support the selected cipher suite, then SUITES_R MUST include one or more supported cipher suites. If the Responder supports a cipher suite in SUITES_I other than the selected cipher suite (independently of if the selected cipher suite is supported or not) then SUITES_R MUST include the supported cipher suite in SUITES_I which is most preferred by the Initiator. SUITES_R MAY include a single cipher suite, in which case it is encoded as an int. If the Responder does not support any cipher suite in SUITES_I, then it SHOULD include all its supported cipher suites in SUITES_R. In contrast to SUITES_I, the order of the cipher suites in SUITES_R has no significance.

Cipher Suite Negotiation After receiving SUITES_R, the Initiator can determine which cipher suite to select (if any) for the next EDHOC run with the Responder. If the Initiator intends to contact the Responder in the future, the Initiator SHOULD remember which selected cipher suite to use until the next message_1 has been sent, otherwise the Initiator and Responder will likely run into an infinite loop where the Initiator selects its most preferred cipher suite and the Responder sends an error with supported cipher suites. After a successful run of EDHOC, the Initiator MAY remember the selected cipher suite to use in future EDHOC sessions. Note that if the Initiator or Responder is updated with new cipher suite policies, any cached information may be outdated. Note that the Initiator's list of supported cipher suites and order of preference is fixed (see and ). Furthermore, the Responder SHALL only accept message_1 if the selected cipher suite is the first cipher suite in SUITES_I that the Responder supports (see ). Following this procedure ensures that the selected cipher suite is the most preferred (by the Initiator) cipher suite supported by both parties. If the selected cipher suite is not the first cipher suite which the Responder supports in SUITES_I received in message_1, then the Responder MUST discontinue the protocol, see . If SUITES_I in message_1 is manipulated, then the integrity verification of message_2 containing the transcript hash TH_2 will fail and the Initiator will discontinue the protocol.

Examples Assume that the Initiator supports the five cipher suites 5, 6, 7, 8, and 9 in decreasing order of preference. Figures and show examples of how the Initiator can format SUITES_I and how SUITES_R is used by Responders to give the Initiator information about the cipher suites that the Responder supports. In the first example (), the Responder supports cipher suite 6 but not the initially selected cipher suite 5.

Example of an Initiator supporting suites 5, 6, 7, 8, and 9 in decreasing order of preference, and a Responder supporting suite 6 but not suite 5. The Responder rejects the first message_1 with an error indicating support for suite 6. The Initiator also supports suite 6, and therefore selects suite 6 in the second message_1. The Initiator prepends in SUITES_I the selected suite 6 with the more preferred suites, in this case suite 5, to mitigate a potential attack on the cipher suite negotiation. | | message_1 | | | | ERR_CODE = 2, SUITES_R = 6 | |<------------------------------------------------------------------+ | error | | | | METHOD, SUITES_I = [5, 6], G_X, C_I, EAD_1 | +------------------------------------------------------------------>| | message_1 | ]]> In the second example (), the Responder supports cipher suites 8 and 9 but not the more preferred (by the Initiator) cipher suites 5, 6 or 7. To illustrate the negotiation mechanics we let the Initiator first make a guess that the Responder supports suite 6 but not suite 5. Since the Responder supports neither 5 nor 6, it responds with SUITES_R containing the supported suites, after which the Initiator selects its most preferred supported suite. (If the Responder had supported suite 5, it would have included it in SUITES_R of the response, and it would in that case have become the selected suite in the second message_1.)

Example of an Initiator supporting suites 5, 6, 7, 8, and 9 in decreasing order of preference, and a Responder supporting suites 8 and 9 but not 5, 6 or 7. The Responder rejects the first message_1 with an error indicating support for suites 8 and 9 (in any order). The Initiator also supports suites 8 and 9, and prefers suite 8, so therefore selects suite 8 in the second message_1. The Initiator prepends in SUITES_I the selected suite 8 with the more preferred suites in order of preference, in this case suites 5, 6 and 7, to mitigate a potential attack on the cipher suite negotiation. | | message_1 | | | | ERR_CODE = 2, SUITES_R = [9, 8] | |<------------------------------------------------------------------+ | error | | | | METHOD, SUITES_I = [5, 6, 7, 8], G_X, C_I, EAD_1 | +------------------------------------------------------------------>| | message_1 | ]]>

Compliance Requirements In the absence of an application profile specifying otherwise: An implementation MAY support only Initiator or only Responder. An implementation MAY support only a single method. None of the methods are mandatory-to-implement. Implementations MUST support 'kid' parameters. None of the other COSE header parameters are mandatory-to-implement. An implementation MAY support only a single credential type (CCS, CWT, X.509, C509). None of the credential types are mandatory-to-implement. Implementations MUST support the EDHOC-Exporter. Implementations MAY support message_4. Error codes (ERR_CODE) 1 and 2 MUST be supported. Implementations MUST support EAD. Implementations MUST support cipher suite 2 and 3. Cipher suites 2 (AES-CCM-16-64-128, SHA-256, 8, P-256, ES256, AES-CCM-16-64-128, SHA-256) and 3 (AES-CCM-16-128-128, SHA-256, 16, P-256, ES256, AES-CCM-16-64-128, SHA-256) only differ in the size of the MAC length, so supporting one or both of these is no essential difference. Implementations only need to implement the algorithms needed for their supported methods.

Security Considerations

Security Properties EDHOC inherits its security properties from the theoretical SIGMA-I protocol . Using the terminology from , EDHOC provides forward secrecy, mutual authentication with aliveness, consistency, and peer awareness. As described in , message_3 provides peer awareness to the Responder while message_4 provides peer awareness to the Initiator. By including the authentication credentials in the transcript hash, EDHOC protects against Duplicate Signature Key Selection (DSKS)-like identity mis-binding attack that the MAC-then-Sign variant of SIGMA-I is otherwise vulnerable to. As described in , different levels of identity protection are provided to the Initiator and the Responder. EDHOC provides identity protection of the Initiator against active attacks and identity protection of the Responder against passive attacks. An active attacker can get the credential identifier of the Responder by eavesdropping on the destination address used for transporting message_1 and then sending its own message_1 to the same address. The roles should be assigned to protect the most sensitive identity/identifier, typically that which is not possible to infer from routing information in the lower layers. EDHOC messages might change in transit due to a noisy channel or through modification by an attacker. Changes in message_1 and message_2 (except Signature_or_MAC_2 when the signature scheme is not strongly unforgeable) are detected when verifying Signature_or_MAC_2. Changes to not strongly unforgeable Signature_or_MAC_2, and message_3 are detected when verifying CIPHERTEXT_3. Changes to message_4 are detected when verifying CIPHERTEXT_4. Compared to , EDHOC adds an explicit method type and expands the message authentication coverage to additional elements such as algorithms, external authorization data, and previous plaintext messages. This protects against an attacker replaying messages or injecting messages from another session. EDHOC also adds selection of connection identifiers and downgrade protected negotiation of cryptographic parameters, i.e., an attacker cannot affect the negotiated parameters. A single session of EDHOC does not include negotiation of cipher suites, but it enables the Responder to verify that the selected cipher suite is the most preferred cipher suite by the Initiator which is supported by both the Initiator and the Responder, and to discontinue the session if not. As required by , IETF protocols need to mitigate pervasive monitoring when possible. EDHOC therefore only supports methods with ephemeral Diffie-Hellman and provides a key update function (see ) for lightweight application protocol rekeying. Either of these provides forward secrecy, in the sense that compromise of the private authentication keys does not compromise past session keys (PRK_out), and compromise of a session key does not compromise past session keys. Frequently re-running EDHOC with ephemeral Diffie-Hellman forces attackers to perform dynamic key exfiltration where the attacker must have continuous interactions with the collaborator, which is a significant complication. To limit the effect of breaches, it is important to limit the use of symmetric group keys for bootstrapping. EDHOC therefore strives to make the additional cost of using raw public keys and self-signed certificates as small as possible. Raw public keys and self-signed certificates are not a replacement for a public key infrastructure but SHOULD be used instead of symmetric group keys for bootstrapping. Compromise of the long-term keys (private signature or static DH keys) does not compromise the security of completed EDHOC exchanges. Compromising the private authentication keys of one party lets an active attacker impersonate that compromised party in EDHOC exchanges with other parties but does not let the attacker impersonate other parties in EDHOC exchanges with the compromised party. Compromise of the long-term keys does not enable a passive attacker to compromise future session keys (PRK_out). Compromise of the HDKF input parameters (ECDH shared secret) leads to compromise of all session keys derived from that compromised shared secret. Compromise of one session key does not compromise other session keys. Compromise of PRK_out leads to compromise of all keying material derived with the EDHOC-Exporter. Based on the cryptographic algorithms requirements , EDHOC provides a minimum of 64-bit security against online brute force attacks and a minimum of 128-bit security against offline brute force attacks. To break 64-bit security against online brute force an attacker would on average have to send 4.3 billion messages per second for 68 years, which is infeasible in constrained IoT radio technologies. A forgery against a 64-bit MAC in EDHOC breaks the security of all future application data, while a forgery against a 64-bit MAC in the subsequent application protocol (e.g., OSCORE ) typically only breaks the security of the data in the forged packet. As the EDHOC protocol is discontinued when verification fails, the security against online attacks is given by the sum of the strength of the verified signatures and MACs (including MAC in AEAD). As an example, if EDHOC is used with method 3, cipher suite 2, and message_4, the Responder is authenticated with 128-bit security against online attacks (the sum of the 64-bit MACs in message_2 and message_4). The same principle applies for MACs in an application protocol keyed by EDHOC as long as EDHOC is rerun when verification of the first MACs in the application protocol fails. As an example, if EDHOC with method 3 and cipher suite 2 is used as in Figure 2 of , 128-bit mutual authentication against online attacks can be achieved after completion of the first OSCORE request and response. After sending message_3, the Initiator is assured that no other party than the Responder can compute the key PRK_out. While the Initiator can securely send protected application data, the Initiator SHOULD NOT persistently store the keying material PRK_out until the Initiator has verified message_4 or a message protected with a derived application key, such as an OSCORE message, from the Responder. After verifying message_3, the Responder is assured that an honest Initiator has computed the key PRK_out. The Responder can securely derive and store the keying material PRK_out, and send protected application data. External authorization data sent in message_1 (EAD_1) or message_2 (EAD_2) should be considered unprotected by EDHOC, see . EAD_2 is encrypted but the Responder has not yet authenticated the Initiator and the encryption does not provide confidentiality against active attacks. External authorization data sent in message_3 (EAD_3) or message_4 (EAD_4) is protected between Initiator and Responder by the protocol, but note that EAD fields may be used by the application before the message verification is completed, see . Designing a secure mechanism that uses EAD is not necessarily straightforward. This document only provides the EAD transport mechanism, but the problem of agreeing on the surrounding context and the meaning of the information passed to and from the application remains. Any new uses of EAD should be subject to careful review. Key compromise impersonation (KCI): In EDHOC authenticated with signature keys, EDHOC provides KCI protection against an attacker having access to the long-term key or the ephemeral secret key. With static Diffie-Hellman key authentication, KCI protection would be provided against an attacker having access to the long-term Diffie-Hellman key, but not to an attacker having access to the ephemeral secret key. Note that the term KCI has typically been used for compromise of long-term keys, and that an attacker with access to the ephemeral secret key can only attack that specific session. Repudiation: If an endpoint authenticates with a signature, the other endpoint can prove that the endpoint performed a run of the protocol by presenting the data being signed as well as the signature itself. With static Diffie-Hellman key authentication, the authenticating endpoint can deny having participated in the protocol. Earlier versions of EDHOC have been formally analyzed and the specification has been updated based on the analysis.

Cryptographic Considerations The SIGMA protocol requires that the encryption of message_3 provides confidentiality against active attackers and EDHOC message_4 relies on the use of authenticated encryption. Hence the message authenticating functionality of the authenticated encryption in EDHOC is critical: authenticated encryption MUST NOT be replaced by plain encryption only, even if authentication is provided at another level or through a different mechanism. To reduce message overhead EDHOC does not use explicit nonces and instead relies on the ephemeral public keys to provide randomness to each session. A good amount of randomness is important for the key generation, to provide liveness, and to protect against interleaving attacks. For this reason, the ephemeral keys MUST NOT be used in more than one EDHOC message, and both parties SHALL generate fresh random ephemeral key pairs. Note that an ephemeral key may be used to calculate several ECDH shared secrets. When static Diffie-Hellman authentication is used the same ephemeral key is used in both ephemeral-ephemeral and ephemeral-static ECDH. As discussed in , the encryption of message_2 does only need to protect against passive attacker as active attackers can always get the Responder's identity by sending their own message_1. EDHOC uses the Expand function (typically HKDF-Expand) as a binary additive stream cipher which is proven secure as long as the expand function is a PRF. HKDF-Expand is not often used as a stream cipher as it is slow on long messages, and most applications require both IND-CCA confidentiality as well as integrity protection. For the encryption of message_2, any speed difference is negligible, IND-CCA does not increase security, and integrity is provided by the inner MAC (and signature depending on method). Requirements for how to securely generate, validate, and process the ephemeral public keys depend on the elliptic curve. For X25519 and X448, the requirements are defined in . For secp256r1, secp384r1, and secp521r1, the requirements are defined in Section 5 of . For secp256r1, secp384r1, and secp521r1, at least partial public-key validation MUST be done. As noted in Section 12 of the use of a single key for multiple algorithms is strongly discouraged unless proven secure by a dedicated cryptographic analysis. In particular this recommendation applies to using the same private key for static Diffie-Hellman authentication and digital signature authentication. A preliminary conjecture is that a minor change to EDHOC may be sufficient to fit the analysis of secure shared signature and ECDH key usage in and . The property that a completed EDHOC exchange implies that another identity has been active is upheld as long as the Initiator does not have its own identity in the set of Responder identities it is allowed to communicate with. In Trust on first use (TOFU) use cases, see , the Initiator should verify that the Responder's identity is not equal to its own. Any future EDHOC methods using e.g., pre-shared keys might need to mitigate this in other ways. However, an active attacker can gain information about the set of identities an Initiator is willing to communicate with. If the Initiator is willing to communicate with all identities except its own an attacker can determine that a guessed Initiator identity is correct. To not leak any long-term identifiers, it is recommended to use a freshly generated authentication key as identity in each initial TOFU exchange.

Cipher Suites and Cryptographic Algorithms When using private cipher suite or registering new cipher suites, the choice of key length used in the different algorithms needs to be harmonized, so that a sufficient security level is maintained for authentication credentials, the EDHOC protocol, and the protection of application data. The Initiator and the Responder should enforce a minimum security level. The output size of the EDHOC hash algorithm MUST be at least 256-bits, i.e., the hash algorithms SHA-1 and SHA-256/64 (SHA-256 truncated to 64-bits) SHALL NOT be supported for use in EDHOC except for certificate identification with x5t and c5t. For security considerations of SHA-1, see . As EDHOC integrity protects the whole authentication credentials, the choice of hash algorithm in x5t and c5t does not affect security and it is RECOMMENDED to use the same hash algorithm as in the cipher suite but with as much truncation as possible, i.e., when the EDHOC hash algorithm is SHA-256 it is RECOMMENDED to use SHA-256/64 in x5t and c5t. The EDHOC MAC length MUST be at least 8 bytes and the tag length of the EDHOC AEAD algorithm MUST be at least 64-bits. Note that secp256k1 is only defined for use with ECDSA and not for ECDH. Note that some COSE algorithms are marked as not recommended in the COSE IANA registry.

Post-Quantum Considerations As of the publication of this specification, it is unclear when or even if a quantum computer of sufficient size and power to exploit public key cryptography will exist. Deployments that need to consider risks decades into the future should transition to Post-Quantum Cryptography (PQC) in the not-too-distant future. Many other systems should take a slower wait-and-see approach where PQC is phased in when the quantum threat is more imminent. Current PQC algorithms have limitations compared to Elliptic Curve Cryptography (ECC) and the data sizes would be problematic in many constrained IoT systems. Symmetric algorithms used in EDHOC such as SHA-256 and AES-CCM-16-64-128 are practically secure against even large quantum computers. EDHOC supports all signature algorithms defined by COSE, including PQC signature algorithms such as HSS-LMS. EDHOC is currently only specified for use with key exchange algorithms of type ECDH curves, but any Key Encapsulation Method (KEM), including PQC KEMs, can be used in method 0. While the key exchange in method 0 is specified with terms of the Diffie-Hellman protocol, the key exchange adheres to a KEM interface: G_X is then the public key of the Initiator, G_Y is the encapsulation, and G_XY is the shared secret. Use of PQC KEMs to replace static DH authentication would likely require a specification updating EDHOC with new methods.

Unprotected Data and Privacy The Initiator and the Responder must make sure that unprotected data and metadata do not reveal any sensitive information. This also applies for encrypted data sent to an unauthenticated party. In particular, it applies to EAD_1, ID_CRED_R, EAD_2, and error messages. Using the same EAD_1 in several EDHOC sessions allows passive eavesdroppers to correlate the different sessions. Note that even if ead_value is encrypted outside of EDHOC, the ead_label in EAD_1 is revealed to passive attackers and the ead_label in EAD_2 is revealed to active attackers. Another consideration is that the list of supported cipher suites may potentially be used to identify the application. The Initiator and the Responder must also make sure that unauthenticated data does not trigger any harmful actions. In particular, this applies to EAD_1 and error messages. An attacker observing network traffic may use connection identifiers sent in clear in EDHOC or the subsequent application protocol to correlate packets sent on different paths or at different times. The attacker may use this information for traffic flow analysis or to track an endpoint. Application protocols using connection identifiers from EDHOC SHOULD provide mechanisms to update the connection identifiers and MAY provide mechanisms to issue several simultaneously active connection identifiers. See for a non-constrained example of such mechanisms. Connection identifiers can e.g., be chosen randomly among the set of unused 1-byte connection identifiers. Connection identity privacy mechanisms are only useful when there are not fixed identifiers such as IP address or MAC address in the lower layers.

Updated Internet Threat Model Considerations Since the publication of there has been an increased awareness of the need to protect against endpoints that are compromised, malicious, or whose interests simply do not align with the interests of users . describes an updated threat model for Internet confidentiality, see . further expands the threat model. Implementations and users SHOULD consider these threat models. In particular, even data sent protected to the other endpoint such as ID_CRED and EAD can be used for tracking, see Section 2.7 of . The fields ID_CRED_I, ID_CRED_R, EAD_2, EAD_3, and EAD_4 have variable length, and information regarding the length may leak to an attacker. A passive attacker may, e.g., be able to differentiate endpoints using identifiers of different length. To mitigate this information leakage an implementation may ensure that the fields have fixed length or use padding. An implementation may, e.g., only use fixed length identifiers like 'kid' of length 1. Alternatively, padding may be used (see ) to hide the true length of, e.g., certificates by value in 'x5chain' or 'c5c'.

Denial-of-Service EDHOC itself does not provide countermeasures against Denial-of-Service attacks. In particular, by sending a number of new or replayed message_1 an attacker may cause the Responder to allocate state, perform cryptographic operations, and amplify messages. To mitigate such attacks, an implementation SHOULD rely on lower layer mechanisms. For instance, when EDHOC is transferred as an exchange of CoAP messages, the CoAP server can use the Echo option defined in which forces the CoAP client to demonstrate reachability at its apparent network address. To avoid an additional roundtrip the Initiator can reduce the amplification factor by padding message_1, see . An attacker can also send faked message_2, message_3, message_4, or error in an attempt to trick the receiving party to send an error message and discontinue the protocol. EDHOC implementations MAY evaluate if a received message is likely to have been forged by an attacker and ignore it without sending an error message or discontinuing the protocol.

Implementation Considerations The availability of a secure random number generator is essential for the security of EDHOC. If no true random number generator is available, a random seed must be provided from an external source and used with a cryptographically secure pseudorandom number generator. As each pseudorandom number must only be used once, an implementation needs to get a unique input to the pseudorandom number generator after reboot, or continuously store state in nonvolatile memory. Appendix B.1.1 in describes issues and solution approaches for writing to nonvolatile memory. Intentionally or unintentionally weak or predictable pseudorandom number generators can be abused or exploited for malicious purposes. describes a way for security protocol implementations to augment their (pseudo)random number generators using a long-term private key and a deterministic signature function. This improves randomness from broken or otherwise subverted random number generators. The same idea can be used with other secrets and functions such as a Diffie-Hellman function or a symmetric secret and a PRF like HMAC or KMAC. It is RECOMMENDED to not trust a single source of randomness and to not put unaugmented random numbers on the wire. Implementations might consider deriving secret and non-secret randomness from different PRNG/PRF/KDF instances to limit the damage if the PRNG/PRF/KDF turns out to be fundamentally broken. NIST generally forbids deriving secret and non-secret randomness from the same KDF instance, but this decision has been criticized by Krawczyk and doing so is common practice. In addition to IVs, other examples are the challenge in EAP-TTLS, the RAND in 3GPP AKAs, and the Session-Id in EAP-TLS 1.3. Note that part of KEYSTREAM_2 is also non-secret randomness as it is known or predictable to an attacker. As explained by Krawczyk, if any attack is mitigated by the NIST requirement it would mean that the KDF is fully broken and would have to be replaced anyway. For many constrained IoT devices it is problematic to support several crypto primitives. Existing devices can be expected to support either ECDSA or EdDSA. If ECDSA is supported, "deterministic ECDSA" as specified in MAY be used. Pure deterministic elliptic-curve signatures such as deterministic ECDSA and EdDSA have gained popularity over randomized ECDSA as their security do not depend on a source of high-quality randomness. Recent research has however found that implementations of these signature algorithms may be vulnerable to certain side-channel and fault injection attacks due to their determinism. See e.g., Section 1 of for a list of attack papers. As suggested in Section 2.1.1 of this can be addressed by combining randomness and determinism. Appendix D of describes how Montgomery curves such as X25519 and X448 and (twisted) Edwards curves as curves such as Ed25519 and Ed448 can mapped to and from short-Weierstrass form for implementation on platforms that accelerate elliptic curve group operations in short-Weierstrass form. All private keys, symmetric keys, and IVs MUST be secret. Implementations should provide countermeasures to side-channel attacks such as timing attacks. Intermediate computed values such as ephemeral ECDH keys and ECDH shared secrets MUST be deleted after key derivation is completed. The Initiator and the Responder are responsible for verifying the integrity and validity of certificates. The selection of trusted CAs should be done very carefully and certificate revocation should be supported. The choice of revocation mechanism is left to the application. For example, in case of X.509 certificates, Certificate Revocation Lists or OCSP may be used. Verification of validity may require the use of a Real-Time Clock (RTC). The private authentication keys MUST be kept secret, only the Responder SHALL have access to the Responder's private authentication key and only the Initiator SHALL have access to the Initiator's private authentication key. The Initiator and the Responder are allowed to select the connection identifier C_I and C_R, respectively, for the other party to use in the ongoing EDHOC protocol as well as in a subsequent application protocol (e.g., OSCORE ). The choice of connection identifier is not security critical in EDHOC but intended to simplify the retrieval of the right security context in combination with using short identifiers. If the wrong connection identifier of the other party is used in a protocol message it will result in the receiving party not being able to retrieve a security context (which will discontinue the protocol) or retrieve the wrong security context (which also discontinues the protocol as the message cannot be verified). If two nodes unintentionally initiate two simultaneous EDHOC message exchanges with each other even if they only want to complete a single EDHOC message exchange, they MAY discontinue the exchange with the lexicographically smallest G_X. Note that in cases where several EDHOC exchanges with different parameter sets (method, COSE headers, etc.) are used, an attacker can affect which parameter set will be used by blocking some of the parameter sets. If supported by the device, it is RECOMMENDED that at least the long-term private keys are stored in a Trusted Execution Environment (TEE) and that sensitive operations using these keys are performed inside the TEE. To achieve even higher security it is RECOMMENDED that additional operations such as ephemeral key generation, all computations of shared secrets, and storage of the PRK keys can be done inside the TEE. The use of a TEE aims at preventing code within that environment to be tampered with, and preventing data used by such code to be read or tampered with by code outside that environment. Note that HKDF-Expand has a relatively small maximum output length of 255 * hash_length, where hash_length is the output size in bytes of the EDHOC hash algorithm of the selected cipher suite. This means that when SHA-256 is used as hash algorithm, PLAINTEXT_2 cannot be longer than 8160 bytes. This is probably not a limitation for most intended applications, but to be able to support for example long certificate chains or large external authorization data, there is a backwards compatible method specified in . The sequence of transcript hashes in EDHOC (TH_2, TH_3, TH_4) does not make use of a so called running hash. This is a design choice as running hashes are often not supported on constrained platforms. When parsing a received EDHOC message, implementations MUST discontinue the protocol if the message does not comply with the CDDL for that message. It is RECOMMENDED to discontinue the protocol if the received EDHOC message is not deterministic CBOR.

IANA Considerations

EDHOC Exporter Label Registry IANA has created a new registry titled "EDHOC Exporter Label" under the new registry group "Ephemeral Diffie-Hellman Over COSE (EDHOC)". The registration procedure is "Expert Review" . The columns of the registry are Label and Description. Label is a uint. Description is a text string. The initial contents of the registry are:

EDHOC Cipher Suites Registry IANA has created a new registry titled "EDHOC Cipher Suites" under the new registry group "Ephemeral Diffie-Hellman Over COSE (EDHOC)". The registration procedure is "Expert Review" . The columns of the registry are Value, Array and Description, where Value is an integer and the other columns are text strings. The initial contents of the registry are:

EDHOC Method Type Registry IANA has created a new registry entitled "EDHOC Method Type" under the new registry group "Ephemeral Diffie-Hellman Over COSE (EDHOC)". The registration procedure is "Specification Required" . The columns of the registry are Value, Initiator Authentication Key, and Responder Authentication Key, where Value is an integer and the other columns are text strings describing the authentication keys. The initial contents of the registry are shown in .

EDHOC Error Codes Registry IANA has created a new registry entitled "EDHOC Error Codes" under the new registry group "Ephemeral Diffie-Hellman Over COSE (EDHOC)". The registration procedure is "Expert Review" . The columns of the registry are ERR_CODE, ERR_INFO Type and Description, where ERR_CODE is an integer, ERR_INFO is a CDDL defined type, and Description is a text string. The initial contents of the registry are shown in .

EDHOC External Authorization Data Registry IANA has created a new registry entitled "EDHOC External Authorization Data" under the new registry group "Ephemeral Diffie-Hellman Over COSE (EDHOC)". The registration procedure is "Specification Required" . The columns of the registry are Label, Description, and Reference, where Label is a positive integer and the other columns are text strings.

COSE Header Parameters Registry IANA has registered the following entries in the "COSE Header Parameters" registry under the registry group "CBOR Object Signing and Encryption (COSE)". The value of the 'kcwt' header parameter is a COSE Web Token (CWT) , and the value of the 'kccs' header parameter is a CWT Claims Set (CCS), see . The CWT/CCS must contain a COSE_Key in a 'cnf' claim . The Value Registry for this item is empty and omitted from the table below.

The Well-Known URI Registry IANA has added the well-known URI "edhoc" to the "Well-Known URIs" registry.

URI suffix: edhoc
Change controller: IETF
Specification document(s): [[this document]]
Related information: None

Media Types Registry IANA has added the media types "application/edhoc+cbor-seq" and "application/cid-edhoc+cbor-seq" to the "Media Types" registry.

application/edhoc+cbor-seq Media Type Registration

Type name: application
Subtype name: edhoc+cbor-seq
Required parameters: N/A
Optional parameters: N/A
Encoding considerations: binary
Security considerations: See Section 7 of this document.
Interoperability considerations: N/A
Published specification: [[this document]] (this document)
Applications that use this media type: To be identified
Fragment identifier considerations: N/A
Additional information:
- Magic number(s): N/A
- File extension(s): N/A
- Macintosh file type code(s): N/A
Person & email address to contact for further information: See "Authors' Addresses" section.
Intended usage: COMMON
Restrictions on usage: N/A
Author: See "Authors' Addresses" section.
Change Controller: IESG

application/cid-edhoc+cbor-seq Media Type Registration

Type name: application
Subtype name: cid-edhoc+cbor-seq
Required parameters: N/A
Optional parameters: N/A
Encoding considerations: binary
Security considerations: See Section 7 of this document.
Interoperability considerations: N/A
Published specification: [[this document]] (this document)
Applications that use this media type: To be identified
Fragment identifier considerations: N/A
Additional information:
- Magic number(s): N/A
- File extension(s): N/A
- Macintosh file type code(s): N/A
Person & email address to contact for further information: See "Authors' Addresses" section.
Intended usage: COMMON
Restrictions on usage: N/A
Author: See "Authors' Addresses" section.
Change Controller: IESG

CoAP Content-Formats Registry IANA has added the media types "application/edhoc+cbor-seq" and "application/cid-edhoc+cbor-seq" to the "CoAP Content-Formats" registry under the registry group "Constrained RESTful Environments (CoRE) Parameters".

CoAP Content-Format IDs

Resource Type (rt=) Link Target Attribute Values Registry IANA has added the resource type "core.edhoc" to the "Resource Type (rt=) Link Target Attribute Values" registry under the registry group "Constrained RESTful Environments (CoRE) Parameters".

Value: "core.edhoc"
Description: EDHOC resource.
Reference: [[this document]]

Expert Review Instructions The IANA Registries established in this document are defined as "Expert Review". This section gives some general guidelines for what the experts should be looking for, but they are being designated as experts for a reason so they should be given substantial latitude. Expert reviewers should take into consideration the following points:

Clarity and correctness of registrations. Experts are expected to check the clarity of purpose and use of the requested entries. Expert needs to make sure the values of algorithms are taken from the right registry, when that is required. Experts should consider requesting an opinion on the correctness of registered parameters from relevant IETF working groups. Encodings that do not meet these objective of clarity and completeness should not be registered.
Experts should take into account the expected usage of fields when approving point assignment. The length of the encoded value should be weighed against how many code points of that length are left, the size of device it will be used on, and the number of code points left that encode to that size.
Specifications are recommended. When specifications are not provided, the description provided needs to have sufficient information to verify the points above.

References Normative References Key words for use in RFCs to Indicate Requirement Levels In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Algorithms and Identifiers for the Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile This document specifies algorithm identifiers and ASN.1 encoding formats for digital signatures and subject public keys used in the Internet X.509 Public Key Infrastructure (PKI). Digital signatures are used to sign certificates and certificate revocation list (CRLs). Certificates include the public key of the named subject. [STANDARDS-TRACK] Guidelines for Writing RFC Text on Security Considerations All RFCs are required to have a Security Considerations section. Historically, such sections have been relatively weak. This document provides guidelines to RFC authors on how to write a good Security Considerations section. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. An Interface and Algorithms for Authenticated Encryption This document defines algorithms for Authenticated Encryption with Associated Data (AEAD), and defines a uniform interface and a registry for such algorithms. The interface and registry can be used as an application-independent set of cryptoalgorithm suites. This approach provides advantages in efficiency and security, and promotes the reuse of crypto implementations. [STANDARDS-TRACK] Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet. An overview of this approach and model is provided as an introduction. The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms. Standard certificate extensions are described and two Internet-specific extensions are defined. A set of required certificate extensions is specified. The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions. An algorithm for X.509 certification path validation is described. An ASN.1 module and examples are provided in the appendices. [STANDARDS-TRACK] HMAC-based Extract-and-Expand Key Derivation Function (HKDF) This document specifies a simple Hashed Message Authentication Code (HMAC)-based key derivation function (HKDF), which can be used as a building block in various protocols and applications. The key derivation function (KDF) is intended to support a wide range of applications and requirements, and is conservative in its use of cryptographic hash functions. This document is not an Internet Standards Track specification; it is published for informational purposes. Fundamental Elliptic Curve Cryptography Algorithms This note describes the fundamental algorithms of Elliptic Curve Cryptography (ECC) as they were defined in some seminal references from 1994 and earlier. These descriptions may be useful for implementing the fundamental algorithms without using any of the specialized methods that were developed in following years. Only elliptic curves defined over fields of characteristic greater than three are in scope; these curves are those used in Suite B. This document is not an Internet Standards Track specification; it is published for informational purposes. X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP This document specifies a protocol useful in determining the current status of a digital certificate without requiring Certificate Revocation Lists (CRLs). Additional mechanisms addressing PKIX operational requirements are specified in separate documents. This document obsoletes RFCs 2560 and 6277. It also updates RFC 5912. Deterministic Usage of the Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA) This document defines a deterministic digital signature generation procedure. Such signatures are compatible with standard Digital Signature Algorithm (DSA) and Elliptic Curve Digital Signature Algorithm (ECDSA) digital signatures and can be processed with unmodified verifiers, which need not be aware of the procedure described therein. Deterministic signatures retain the cryptographic security features associated with digital signatures but can be more easily implemented in various environments, since they do not need access to a source of high-quality randomness. The Constrained Application Protocol (CoAP) The Constrained Application Protocol (CoAP) is a specialized web transfer protocol for use with constrained nodes and constrained (e.g., low-power, lossy) networks. The nodes often have 8-bit microcontrollers with small amounts of ROM and RAM, while constrained networks such as IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs) often have high packet error rates and a typical throughput of 10s of kbit/s. The protocol is designed for machine- to-machine (M2M) applications such as smart energy and building automation. CoAP provides a request/response interaction model between application endpoints, supports built-in discovery of services and resources, and includes key concepts of the Web such as URIs and Internet media types. CoAP is designed to easily interface with HTTP for integration with the Web while meeting specialized requirements such as multicast support, very low overhead, and simplicity for constrained environments. Confidentiality in the Face of Pervasive Surveillance: A Threat Model and Problem Statement Since the initial revelations of pervasive surveillance in 2013, several classes of attacks on Internet communications have been discovered. In this document, we develop a threat model that describes these attacks on Internet confidentiality. We assume an attacker that is interested in undetected, indiscriminate eavesdropping. The threat model is based on published, verified attacks. Elliptic Curves for Security This memo specifies two elliptic curves over prime fields that offer a high level of practical security in cryptographic applications, including Transport Layer Security (TLS). These curves are intended to operate at the ~128-bit and ~224-bit security level, respectively, and are generated deterministically based on a list of required properties. Block-Wise Transfers in the Constrained Application Protocol (CoAP) The Constrained Application Protocol (CoAP) is a RESTful transfer protocol for constrained nodes and networks. Basic CoAP messages work well for small payloads from sensors and actuators; however, applications will need to transfer larger payloads occasionally -- for instance, for firmware updates. In contrast to HTTP, where TCP does the grunt work of segmenting and resequencing, CoAP is based on datagram transports such as UDP or Datagram Transport Layer Security (DTLS). These transports only offer fragmentation, which is even more problematic in constrained nodes and networks, limiting the maximum size of resource representations that can practically be transferred. Instead of relying on IP fragmentation, this specification extends basic CoAP with a pair of "Block" options for transferring multiple blocks of information from a resource representation in multiple request-response pairs. In many important cases, the Block options enable a server to be truly stateless: the server can handle each block transfer separately, with no need for a connection setup or other server-side memory of previous block transfers. Essentially, the Block options provide a minimal way to transfer larger representations in a block-wise fashion. A CoAP implementation that does not support these options generally is limited in the size of the representations that can be exchanged, so there is an expectation that the Block options will be widely used in CoAP implementations. Therefore, this specification updates RFC 7252. Guidelines for Writing an IANA Considerations Section in RFCs Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA). To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry. This is the third edition of this document; it obsoletes RFC 5226. Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. Low-Power Wide Area Network (LPWAN) Overview Low-Power Wide Area Networks (LPWANs) are wireless technologies with characteristics such as large coverage areas, low bandwidth, possibly very small packet and application-layer data sizes, and long battery life operation. This memo is an informational overview of the set of LPWAN technologies being considered in the IETF and of the gaps that exist between the needs of those technologies and the goal of running IP in LPWANs. CBOR Web Token (CWT) CBOR Web Token (CWT) is a compact means of representing claims to be transferred between two parties. The claims in a CWT are encoded in the Concise Binary Object Representation (CBOR), and CBOR Object Signing and Encryption (COSE) is used for added application-layer security protection. A claim is a piece of information asserted about a subject and is represented as a name/value pair consisting of a claim name and a claim value. CWT is derived from JSON Web Token (JWT) but uses CBOR rather than JSON. Algorithm Identifiers for Ed25519, Ed448, X25519, and X448 for Use in the Internet X.509 Public Key Infrastructure This document specifies algorithm identifiers and ASN.1 encoding formats for elliptic curve constructs using the curve25519 and curve448 curves. The signature algorithms covered are Ed25519 and Ed448. The key agreement algorithms covered are X25519 and X448. The encoding for public key, private key, and Edwards-curve Digital Signature Algorithm (EdDSA) structures is provided. Concise Data Definition Language (CDDL): A Notational Convention to Express Concise Binary Object Representation (CBOR) and JSON Data Structures This document proposes a notational convention to express Concise Binary Object Representation (CBOR) data structures (RFC 7049). Its main goal is to provide an easy and unambiguous way to express structures for protocol messages and data formats that use CBOR or JSON. Object Security for Constrained RESTful Environments (OSCORE) This document defines Object Security for Constrained RESTful Environments (OSCORE), a method for application-layer protection of the Constrained Application Protocol (CoAP), using CBOR Object Signing and Encryption (COSE). OSCORE provides end-to-end protection between endpoints communicating using CoAP or CoAP-mappable HTTP. OSCORE is designed for constrained nodes and networks supporting a range of proxy operations, including translation between different transport protocols. Although an optional functionality of CoAP, OSCORE alters CoAP options processing and IANA registration. Therefore, this document updates RFC 7252. SCHC: Generic Framework for Static Context Header Compression and Fragmentation This document defines the Static Context Header Compression and fragmentation (SCHC) framework, which provides both a header compression mechanism and an optional fragmentation mechanism. SCHC has been designed with Low-Power Wide Area Networks (LPWANs) in mind. SCHC compression is based on a common static context stored both in the LPWAN device and in the network infrastructure side. This document defines a generic header compression mechanism and its application to compress IPv6/UDP headers. This document also specifies an optional fragmentation and reassembly mechanism. It can be used to support the IPv6 MTU requirement over the LPWAN technologies. Fragmentation is needed for IPv6 datagrams that, after SCHC compression or when such compression was not possible, still exceed the Layer 2 maximum payload size. The SCHC header compression and fragmentation mechanisms are independent of the specific LPWAN technology over which they are used. This document defines generic functionalities and offers flexibility with regard to parameter settings and mechanism choices. This document standardizes the exchange over the LPWAN between two SCHC entities. Settings and choices specific to a technology or a product are expected to be grouped into profiles, which are specified in other documents. Data models for the context and profiles are out of scope. Concise Binary Object Representation (CBOR) Sequences This document describes the Concise Binary Object Representation (CBOR) Sequence format and associated media type "application/cbor-seq". A CBOR Sequence consists of any number of encoded CBOR data items, simply concatenated in sequence. Structured syntax suffixes for media types allow other media types to build on them and make it explicit that they are built on an existing media type as their foundation. This specification defines and registers "+cbor-seq" as a structured syntax suffix for CBOR Sequences. Proof-of-Possession Key Semantics for CBOR Web Tokens (CWTs) This specification describes how to declare in a CBOR Web Token (CWT) (which is defined by RFC 8392) that the presenter of the CWT possesses a particular proof-of-possession key. Being able to prove possession of a key is also sometimes described as being the holder-of-key. This specification provides equivalent functionality to "Proof-of-Possession Key Semantics for JSON Web Tokens (JWTs)" (RFC 7800) but using Concise Binary Object Representation (CBOR) and CWTs rather than JavaScript Object Notation (JSON) and JSON Web Tokens (JWTs). Concise Binary Object Representation (CBOR) The Concise Binary Object Representation (CBOR) is a data format whose design goals include the possibility of extremely small code size, fairly small message size, and extensibility without the need for version negotiation. These design goals make it different from earlier binary serializations such as ASN.1 and MessagePack. This document obsoletes RFC 7049, providing editorial improvements, new details, and errata fixes while keeping full compatibility with the interchange format of RFC 7049. It does not create a new version of the format. CBOR Object Signing and Encryption (COSE): Structures and Process Concise Binary Object Representation (CBOR) is a data format designed for small code size and small message size. There is a need to be able to define basic security services for this data format. This document defines the CBOR Object Signing and Encryption (COSE) protocol. This specification describes how to create and process signatures, message authentication codes, and encryption using CBOR for serialization. This specification additionally describes how to represent cryptographic keys using CBOR. This document, along with RFC 9053, obsoletes RFC 8152. CBOR Object Signing and Encryption (COSE): Initial Algorithms Concise Binary Object Representation (CBOR) is a data format designed for small code size and small message size. There is a need to be able to define basic security services for this data format. This document defines a set of algorithms that can be used with the CBOR Object Signing and Encryption (COSE) protocol (RFC 9052). This document, along with RFC 9052, obsoletes RFC 8152. Constrained Application Protocol (CoAP): Echo, Request-Tag, and Token Processing This document specifies enhancements to the Constrained Application Protocol (CoAP) that mitigate security issues in particular use cases. The Echo option enables a CoAP server to verify the freshness of a request or to force a client to demonstrate reachability at its claimed network address. The Request-Tag option allows the CoAP server to match block-wise message fragments belonging to the same request. This document updates RFC 7252 with respect to the following: processing requirements for client Tokens, forbidding non-secure reuse of Tokens to ensure response-to-request binding when CoAP is used with a security protocol, and amplification mitigation (where the use of the Echo option is now recommended). CBOR Object Signing and Encryption (COSE): Header parameters for carrying and referencing X.509 certificates August Cellars The CBOR Signing And Encrypted Message (COSE) structure uses references to keys in general. For some algorithms, additional properties are defined which carry parameters relating to keys as needed. The COSE Key structure is used for transporting keys outside of COSE messages. This document extends the way that keys can be identified and transported by providing attributes that refer to or contain X.509 certificates. Informative References PKCS #10: Certification Request Syntax Specification Version 1.7 This memo represents a republication of PKCS #10 v1.7 from RSA Laboratories' Public-Key Cryptography Standards (PKCS) series, and change control is retained within the PKCS process. The body of this document, except for the security considerations section, is taken directly from the PKCS #9 v2.0 or the PKCS #10 v1.7 document. This memo provides information for the Internet community. Security Considerations for the SHA-0 and SHA-1 Message-Digest Algorithms This document includes security considerations for the SHA-0 and SHA-1 message digest algorithm. This document is not an Internet Standards Track specification; it is published for informational purposes. Terminology for Constrained-Node Networks The Internet Protocol Suite is increasingly used on small devices with severe constraints on power, memory, and processing resources, creating constrained-node networks. This document provides a number of basic terms that have been useful in the standardization work for constrained-node networks. Pervasive Monitoring Is an Attack Pervasive monitoring is a technical attack that should be mitigated in the design of IETF protocols, where possible. Internet Key Exchange Protocol Version 2 (IKEv2) This document describes version 2 of the Internet Key Exchange (IKE) protocol. IKE is a component of IPsec used for performing mutual authentication and establishing and maintaining Security Associations (SAs). This document obsoletes RFC 5996, and includes all of the errata for it. It advances IKEv2 to be an Internet Standard. A Voucher Artifact for Bootstrapping Protocols This document defines a strategy to securely assign a pledge to an owner using an artifact signed, directly or indirectly, by the pledge's manufacturer. This artifact is known as a "voucher". This document defines an artifact format as a YANG-defined JSON document that has been signed using a Cryptographic Message Syntax (CMS) structure. Other YANG-derived formats are possible. The voucher artifact is normally generated by the pledge's manufacturer (i.e., the Manufacturer Authorized Signing Authority (MASA)). This document only defines the voucher artifact, leaving it to other documents to describe specialized protocols for accessing it. The Transport Layer Security (TLS) Protocol Version 1.3 This document specifies version 1.3 of the Transport Layer Security (TLS) protocol. TLS allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery. This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961. This document also specifies new requirements for TLS 1.2 implementations. Randomness Improvements for Security Protocols Randomness is a crucial ingredient for Transport Layer Security (TLS) and related security protocols. Weak or predictable "cryptographically secure" pseudorandom number generators (CSPRNGs) can be abused or exploited for malicious purposes. An initial entropy source that seeds a CSPRNG might be weak or broken as well, which can also lead to critical and systemic security problems. This document describes a way for security protocol implementations to augment their CSPRNGs using long-term private keys. This improves randomness from broken or otherwise subverted CSPRNGs. This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF. QUIC: A UDP-Based Multiplexed and Secure Transport This document defines the core of the QUIC transport protocol. QUIC provides applications with flow-controlled streams for structured communication, low-latency connection establishment, and network path migration. QUIC includes security measures that ensure confidentiality, integrity, and availability in a range of deployment circumstances. Accompanying documents describe the integration of TLS for key negotiation, loss detection, and an exemplary congestion control algorithm. The Datagram Transport Layer Security (DTLS) Protocol Version 1.3 This document specifies version 1.3 of the Datagram Transport Layer Security (DTLS) protocol. DTLS 1.3 allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery. The DTLS 1.3 protocol is based on the Transport Layer Security (TLS) 1.3 protocol and provides equivalent security guarantees with the exception of order protection / non-replayability. Datagram semantics of the underlying transport are preserved by the DTLS protocol. This document obsoletes RFC 6347. Constrained RESTful Environments (CoRE) Resource Directory In many Internet of Things (IoT) applications, direct discovery of resources is not practical due to sleeping nodes or networks where multicast traffic is inefficient. These problems can be solved by employing an entity called a Resource Directory (RD), which contains information about resources held on other servers, allowing lookups to be performed for those resources. The input to an RD is composed of links, and the output is composed of links constructed from the information stored in the RD. This document specifies the web interfaces that an RD supports for web servers to discover the RD and to register, maintain, look up, and remove information on resources. Furthermore, new target attributes useful in conjunction with an RD are defined. The Entity Attestation Token (EAT) Security Theory LLC Qualcomm Technologies Inc. Qualcomm Technologies Inc. Red Hound Software, Inc. An Entity Attestation Token (EAT) provides an attested claims set that describes state and characteristics of an entity, a device like a smartphone, IoT device, network equipment or such. This claims set is used by a relying party, server or service to determine how much it wishes to trust the entity. An EAT is either a CBOR Web Token (CWT) or JSON Web Token (JWT) with attestation-oriented claims. Requirements for a Lightweight AKE for OSCORE Inria Ericsson AB Ericsson AB Odin Solutions S.L. This document compiles the requirements for a lightweight authenticated key exchange protocol for OSCORE. This draft has completed a working group last call (WGLC) in the LAKE working group. Post-WGLC, the requirements are considered sufficiently stable for the working group to proceed with its work. It is not currently planned to publish this draft as an RFC. Traces of EDHOC Ericsson Ericsson ASSA ABLOY RISE This document contains some example traces of Ephemeral Diffie- Hellman Over COSE (EDHOC). Profiling EDHOC for CoAP and OSCORE Ericsson RISE AB RISE AB Fraunhofer AISEC Ericsson The lightweight authenticated key exchange protocol EDHOC can be run over CoAP and used by two peers to establish an OSCORE Security Context. This document further profiles this use of the EDHOC protocol, by specifying a number of additional and optional mechanisms. These especially include an optimization approach for combining the execution of EDHOC with the first subsequent OSCORE transaction. This combination reduces the number of round trips required to set up an OSCORE Security Context and to complete an OSCORE transaction using that Security Context. CBOR Encoded X.509 Certificates (C509 Certificates) Ericsson AB Ericsson AB RISE AB RISE AB Nexus Group This document specifies a CBOR encoding of X.509 certificates. The resulting certificates are called C509 Certificates. The CBOR encoding supports a large subset of RFC 5280 and all certificates compatible with the RFC 7925, IEEE 802.1AR (DevID), CNSA, RPKI, GSMA eUICC, and CA/Browser Forum Baseline Requirements profiles. When used to re-encode DER encoded X.509 certificates, the CBOR encoding can in many cases reduce the size of RFC 7925 profiled certificates with over 50%. The CBOR encoded structure can alternatively be signed directly ("natively signed"), which does not require re- encoding for the signature to be verified. The document also specifies C509 COSE headers, a C509 TLS certificate type, and a C509 file format. Key Update for OSCORE (KUDOS) RISE AB RISE AB Object Security for Constrained RESTful Environments (OSCORE) uses AEAD algorithms to ensure confidentiality and integrity of exchanged messages. Due to known issues allowing forgery attacks against AEAD algorithms, limits should be followed on the number of times a specific key is used for encryption or decryption. Among other reasons, approaching key usage limits requires updating the OSCORE keying material before communications can securely continue. This document defines how two OSCORE peers must follow these key usage limits and what steps they must take to preserve the security of their communications. Also, it specifies Key Update for OSCORE (KUDOS), a lightweight procedure that two peers can use to update their keying material and establish a new OSCORE Security Context. Accordingly, it updates the use of the OSCORE flag bits in the CoAP OSCORE Option. Finally, this document specifies a method that two peers can use to update their OSCORE identifiers, as a stand-alone procedure or embedded in a KUDOS execution. Thus, this document updates RFC 8613. Alternative Elliptic Curve Representations Struik Security Consultancy This document specifies how to represent Montgomery curves and (twisted) Edwards curves as curves in short-Weierstrass form and illustrates how this can be used to carry out elliptic curve computations leveraging existing implementations and specifications of, e.g., ECDSA and ECDH using NIST prime curves. We also provide extensive background material that may be useful for implementers of elliptic curve cryptography. Comparison of CoAP Security Protocols Ericsson AB Ericsson AB INRIA This document analyzes and compares the sizes of key exchange flights and the per-packet message size overheads when using different security protocols to secure CoAP. The analyzed security protocols are DTLS 1.2, DTLS 1.3, TLS 1.2, TLS 1.3, EDHOC, OSCORE, and Group OSCORE. The DTLS and TLS record layers are analyzed with and without 6LoWPAN-GHC compression. DTLS is analyzed with and without Connection ID. Deterministic ECDSA and EdDSA Signatures with Additional Randomness Ericsson Ericsson Ericsson Deterministic elliptic-curve signatures such as deterministic ECDSA and EdDSA have gained popularity over randomized ECDSA as their security do not depend on a source of high-quality randomness. Recent research has however found that implementations of these signature algorithms may be vulnerable to certain side-channel and fault injection attacks due to their determinism. One countermeasure to such attacks is to re-add randomness to the otherwise deterministic calculation of the per-message secret number. This document updates RFC 6979 and RFC 8032 to recommend constructions with additional randomness for deployments where side-channel attacks and fault injection attacks are a concern. The updates are invisible to the validator of the signature and compatible with existing ECDSA and EdDSA validators. Lightweight Authorization for EDHOC Ericsson AB Ericsson AB INRIA Sandelman Software Works Institute of Embedded Systems, ZHAW This document describes a procedure for augmenting the lightweight authenticated Diffie-Hellman key exchange protocol EDHOC with third party assisted authorization, targeting constrained IoT deployments (RFC 7228). Internet Threat Model Guidance Ericsson Trinity College Dublin Communications security has been at the center of many security improvements in the Internet. The goal has been to ensure that communications are protected against outside observers and attackers. This memo suggests that the existing RFC 3552 threat model, while important and still valid, is no longer alone sufficient to cater for the pressing security and privacy issues seen on the Internet today. For instance, it is often also necessary to protect against endpoints that are compromised, malicious, or whose interests simply do not align with the interests of users. While such protection is difficult, there are some measures that can be taken and we argue that investigation of these issues is warranted. It is particularly important to ensure that as we continue to develop Internet technology, non-communications security related threats, and privacy issues, are properly understood. Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography On the Joint Security of Encryption and Signature in EMV Standards for Efficient Cryptography 1 (SEC 1) SIGMA - The 'SIGn-and-MAc' Approach to Authenticated Diffie-Hellman and Its Use in the IKE-Protocols (Long version) Cryptographic Extraction and Key Derivation: The HKDF Scheme On using the same key pair for Ed25519 and an X25519 based KEM Commercial National Security Algorithm Suite A comprehensive, formal and automated analysis of the EDHOC protocol Formal Analysis of EDHOC Key Establishment for Constrained IoT Devices Formal Verification of Ephemeral Diffie-Hellman Over COSE (EDHOC) CBOR Playground

Use with OSCORE and Transfer over CoAP This appendix describes how to derive an OSCORE security context when EDHOC is used to key OSCORE, and how to transfer EDHOC messages over CoAP.

Deriving the OSCORE Security Context This section specifies how to use EDHOC output to derive the OSCORE security context. After successful processing of EDHOC message_3, Client and Server derive Security Context parameters for OSCORE as follows (see Section 3.2 of ):

The Master Secret and Master Salt are derived by using the EDHOC-Exporter interface, see :
- The EDHOC Exporter Labels for deriving the OSCORE Master Secret and the OSCORE Master Salt, are the uints 0 and 1, respectively.
- The context parameter is h'' (0x40), the empty CBOR byte string.
- By default, oscore_key_length is the key length (in bytes) of the application AEAD Algorithm of the selected cipher suite for the EDHOC session. Also by default, oscore_salt_length has value 8. The Initiator and Responder MAY agree out-of-band on a longer oscore_key_length than the default and on a different oscore_salt_length.

The AEAD Algorithm is the application AEAD algorithm of the selected cipher suite for the EDHOC session.
The HKDF Algorithm is the one based on the application hash algorithm of the selected cipher suite for the EDHOC session. For example, if SHA-256 is the application hash algorithm of the selected cipher suite, HKDF SHA-256 is used as HKDF Algorithm in the OSCORE Security Context.
The relationship between identifiers in OSCORE and EDHOC is specified in . The OSCORE Sender ID and Recipient ID are determined by the EDHOC connection identifiers C_R and C_I for the EDHOC session as shown in .

Usage of connection identifiers in OSCORE Client and Server use the parameters above to establish an OSCORE Security Context, as per Section 3.2.1 of . From then on, Client and Server retrieve the OSCORE protocol state using the Recipient ID, and optionally other transport information such as the 5-tuple.

Transferring EDHOC over CoAP This section specifies one instance for how EDHOC can be transferred as an exchange of CoAP messages. CoAP provides a reliable transport that can preserve packet ordering and handle message duplication. CoAP can also perform fragmentation and protect against denial-of-service attacks. The underlying CoAP transport should be used in reliable mode, in particular when fragmentation is used, to avoid, e.g., situations with hanging endpoints waiting for each other. By default, the CoAP client is the Initiator and the CoAP server is the Responder, but the roles SHOULD be chosen to protect the most sensitive identity, see . Client applications can use the resource type "core.edhoc" to discover a server's EDHOC resource, i.e., where to send a request for executing the EDHOC protocol, see . According to this specification, EDHOC is transferred in POST requests and 2.04 (Changed) responses to the Uri-Path: "/.well-known/edhoc", see . An application may define its own path that can be discovered, e.g., using a resource directory . By default, the message flow is as follows:

EDHOC message_1 is sent in the payload of a POST request from the client to the server's resource for EDHOC.
EDHOC message_2 or the EDHOC error message is sent from the server to the client in the payload of the response, in the former case with response code 2.04 (Changed), in the latter with response code as specified in .
EDHOC message_3 or the EDHOC error message is sent from the client to the server's resource in the payload of a POST request.
If EDHOC message_4 is used, or in case of an error message, it is sent from the server to the client in the payload of the response, with response codes analogously to message_2. In case of an error message sent in response to message_4, it is sent analogously to error message sent in response to message_2.

In order for the server to correlate a message received from a client to a message previously sent in the same EDHOC session over CoAP, messages sent by the client are prepended with the CBOR serialization of the connection identifier which the server has chosen. This applies independently of if the CoAP server is Responder or Initiator.

For the default case when the server is Responder, message_3 is sent from the client prepended with the identifier C_R. In this case message_1 is also sent by the client, and to indicate that this is a new EDHOC session it is prepended with a dummy identifier, the CBOR simple value true (0xf5), since the server has not selected C_R yet. See for an example.
In the case when the server is Initiator, message_2 (and, if present, message_4) is sent from the client prepended with the identifier C_I. See for an example.

The prepended identifiers are encoded in CBOR and thus self-delimiting. The integer representation of identifiers described in is used, when applicable. They are sent in front of the actual EDHOC message to keep track of messages in an EDHOC session, and only the part of the body following the identifier is used for EDHOC processing. In particular, the connection identifiers within the EDHOC messages are not impacted by the prepended identifiers. The application/edhoc+cbor-seq media type does not apply to a CoAP message that transports an EDHOC message prepended by a connection identifier; its media type is application/cid-edhoc+cbor-seq. An example of a successful EDHOC exchange using CoAP is shown in . In this case the CoAP Token enables correlation on the Initiator side, and the prepended C_R enables correlation on the Responder (server) side.

Example of transferring EDHOC in CoAP when the Initiator is CoAP client. The optional message_4 is included in this example, without which that message needs no payload. | Header: POST (Code=0.02) | POST | Uri-Path: "/.well-known/edhoc" | | Content-Format: application/cid-edhoc+cbor-seq | | Payload: true, EDHOC message_1 | | |<---------+ Header: 2.04 Changed | 2.04 | Content-Format: application/edhoc+cbor-seq | | Payload: EDHOC message_2 | | +--------->| Header: POST (Code=0.02) | POST | Uri-Path: "/.well-known/edhoc" | | Content-Format: application/cid-edhoc+cbor-seq | | Payload: C_R, EDHOC message_3 | | |<---------+ Header: 2.04 Changed | 2.04 | Content-Format: application/edhoc+cbor-seq | | Payload: EDHOC message_4 | | ]]> The exchange in protects the client identity against active attackers and the server identity against passive attackers. An alternative exchange that protects the server identity against active attackers and the client identity against passive attackers is shown in . In this case the CoAP Token enables the Responder to correlate message_2 and message_3, and the prepended C_I enables correlation on the Initiator (server) side. If EDHOC message_4 is used, C_I is prepended, and it is transported with CoAP in the payload of a POST request with a 2.04 (Changed) response.

Example of transferring EDHOC in CoAP when the Initiator is CoAP server. | Header: POST (Code=0.02) | POST | Uri-Path: "/.well-known/edhoc" | | |<---------+ Header: 2.04 Changed | 2.04 | Content-Format: application/edhoc+cbor-seq | | Payload: EDHOC message_1 | | +--------->| Header: POST (Code=0.02) | POST | Uri-Path: "/.well-known/edhoc" | | Content-Format: application/cid-edhoc+cbor-seq | | Payload: C_I, EDHOC message_2 | | |<---------+ Header: 2.04 Changed | 2.04 | Content-Format: application/edhoc+cbor-seq | | Payload: EDHOC message_3 | | ]]> To protect against denial-of-service attacks, the CoAP server MAY respond to the first POST request with a 4.01 (Unauthorized) containing an Echo option . This forces the Initiator to demonstrate its reachability at its apparent network address. If message fragmentation is needed, the EDHOC messages may be fragmented using the CoAP Block-Wise Transfer mechanism . EDHOC does not restrict how error messages are transported with CoAP, as long as the appropriate error message can to be transported in response to a message that failed (see ). EDHOC error messages transported with CoAP are carried in the payload.

Transferring EDHOC and OSCORE over CoAP When using EDHOC over CoAP, EDHOC error messages sent as CoAP responses MUST be sent in the payload of error responses, i.e., they MUST specify a CoAP error response code. In particular, it is RECOMMENDED that such error responses have response code either 4.00 (Bad Request) in case of client error (e.g., due to a malformed EDHOC message), or 5.00 (Internal Server Error) in case of server error (e.g., due to failure in deriving EDHOC keying material). The Content-Format of the error response MUST be set to application/edhoc+cbor-seq, see . A method for combining the EDHOC and OSCORE protocols in two round-trips is specified in . That specification also contains conversion from OSCORE Sender/Recipient IDs to EDHOC connection identifiers, web-linking and target attributes for discovering of EDHOC resources.

Compact Representation This section defines a format for compact representation based on the Elliptic-Curve-Point-to-Octet-String Conversion defined in Section 2.3.3 of . As described in Section 4.2 of the x-coordinate of an elliptic curve public key is a suitable representative for the entire point whenever scalar multiplication is used as a one-way function. One example is ECDH with compact output, where only the x-coordinate of the computed value is used as the shared secret. In EDHOC, compact representation is used for the ephemeral public keys (G_X and G_Y), see . Using the notation from , the output is an octet string of length ceil( (log2 q) / 8 ). See for a definition of q, M, X, xp, and ~yp. The steps in Section 2.3.3 of are replaced by:

Convert the field element xp to an octet string X of length ceil( (log2 q) / 8 ) octets using the conversion routine specified in Section 2.3.5 of .
Output M = X

The encoding of the point at infinity is not supported. Compact representation does not change any requirements on validation, see . Using compact representation has some security benefits. An implementation does not need to check that the point is not the point at infinity (the identity element). Similarly, as not even the sign of the y-coordinate is encoded, compact representation trivially avoids so called "benign malleability" attacks where an attacker changes the sign, see . The following may be needed for validation or compatibility with APIs that do not support compact representation or do not support the full format:

If a compressed y-coordinate is required, then the value ~yp set to zero can be used. The compact representation described above can in such a case be transformed into the SECG point compressed format by prepending it with the single byte 0x02 (i.e., M = 0x02 || X).
If a uncompressed y-coordinate is required, then a y-coordinate has to be calculated following Section 2.3.4 of or Appendix C of . Any of the square roots (see or ) can be used. The uncompressed SECG format is M = 0x04 || X || Y.

For example: The curve P-256 has the parameters (using the notation in )

p = 2²⁵⁶ - 2²²⁴ + 2¹⁹² + 2⁹⁶ - 1
a = -3
b = 410583637251521421293261297800472684091144410159937255 54835256314039467401291

Given an example x:

x = 115792089183396302095546807154740558443406795108653336 398970697772788799766525

we can calculate y as the square root w = (x³ + a x + b)^{((p + 1)/4)} (mod p)

y = 834387180070192806820075864918626005281451259964015754 16632522940595860276856

Note that this does not guarantee that (x, y) is on the correct elliptic curve. A full validation according to Section 5.6.2.3.3 of can be achieved by also checking that 0 x < p and that y² x³ + a x + b (mod p).

Use of CBOR, CDDL, and COSE in EDHOC This Appendix is intended to help implementors not familiar with CBOR , CDDL , COSE , and HKDF .

CBOR and CDDL The Concise Binary Object Representation (CBOR) is a data format designed for small code size and small message size. CBOR builds on the JSON data model but extends it by e.g., encoding binary data directly without base64 conversion. In addition to the binary CBOR encoding, CBOR also has a diagnostic notation that is readable and editable by humans. The Concise Data Definition Language (CDDL) provides a way to express structures for protocol messages and APIs that use CBOR. also extends the diagnostic notation. CBOR data items are encoded to or decoded from byte strings using a type-length-value encoding scheme, where the three highest order bits of the initial byte contain information about the major type. CBOR supports several different types of data items, in addition to integers (int, uint), simple values, byte strings (bstr), and text strings (tstr), CBOR also supports arrays [] of data items, maps {} of pairs of data items, and sequences of data items. Some examples are given below. The EDHOC specification sometimes use CDDL names in CBOR diagnostic notation as in e.g., << ID_CRED_R, ? EAD_2 >>. This means that EAD_2 is optional and that ID_CRED_R and EAD_2 should be substituted with their values before evaluation. I.e., if ID_CRED_R = { 4 : h'' } and EAD_2 is omitted then << ID_CRED_R, ? EAD_2 >> = << { 4 : h'' } >>, which encodes to 0x43a10440. We also make use of the occurrence symbol "*", like in e.g., 2* int, meaning two or more CBOR integers. For a complete specification and more examples, see and . We recommend implementors to get used to CBOR by using the CBOR playground . > 0x430102f5 byte string [ 1, 2, true ] 0x830102f5 array ( 1, 2, true ) 0x0102f5 sequence 1, 2, true 0x0102f5 sequence ------------------------------------------------------------------ ]]>

CDDL Definitions This sections compiles the CDDL definitions for ease of reference.

COSE CBOR Object Signing and Encryption (COSE) describes how to create and process signatures, message authentication codes, and encryption using CBOR. COSE builds on JOSE, but is adapted to allow more efficient processing in constrained devices. EDHOC makes use of COSE_Key, COSE_Encrypt0, and COSE_Sign1 objects in the message processing:

ECDH ephemeral public keys of type EC2 or OKP in message_1 and message_2 consist of the COSE_Key parameter named 'x', see Section 7.1 and 7.2 of
The ciphertexts in message_3 and message_4 consist of a subset of the single recipient encrypted data object COSE_Encrypt0, which is described in Sections 5.2-5.3 of . The ciphertext is computed over the plaintext and associated data, using an encryption key and an initialization vector. The associated data is an Enc_structure consisting of protected headers and externally supplied data (external_aad). COSE constructs the input to the AEAD for message_i (i = 3 or 4, see and , respectively) as follows:
- Secret key K = K_i
- Nonce N = IV_i
- Plaintext P for message_i
- Associated Data A = [ "Encrypt0", h'', TH_i ]
Signatures in message_2 of method 0 and 2, and in message_3 of method 0 and 1, consist of a subset of the single signer data object COSE_Sign1, which is described in Sections 4.2-4.4 of . The signature is computed over a Sig_structure containing payload, protected headers and externally supplied data (external_aad) using a private signature key and verified using the corresponding public signature key. For COSE_Sign1, the message to be signed is: where protected, external_aad and payload are specified in and .

Different header parameters to identify X.509 or C509 certificates by reference are defined in and :

by a hash value with the 'x5t' or 'c5t' parameters, respectively:
- ID_CRED_x = { 34 : COSE_CertHash }, for x = I or R,
- ID_CRED_x = { TBD3 : COSE_CertHash }, for x = I or R;
or by a URI with the 'x5u' or 'c5u' parameters, respectively:
- ID_CRED_x = { 35 : uri }, for x = I or R,
- ID_CRED_x = { TBD4 : uri }, for x = I or R.

When ID_CRED_x does not contain the actual credential, it may be very short, e.g., if the endpoints have agreed to use a key identifier parameter 'kid':

ID_CRED_x = { 4 : kid_x }, where kid_x : kid, for x = I or R. For further optimization, see .

Note that a COSE header map can contain several header parameters, for example { x5u, x5t } or { kid, kid_context }. ID_CRED_x MAY also identify the credential by value. For example, a certificate chain can be transported in ID_CRED_x with COSE header parameter c5c or x5chain, defined in and and credentials of type CWT and CCS can be transported with the COSE header parameters registered in .

Authentication Related Verifications EDHOC performs certain authentication related operations, see , but in general it is necessary to make additional verifications beyond EDHOC message processing. What verifications are needed depend on the deployment, in particular the trust model and the security policies, but most commonly it can be expressed in terms of verifications of credential content. EDHOC assumes the existence of mechanisms (certification authority or other trusted third party, pre-provisioning, etc.) for generating and distributing authentication credentials and other credentials, as well as the existence of trust anchors (CA certificates, trusted public keys, etc.). For example, a public key certificate or CWT may rely on a trusted third party whose public key is pre-provisioned, whereas a CCS or a self-signed certificate/CWT may be used when trust in the public key can be achieved by other means, or in the case of Trust on first use, see . In this section we provide some examples of such verifications. These verifications are the responsibility of the application but may be implemented as part of an EDHOC library.

Validating the Authentication Credential The authentication credential may contain, in addition to the authentication key, other parameters that needs to be verified. For example:

In X.509 and C509 certificates, signature keys typically have key usage "digitalSignature" and Diffie-Hellman public keys typically have key usage "keyAgreement" .
In X.509 and C509 certificates validity is expressed using Not After and Not Before. In CWT and CCS, the "exp" and "nbf" claims have similar meanings.

Identities The application must decide on allowing a connection or not depending on the intended endpoint, and in particular whether it is a specific identity or in a set of identities. To prevent misbinding attacks, the identity of the endpoint is included in a MAC verified through the protocol. More details and examples are provided in this section. Policies for what connections to allow are typically set based on the identity of the other endpoint, and endpoints typically only allow connections from a specific identity or a small restricted set of identities. For example, in the case of a device connecting to a network, the network may only allow connections from devices which authenticate with certificates having a particular range of serial numbers and signed by a particular CA. Conversely, a device may only be allowed to connect to a network which authenticates with a particular public key.

When a Public Key Infrastructure (PKI) is used with certificates, the identity is the subject whose unique name, e.g., a domain name, a Network Access Identifier (NAI), or an Extended Unique Identifier (EUI), is included in the endpoint's certificate.
Similarly, when a PKI is used with CWTs, the identity is the subject identified by the relevant claim(s), such as 'sub' (subject).
When PKI is not used (e.g., CCS, self-signed certificate/CWT) the identity is typically directly associated with the authentication key of the other party. For example, if identities can be expressed in the form of unique subject names assigned to public keys, then a binding to identity is achieved by including both public key and associated subject name in the authentication credential: CRED_I or CRED_R may be a self-signed certificate/CWT or CCS containing the authentication key and the subject name, see . Each endpoint thus needs to know the specific authentication key/unique associated subject name, or set of public authentication keys/unique associated subject names, which it is allowed to communicate with.

To prevent misbinding attacks in systems where an attacker can register public keys without proving knowledge of the private key, SIGMA enforces a MAC to be calculated over the "identity". EDHOC follows SIGMA by calculating a MAC over the whole authentication credential, which in case of an X.509 or C509 certificate includes the "subject" and "subjectAltName" fields, and in the case of CWT or CCS includes the "sub" claim. (While the SIGMA paper only focuses on the identity, the same principle is true for other information such as policies associated with the public key.)

Certification Path and Trust Anchors When a Public Key Infrastructure (PKI) is used with certificates, the trust anchor is a Certification Authority (CA) certificate. Each party needs at least one CA public key certificate, or just the CA public key. The certification path contains proof that the subject of the certificate owns the public key in the certificate. Only validated public-key certificates are to be accepted. Similarly, when a PKI is used with CWTs, each party needs to have at least one trusted third party public key as trust anchor to verify the end entity CWTs. The trusted third party public key can, e.g., be stored in a self-signed CWT or in a CCS. The signature of the authentication credential needs to be verified with the public key of the issuer. X.509 and C509 certificates includes the "Issuer" field. In CWT and CCS, the "iss" claim has a similar meaning. The public key is either a trust anchor or the public key in another valid and trusted credential in a certification path from trust anchor to authentication credential. Similar verifications as made with the authentication credential (see ) are also needed for the other credentials in the certification path. When PKI is not used (CCS, self-signed certificate/CWT), the trust anchor is the authentication key of the other party, in which case there is no certification path.

Revocation Status The application may need to verify that the credentials are not revoked, see . Some use cases may be served by short-lived credentials, for example, where the validity of the credential is on par with the interval between revocation checks. But, in general, credential lifetime and revocation checking are complementary measures to control credential status. Revocation information may be transported as External Authentication Data (EAD), see .

Unauthenticated Operation EDHOC might be used without authentication by allowing the Initiator or Responder to communicate with any identity except its own. Note that EDHOC without mutual authentication is vulnerable to man-in-the-middle attacks and therefore unsafe for general use. However, it is possible to later establish a trust relationship with an unknown or not-yet-trusted endpoint. Some examples:

The EDHOC authentication credential can be verified out-of-band at a later stage.
The EDHOC session key can be bound to an identity out-of-band at a later stage.
Trust on first use (TOFU) can be used to verify that several EDHOC connections are made to the same identity. TOFU combined with proximity is a common IoT deployment model which provides good security if done correctly. Note that secure proximity based on short range wireless technology requires very low signal strength or very low latency.

Use of External Authorization Data In order to reduce the number of messages and round trips, or to simplify processing, external security applications may be integrated into EDHOC by transporting related external authorization data (EAD) in the messages. The EAD format is specified in , this section contains examples and further details of how EAD may be used with an appropriate accompanying specification.

One example is third party assisted authorization, requested with EAD_1, and an authorization artifact ("voucher", cf. ) returned in EAD_2, see .
Another example is remote attestation, requested in EAD_2, and an Entity Attestation Token (EAT, ) returned in EAD_3.
A third example is certificate enrolment, where a Certificate Signing Request (CSR, ) is included EAD_3, and the issued public key certificate (X.509 , C509 ) or a reference thereof is returned in EAD_4.

External authorization data should be considered unprotected by EDHOC, and the protection of EAD is the responsibility of the security application (third party authorization, remote attestation, certificate enrolment, etc.). The security properties of the EAD fields (after EDHOC processing) are discussed in . The content of the EAD field may be used in the EDHOC processing of the message in which they are contained. For example, authentication related information like assertions and revocation information, transported in EAD fields may provide input about trust anchors or validity of credentials relevant to the authentication processing. The EAD fields (like ID_CRED fields) are therefore made available to the application before the message is verified, see details of message processing in . In the first example above, a voucher in EAD_2 made available to the application can enable the Initiator to verify the identity or public key of the Responder before verifying the signature. An application allowing EAD fields containing authentication information thus may need to handle authentication related verifications associated with EAD processing. Conversely, the security application may need to wait for EDHOC message verification to complete. In the third example above, the validation of a CSR carried in EAD_3 is not started by the Responder before EDHOC has successfully verified message_3 and proven the possession of the private key of the Initiator. The security application may reuse EDHOC protocol fields which therefore need to be available to the application. For example, the security application may use the same crypto algorithms as in the EDHOC session and therefore needs access to the selected cipher suite (or the whole SUITES_I). The application may use the ephemeral public keys G_X and G_Y, as ephemeral keys or as nonces, see . The processing of the EAD item (ead_label, ? ead_value) by the security application needs to be described in the specification where the ead_label is registered, see , including the optional ead_value for each message and actions in case of errors. An application may support multiple security applications that make use of EAD, which may result in multiple EAD items in one EAD field, see . Any dependencies on security applications with previously registered EAD items needs to be documented, and the processing needs to consider their simultaneous use. Since data carried in EAD may not be protected, or be processed by the application before the EDHOC message is verified, special considerations need to be made such that it does not violate security and privacy requirements of the service which uses this data, see . The content in an EAD item may impact the security properties provided by EDHOC. Security applications making use of the EAD items must perform the necessary security analysis.

Application Profile Example This appendix contains a rudimentary example of an application profile, see . For use of EDHOC with application X the following assumptions are made:

Transfer in CoAP as specified in with requests expected by the CoAP server (= Responder) at /app1-edh, no Content-Format needed.
METHOD = 1 (I uses signature key, R uses static DH key.)
CRED_I is an IEEE 802.1AR IDevID encoded as a C509 certificate of type 0 .
- R acquires CRED_I out-of-band, indicated in EAD_1.
- ID_CRED_I = {4: h''} is a 'kid' with value the empty CBOR byte string.
CRED_R is a CCS of type OKP as specified in .
- The CBOR map has parameters 1 (kty), -1 (crv), and -2 (x-coordinate).
- ID_CRED_R is {TBD2 : CCS}. Editor's note: TBD2 is the COSE header parameter value of 'kccs', see
External authorization data is defined and processed as specified in .
EUI-64 is used as the identity of the endpoint (see example in ).
No use of message_4: the application sends protected messages from R to I.

EDHOC Message Deduplication EDHOC by default assumes that message duplication is handled by the transport, in this section exemplified with CoAP. Deduplication of CoAP messages is described in Section 4.5 of . This handles the case when the same Confirmable (CON) message is received multiple times due to missing acknowledgement on the CoAP messaging layer. The recommended processing in is that the duplicate message is acknowledged (ACK), but the received message is only processed once by the CoAP stack. Message deduplication is resource demanding and therefore not supported in all CoAP implementations. Since EDHOC is targeting constrained environments, it is desirable that EDHOC can optionally support transport layers which do not handle message duplication. Special care is needed to avoid issues with duplicate messages, see . The guiding principle here is similar to the deduplication processing on the CoAP messaging layer: a received duplicate EDHOC message SHALL NOT result in another instance of the next EDHOC message. The result MAY be that a duplicate next EDHOC message is sent, provided it is still relevant with respect to the current protocol state. In any case, the received message MUST NOT be processed more than once in the same EDHOC session. This is called "EDHOC message deduplication". An EDHOC implementation MAY store the previously sent EDHOC message to be able to resend it. In principle, if the EDHOC implementation would deterministically regenerate the identical EDHOC message previously sent, it would be possible to instead store the protocol state to be able to recreate and resend the previously sent EDHOC message. However, even if the protocol state is fixed, the message generation may introduce differences which compromise security. For example, in the generation of message_3, if I is performing a (non-deterministic) ECDSA signature (say, method 0 or 1, cipher suite 2 or 3) then PLAINTEXT_3 is randomized, but K_3 and IV_3 are the same, leading to a key and nonce reuse. The EDHOC implementation MUST NOT store previous protocol state and regenerate an EDHOC message if there is a risk that the same key and IV are used for two (or more) distinct messages. The previous message or protocol state MUST NOT be kept longer than what is required for retransmission, for example, in the case of CoAP transport, no longer than the EXCHANGE_LIFETIME (see Section 4.8.2 of ).

Transports Not Natively Providing Correlation Protocols that do not natively provide full correlation between a series of messages can send the C_I and C_R identifiers along as needed. The transport over CoAP () can serve as a blueprint for other server-client protocols: The client prepends the C_x which the server selected (or, for message_1, the CBOR simple value true which is not a valid C_x) to any request message it sends. The server does not send any such indicator, as responses are matched to request by the client-server protocol design. Protocols that do not provide any correlation at all can prescribe prepending of the peer's chosen C_x to all messages.

Long PLAINTEXT_2 By the definition of encryption of PLAINTEXT_2 with KEYSTREAM_2, it is limited to lengths of PLAINTEXT_2 not exceeding the output of EDHOC-KDF, see . If the EDHOC hash algorithm is SHA-2 then HKDF-Expand is used, which limits the length of the EDHOC-KDF output to 255 hash_length, where hash_length is the length of the output of the EDHOC hash algorithm given by the cipher suite. For example, with SHA-256 as EDHOC hash algorithm, the length of the hash output is 32 bytes and the maximum length of PLAINTEXT_2 is 255 32 = 8160 bytes. While PLAINTEXT_2 is expected to be much shorter than 8 kB for the intended use cases, it seems nevertheless prudent to provide an extended solution for the event that this should turn out to be a limitation. A potential work-around is to use a cipher suite with a different hash function. In particular, the use of KMAC removes all practical limitations in this respect. Another solution is to make use of multiple invocations of HKDF-Expand and negative values of info_label, as specified in the remainder of this section. Consider the PLAINTEXT_2 partitioned in parts P(i) of length equal to M = 255 hash_length, except possibly the last part P(last) which has 0 < length M. where | indicates concatenation. The object is to define a matching KEYSTREAM_2 of the same length and perform the encryption in the same way as defined in : Define the keystream as: where Note that if length(PLAINTEXT_2) M then P(0) = PLAINTEXT_2 and the definition of KEYSTREAM_2 = OKM(0) coincides with . This describes the processing of the Responder when sending message_2. The Initiator makes the same calculations when receiving message_2, but interchanging PLAINTEXT_2 and CIPHERTEXT_2. An application profile may specify if it supports or not the method described in this appendix.

EDHOC-KeyUpdate To provide forward secrecy in an even more efficient way than re-running EDHOC, this section specifies the optional function EDHOC-KeyUpdate in terms of EDHOC-KDF and PRK_out. When EDHOC-KeyUpdate is called, a new PRK_out is calculated as a "hash" of the old PRK_out using the Expand function as illustrated by the following pseudocode. The change of PRK_out causes a change to PRK_exporter which enables the derivation of new application keys superseding the old ones, using EDHOC-Exporter, see . where hash_length denotes the output size in bytes of the EDHOC hash algorithm of the selected cipher suite. The EDHOC-KeyUpdate takes a context as input to enable binding of the updated PRK_out to some event that triggered the key update. The Initiator and the Responder need to agree on the context, which can, e.g., be a counter or a pseudorandom number such as a hash. To provide forward secrecy the old PRK_out and keys derived from it (old PRK_exporter and old application keys) must be deleted as soon as they are not needed. When to delete the old keys and how to verify that they are not needed is up to the application. An application using EDHOC-KeyUpdate needs to store PRK_out. Compromise of PRK_out leads to compromise of all keying material derived with the EDHOC-Exporter since the last invocation of the EDHOC-KeyUpdate function. While this key update method provides forward secrecy it does not give as strong security properties as re-running EDHOC. EDHOC-KeyUpdate can be used to meet cryptographic limits and provide partial protection against key leakage, but it provides significantly weaker security properties than re-running EDHOC with ephemeral Diffie-Hellman. Even with frequent use of EDHOC-KeyUpdate, compromise of one session key compromises all future session keys, and an attacker therefore only needs to perform static key exfiltration , which is less complicated and has a lower risk profile than the dynamic case, see . A similar method to do key update for OSCORE is KUDOS, see .

Change Log RFC Editor: Please remove this appendix.

From -17 to -18
- Padding realised as EAD with ead_label = 0, PAD fields removed
- Revised EAD syntax; ead is now EAD item; ead_value is now optional
- Clarifications of
  - Identifier representation
  - Authentication credentials
  - RPK
  - Encoding of ID_CRED with kid
  - Representation of public keys, y-coordinate of ephemeral keys and validation
  - Processing after completed protocol
  - Making verifications available to the application
  - Relation between EDHOC and OSCORE identifiers
- Terminology alignment in particular session / protocol; discontinue / terminate
- Updated CDDL
- Additional unicode encodings
- Large number of nits from WGLC
From -16 to -17
- EDHOC-KeyUpdate moved to appendix
- Updated peer awareness properties based on SIGMA
- Clarify use of random connection identifiers
- Editorials related to appendix about messages with long PLAINTEXT_2
- Updated acknowledgments (have we forgotten someone else? please send email)
From -15 to -16
- TH_2 used as salt in the derivation of PRK_2e
- CRED_R/CRED_I included in TH_3/TH_4
- Distinguish label used in info, exporter or elsewhere
- New appendix for optional handling arbitrarily large message_2
  - info_label type changed to int to support this
- Updated security considerations
- Implementation note about identifiers which are bstr/int
- Clarifications, especifically about compact representation
- Type bug fix in CDDL section
From -14 to -15
- Connection identifiers and key identifiers are now byte strings
  - Represented as CBOR bstr in the EDHOC message
    - Unless they happen to encode a one-byte CBOR int
  - More examples
- EAD updates and details
  - Definition of EAD item
  - Definition of critical / non-critical EAD item
- New section in Appendix D: Unauthenticated Operation
- Clarifications
  - Lengths used in EDHOC-KDF
  - Key derivation from PRK_out
    - EDHOC-KeyUpdate and EDHOC-Exporter
  - Padding
- Security considerations
  - When a change in a message is detected
  - Confidentiality in case of active attacks
  - Connection identifiers should be unpredictable
  - Maximum length of message_2
- Minor bugs
From -13 to -14
- Merge of section 1.1 and 1.2
- Connection and key identifiers restricted to be byte strings
- Representation of byte strings as one-byte CBOR ints (-24..23)
- Simplified mapping between EDHOC and OSCORE identifiers
- Rewrite of 3.5
  - Clarification of authentication related operations performed by EDHOC
  - Authentication related verifications, including old section 3.5.1, moved to new appendix D
- Rewrite of 3.8
  - Move content about use of EAD to new appendix E
  - ead_value changed to bstr
- EDHOC-KDF updated
  - transcript_hash argument removed
  - TH included in context argument
  - label argument is now type uint, all labels replaced
- Key schedule updated
  - New salts derived to avoid reuse of same key with expand and extract
  - PRK_4x3m renamed PRK_4e3m
  - K_4 and IV_4 derived from PRK_4e3m
  - New PRK: PRK_out derived from PRK_4e3m and TH_4
  - Clarified main output of EDHOC is the shared secret PRK_out
  - Exporter defined by EDHOC-KDF and new PRK PRK_exporter derived from PRK_out
  - Key update defined by Expand instead of Extract
- All applications of EDHOC-KDF in one place
- Update of processing
  - EAD and ID_CRED passed to application when available
  - identity verification and credential retrieval omitted in protocol description
  - Transcript hash defined by plaintext messages instead of ciphertext
  - Changed order of input to TH_2
  - Removed general G_X checking against selfie-attacks
- Support for padding of plaintext
- Updated compliance requirements
- Updated security considerations
  - Updated and more clear requirements on MAC length
  - Clarification of key confirmation
  - Forbid use of same key for signature and static DH
- Updated appendix on message deduplication
- Clarifications of
  - connection identifiers
  - cipher suites, including negotiation
  - EAD
  - Error messages
- Updated media types
- Applicability template renamed application profile
- Editorials
From -12 to -13
- no changes
From -12:
- Shortened labels to derive OSCORE key and salt
- ead_value changed to bstr
- Removed general G_X checking against selfie-attacks
- Updated and more clear requirements on MAC length
- Clarifications from Kathleen, Stephen, Marco, Sean, Stefan,
- Authentication Related Verifications moved to appendix
- Updated MTI section and cipher suite
- Updated security considerations
From -11 to -12:
- Clarified applicability to KEMs
- Clarified use of COSE header parameters
- Updates on MTI
- Updated security considerations
- New section on PQC
- Removed duplicate definition of cipher suites
- Explanations of use of COSE moved to Appendix C.3
- Updated internal references
From -10 to -11:
- Restructured section on authentication parameters
- Changed UCCS to CCS
- Changed names and description of COSE header parameters for CWT/CCS
- Changed several of the KDF and Exporter labels
- Removed edhoc_aead_id from info (already in transcript_hash)
- Added MTI section
- EAD: changed CDDL names and added value type to registry
- Updated Figures 1, 2, and 3
- Some correction and clarifications
- Added core.edhoc to CoRE Resource Type registry
From -09 to -10:
- SUITES_I simplified to only contain the selected and more preferred suites
- Info is a CBOR sequence and context is a bstr
- Added kid to UCCS example
- Separate header parameters for CWT and UCCS
- CWT Confirmation Method kid extended to bstr / int
From -08 to -09:
- G_Y and CIPHERTEXT_2 are now included in one CBOR bstr
- MAC_2 and MAC_3 are now generated with EDHOC-KDF
- Info field "context" is now general and explicit in EDHOC-KDF
- Restructured Section 4, Key Derivation
- Added EDHOC MAC length to cipher suite for use with static DH
- More details on the use of CWT and UCCS
- Restructured and clarified Section 3.5, Authentication Parameters
- Replaced 'kid2' with extension of 'kid'
- EAD encoding now supports multiple ead types in one message
- Clarified EAD type
- Updated message sizes
- Replaced "perfect forward secrecy" with "forward secrecy"
- Updated security considerations
- Replaced prepended 'null' with 'true' in the CoAP transport of message_1
- Updated CDDL definitions
- Expanded on the use of COSE
From -07 to -08:
- Prepended C_x moved from the EDHOC protocol itself to the transport mapping
- METHOD_CORR renamed to METHOD, corr removed
- Removed bstr_identifier and use bstr / int instead; C_x can now be int without any implied bstr semantics
- Defined COSE header parameter 'kid2' with value type bstr / int for use with ID_CRED_x
- Updated message sizes
- New cipher suites with AES-GCM and ChaCha20 / Poly1305
- Changed from one- to two-byte identifier of CNSA compliant suite
- Separate sections on transport and connection id with further sub-structure
- Moved back key derivation for OSCORE from draft-ietf-core-oscore-edhoc
- OSCORE and CoAP specific processing moved to new appendix
- Message 4 section moved to message processing section
From -06 to -07:
- Changed transcript hash definition for TH_2 and TH_3
- Removed "EDHOC signature algorithm curve" from cipher suite
- New IANA registry "EDHOC Exporter Label"
- New application defined parameter "context" in EDHOC-Exporter
- Changed normative language for failure from MUST to SHOULD send error
- Made error codes non-negative and 0 for success
- Added detail on success error code
- Aligned terminology "protocol instance" -> "session"
- New appendix on compact EC point representation
- Added detail on use of ephemeral public keys
- Moved key derivation for OSCORE to draft-ietf-core-oscore-edhoc
- Additional security considerations
- Renamed "Auxililary Data" as "External Authorization Data"
- Added encrypted EAD_4 to message_4
From -05 to -06:
- New section 5.2 "Message Processing Outline"
- Optional inital byte C_1 = null in message_1
- New format of error messages, table of error codes, IANA registry
- Change of recommendation transport of error in CoAP
- Merge of content in 3.7 and appendix C into new section 3.7 "Applicability Statement"
- Requiring use of deterministic CBOR
- New section on message deduplication
- New appendix containin all CDDL definitions
- New appendix with change log
- Removed section "Other Documents Referencing EDHOC"
- Clarifications based on review comments
From -04 to -05:
- EDHOC-Rekey-FS -> EDHOC-KeyUpdate
- Clarification of cipher suite negotiation
- Updated security considerations
- Updated test vectors
- Updated applicability statement template
From -03 to -04:
- Restructure of section 1
- Added references to C509 Certificates
- Change in CIPHERTEXT_2 -> plaintext XOR KEYSTREAM_2 (test vector not updated)
- "K_2e", "IV_2e" -> KEYSTREAM_2
- Specified optional message 4
- EDHOC-Exporter-FS -> EDHOC-Rekey-FS
- Less constrained devices SHOULD implement both suite 0 and 2
- Clarification of error message
- Added exporter interface test vector
From -02 to -03:
- Rearrangements of section 3 and beginning of section 4
- Key derivation new section 4
- Cipher suites 4 and 5 added
- EDHOC-EXPORTER-FS - generate a new PRK_4x3m from an old one
- Change in CIPHERTEXT_2 -> COSE_Encrypt0 without tag (no change to test vector)
- Clarification of error message
- New appendix C applicability statement
From -01 to -02:
- New section 1.2 Use of EDHOC
- Clarification of identities
- New section 4.3 clarifying bstr_identifier
- Updated security considerations
- Updated text on cipher suite negotiation and key confirmation
- Test vector for static DH
From -00 to -01:
- Removed PSK method
- Removed references to certificate by value

Acknowledgments The authors want to thank , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , and for reviewing and commenting on intermediate versions of the draft. We are especially indebted to for his continuous reviewing and implementation of different versions of the draft. Work on this document has in part been supported by the H2020 project SIFIS-Home (grant agreement 952652).