RFC 9711: The Entity Attestation Token (EAT)
- L. Lundblade,
- G. Mandyam,
- J. O'Donoghue,
- C. Wallace
Abstract
An Entity Attestation Token (EAT) provides an attested claims set that describes the state and characteristics of an entity, a device such as a smartphone, an Internet of Things (IoT) device, network equipment, or such. This claims set is used by a relying party, server, or service to determine the type and degree of trust placed in the entity.¶
An EAT is either a CBOR Web Token (CWT) or a JSON Web Token (JWT) with attestation
Status of This Memo
This is an Internet Standards Track document.¶
This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 7841.¶
Information about the current status of this document, any
errata, and how to provide feedback on it may be obtained at
https://
Copyright Notice
Copyright (c) 2025 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://
1. Introduction
An Entity Attestation Token (EAT) is a message made up of claims about an entity. An entity may be a device, some hardware, or some software. The claims are ultimately used by a relying party who decides if and how it will interact with the entity. The relying party may choose to trust, not trust, or partially trust the entity. For example, partial trust may be allowing a monetary transaction only up to a limit.¶
The security model and goal for attestation are unique and are not the same as those for other security standards such as server authentication, user authentication, and secured messaging. To give an example of one aspect of the difference, consider the association and life cycle of key material. For authentication, keys are associated with a user or service and are set up by actions performed by a user or an operator of a service. For attestation, the keys are associated with specific devices and are configured by device manufacturers. Since the reader is assumed to be familiar with the goals and security model for attestation as described in "Remote ATtestation procedureS (RATS) Architecture" [RFC9334], they are not repeated here.¶
This document defines some common claims that are potentially of broad use. EAT additionally allows proprietary claims and for further claims to be standardized. Here are some examples:¶
EAT is constructed to support a wide range of use cases.¶
No single set of claims can accommodate all use cases, so EAT is constructed as a framework for defining specific attestation tokens for specific use cases. In particular, EAT provides a profile mechanism to be able to clearly specify the claims needed, the cryptographic algorithms that should be used, and other characteristics for a particular token and use case. Section 6 describes profile contents and provides a profile that is suitable for constrained device use cases.¶
The entity's EAT implementation generates the claims and typically signs them with an attestation key. It is responsible for protecting the attestation key. Some EAT implementations will use components with very high resistance to attack such as Trusted Platform Modules or Secure Elements. Others may rely solely on simple software defenses.¶
Nesting of tokens and claims sets is accommodated for composite devices that have multiple subsystems.¶
An EAT may be encoded in either JavaScript Object Notation (JSON) [RFC8259] or Concise Binary Object Representation (CBOR) [RFC8949] as needed for each use case. EAT is built on the CBOR Web Token (CWT) [RFC8392] and JSON Web Token (JWT) [RFC7519] and inherits all their characteristics and their security mechanisms. Like CWT and JWT, EAT does not imply any message flow.¶
The following is a very simple example. It is presented in JSON format for easy reading, but it could also be CBOR. Only the Claims-Set, the payload for the JWT, is shown.¶
This example has a nonce for freshness. This nonce is the base64url encoding of a 12-byte random binary byte string. The ueid (Universal Entity ID) is effectively a serial number uniquely identifying the device. This ueid is the base64url encoding of a 48-bit Media Access Control (MAC) address preceded by the type byte 0x02. The oemid (Hardware OEM ID) identifies the manufacturer using a Private Enterprise Number (PEN) [PEN]. The software is identified by a simple string name and version. It could be identified by a full manifest, but this is a minimal example.¶
1.1. Entity Overview
This document uses the term "entity" to refer to the target of an EAT. Most of the claims defined in this document are claims about an entity. An entity is equivalent to a target environment in an attester as defined in [RFC9334].¶
Layered attestation and composite devices, as described in [RFC9334], are supported by a submodule mechanism (see Section 4.2.18). Submodules allow nesting of EATs and of Claims-Sets so that such hierarchies can be modeled.¶
An entity is the same as a "system component", as defined in the Internet Security Glossary [RFC4949].¶
Note that [RFC4949] defines "entity" and "system entity" as synonyms, and that they may be a person or organization in addition to being a system component. In the EAT context, "entity" never refers to a person or organization. The hardware and software that implement a website server or service may be an entity in the EAT sense, but the organization that operates, maintains, or hosts the website is not an entity.¶
Some examples of entities:¶
An entity may have strong security defenses against hardware
1.2. EAT as a Framework
EAT is a framework that is used for defining attestation tokens for specific use cases; it is not used for specific token definition. While EAT is based on and compatible with CWT and JWT, it can also be described as:¶
EAT uses name/value pairs to identify individual claims the same way as CWT and JWT. Section 4 defines common attestation
Unlike (but compatible with) CWT and JWT, EAT defines claims using CDDL [RFC8610]. In most cases, the same CDDL definition is used for both the CBOR/CWT serialization and the JSON/JWT serialization.¶
Like CWT and JWT, EAT uses COSE and JOSE to provide authenticity, integrity, and optionally confidentiality
EAT defines a means for nesting tokens and claims sets to accommodate composite devices that have multiple subsystems and multiple attesters. Tokens with security envelopes or bare claims sets may be embedded in an enclosing token. The nested token and the enclosing token do not have to use the same encoding (e.g., a CWT may be enclosed in a JWT).¶
EAT adds the ability to detach claims sets and send them separately from a security
This document registers no media or content types for the identification of the EAT type, serialization encoding, or security envelope. The definition and registration of EAT media types are addressed in [EAT.media-types].¶
Finally, this document introduces the notion of an EAT profile that facilitates the creation of narrowed definitions of EATs for specific use cases in subsequent documents. One basic profile for constrained devices is normatively defined.¶
1.3. Operating Model and RATS Architecture
EAT follows the operational model described in Figure 1 of RATS Architecture (Section 3 of [RFC9334]). To summarize, an attester generates evidence in the form of a claims set describing various characteristics of an entity. Evidence is usually signed by a key that proves the attester and the evidence it produces are authentic. The claims set either includes a received nonce or uses some other means to assure freshness.¶
A verifier confirms an EAT is valid by verifying the signature and may vet some claims using reference values. The verifier then produces attestation results, which may also be represented as an EAT. The attestation results are provided to the relying party, which is the ultimate consumer of the Remote Attestation Procedure. The relying party uses the attestation results as needed for its use case, perhaps allowing an entity to access a network, a financial transaction, or such. In some cases, the verifier and relying party are not distinct entities.¶
1.3.1. Relationship between Evidence and Attestation Results
Any claim defined in this document or in the IANA "CBOR Web Token (CWT) Claims" or "JSON Web Token Claims" registries may be used in evidence or attestation results. The relationship of claims in attestation results to evidence is fundamentally governed by the verifier and the verifier's policy.¶
A common use case is for the verifier and its policy to perform checks, calculations, and processing with evidence as the input to produce a summary result in attestation results that indicates the overall health and status of the entity. For example, measurements in evidence may be compared to reference values, the results of which are represented as a simple pass/fail in attestation results.¶
It is also possible that some claims in the evidence will be forwarded unmodified to the relying party in attestation results. This forwarding is subject to the verifier's implementation and policy. The relying party should be aware of the verifier's policy to know what checks it has performed on claims it forwards.¶
The verifier may modify claims it forwards, for example, to implement a privacy preservation functionality. It is also possible the verifier will put claims in the attestation results that give details about the entity that it has computed or looked up in a database. For example, the verifier may be able to put an "oemid" claim in the attestation results by performing a lookup based on a "ueid" claim (e.g., serial number) it received in evidence.¶
This specification does not establish any normative rules for the verifier to follow, as these are a matter of local policy. It is up to each relying party to understand the processing rules of each verifier to know how to interpret claims in attestation results.¶
2. Terminology
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 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
In this document, the structure of data is specified in CDDL [RFC8610] [RFC9165].¶
The examples in Appendix A use CBOR diagnostic notation defined in Section 8 of [RFC8949] and Appendix G of [RFC8610].¶
This document reuses terminology from JWT [RFC7519] and CWT [RFC8392]:¶
- base64url encoding:
-
base64 encoding using the URL- and filename-safe character set defined in Section 5 of [RFC4648], with all trailing '=' characters omitted and without the inclusion of any line breaks, whitespace, or other additional characters [RFC7515].¶
- Claim:
-
A piece of information asserted about a subject. A claim is represented as a value and either a name or a key to identify it.¶
- Claim Name:
-
A unique text string that identifies the claim. It is used as the claim name for JSON encoding.¶
- Claim Key:
-
The CBOR map key used to identify a claim. (The term "Claim Key" comes from CWT. This document, like COSE [RFC9052], uses the term "label" to refer to CBOR map keys to avoid confusion with cryptographic keys.)¶
- Claim Value:
-
The value portion of the claim. A claim value can be any CBOR data item or JSON value.¶
- Claims Set:
-
The CBOR map or JSON object that contains the claims conveyed by the CWT or JWT.¶
This document reuses terminology from RATS Architecture [RFC9334]; note that EAT does not capitalize RATS terms like "evidence" for easier readability:¶
- Attester:
-
A role performed by an entity (typically a device) whose evidence must be appraised in order to infer the extent to which the attester is considered trustworthy, such as when deciding whether it is authorized to perform some operation.¶
- Verifier:
-
A role that appraises the validity of evidence about an attester and produces attestation results to be used by a relying party.¶
- Relying Party:
-
A role performed by an entity that depends on the validity of information about an attester for purposes of reliably applying application
-specific actions. Compare: relying party [RFC4949].¶ - Evidence:
-
A set of claims generated by an attester to be appraised by a verifier. Evidence may include configuration data, measurements, telemetry, or inferences.¶
- Attestation Results:
-
The output generated by a verifier, typically including information about an attester, where the verifier vouches for the validity of the results.¶
- Reference Values:
-
A set of values against which values of claims can be compared as part of applying an appraisal policy for evidence. Reference values are sometimes referred to in other documents as "known-good values", "golden measurements", or "nominal values". These terms typically assume comparison for equality, whereas here, reference values might be more general and be used in any sort of comparison.¶
- Endorsement:
-
A secure statement that an endorser vouches for the integrity of an attester's various capabilities such as claims collection and evidence signing.¶
3. Top-Level Token Definition
An "EAT" is an encoded (serialized) message, the purpose of which is to transfer a Claims-Set between two parties. An EAT MUST contain a Claims-Set. In this document, an EAT is always a CWT or JWT.¶
An EAT MUST have authenticity and integrity protection. CWT and JWT provide that in this document.¶
Further documents may define other encodings and security mechanisms for EAT.¶
The identification of a protocol element as an EAT follows the general conventions used for CWTs and JWTs. Identification depends on the protocol carrying the EAT. In some cases, it may be by media type (e.g., in an HTTP Content-Type field). In other cases, it may be through use of CBOR tags. There is no fixed mechanism across all use cases.¶
This document also defines another message, the detached EAT bundle (see Section 5), which holds a collection of detached claims sets and an EAT that provides integrity and authenticity protection for them. Detached EAT bundles can be either CBOR or JSON encoded.¶
The following CDDL defines the top-level $CBOR, $EAT, and $EAT sockets (see Section 3.9 of [RFC8610]), enabling future token formats to be defined.
Any new format that plugs into one or more of these sockets MUST be defined by an IETF Standards Action [RFC8126].
Of particular use may be a token type that provides no direct authenticity or integrity protection for use with transport mechanisms that do provide the necessary security services [UCCS].¶
Nesting of EATs is allowed and defined in Section 4.2.18.3. This includes the nesting of an EAT that is in a different format than the enclosing EAT, i.e., the nested EAT may be encoded using CBOR and the enclosing EAT encoded using JSON or vice versa. The definition of Nested-Token references the CDDL defined in this section. When new token formats are defined, the means for identification in a nested token MUST also be defined.¶
The top-level CDDL type for CBOR-encoded EATs is EAT-CBOR-Token and for JSON-encoded EATs is EAT-JSON-Token (while CDDL and CDDL tools provide enough support for shared definitions of most items in this document, they do not provide enough support for this sharing at the top level).¶
4. The Claims
This section describes new claims defined for attestation that have been added to the IANA "CBOR Web Token (CWT) Claims" [IANA.CWT.Claims] and "JSON Web Token Claims" [IANA.JWT.Claims] registries.¶
All definitions, requirements, creation and validation procedures, security considerations, IANA registrations, and so on from CWT and JWT carry over to EAT.¶
This section also describes how several extant CWT and JWT claims apply in EAT.¶
The set of claims that an EAT must contain to be considered valid is context dependent and is outside the scope of this specification. Specific applications of EATs will require implementations to understand and process some claims in particular ways. However, in the absence of such requirements, all claims that are not understood by implementations MUST be ignored.¶
CDDL, along with a text description, is used to define each claim independent of encoding. Each claim is defined as a CDDL group. In "Encoding and Collected CDDL" (Section 7), the CDDL groups turn into CBOR map entries and JSON name/value pairs.¶
Each claim defined in this document is added to the $$Claims group socket. Claims defined by other specifications MUST also be added to the $$Claims group socket.¶
All claims in an EAT MUST use the same encoding except where otherwise explicitly stated (e.g., in a CBOR-encoded token, all claims must be encoded with CBOR).¶
This specification provides a CDDL definition for most of the elements defined in [RFC7519] and [RFC8392]. These definitions are in Appendix D and are not normative.¶
Each claim described has a unique text string and integer that identifies it. CBOR-encoded tokens MUST only use the integer for claim keys. JSON-encoded tokens MUST only use the text string for claim names.¶
4.1. eat_nonce (EAT Nonce) Claim
In JSON, an EAT nonce is either a text string or an array of text strings. In CBOR, an EAT nonce is either a byte string or an array of byte strings. The array option supports multistage EAT verification and consumption.¶
A claim named "nonce" was defined for JWT and registered with IANA in the "JSON Web Token Claims" registry, but it MUST NOT be used because it does not support multiple nonces. No previous "nonce" claim was defined for CWT. To distinguish from the previously defined JWT "nonce" claim, this claim is named "eat_nonce" in JSON-encoded EATs. The CWT nonce defined here is intended for general purpose use and retains the "Nonce" claim name instead of an EAT-specific name.¶
An EAT nonce MUST have at least 64 bits of entropy. A maximum EAT nonce size is set to limit the memory required for an implementation. All receivers MUST be able to accommodate the maximum size.¶
In CBOR, an EAT nonce is a byte string between 8 and 64 bytes in length. In JSON, an EAT nonce is a text string between 8 and 88 bytes in length.¶
4.2. Claims Describing the Entity
The claims in this section describe the entity itself. They describe the entity whether they occur in evidence or occur in attestation results. See Section 1.3.1 for discussion on how attestation results relate to evidence.¶
4.2.1. ueid (Universal Entity ID) Claim
The "ueid" claim conveys a UEID, which identifies an individual manufactured entity such as a mobile phone, water meter, Bluetooth speaker, or networked security camera. It may identify the entire entity or a submodule. It does not identify types, models, or classes of entities. It is akin to a serial number, though it does not have to be sequential.¶
UEIDs MUST be universally and globally unique across manufacturers and countries, as described in Section 4.2.1.1. UEIDs MUST also be unique across protocols and systems, as tokens are intended to be embedded in many different protocols and systems. No two products anywhere, even in completely different industries made by two different manufacturers in two different countries, should have the same UEID (if they are not global and universal in this way, then relying parties receiving them will have to track other characteristics of the entity to keep entities distinct between manufacturers).¶
UEIDs are not designed for direct use by humans (e.g., printing on the case of a device), so no such representation is defined.¶
There are privacy considerations for UEIDs. See Section 8.1.¶
A Device Identifier (DevID) URN is registered for UEIDs. See Section 10.3.¶
4.2.1.1. Rules for Creating UEIDs
These rules are solely for the creation of UEIDs. The EAT consumer need not have any awareness of them.¶
A UEID is constructed of a single type byte followed by the unique bytes for that type. The type byte assures global uniqueness of a UEID even if the unique bytes for different types are accidentally the same.¶
UEIDS are of variable length to accommodate the types defined here as well as future-defined types.¶
UEIDs SHOULD NOT be longer than 33 bytes. If they are longer, there is no guarantee that a receiver will be able to accept them. See Appendix B.¶
A UEID is permanent. It MUST NOT change for a given entity.¶
The different types of UEIDs 1) accommodate different manufacturing processes, 2) accommodate small UEIDs, and 3) provide an option that does not require registration fees and central administration.¶
In the unlikely event that a new UEID type is needed, it MUST be defined in an update to this document on the Standards Track.¶
A manufacturer of entities MAY use different types for different products. They MAY also change from one type to another for a given product or use one type for some items of a given product and another type for others.¶
4.2.1.2. Rules for Consuming UEIDs
For the consumer, a UEID is solely a globally unique opaque identifier. The consumer does not and should not have any awareness of the rules and structure used to achieve global uniqueness.¶
All implementations MUST be able to receive UEIDs up to 33 bytes long. 33 bytes is the longest defined in this document and gives necessary entropy for probabilistic uniqueness.¶
The consumer of a UEID MUST treat it as a completely opaque string of bytes and MUST NOT make any use of its internal structure. The reasons for this are:¶
For example, when the consumer receives a type 0x02 UEID, they should not use the OUI part to identify the manufacturer of the device because there is no guarantee all UEIDs will be type 0x02. Different manufacturers may use different types. A manufacturer may make some of their product with one type and others with a different type or even change to a different type for newer versions of their product. Instead, the consumer should use the "oemid" claim.¶
4.2.2. sueids (Semipermanent UEIDs) Claim
The "sueids" claim conveys one or more semipermanent UEIDs (SUEIDs). An SUEID has the same format, characteristics
Examples of life-cycle events are change of ownership, factory reset, and onboarding into an IoT device management system. It is beyond the scope of this document to specify particular types of SUEIDs and the life-cycle events that trigger their change. An EAT profile MAY provide this specification.¶
There MAY be multiple SUEIDs. Each has a text string label, the purpose of which is to distinguish it from others. The label MAY name the purpose, application, or type of the SUEID. For example, the label for the SUEID used by the XYZ Onboarding Protocol could thus be "XYZ". It is beyond the scope of this document to specify any SUEID labeling schemes. They are use case specific and MAY be specified in an EAT profile.¶
If there is only one SUEID, the claim remains a map and there still MUST be a label.¶
An SUEID provides functionality similar to an IEEE Local Device Identifier (LDevID) [IEEE.802.1AR].¶
There are privacy considerations for SUEIDs; see Section 8.1.¶
A DevID URN is registered for SUEIDs; see Section 10.3.¶
4.2.3. oemid (Hardware OEM ID) Claim
The "oemid" claim identifies the Original Equipment Manufacturer (OEM) of the hardware. Any of the three forms described below MAY be used at the convenience of the claim sender. The receiver of this claim MUST be able to handle all three forms.¶
Note that the "hwmodel" claim in Section 4.2.4, the "oemboot" claim in Section 4.2.8, and the "dbgstat" claim in Section 4.2.9 depend on this claim.¶
Sometimes one manufacturer will acquire or merge with another. Depending on the situation and use case, newly manufactured devices may continue to use the old OEM ID or switch to a new one. This is left to the discretion of the manufacturers, but they should consider how it affects the above-mentioned claims and the attestation ecosystem for their devices. The considerations are the same for all three forms of this claim.¶
4.2.3.1. Random Number-Based OEM ID
The random number-based OEM ID MUST be 16 bytes (128 bits) long.¶
The OEM may create their own ID by using a cryptographic
In JSON-encoded tokens, this MUST be base64url encoded.¶
4.2.3.2. IEEE-Based OEM ID
The IEEE operates a global registry for MAC addresses and company IDs. This claim uses that database to identify OEMs. The contents of the claim may be either an IEEE MA-L, MA-M, MA-S, or CID [IEEE-RA]. An MA-L (formerly known as an OUI) is a 24-bit value used as the first half of a MAC address. Similarly, MA-M is a 28-bit value used as the first part of a MAC address, and MA-S (formerly known as OUI-36) is a 36-bit value. Many companies have already obtained an OEM ID from the IEEE registry. A CID is also a 24-bit value from the same space as an MA-L but is not for use as a MAC address. IEEE has published Guidelines for Use of EUI, OUI, and CID [OUI.Guide] and provides a lookup service [OUI.Lookup].¶
Companies that have more than one of these IDs or MAC address blocks SHOULD select one as preferred and use that for all their entities.¶
Commonly, these are expressed in "hexadecimal representation" as described in
[IEEE.802-2014]. When this claim is
encoded, the order of bytes in the bstr is the same as the order in the
"hexadecimal representation"
This format is always 3 bytes in size in CBOR.¶
In JSON-encoded tokens, this MUST be base64url encoded and always 4 bytes.¶
4.2.3.3. IANA Private Enterprise Number-Based OEM ID
IANA maintains a registry for Private Enterprise Numbers [PEN]. A PEN is an integer that identifies an enterprise, and it may be
used to construct an object identifier (OID) relative to the following OID arc that is managed by IANA: iso(1) identified
For EAT purposes, only the integer value assigned by IANA as the PEN is relevant, not the full OID value.¶
In CBOR, this value MUST be encoded as a major type 0 integer and is typically 3 bytes. In JSON, this value MUST be encoded as a number.¶
4.2.4. hwmodel (Hardware Model) Claim
The "hwmodel" claim differentiates hardware models, products, and variants manufactured by a particular OEM, namely the one identified by the OEM ID in Section 4.2.3. It MUST be unique within a given OEM ID. The concatenation of the OEM ID and "hwmodel" gives a global identifier of a particular product. The "hwmodel" claim MUST only be present if an "oemid" claim described in Section 4.2.3 is present.¶
The granularity of the model identification is for each OEM to decide. It may be very granular, perhaps including some version information. It may be very general, perhaps only indicating top-level products.¶
The "hwmodel" claim is for use in protocols and not for human consumption. The format and encoding of this claim should not be human readable to discourage use other than in protocols. If this claim is to be derived from an already-in-use human-readable identifier, it can be run through a hash function.¶
There is no minimum length so that an OEM with a very small number of models can use a one-byte encoding. The maximum length is 32 bytes. All receivers of this claim MUST be able to receive this maximum size.¶
The receiver of this claim MUST treat it as a completely opaque string of bytes, even if there is some apparent naming or structure. The OEM is free to alter the internal structure of these bytes as long as the claim continues to uniquely identify its models.¶
4.2.5. hwversion (Hardware Version) Claim
The "hwversion" claim is a text string, of which the format is set by each manufacturer. The structure and sorting order of this text string can be specified using the version-scheme item from Concise Software Identification (CoSWID) [RFC9393]. It is useful to know how to sort versions so the newer ones can be distinguished from the older ones. A "hwversion" claim MUST only be present if a "hwmodel" claim, as described in Section 4.2.4, is present.¶
4.2.6. swname (Software Name) Claim
The "swname" claim contains a very simple free-form text value for naming the software used by the entity. Intentionally, no general rules or structure are set. This will make it unsuitable for use cases that wish precise naming.¶
If precise and rigorous naming of the software for the entity is needed, the "manifests" claim, as described in Section 4.2.15, may be used instead.¶
4.2.7. swversion (Software Version) Claim
The "swversion" claim makes use of the CoSWID version-scheme defined in [RFC9393] to give a simple version for the software. A "swversion" claim MUST only be present if a "swname" claim, as described in Section 4.2.6, is present.¶
The "manifests" claim (Section 4.2.15) may be used instead if this is too simple.¶
4.2.8. oemboot (OEM Authorized Boot) Claim
An "oemboot" claim with a value of "true" indicates that the entity booted with software authorized by the manufacturer of the entity as indicated by the "oemid" claim described in Section 4.2.3. It indicates that the firmware and operating system are fully under control of the OEM and may not be replaced by the end user or even the enterprise that owns the device. The means of control may be by cryptographic authentication of the software, the software being in Read-Only Memory (ROM), a combination of the two, or other. If this claim is present, the "oemid" claim MUST be present.¶
4.2.9. dbgstat (Debug Status) Claim
The "dbgstat" claim applies to entity-wide or submodule-wide debug facilities of the entity like [JTAG] and diagnostic hardware built into chips. It applies to any software debug facilities related to privileged software that allows system-wide memory inspection, tracing, or modification of non-system software like user-mode applications.¶
This characterizatio
As with all claims, the absence of the "dbgstat" claim means it is not reported.¶
This claim is not extensible so as to provide a common interoperable description of debug status. If a particular implementation considers this claim to be inadequate, it can define its own proprietary claim. It may consider including both this claim as a coarse indication of debug status and its own proprietary claim as a refined indication.¶
The higher levels of debug disabling require that all debug disabling of the levels below it be in effect. Since the lowest level requires that all of the target's debug be currently disabled, all other levels require that too.¶
There is no inheritance of claims from a submodule to a superior module or vice versa. There is no assumption, requirement, or guarantee that the target of a superior module encompasses the targets of submodules. Thus, every submodule must explicitly describe its own debug state. The receiver of an EAT MUST NOT assume that debug is turned off in a submodule because there is a claim indicating it is turned off in a superior module.¶
An entity may have multiple debug facilities. The use of plural in the description of the states refers to that, not to any aggregation or inheritance.¶
The architecture of some chips or devices may be such that a debug facility operates for the whole chip or device. If the EAT for such a chip includes submodules, then each submodule should independently report the status of the whole-chip or whole-device debug facility. This is the only way the receiver can know the debug status of the submodules since there is no inheritance.¶
4.2.9.1. Enabled
If any debug facility, even manufacturer hardware diagnostics, is currently enabled, then this level must be indicated.¶
4.2.9.2. Disabled
This level indicates all debug facilities are currently disabled. It may be possible to enable them in the future. It may also be that they were enabled in the past but are currently disabled.¶
4.2.9.3. Disabled Since Boot
This level indicates all debug facilities are currently disabled and have been so since the entity booted/started.¶
4.2.9.4. Disabled Permanently
This level indicates all non
4.2.9.5. Disabled Fully and Permanently
This level indicates that all debug facilities for the entity are permanently disabled.¶
4.2.10. location (Location) Claim
The "location" claim gives the geographic position of the entity from which the attestation originates.
Latitude, longitude, altitude, accuracy, altitude
The location may have been cached for a period of time before token creation. For example, it might have been minutes, hours, or more since the last contact with a satellite in the Global Navigation Satellite System (GNSS). Either the timestamp or the age data item can be used to quantify the cached period. The timestamp data item is preferred as it is a non-relative time. If the entity has no clock or the clock is unset but has a means to measure the time interval between the acquisition of the location and the token creation, the age may be reported instead. The age is in seconds.¶
See location
4.2.11. uptime (Uptime) Claim
The "uptime" claim contains the number of seconds that have elapsed since the entity or submodule was last booted.¶
4.2.12. bootcount (Boot Count) Claim
The "bootcount" claim contains a count of the number of times the entity or submodule has been booted. Support for this claim requires a persistent storage on the device.¶
4.2.13. bootseed (Boot Seed) Claim
The "bootseed" claim contains a value created at system boot time that allows differentiation of attestation reports from different boot sessions of a particular entity (e.g., a certain UEID).¶
This value is usually public. It is not a secret and MUST NOT be used for any purpose where a secret seed is needed, such as seeding a random number generator.¶
There are privacy considerations for this claim; see Section 8.3.¶
4.2.14. dloas (Digital Letters of Approval) Claim
The "dloas" claim conveys one or more Digital Letters of Approval (DLOAs). A DLOA [DLOA] is a document that describes a certification that an entity has received. Examples of certifications represented by a DLOA include those issued by GlobalPlatform [GP-Example] and those based on Common Criteria [CC-Example]. The DLOA is unspecific to any particular certification type or those issued by any particular organization.¶
This claim is typically issued by a verifier, not an attester. Verifiers MUST NOT issue this claim unless the entity has received the certification indicated by the DLOA.¶
This claim MAY contain more than one DLOA. If multiple DLOAs are present, verifiers MUST NOT issue this claim unless the entity has received all of the certifications.¶
DLOA documents are always fetched from a registrar that stores them. This claim contains several data items used to construct a Uniform Resource Locator (URL) for fetching the DLOA from the particular registrar.¶
This claim MUST be encoded as an array with either two or three elements. The first element MUST be the URL for the registrar. The second element MUST be a platform label indicating which platform was certified. If the DLOA applies to an application, then the third element is added, which MUST be an application label. The method of constructing the registrar URL, platform label, and possibly application label is specified in [DLOA].¶
The retriever of a DLOA MUST follow the recommendation in [DLOA] and use Transport Layer Security (TLS) or some other means to be sure the DLOA registrar they are accessing is authentic. The platform and application labels in the claim indicate the correct DLOA for the entity.¶
4.2.15. manifests (Software Manifests) Claim
The "manifests" claim contains descriptions of software present on the entity. These manifests are installed on the entity when the software is installed or are created as part of the installation process. Installation is anything that adds software to the entity, possibly factory installation, the user installing elective applications, and so on. The defining characteristic of a manifest is that it is created by the software manufacturer. The purpose of this claim is to relay unmodified manifests to the verifier and possibly to the relying party.¶
Some manifests are signed by their software manufacturer independently, and some are not because either they do not support signing or the manufacturer chose not to sign them.
For example, a CoSWID might be signed independently before it is included in an EAT.
When signed manifests are put into an EAT, the manufacturer's signature SHOULD be included even though an EAT's signature will also cover the manifest.
This allows the receiver to directly verify the manufacturer
This claim allows multiple manifest formats. For example, the manifest may be a CBOR-encoded CoSWID, an XML-encoded Software Identification (SWID) tag, or other. Identification of the type of manifest is always by a Constrained Application Protocol (CoAP) Content-Format identifier [RFC7252]. If there is no CoAP identifier registered for a manifest format, one MUST be registered.¶
This claim MUST be an array of one or more manifests. Each manifest in the claim MUST be an array of two. The first item in the array of two MUST be a CoAP Content-Format identifier. The second item is MUST be the actual manifest.¶
In JSON-encoded tokens, the manifest, whatever encoding it is, MUST be placed in a text string. When a non-text encoded manifest such as a CBOR-encoded CoSWID is put in a JSON-encoded token, the manifest MUST be base64 encoded.¶
This claim allows for multiple manifests in one token since multiple software packages are likely to be present. The multiple manifests MAY be of different encodings. In some cases, EAT submodules may be used instead of the array structure in this claim for multiple manifests.¶
A CoSWID manifest MUST be a payload CoSWID, not an evidence CoSWID. These are defined in [RFC9393].¶
This claim is extensible for use of manifest formats beyond those mentioned in this document.
No particular manifest format is preferred.
For manifest interoperabilit
4.2.16. measurements (Measurements) Claim
The "measurements" claim contains descriptions, lists, evidence, or measurements of the software that exists on the entity or on any other measurable subsystem of the entity (e.g., hash of sections of a file system or non-volatile memory). The defining characteristic of this claim is that its contents are created by processes on the entity that inventory, measure, or otherwise characterize the software on the entity. The contents of this claim do not originate from the manufacturer of the measurable subsystem (e.g., developer of a software library).¶
This claim can be a CoSWID [RFC9393]. When the CoSWID format is used, it MUST be an evidence CoSWID, not a payload CoSWID.¶
Formats other than CoSWID MAY be used. The format is identified by a CoAP Content-Format identifier, which is the same for the "manifests" claim in Section 4.2.15.¶
4.2.17. measres (Software Measurement Results) Claim
The "measres" claim is a general-purpose structure for reporting the comparison of measurements to expected reference values. This claim provides a simple standard way to report the result of a comparison as a success, a failure, not run, or absent.¶
It is the nature of measurement systems to be specific to the operating system, software, and hardware of the entity that is being measured.
It is not possible to standardize what is measured and how it is measured across platforms, OSes, software, and hardware.
The recipient must obtain the information about what was measured and what it indicates for the characterizatio
This claim MAY be generated by the verifier and sent to the relying party. For example, it could be the results of the verifier comparing the contents of the "measurements" claim (Section 4.2.16) to reference values.¶
This claim MAY also be generated on the entity if the entity has the ability for one subsystem to measure and evaluate another subsystem. For example, a TEE might have the ability to measure the software of the rich OS and may have the reference values for the rich OS.¶
Within an entity, attestation target, or submodule, multiple results can be reported. For example, it may be desirable to report the results for measurements of the file system, chip configuration, installed software, running software, and so on.¶
Note that this claim is not for reporting the overall result of a verifier. It is solely for reporting the result of comparison to reference values.¶
An individual measurement result
Each individual measurement result is part of a group that may contain many individual results. Each group has a text string that names it, typically the name of the measurement scheme or system.¶
The claim itself consists of one or more groups.¶
The values for the results enumerated type are as follows:¶
- 1 -- comparison success:
- The comparison to reference values was successful.¶
- 2 -- comparison failure:
- The comparison was completed but did not compare correctly to the reference values.¶
- 3 -- comparison not run:
- The comparison was not run. This includes error conditions such as running out of memory.¶
- 4 -- measurement absent:
- The particular measurement was not available for comparison.¶
4.2.18. submods (Submodules) Claim
Some devices are complex and have many subsystems. A mobile phone is a good example. It may have subsystems for communications (e.g., Wi-Fi and cellular), low-power audio and video playback, and multiple security
Submodules may be used in either evidence or attestation results.¶
Because system architecture will vary greatly from use case to use case, there are no set requirements for what a submodule represents either in evidence or in attestation results. Profiles (Section 6) may wish to impose requirements. An attester that outputs evidence with submodules should document the semantics it associates with particular submodules for the verifier. Likewise, a verifier that outputs attestation results with submodules should document the semantics it associates with the submodules for the relying party.¶
A submodule claim is a map that holds some number of submodules.
Each submodule is named by its label in the submodule claim map.
The value of each entry in a submodule may be a Claims-Set, nested token, or Detached
A submodule may include a submodule, allowing for arbitrary levels of nesting. However, submodules do not inherit anything from the containing token and must explicitly include all claims. Submodules may contain claims that are present in any surrounding token or submodule. For example, the top level of the token may have a UEID, a submodule may have a different UEID, and a further subordinate submodule may also have a UEID.¶
The following subsections define the three types for representing submodules:¶
The Submodule type and Nested-Token type definitions vary with the type of encoding. The definitions for CBOR-encoded EATs are as follows:¶
The Submodule and Nested-Token definitions for JSON-encoded EATs are as below. The definitions are necessarily different than CBOR because JSON has no tag mechanism and no byte-string type to help indicate that the nested token is CBOR.¶
The Detached
Nested tokens can be one of three types as defined in this document or types that are standardized in subsequent documents (e.g., [UCCS]). Nested tokens are the only mechanism by which JSON can be embedded in CBOR and vice versa.¶
The addition of further types is accomplished by augmenting the $CBOR
When decoding a JSON-encoded EAT, the type of submodule is determined as follows.
A JSON object indicates that the submodule is a Claims-Set.
In all other cases, it is a JSON-Selector, which is an array of two elements that indicates whether the submodule is a nested token or a Detached
When decoding a CBOR-encoded EAT, the CBOR item type indicates the type of the submodule as follows.
A map indicates a CBOR-encoded submodule Claims-Set.
An array indicates a CBOR-encoded Detached
The type of a CBOR-encoded nested token is always determined by the CBOR tag encountered after the byte string wrapping is removed in a CBOR-encoded enclosing token or after the base64 wrapping is removed in a JSON-encoded enclosing token.¶
The type of JSON-encoded nested token is always determined by the string name in JSON-Selector and is always "JWT", "BUNDLE", or a new name standardized outside this document for a further type (e.g., "UCCS"). This string name may also be "CBOR" to indicate the nested token is CBOR encoded.¶
- "JWT":
- The second array item MUST be a JWT formatted according to [RFC7519].¶
- "CBOR":
- The second array item MUST be some
base64url
-encoded CBOR that is a tag, typically a CWT or CBOR-encoded detached EAT bundle.¶ - "BUNDLE":
- The second array item MUST be a JSON-encoded detached EAT bundle as defined in this document.¶
- "DIGEST":
- The second array item MUST be a
JSON-encoded Detached
-Submodule -Digest as defined in this document.¶
As noted elsewhere, additional EAT types may be defined by a Standards Action. New type specifications MUST address the integration of the new type into the submodule claim type for submodules.¶
4.2.18.1. Submodule Claims-Set
The Claims-Set type provides a means of representing claims from a submodule that does not have its own attesting environment, i.e., it has no keys distinct from the attester producing the surrounding token. Claims are represented as a Claims-Set. Submodule claims represented in this way are secured by the same mechanism as the enclosing token (e.g., it is signed by the same attestation key).¶
The encoding of a submodule Claims-Set MUST be the same as the encoding of the surrounding EAT, e.g., all submodule Claims-Sets in a CBOR-encoded token must be CBOR encoded.¶
4.2.18.2. Detached Submodule Digest
The Detached
The data type for this type of submodule is an array consisting of two data items: an algorithm identifier and a byte string containing the digest. The hash algorithm identifier is always from the "COSE Algorithms" registry [IANA
A detached EAT bundle, as described in Section 5, may be used to convey detached claims sets and the EAT containing the corresponding detached digests. However, EAT does not require the use of a detached EAT bundle. Any other protocols may be used to convey detached claims sets and the EAT containing the corresponding detached digests. If detached Claims-Sets are modified in transit, then validation can fail.¶
4.2.18.3. Nested Tokens
The CBOR
Inclusion of a signed EAT as a claim cryptographical
A nested token need not use the same encoding as the enclosing token. This enables composite devices to be built without regards to the encoding used by components. Thus, a CBOR-encoded EAT can have a JSON-encoded EAT as a nested token and vice versa.¶
4.3. Claims Describing the Token
The claims in this section provide metadata about the token they occur in. They do not describe the entity. They may appear in evidence or attestation results.¶
4.3.1. iat (Timestamp) Claim
The "iat" claim defined in CWT and JWT is used to indicate the
date
The data for some claims may be held or cached for some period of time before the token is created. This period may be long, even days. Examples are measurements taken at boot or a geographic position fix taken the last time a satellite signal was received. There are individual timestamps associated with these claims to indicate their age is older than the "iat" timestamp.¶
CWT allows the use of floating-point for this claim, whereas EAT disallows the use of floating-point. An EAT token MUST NOT contain an "iat" claim in floating-point format. Any recipient of a token with a floating-point format "iat" claim MUST consider it an error.¶
A 64-bit integer representation of the CBOR epoch-based time [RFC8949] used by this claim can represent a range of +/- 500 billion years, so the only point of a floating-point timestamp is to have precession greater than one second. This is not needed for EAT.¶
4.3.2. eat_profile (EAT Profile) Claim
See Section 6 for the detailed description of an EAT profile.¶
The "eat_profile" claim identifies an EAT profile by either a Uniform Resource Identifier (URI) or an OID. Typically, the URI will reference a document describing the profile. An OID is just a unique identifier for the profile. It may exist anywhere in the OID tree. There is no requirement that the named document be publicly accessible. The primary purpose of the "eat_profile" claim is to uniquely identify the profile even if it is a private profile.¶
The OID is always absolute and never relative.¶
See Section 7.2.1 for OID and URI encoding.¶
4.3.3. intuse (Intended Use) Claim
EATs may be employed in the context of several different applications. The "intuse" claim provides an indication to an EAT consumer about the intended usage of the token. This claim can be used as a way for an application using EAT to internally distinguish between different ways it utilizes EAT. The possible values are in the "Entity Attestation Token (EAT) Intended Uses" registry defined in Section 10.5.¶
5. Detached EAT Bundles
A detached EAT bundle is a message to convey an EAT plus detached claims sets secured by that EAT. It is a top-level message like a CWT or JWT. It can occur in any place that a CWT or JWT occurs, for example, as a submodule nested token as defined in Section 4.2.18.3.¶
A detached EAT bundle may be either CBOR or JSON encoded.¶
A detached EAT bundle consists of two parts.¶
The first part is an encoded EAT that:¶
The same mechanism for distinguishing the type for nested token submodules is employed here.¶
The second part is a map/object that:¶
For a CBOR-encoded detached EAT bundle, tag 602 can be used to identify it. The standard rules apply for use or non-use of a tag. When it is sent as a submodule, it is always sent as a tag to distinguish it from the other types of nested tokens.¶
The digests of the detached claims sets are associated with detached Claims-Sets by label/name. It is up to the constructor of the detached EAT bundle to ensure that the names uniquely identify the detached claims sets. Since the names are used only in the detached EAT bundle, they can be very short, perhaps one byte.¶
6. Profiles
EAT makes normative use of CBOR, JSON, COSE, JOSE, CWT, and JWT. Most of these have implementation options to accommodate a range of use cases.¶
For example, COSE does not require a particular set of cryptographic algorithms so as to accommodate different usage scenarios and evolution of algorithms over time. Section 10 of [RFC9052] describes the profiling considerations for COSE.¶
The use of encryption is optional for both CWT and JWT. Section 8 of [RFC7519] describes implementation requirements and recommendations for JWT.¶
Similarly, CBOR provides indefinite
For example, a mobile phone use case may require the device make and model and may prohibit UEID and location for privacy reasons. The general EAT standard retains all this flexibility because it too is aimed to accommodate a broad range of use cases.¶
It is necessary to explicitly narrow these implementation options to guarantee interoperabilit
Below is a list of the various issues that should be addressed by a profile.¶
The "eat_profile" claim in Section 4.3.2 provides a unique identifier for the profile a particular token uses.¶
A profile can apply to evidence, attestation results, or both.¶
6.1. Format of a Profile Document
A profile document does not have to be in any particular format. It may be simple text, something more formal, or a combination of both.¶
A profile may define, and possibly register, one or more new claims if needed. A profile may also reuse one or more already defined claims either as is or with values constrained to a subset or subrange.¶
6.2. Full and Partial Profiles
For a "full" profile, the receiver will be able to decode and verify every possible EAT sent when a sender and receiver both adhere to it. For a "partial" profile, there are still some protocol options left undecided.¶
For example, a profile that allows the use of signing algorithms by the sender that the receiver is not required to support is a partial profile. The sender might choose a signing algorithm that some receivers do not support.¶
Full profiles MUST be complete such that a complying receiver can decode, verify, and check for freshness for every EAT created by a complying sender. Full profiles do not need to require the receiver to fully handle every claim in an EAT from a complying sender. Profile specifications may assume the receiver has access to the necessary verification keys or may go into specific detail on the means to access verification keys.¶
The "eat_profile" claim MUST NOT be used to identify partial profiles.¶
While fewer profiles are preferable, sometimes several may be needed for a use case.
One approach to handling variation in devices might be to define several full profiles that are variants of each other.
It is relatively easy and inexpensive to define profiles as they do not have to be published on the Standards Track and do not have to be registered anywhere.
For example, flexibility for post-quantum algorithms can be handled as follows.
First, define a full profile for a set of non
6.3. List of Profile Issues
The following is a list of EAT, CWT, JWT, COSE, JOSE, and CBOR options that a profile should address.¶
6.3.1. Use of JSON, CBOR, or Both
A profile should specify whether CBOR, JSON, or both may be sent. A profile should specify that the receiver can accept all encodings that the sender is allowed to send.¶
This should be specified for the top level and all nested tokens. For example, a profile might require all nested tokens to be of the same encoding of the top-level token.¶
6.3.2. CBOR Map and Array Encoding
A profile should specify whether definite-length arrays/maps, indefinite
This applies to individual EAT claims, CWT, and COSE parts of the implementation.¶
For most use cases, specifying that only definite-length arrays/maps may be sent is suitable.¶
6.3.3. CBOR String Encoding
A profile should specify whether definite-length strings, indefinite
For most use cases, specifying that only definite-length strings may be sent is suitable.¶
6.3.4. CBOR Preferred Serialization
A profile should specify whether or not CBOR preferred serialization must be sent or not. A profile should specify that the receiver accepts preferred and/or non-preferred serialization, so it will be able to accept anything sent by the sender.¶
6.3.6. COSE/JOSE Protection
COSE and JOSE have several options for signed, MACed, and encrypted messages. It may be an Unsecured JWT as described in Section 6 of [RFC7519]. It is possible to implement no protection, sign only, MAC only, sign then encrypt, and so on. All combinations allowed by COSE, JOSE, JWT, and CWT are allowed by EAT.¶
A profile should specify all signing, encryption, and MAC message formats that may be sent.
For example, a profile might allow only COSE_Sign1 to be sent.
As another example, a profile might allow COSE_Sign and COSE_Encrypt to be sent to carry multiple signatures for post quantum cryptography and to use encryption to provide confidentiality
A profile should specify that the receiver accepts all message formats that are allowed to be sent.¶
When both signing and encryption are allowed, a profile should specify which is applied first.¶
6.3.7. COSE/JOSE Algorithms
See "Application Profiling Considerations" (Section 10 of [RFC9052]) for a discussion on the selection of cryptographic algorithms and related issues.¶
The profile MAY require the protocol or system using EAT to provide an algorithm negotiation mechanism.¶
If not, the profile document should list a set of algorithms for each COSE and JOSE message type allowed by the profile per Section 6.3.6. The verifier should implement all of them. The attester may implement any of them it wishes, possibly just one for each message type.¶
If detached submodule digests are used, the profile should address the determination of the hash algorithm(s) for the digests.¶
6.3.8. Detached EAT Bundle Support
A profile should specify whether or not a detached EAT bundle (Section 5) can be sent. A profile should specify that a receiver accepts a detached EAT bundle if the sender is allowed to send it.¶
6.3.9. Key Identification
A profile should specify what must be sent to identify the verification, decryption, or MAC key(s). If multiple methods of key identification may be sent, a profile should require the receiver to support them all.¶
Appendix F describes a number of methods for identifying verification keys. When encryption is used, there are further considerations. In some cases, key identification may be very simple, and in other cases, multiple components may be involved. For example, it may be simple through the use of a COSE key ID, or it may be complex through the use of an X.509 certificate hierarchy.¶
While not always possible, a profile should specify, or make reference to, a full end-to-end specification for key identification. For example, a profile should specify in full detail how COSE key IDs are to be created, their life cycle, and such rather than just specifying that a COSE key ID be used. For example, a profile should specify the full details of an X.509 hierarchy including extension processing, algorithms allowed, and so on rather than just saying X.509 certificates are used.¶
6.3.10. Endorsement Identification
Similar to, or perhaps the same as, verification key identification, the profile may wish to specify how endorsements are to be identified. However, note that endorsement identification is optional, whereas key identification is not.¶
6.3.11. Freshness
Security considerations (see Section 9.3) require a mechanism to provide freshness. This may be the EAT nonce claim in Section 4.1 or some claim or mechanism defined outside this document. Several options are described in "Freshness" (Section 10 of [RFC9334]). A profile should specify which freshness mechanism or mechanisms can be used.¶
If the EAT nonce claim is used, a profile should specify whether multiple nonces may be sent. If a profile allows multiple nonces to be sent, it should require the receiver to process multiple nonces.¶
6.3.12. Claims Requirements
A profile may define new claims that are not defined in this document.¶
This document requires that an EAT receiver must accept tokens with claims it does not understand. A profile for a specific use case may reverse this and allow a receiver to reject tokens with claims it does not understand. A profile for a specific use case may specify that specific claims are prohibited.¶
A profile for a specific use case may modify this and specify that some claims are required.¶
A profile may constrain the definition of claims that are defined in this document or elsewhere. For example, a profile may require the EAT nonce to be a certain length or the "location" claim to always include the altitude.¶
Some claims are "pluggable" in that they allow different formats for their content. The "manifests" claim (Section 4.2.15) and the "measurements" claim (Section 4.2.16) are examples of this, allowing the use of CoSWID and other formats. A profile should specify which formats are allowed to be sent, with the assumption that the corresponding CoAP content types have been registered. A profile should require the receiver to accept all formats that are allowed to be sent.¶
Further, if there is variation within a format that is allowed, the profile should specify which variations can be sent. For example, there are variations in the CoSWID format. A profile might require the receiver to accept all variations that are allowed to be sent.¶
6.4. The Constrained Device Standard Profile
It is anticipated that there will be many profiles defined for EAT for many different use cases. This section gives a normative definition of one profile that is good for many constrained device use cases.¶
The identifier for this profile is "urn
Any profile with different requirements than those above MUST have a different profile identifier.¶
Note that many claims can be present for tokens conforming to this profile, even claims not defined in this document. Note also that even slight deviation from the above requirements is considered a different profile that MUST have a different identifier. For example, if a kid (key identifier) or UEID is not used for key identification, it is not in conformance with this profile. As another example, requiring the presence of some claim is also not in conformance and requires another profile.¶
Derivations of this profile are encouraged. For example, another profile may be simply defined as "The Constrained Device Standard Profile" plus the requirement for the presence of claim xxxx and claim yyyy.¶
7. Encoding and Collected CDDL
An EAT is fundamentally defined using CDDL. This document specifies how to encode the CDDL in CBOR or JSON. Since CBOR can express some things that JSON cannot (e.g., tags) or that are expressed differently (e.g., labels), there is some CDDL that is specific to the encoding.¶
7.1. Claims-Set and CDDL for CWT and JWT
CDDL was not used to define CWT or JWT. It was not available at the time.¶
This document defines CDDL for both CWT and JWT. This document does not change the encoding or semantics of anything in a CWT or JWT.¶
A Claims-Set is the central data structure for EAT, CWT, and JWT. It holds all the claims and is the structure that is secured by signing or other means. It is not possible to define EAT, CWT, or JWT in CDDL without it. The CDDL definition of Claims-Set here is applicable to EAT, CWT, and JWT.¶
This document specifies how to encode a Claims-Set in CBOR or JSON.¶
With the exception of nested tokens and some other externally defined structures (e.g., SWIDs), an entire Claims-Set must be encoded in either CBOR or JSON, never a mixture.¶
CDDL for the seven claims defined by [RFC8392] and [RFC7519] is also specified in this document.¶
7.2. Encoding Data Types
The following subsections use the types defined in "Standard Prelude" (Appendix D of [RFC8610]).¶
7.2.1. Common Data Types
time-int is identical to the epoch-based time but disallows floating-point representation.¶
For CBOR-encoded tokens, OIDs are specified using the CDDL type name "oid" from [RFC9090]. They are encoded without the tag number. For JSON-encoded tokens, OIDs are text strings in the common form of "nn.nn.nn...".¶
Unless explicitly indicated, URIs are not the URI tag defined in [RFC8949]. They are just text strings that contain a URI conforming to the format defined in [RFC3986].¶
7.2.2. JSON Interoperability
JSON should be encoded per Appendix E of [RFC8610]. In addition, the following CDDL types are encoded in JSON as follows:¶
The CDDL generic "JC<>" is used in most places where there is a variance between CBOR and JSON. The first argument is the CDDL for JSON, and the second is CDDL for CBOR.¶
7.2.3. Labels
Most map labels, Claims-Keys, Claim-Names, and enumerated-type values are integers for CBOR-encoded tokens and strings for JSON-encoded tokens. When this is the case, the JC<> CDDL construct is used to give both the integer and string values.¶
7.2.4. CBOR Interoperability
CBOR allows data items to be serialized in more than one form to accommodate a variety of use cases. This is addressed in Section 6.¶
7.3. Collected CDDL
See [EAT-GitHub] for additional information and stub files, when using the CDDL presented in this section to validate EAT protocol messages.¶
7.3.1. Payload CDDL
The payload CDDL defines all the EAT claims that are added to the main definition of a Claims-Set in Appendix D. Claims-Set is the payload for CWT, JWT, and potentially other token types. This is for both CBOR and JSON. When there is variation between CBOR and JSON, the JC<> CDDL generic defined in Appendix D is used. Note that the JC<> generic uses the CDDL ".feature" control operator defined in [RFC9165].¶
This CDDL uses, but does not define, Submodule or nested tokens because the definition for these types varies between CBOR and JSON and the JC<> generic cannot be used to define it.
The submodule claim is the one place where a CBOR token can be nested inside a JSON token and vice versa.
Encoding
8. Privacy Considerations
Certain EAT claims can be used to track the owner of an entity;
therefore, implementations should consider privacy
8.1. UEID and SUEID Privacy Considerations
A UEID is usually not privacy
Thus, the use of the claim may violate privacy policies. In other usage situations, a UEID will not be allowed for certain products such as browsers that give privacy for the end user. It will often be the case that tokens will not have a UEID for these reasons.¶
An SUEID is also usually not privacy
There are several strategies that can be used to still be able to put UEIDs and SUEIDs in tokens:¶
Note that some of these privacy preservation strategies result in multiple UEIDs and SUEIDs per entity. Each UEID/SUEID is used in a different context, use case, or system on the entity. However, from the view of the relying party, there is just one UEID and it is still globally universal across manufacturers.¶
8.2. Location Privacy Considerations
Geographic location is almost always considered personally identifiable information. Implementors should consider laws and regulations governing the transmission of location data from end-user devices to servers and services. Implementors should consider using location management facilities offered by the operating system on the entity generating the attestation. For example, many mobile phones prompt the user for permission before sending location data.¶
8.3. Boot Seed Privacy Considerations
The "bootseed" claim is effectively a stable entity identifier within a given boot epoch. Therefore, it is not suitable for use in attestation schemes that are privacy
8.4. Replay Protection and Privacy
EAT defines the EAT nonce claim for replay protection and token freshness. The nonce claim is based on a value usually derived remotely (outside of the entity). This claim might be used to extract and convey personally identifying information either inadvertently or by intention. For instance, an implementor may choose a nonce equivalent to a username associated with the device (e.g., account login). If the token is inspected by a third party, then this information could be used to identify the source of the token or an account associated with the token. To avoid the conveyance of privacy-related information in the nonce claim, it should be derived using a salt that originates from a true and reliable random number generator or any other source of randomness that would still meet the target system requirements for replay protection and token freshness.¶
9. Security Considerations
The security considerations provided in Section 8 of [RFC8392] and of Section 11 of [RFC7519] apply to EAT in its CWT and JWT form, respectively. Moreover, Section 12 of [RFC9334] is also applicable to implementations of EAT. In addition, implementors should consider the information in the following subsections.¶
9.1. Claim Trustworthiness
This specification defines semantics for each claim. It does not require any particular level of security in the implementation of the claims or even for the attester itself. Such specification is far beyond the scope of this document, which is about a message format not the security level of an implementation.¶
The receiver of an EAT knows the trustworthiness of the claims in it by understanding the implementation made by the attester vendor and/or understanding the checks and processing performed by the verifier.¶
For example, this document states that a UEID is permanent and that it must not change, but it does not describe any security requirements or a level of defense to prevent an attacker from changing the UEID.¶
The degree of security will vary from use case to use case. In some cases, the receiver may only need to know something of the implementation such as that it was implemented in a TEE. In other cases, the receiver may require the attester to be certified by a particular certification program. Or perhaps the receiver is content with very little security.¶
9.2. Key Provisioning
Private key material can be used to sign and/or encrypt the EAT or to derive the keys used for signing and/or encryption. In some instances, the manufacturer of the entity may create the key material separately and provision the key material in the entity itself. The manufacturer of any entity that is capable of producing an EAT should take care to ensure that any private key material be suitably protected prior to provisioning the key material in the entity itself. This can require creation of key material in an enclave (see [RFC4949] for definition of "enclave"), secure transmission of the key material from the enclave to the entity using an appropriate protocol, and persistence of the private key material in some form of secure storage to which (preferably) only the entity has access.¶
9.2.1. Transmission of Key Material
Regarding transmission of key material from the enclave to the entity, the key material may pass through one or more intermediaries. Therefore, some form of protection (e.g., key wrapping) may be necessary. The transmission itself may be performed electronically, but it can also be done by human courier. In the latter case, there should be minimal to no exposure of the key material to the human (e.g., encrypted portable memory). Moreover, the human should transport the key material directly from the secure enclave where it was created to a destination secure enclave where it can be provisioned.¶
9.3. Freshness
All EAT use MUST provide a freshness mechanism to prevent replay and related attacks. The extensive discussions in [RFC9334] on freshness, as well as the security considerations, apply here. One option to provide freshness is the EAT nonce claim (Section 4.1).¶
9.4. Multiple EAT Consumers
In many cases, more than one EAT consumer may be required to fully verify the entity attestation. Examples include individual consumers for nested EATs or consumers for individual claims with an EAT. When multiple consumers are required for verification of an EAT, it is important to minimize information exposure to each consumer. In addition, the communication between multiple consumers should be secure.¶
For instance, consider the example of an encrypted and signed EAT with multiple claims. A consumer may receive the EAT (denoted as the "receiving consumer"), decrypt its payload, and verify its signature but then pass specific subsets of claims to other consumers for evaluation ("downstream consumers"). Since any COSE encryption will be removed by the receiving consumer, the communication of claim subsets to any downstream consumer MUST leverage an equivalent communication security protocol (e.g., TLS).¶
However, assume the EAT of the previous example is hierarchical and
each claim subset for a downstream consumer is created in the form of
a nested EAT. Then, the nested EAT itself is encrypted and cryptographical
9.5. Detached EAT Bundle Digest Security Considerations
A detached EAT bundle is composed of a nested EAT and a claims set as per Section 5. Although the attached claims set is vulnerable to modification in transit, any modification can be detected by the receiver through the associated digest, which is a claim fully contained within an EAT. Moreover, the digest itself can only be derived using an appropriate COSE hash algorithm, implying that an attacker cannot induce false detection of modified detached claims because the algorithms in the COSE registry are assumed to be of sufficient cryptographic strength.¶
9.6. Verification Keys
In all cases, there must be some way that the verification key itself is verified or determined to be trustworthy. The key identification itself is never enough. This will always be by some out-of-band mechanism that is not described here. For example, the verifier may be configured with a root certificate or a master key by the verifier system administrator.¶
Often, an X.509 certificate or an endorsement carries more than just the verification key.
For example, an X.509 certificate might have key usage constraints, and an endorsement might have reference values.
When this is the case, the key identifier must be either a protected header or in the payload, such that it is cryptographical
10. IANA Considerations
10.1. Reuse of CBOR and JSON Web Token (CWT and JWT) Claims Registries
Claims defined for EAT are compatible with those of CWT and JWT, so the CWT and JWT Claims registries, [IANA.CWT.Claims] and [IANA.JWT.Claims], are reused. No new IANA registry is created.¶
All EAT claims defined in this document have been placed in both registries. All new EAT claims defined subsequently should be placed in both registries.¶
Appendix E describes some considerations when defining new claims.¶
10.2. CWT and JWT Claims Registered by This Document
Per this specification, the following values have been added to the "JSON Web Token Claims" registry established by [RFC7519] and the "CBOR Web Token (CWT) Claims" registry established by [RFC8392]. Each entry below has been added to both registries.¶
The "Claim Description", "Change Controller", and "Reference" fields are common and equivalent for the JWT and CWT registries. The "Claim Key" and "Claim Value Type" fields are for the CWT registry only. The "Claim Name" field is as defined for the CWT registry, not the JWT registry. The "JWT Claim Name" field is equivalent to the "Claim Name" field in the JWT registry.¶
IANA has registered the following claims.¶
- Claim Name:
- Nonce¶
- Claim Description:
- Nonce¶
- JWT Claim Name:
- eat_nonce¶
- Claim Key:
- 10¶
- Claim Value Type:
- bstr or array¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- UEID¶
- Claim Description:
- Universal Entity ID¶
- JWT Claim Name:
- ueid¶
- CWT Claim Key:
- 256¶
- Claim Value Type:
- bstr¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- SUEIDs¶
- Claim Description:
- Semipermanent UEIDs¶
- JWT Claim Name:
- sueids¶
- CWT Claim Key:
- 257¶
- Claim Value Type:
- map¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Hardware OEM ID¶
- Claim Description:
- Hardware OEM ID¶
- JWT Claim Name:
- oemid¶
- Claim Key:
- 258¶
- Claim Value Type:
- bstr or int¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Hardware Model¶
- Claim Description:
- Model identifier for hardware¶
- JWT Claim Name:
- hwmodel¶
- Claim Key:
- 259¶
- Claim Value Type:
- bstr¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Hardware Version¶
- Claim Description:
- Hardware Version Identifier¶
- JWT Claim Name:
- hwversion¶
- Claim Key:
- 260¶
- Claim Value Type:
- array¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Uptime¶
- Claim Description:
- Uptime¶
- JWT Claim Name:
- uptime¶
- Claim Key:
- 261¶
- Claim Value Type:
- uint¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- OEM Authorized Boot¶
- Claim Description:
- Indicates whether the software booted was OEM authorized¶
- JWT Claim Name:
- oemboot¶
- Claim Key:
- 262¶
- Claim Value Type:
- bool¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Debug Status¶
- Claim Description:
- The status of debug facilities¶
- JWT Claim Name:
- dbgstat¶
- Claim Key:
- 263¶
- Claim Value Type:
- uint¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Location¶
- Claim Description:
- The geographic location¶
- JWT Claim Name:
- location¶
- Claim Key:
- 264¶
- Claim Value Type:
- map¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- EAT Profile¶
- Claim Description:
- The EAT profile followed¶
- JWT Claim Name:
- eat_profile¶
- Claim Key:
- 265¶
- Claim Value Type:
- uri or oid¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Submodules Section¶
- Claim Description:
- The section containing submodules¶
- JWT Claim Name:
- submods¶
- Claim Key:
- 266¶
- Claim Value Type:
- map¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Boot Count¶
- Claim Description:
- The number of times the entity or submodule has been booted¶
- JWT Claim Name:
- bootcount¶
- Claim Key:
- 267¶
- Claim Value Type:
- uint¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Boot Seed¶
- Claim Description:
- Identifies a boot cycle¶
- JWT Claim Name:
- bootseed¶
- Claim Key:
- 268¶
- Claim Value Type:
- bstr¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- DLOAs¶
- Claim Description:
- Certifications received as Digital Letters of Approval¶
- JWT Claim Name:
- dloas¶
- Claim Key:
- 269¶
- Claim Value Type:
- array¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Software Name¶
- Claim Description:
- The name of the software running in the entity¶
- JWT Claim Name:
- swname¶
- Claim Key:
- 270¶
- Claim Value Type:
- tstr¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Software Version¶
- Claim Description:
- The version of software running in the entity¶
- JWT Claim Name:
- swversion¶
- Claim Key:
- 271¶
- Claim Value Type:
- array¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Software Manifests¶
- Claim Description:
- Manifests describing the software installed on the entity¶
- JWT Claim Name:
- manifests¶
- Claim Key:
- 272¶
- Claim Value Type:
- array¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
- Claim Name:
- Measurements¶
- Claim Description:
- Measurements of the software, memory configuration, and such on the entity¶
- JWT Claim Name:
- measurements¶
- Claim Key:
- 273¶
- Claim Value Type:
- array¶
- Change Controller:
- IETF¶
- Reference:
- RFC 9711¶
10.3. UEID URNs Registered by This Document
IANA has registered the following new subtypes in the "DEV URN Subtypes" registry [IANA.DEV-URNs] under the "Device Identification" registry group; see [RFC9039].¶
The ABNF [RFC5234] [RFC7405] for these two URNs is as follows, where b64ueid is the base64url
10.4. CBOR Tag for Detached EAT Bundle Registered by This Document
In the "CBOR Tags" registry [IANA.cbor-tags], IANA has allocated the following tag from the Specification Required range, with the present document as the reference.¶
10.5. Intended Use Registry
IANA has created a new registry titled "Entity Attestation Token (EAT) Intended Uses" under the new "Remote Attestation Procedures (RATS)" registry group. The registry uses the Expert Review registration procedure [RFC8126].¶
Guidelines for designated experts:¶
The three columns for the registry are:¶
The following 5 values represent the initial content of the registry. Note that 0 will be marked as "reserved" for the CBOR value, and the maximum CBOR value for assignment is 255.¶
- 1 -- Generic:
- Generic attestation describes an application where the EAT consumer requires the most up-to-date security assessment of the attesting entity. It is expected that this is the most commonly used application of EAT.¶
- 2 -- Registration:
- Entities that are registering for a new service may be expected to provide an attestation as part of the registration process. This "intuse" setting indicates that the attestation is not intended for any use but registration.¶
- 3 -- Provisioning:
- Entities may be provisioned with different values or settings by an EAT consumer. Examples include key material or device management trees. The consumer may require an EAT to assess entity security state of the entity prior to provisioning.¶
- 4 -- Certificate Issuance:
- Certification Authorities (CAs) may require attestation results (which in a background check model might require receiving evidence to be passed to a verifier) to make decisions about the issuance of certificates. An EAT may be used as part of the certificate signing request (CSR).¶
- 5 -- Proof of Possession:
- An EAT consumer may require an
attestation as part of an accompanying proof
-of -possession (PoP) application. More precisely, a PoP transaction is intended to provide the recipient with cryptographical ly verifiable proof that the sender has possession of a key. This kind of attestation may be necessary to verify the security state of the entity storing the private key used in a PoP application.¶
11. References
11.1. Normative References
- [DLOA]
-
GlobalPlatform, "GlobalPlatform Card: Digital Letter of Approval", Public Release Version 1.0, GPC_SPE_095, , <https://
globalplatform >..org /wp -content /uploads /2015 /12 /GPC _Digital Letter Of Approval _v1 .0 .pdf -
IANA, "CBOR Tags", <https://
www >..iana .org /assignments /cbor -tags - [IANA
.COSE .Algorithms] -
IANA, "COSE Algorithms", <https://
www >..iana .org /assignments /cose - [IANA
.CWT .Claims] -
IANA, "CBOR Web Token (CWT) Claims", <https://
www >..iana .org /assignments /cwt - [IANA.DEV-URNs]
-
IANA, "DEV URN Subtypes", <https://
www >..iana .org /assignments /device -identification - [IANA
.JWT .Claims] -
IANA, "JSON Web Token Claims", <https://
www >..iana .org /assignments /jwt - [PEN]
-
IANA, "Private Enterprise Numbers (PENs)", <https://
www >..iana .org /assignments /enterprise -numbers / - [RFC2119]
-
Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10
.17487 , , <https:///RFC2119 www >..rfc -editor .org /info /rfc2119 - [RFC3986]
-
Berners-Lee, T., Fielding, R., and L. Masinter, "Uniform Resource Identifier (URI): Generic Syntax", STD 66, RFC 3986, DOI 10
.17487 , , <https:///RFC3986 www >..rfc -editor .org /info /rfc3986 - [RFC4517]
-
Legg, S., Ed., "Lightweight Directory Access Protocol (LDAP): Syntaxes and Matching Rules", RFC 4517, DOI 10
.17487 , , <https:///RFC4517 www >..rfc -editor .org /info /rfc4517 - [RFC4648]
-
Josefsson, S., "The Base16, Base32, and Base64 Data Encodings", RFC 4648, DOI 10
.17487 , , <https:///RFC4648 www >..rfc -editor .org /info /rfc4648 - [RFC5234]
-
Crocker, D., Ed. and P. Overell, "Augmented BNF for Syntax Specifications: ABNF", STD 68, RFC 5234, DOI 10
.17487 , , <https:///RFC5234 www >..rfc -editor .org /info /rfc5234 - [RFC7252]
-
Shelby, Z., Hartke, K., and C. Bormann, "The Constrained Application Protocol (CoAP)", RFC 7252, DOI 10
.17487 , , <https:///RFC7252 www >..rfc -editor .org /info /rfc7252 - [RFC7405]
-
Kyzivat, P., "Case-Sensitive String Support in ABNF", RFC 7405, DOI 10
.17487 , , <https:///RFC7405 www >..rfc -editor .org /info /rfc7405 - [RFC7515]
-
Jones, M., Bradley, J., and N. Sakimura, "JSON Web Signature (JWS)", RFC 7515, DOI 10
.17487 , , <https:///RFC7515 www >..rfc -editor .org /info /rfc7515 - [RFC7519]
-
Jones, M., Bradley, J., and N. Sakimura, "JSON Web Token (JWT)", RFC 7519, DOI 10
.17487 , , <https:///RFC7519 www >..rfc -editor .org /info /rfc7519 - [RFC8174]
-
Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10
.17487 , , <https:///RFC8174 www >..rfc -editor .org /info /rfc8174 - [RFC8259]
-
Bray, T., Ed., "The JavaScript Object Notation (JSON) Data Interchange Format", STD 90, RFC 8259, DOI 10
.17487 , , <https:///RFC8259 www >..rfc -editor .org /info /rfc8259 - [RFC8392]
-
Jones, M., Wahlstroem, E., Erdtman, S., and H. Tschofenig, "CBOR Web Token (CWT)", RFC 8392, DOI 10
.17487 , , <https:///RFC8392 www >..rfc -editor .org /info /rfc8392 - [RFC8610]
-
Birkholz, H., Vigano, C., and C. Bormann, "Concise Data Definition Language (CDDL): A Notational Convention to Express Concise Binary Object Representation (CBOR) and JSON Data Structures", RFC 8610, DOI 10
.17487 , , <https:///RFC8610 www >..rfc -editor .org /info /rfc8610 - [RFC8792]
-
Watsen, K., Auerswald, E., Farrel, A., and Q. Wu, "Handling Long Lines in Content of Internet-Drafts and RFCs", RFC 8792, DOI 10
.17487 , , <https:///RFC8792 www >..rfc -editor .org /info /rfc8792 - [RFC8949]
-
Bormann, C. and P. Hoffman, "Concise Binary Object Representation (CBOR)", STD 94, RFC 8949, DOI 10
.17487 , , <https:///RFC8949 www >..rfc -editor .org /info /rfc8949 - [RFC9052]
-
Schaad, J., "CBOR Object Signing and Encryption (COSE): Structures and Process", STD 96, RFC 9052, DOI 10
.17487 , , <https:///RFC9052 www >..rfc -editor .org /info /rfc9052 - [RFC9090]
-
Bormann, C., "Concise Binary Object Representation (CBOR) Tags for Object Identifiers", RFC 9090, DOI 10
.17487 , , <https:///RFC9090 www >..rfc -editor .org /info /rfc9090 - [RFC9165]
-
Bormann, C., "Additional Control Operators for the Concise Data Definition Language (CDDL)", RFC 9165, DOI 10
.17487 , , <https:///RFC9165 www >..rfc -editor .org /info /rfc9165 - [RFC9334]
-
Birkholz, H., Thaler, D., Richardson, M., Smith, N., and W. Pan, "Remote ATtestation procedureS (RATS) Architecture", RFC 9334, DOI 10
.17487 , , <https:///RFC9334 www >..rfc -editor .org /info /rfc9334 - [RFC9393]
-
Birkholz, H., Fitzgerald
-Mc , Schmidt, C., and D. Waltermire, "Concise Software Identification Tags", RFC 9393, DOI 10Kay, J. .17487 , , <https:///RFC9393 www >..rfc -editor .org /info /rfc9393 - [ThreeGPP.IMEI]
-
3GPP, "Numbering, addressing and identification", Version 19, 3GPP TS 23.003, , <https://
portal >..3gpp .org /desktopmodules /Specifications /Specification Details .aspx ?specification Id =729 - [W3C.GeoLoc]
-
Cáceres, M. and R. Grant, "Geolocation", W3C Recommendation, , <https://
www >..w3 .org /TR /geolocation / - [WGS84]
-
National Geospatial
-Intelligence , "Department of Defense World Geodetic System 1984: Its Definition and Relationships with Local Geodetic Systems", NGAAgency (NGA) .STND , , <https://.0036 _1 .0 .0 _WGS84 nsgreg >..nga .mil /doc /view ?i =4085
11.2. Informative References
- [BirthdayAttack]
-
Wikipedia, "Birthday attack", , <https://
en >..wikipedia .org /w /index .php ?title =Birthday _attack &oldid =1249270346 - [CBOR.Certs]
-
Mattsson, J. P., Selander, G., Raza, S., Höglund, J., and M. Furuhed, "CBOR Encoded X.509 Certificates (C509 Certificates)", Work in Progress, Internet-Draft, draft
-ietf , , <https://-cose -cbor -encoded -cert -13 datatracker >..ietf .org /doc /html /draft -ietf -cose -cbor -encoded -cert -13 - [CC-Example]
-
Eurosmart, "Secure Sub-System in System-on-Chip (3S in SoC) Protection Profile", Version 1.8, , <https://
commoncriteriapo >.rtal .org /nfs /ccpfiles /files /ppfiles /pp0117V2b _pdf .pdf - [EAT-GitHub]
-
"The Entity Attestation Token (EAT)", commit 62c726b, , <https://
github >..com /ietf -rats -wg /eat - [EAT
.media -types] -
Lundblade, L., Birkholz, H., and T. Fossati, "EAT Media Types", Work in Progress, Internet-Draft, draft
-ietf , , <https://-rats -eat -media -type -12 datatracker >..ietf .org /doc /html /draft -ietf -rats -eat -media -type -12 - [GP-Example]
-
GlobalPlatform, "GlobalPlatform Technology: TEE Certification Process", Public Release Version 2.0, GP_PRO_023, , <https://
globalplatform >..org /wp -content /uploads /2021 /01 /GP _TEECertificatio n Process _v2 .0 _Public Release .pdf - [IEEE-RA]
-
IEEE, "IEEE Registration Authority", <https://
standards >..ieee .org /products -services /regauth /index .html - [IEEE.802-2014]
-
IEEE, "IEEE Standard for Local and Metropolitan Area Networks: Overview and Architecture", IEEE Std 802-2014, DOI 10
.1109 , , <https:///IEEESTD .2014 .6847097 ieeexplore >..ieee .org /document /6847097 - [IEEE.802.1AR]
-
IEEE, "IEEE Standard for Local and Metropolitan Area Networks - Secure Device Identity", IEEE Std 802.1AR-2018, DOI 10
.1109 , , <https:///IEEESTD .2018 .8423794 ieeexplore >..ieee .org /document /8423794 - [JTAG]
-
IEEE, "IEEE Standard for Reduced-Pin and Enhanced
-Functionality , IEEE Std 1149.7-2009, DOI 10Test Access Port and Boundary-Scan Architecture" .1109 , , <https:///IEEESTD .2010 .5412866 ieeexplore >..ieee .org /document /5412866 - [OUI.Guide]
-
IEEE, "Guidelines for Use of Extended Unique Identifier (EUI), Organizationall
y , , <https://Unique Identifier (OUI), and Company ID (CID)" standards >..ieee .org /content /dam /ieee -standards /standards /web /documents /tutorials /eui .pdf - [OUI.Lookup]
-
IEEE, "IEEE Registration Authority: Assignments", <https://
regauth >..standards .ieee .org /standards -ra -web /pub /view .html#registries - [RFC4949]
-
Shirey, R., "Internet Security Glossary, Version 2", FYI 36, RFC 4949, DOI 10
.17487 , , <https:///RFC4949 www >..rfc -editor .org /info /rfc4949 - [RFC8126]
-
Cotton, M., Leiba, B., and T. Narten, "Guidelines for Writing an IANA Considerations Section in RFCs", BCP 26, RFC 8126, DOI 10
.17487 , , <https:///RFC8126 www >..rfc -editor .org /info /rfc8126 - [RFC9039]
-
Arkko, J., Jennings, C., and Z. Shelby, "Uniform Resource Names for Device Identifiers", RFC 9039, DOI 10
.17487 , , <https:///RFC9039 www >..rfc -editor .org /info /rfc9039 - [RFC9360]
-
Schaad, J., "CBOR Object Signing and Encryption (COSE): Header Parameters for Carrying and Referencing X.509 Certificates", RFC 9360, DOI 10
.17487 , , <https:///RFC9360 www >..rfc -editor .org /info /rfc9360 - [RFC9562]
-
Davis, K., Peabody, B., and P. Leach, "Universally Unique IDentifiers (UUIDs)", RFC 9562, DOI 10
.17487 , , <https:///RFC9562 www >..rfc -editor .org /info /rfc9562 - [UCCS]
-
Birkholz, H., O'Donoghue, J., Cam-Winget, N., and C. Bormann, "A CBOR Tag for Unprotected CWT Claims Sets", Work in Progress, Internet-Draft, draft
-ietf , , <https://-rats -uccs -12 datatracker >..ietf .org /doc /html /draft -ietf -rats -uccs -12
Appendix A. Examples
Most examples are shown as a Claims-Set that would be a payload for a CWT, a JWT, a detached EAT bundle, or future token types. The signing is left off so the Claims-Set is easier to see. Some examples of signed tokens are also given.¶
A.1. Claims Set Examples
A.1.1. Simple TEE Attestation
This is a simple attestation of a TEE; it includes a manifest that is a payload CoSWID to describe the TEE's software.¶
A.1.5. Software Measurements of an IoT Device
This is a simple token that might be for an IoT device. It includes CoSWID format measurements of the SW. The CoSWID is byte string wrapped in the token and is also shown in diagnostic form.¶
A.1.6. Attestation Results in JSON
This is a JSON-encoded payload that might be the output of a verifier that evaluated the IoT Attestation example immediately above.¶
This particular verifier knows enough about the TEE attester to be able to pass claims such as debug status directly through to the relying party. The verifier also knows the reference values for the measured software components and is able to check them. It informs the relying party that they were correct in the "measres" claim. "Trustus Verifications" is the name of the service that verifies the software component measurements.¶
A.2. Signed Token Examples
A.2.1. Basic CWT Example
This is a simple CWT-format token signed with the Elliptic Curve Digital Signature Algorithm (ECDSA).¶
A.2.2. CBOR-Encoded Detached EAT Bundle
In this detached EAT bundle, the main token is produced by a hardware (HW) attestation block. The detached Claims-Set is produced by a TEE and is largely identical to the simple TEE example in Appendix A.1.1. The TEE digests its Claims-Set and feeds that digest to the HW block.¶
In a better example, the attestation produced by the HW block would be a CWT and thus signed and secured by the HW block. Since the signature covers the digest from the TEE, that Claims-Set is also secured.¶
The detached EAT bundle itself can be assembled by untrusted software.¶
A.2.3. JSON-Encoded Detached EAT Bundle
In this bundle, there are two detached Claims-Sets: "Audio Subsystem" and "Graphics Subsystem". The JWT at the start of the bundle has detached signature submodules with hashes that cover these two Claims-Sets. The JWT itself is protected using the Hashed Message Authentication Code (HMAC) with a key of "xxxxxx".¶
Appendix B. UEID Design Rationale
B.1. Collision Probability
This calculation is to determine the probability of a collision of type 0x01 UEIDs given the total possible entity population and the number of entities in a particular entity management database.¶
Three different-sized databases are considered. The number of devices per person roughly models non-personal devices such as traffic lights, devices in stores they shop in, facilities they work in, and so on, even considering individual light bulbs. A device may have individually attested subsystems, for example, parts of a car or a mobile phone. It is assumed that the largest database will have at most 10% of the world's population of devices. Note that databases that handle more than a trillion records exist today.¶
The trillion-record database size models an easy-to-imagine reality
over the next decades. The quadrillion
Note that the items counted here certainly do not have IP addresses and are not individually connected to the network. They may be connected to internal buses, via serial links, via Bluetooth, and so on. This is not the same problem as sizing IP addresses.¶
This is conceptually similar to the Birthday Problem where m is the number of possible birthdays (always 365) and k is the number of people. It is also conceptually similar to the Birthday Attack where collisions of the output of hash functions are considered.¶
The proper formula for the collision calculation is:¶
For this calculation:¶
However, for the very large values involved here, this formula requires floating-point precision higher than commonly available in calculators and software, so this simple approximation is used. See [BirthdayAttack].¶
For this calculation:¶
- p:
- Collision probability¶
- n:
- Total population based on number of bits in UEID¶
- k:
- Population in a database¶
Next, to calculate the probability of a collision occurring in one year's operation of a database, it is assumed that the database size is in a steady state and that 10% of the database changes per year. For example, a trillion record database would have 100 billion states per year. Each of those states has the above calculated probability of a collision.¶
This assumption is a worst-case scenario since it assumes that each state of the database is completely independent from the previous state. In reality, this is unlikely as state changes will be the addition or deletion of a few records.¶
The following table gives the time interval until there is a probability of a collision, which is based on there being one tenth of the number of states per year as the number of records in the database.¶
For this calculation:¶
Clearly, 128 bits is enough for the near future, thus the requirement that type 0x01 UEIDs be a minimum of 128 bits.¶
There is no requirement for 256 bits today as quadrillion
B.2. No Use of UUID
A UEID is not a Universally Unique Identifier (UUID) [RFC9562] by conscious choice for the following reasons.¶
UUIDs are limited to 128 bits, which may not be enough for some future use cases.¶
Today, cryptographic
Version 4 UUIDs do allow for the use of such cryptographic
The design of UUID accommodates the construction of a unique identifier by the combination of several identifiers that separately do not provide sufficient uniqueness.
The design philosophy underlying UEID assumes that this construction is no longer needed, in particular because cryptographic
Note also that a type 2 UEID (EUI/MAC) is only 7 bytes whereas a UUID is 16.¶
Appendix C. EAT Relation to IEEE.802.1AR Secure Device Identity (DevID)
This section describes several distinct ways in which an IEEE Initial Device Identifier (IDevID) [IEEE.802.1AR] relates to EAT, particularly to UEID and SUEID.¶
[IEEE.802.1AR] orients around the definition of an implementation called a "DevID Module". It describes how IDevIDs and LDevIDs are stored, protected, and accessed using a DevID Module. A particular level of defense against attack that should be achieved to be a DevID is defined here. The intent is that IDevIDs and LDevIDs can be used with any network protocol or message format. In these protocols and message formats, the DevID secret is used to sign a nonce or similar to prove the association of the DevID certificates with the device.¶
By contrast, EAT standardizes a message format that is sent to a relying party, the very thing that is not defined in [IEEE.802.1AR]. Nor does EAT give details on how keys, data, and such are stored, protected, and accessed. EAT is intended to work with a variety of different on-device implementations ranging from minimal protection of assets to the highest levels of asset protection. It does not define any particular level of defense against attack; instead, it provides a set of security considerations.¶
EAT and DevID can be viewed as complimentary when used together or as competing to provide a device identity service.¶
C.1. DevID Used with EAT
As described above, EAT standardizes a message format, but [IEEE.802.1AR] does not. Vice versa, EAT does not define a device implementation, but DevID does.¶
Hence, EAT can be the message format that a DevID is used with. The DevID secret becomes the attestation key used to sign EATs, and the DevID and its certificate chain become the endorsement sent to the verifier.¶
In this case, the EAT and the DevID are likely to both provide a device identifier (e.g., a serial number). In the EAT, it is the UEID (or SUEID). In the DevID (used as an endorsement), it is a device serial number included in the subject field of the DevID certificate. For this use, it is a good idea for the serial numbers to be the same or for the UEID to be a hash of the DevID serial number.¶
C.2. How EAT Provides an Equivalent Secure Device Identity
The UEID, SUEID, and other claims such as OEM ID are equivalent to the secure device identity that is put into the subject field of a DevID certificate. These EAT claims can represent all the same fields and values that can be put in a DevID certificate subject. EAT explicitly and carefully defines a variety of useful claims.¶
EAT secures the conveyance of these claims by having them signed on the device by the attestation key when the EAT is generated. EAT also signs the nonce that gives freshness at this time. Since these claims are signed for every EAT generated, they can include things that vary over time such as GPS location.¶
DevID secures the device identity fields by embedding them in a certificate and signing it. The certificate is created once during manufacturing and remains unchanged.¶
So in one case, the signing of the identity happens on the device, and in the other case, it happens in a manufacturing facility. However, in both cases, the signing of the nonce that proves the binding to the actual device happens on the device.¶
While EAT does not specify how the signing keys, signature process, and storage of the identity values should be secured against attack, an EAT implementation may have equal defenses against attack. One reason EAT uses CBOR is because it is simple enough that a basic EAT implementation can be constructed entirely in hardware. This allows EAT to be implemented with the strongest defenses possible.¶
C.3. An X.509 Format EAT
It is possible to define a way to encode EAT claims in an X.509 certificate. For example, the EAT claims might be mapped to X.509 v3 extensions. It is even possible to stuff a whole CBOR-encoded unsigned EAT token into an X.509 certificate.¶
If that X.509 certificate is an IDevID or LDevID, it becomes another way to use EAT and DevID together.¶
Note that the DevID must still be used with an authentication protocol that has a nonce or equivalent. The EAT here is not being used as the protocol to interact with the relying party.¶
C.4. Device Identifier Permanence
In terms of permanence, an IDevID is similar to a UEID in that they do not change over the life of the device. They cease to exist only when the device is destroyed.¶
An SUEID is similar to an LDevID. They change on device life-cycle events.¶
[IEEE.802.1AR] describes much of this permanence as resistant to attacks that seek to change the ID. IDevID permanence can be described this way because [IEEE.802.1AR] is oriented around the definition of an implementation with a particular level of defense against attack.¶
EAT is not defined around a particular implementation and must work on a range of devices that have a range of defenses against attack. For EAT, permanence is not defined in terms of resistance to attacks. Instead, it is defined in the context of operational functionality and the device life cycle.¶
Appendix D. CDDL for CWT and JWT
[RFC8392] was published before CDDL was available and thus is specified in prose, not CDDL. In the following example, CDDL specifies CWT as it is needed to complete this specification. This CDDL also covers the Claims-Set for JWT.¶
Note that Section 4.3.1 requires that the "iat" claim be the type ~time-int (Section 7.2.1), not the type ~time when it is used in an EAT as floating-point values are not allowed for the "iat" claim in EAT.¶
The COSE-related types in this CDDL are defined in [RFC9052].¶
This, however, is NOT a normative or standard definition of CWT or JWT in CDDL. The prose in CWT and JWT remains the normative definition. See also [UCCS].¶
Appendix E. New Claim Design Considerations
The following are design considerations that may be helpful to take into account when creating new EAT claims. This is the product of discussion in the RATS Working Group.¶
EAT reuses the CWT and JWT claims registries. There is no registry exclusively for EAT claims. This is not an update to the expert review criteria for the JWT and CWT claims registries as that would be an overreach for this document.¶
E.1. Interoperability and Relying Party Orientation
It is a broad goal that EATs can be processed by relying parties in a general way regardless of the type, manufacturer, or technology of the device from which they originate. It is a goal that there be general-purpose verification implementations that can verify tokens for large numbers of use cases with special cases and configurations for different device types. This is a goal of interoperabilit
This is a lofty goal and difficult to achieve broadly as it requires careful definition of claims in a technology
E.2. Operating System and Technology Neutral
Claims should be defined such that they are not specific to an operating system. They should be applicable to multiple large high-level operating systems from different vendors as well as to multiple small embedded operating systems from multiple vendors and everything in between.¶
Claims should not be defined such that they are specific to a software environment or programming language.¶
Claims should not be defined such that they are specific to a chip or particular hardware. For example, they should not just be the contents of some HW status register as it is unlikely that the same HW status register with the same bits exists on a chip of a different manufacturer.¶
The boot and debug state claims in this document are an example of a claim that has been defined in this neutral way.¶
E.3. Security Level Neutral
Many use cases will have EATs generated by some of the most secure hardware and software that exists. Secure Elements and smart cards are examples of this. However, EAT is intended for use in low-security use cases the same as high-security use cases. For example, an app on a mobile device may generate EATs on its own.¶
Claims should be defined and registered based on whether they are useful and interoperable, not based on security level. In particular, there should be no exclusion of claims because they are only used in low-security environments.¶
E.4. Reuse of Extant Data Formats
Where possible, claims should use data items, identifiers, and formats that are already standardized. This takes advantage of the expertise put into creating those formats and improves interoperabilit
Often, extant claims will not be defined in an encoding or serialization format used by EAT. It is preferred to define a CBOR and JSON encoding for them so that EAT implementations do not require a plethora of encoders and decoders for serialization formats.¶
In some cases, it may be better to use the encoding and serialization as is.
For example, signed X.509 certificates and Certificate Revocation Lists (CRLs) can be carried as is in a byte string.
This retains interoperabilit
E.5. Proprietary Claims
It is not always possible or convenient to achieve the above goals, so the definition and use of proprietary claims is an option.¶
For example, a device manufacturer may generate a token with proprietary claims intended only for verification by a service offered by that device manufacturer. This is a supported use case.¶
In many cases, proprietary claims will be the easiest and most obvious way to proceed; however, for better interoperabilit
Appendix F. Endorsements and Verification Keys
The verifier must possess the correct key when it performs the cryptographic part of an EAT verification (e.g., verifying the COSE/JOSE signature). This section describes several ways to identify the verification key. There is not one standard method.¶
The verification key itself may be a public key, a symmetric key, or something complicated in the case of a scheme such as Direct Anonymous Attestation (DAA).¶
RATS Architecture [RFC9334] describes what is called an endorsement. This is an input to the verifier that is usually the basis of the trust placed in an EAT and the attester that generated it. It may contain the public key for verification of the signature on the EAT, and it may contain implied claims, i.e., those that are passed on to the relying party in attestation results.¶
There is not yet any standard format(s) for an endorsement. One format that may be used for an endorsement is an X.509 certificate. Endorsement data such as reference values and implied claims can be carried in X.509 v3 extensions. In this use, the public key in the X.509 certificate becomes the verification key, so identification of the endorsement is also identification of the verification key.¶
The verification key identification and establishment of trust in the EAT and the attester may also be by some other means than an endorsement.¶
For the components (attester, verifier, relying party, etc.) of a particular end-to-end attestation system to reliably interoperate, its definition should specify how the verification key is identified. Usually, this will be in the profile document for a particular attestation system.¶
See also the security considerations in Section 9.6.¶
F.1. Identification Methods
Following is a list of possible methods of key identification. A specific attestation system may employ any one of these or one not listed here.¶
The following assumes endorsements are X.509 certificates or equivalent and thus does not mention or define any identifier for endorsements in other formats. If such an endorsement format is created, new identifiers for them will also need to be created.¶
F.1.1. COSE/JWS Key ID
The COSE standard header parameter for Key ID (kid) may be used; see [RFC9052] and [RFC7515].¶
COSE leaves the semantics of the key ID open-ended. It could be a record locator in a database, a hash of a public key, an input to a Key Derivation Function (KDF), an Authority Key Identifier (AKI) for an X.509 certificate, or other. The profile document should specify what the key ID's semantics are.¶
F.1.2. JWS and COSE X.509 Header Parameters
COSE X.509 [RFC9360] and JSON Web Signature [RFC7515] define several header parameters (x5t, x5u,...) for referencing or carrying X.509 certificates, any of which may be used.¶
The X.509 certificate may be an endorsement and thus carrying additional input to the verifier. It may be just an X.509 certificate, not an endorsement. The same header parameters are used in both cases, and it is up to the attestation system design and the verifier to determine which.¶
F.1.3. CBOR Certificate COSE Header Parameters
Compressed X.509 and CBOR Native certificates are defined by CBOR Certificates [CBOR.Certs]. These are semantically compatible with X.509 and therefore can be used as an equivalent to X.509 as described above.¶
These are identified by their own header parameters (c5t, c5u, etc.).¶
F.1.4. Claim-Based Key Identification
For some attestation systems, a claim may be reused as a key identifier. For example, the UEID uniquely identifies the entity and therefore can work well as a key identifier or endorsement identifier.¶
An advantage of this is that key identification requires no additional bytes in the EAT and makes the EAT smaller.¶
A disadvantage of this is that the unverified EAT must be substantially decoded to obtain the identifier since the identifier is in the COSE/JOSE payload, not in the headers.¶
Contributors
Many thanks to the following for their contributions to earlier draft versions of this document:¶