Internet-Draft | device enrollment | October 2020 |
Richardson | Expires 10 April 2021 | [Page] |
This document provides an overview of enrollment or imprinting mechanisms in current IETF protocols.¶
This document is being worked on in the ANIMA-WG, and on github at: https://github.com/anima-wg/enrollment-roadmap¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 10 April 2021.¶
Copyright (c) 2020 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://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.¶
There are numerous mechanisms being proposed to solve the problem of securely introducing a new devices into an existing managed network.¶
This document provides an overview of the different mechanisms showing what technologies are common.¶
The document starts with a diagram showing the various components and how they go together to form five enrollment scenarios.¶
This diagram is taken from [I-D.ietf-anima-bootstrapping-keyinfra], which is where this work started.¶
+------------------------+ +--------------Drop Ship--------------->| Vendor Service | | +------------------------+ | | M anufacturer| | | | A uthorized |Ownership| | | S igning |Tracker | | | A uthority | | | +--------------+---------+ | ^ | | BRSKI- V | MASA +-------+ ............................................|... | | . | . | | . +------------+ +-----------+ | . | | . | | | | | . |Pledge | . | Circuit | | Domain <-------+ . | | . | Proxy | | Registrar | . | <-------->............<-------> (PKI RA) | . | | | BRSKI-EST | | . | | . | | +-----+-----+ . |IDevID | . +------------+ | EST RFC7030 . | | . +-----------------+----------+ . | | . | Key Infrastructure | . | | . | (e.g. PKI Certificate | . +-------+ . | Authority) | . . +----------------------------+ . . . ................................................ "Domain" components¶
Five major components are described:¶
.-------------------. . generic (YANG) . .----------------. voucher semantics . | '-------------------' | .--- | | 6tisch 6tisch Tran|ition to | minimal zero Con|trained | security touch Bo|tstrap BRSKI | Netconf .----------..-----------..---|-------..------------. |-------------. | || || v || | v | | ||..................................................... | | ||. constrained voucher . JSON format voucher . | | ||. (anima) . (RFC8366) . | | ||..................................................... | | || || || | | | | |.............| ...................................... | | |. COSE .| . standard signature (CMS - RFC5652) . | | |. rfc8152 .| ...................................... | | |.............| || | | | | || ............................| | | | |......... . EST-COAPS .. EST-HTTPS .| | | | |. EDHOC . . w/DTLS sec. .. TLS sec. .| | | |..................................................| | | |. constrained object . || || | | | |. security (OSCORE) . || || | |.............| |...................... || ||............| |. call-home .| | || ||......... ||. circuit .| |. ssh/tls .| |........................|. DTLS . ||. proxy .| |. .usbkey .| |. CoAP proxy,stateless .|. proxy . ||. stateful .| |.............| |..................................................| | | | ||. IPIP proxy,stateless .| | | | ||......................................| | | '----------''-----------''-----------''------------' '-------------' ^ ^ ^ ^ | \ | | | '. .--------------' | | | | | | | | .--------------. | | . manufacturer . | | . authorized . '---------------|--. signing . . authority . . (MASA) . '--------------'¶
The abstract semantics of the voucher, described in YANG, are in [RFC8366].¶
The semantics of the constrained voucher, represented in CBOR, are described in [I-D.ietf-anima-constrained-voucher].¶
The semantics of the basic voucher, represented in JSON, are described in [RFC8366].¶
In constrained systems the voucher is signed using the COSE mechanism described in [RFC8152]. This is to be replaced with [I-D.ietf-cose-rfc8152bis-algs] (now in RFC-EDITOR Q) and [I-D.ietf-cose-rfc8152bis-struct] (in WGLC, being revised to remove countersignatures).¶
In un-constrained systems the voucher is signed using the Cryptographic Message Syntax (CMS) described in [RFC5652].¶
On constrained and challenged networks, the session key management can be formed by [I-D.ietf-lake-edhoc].¶
This document has a WG called LAKE.¶
The CoAP-EST layer on top is described by [I-D.ietf-ace-coap-est]¶
On unconstrained networks, the session key management is provided by [RFC6347]. The CoAP-EST layer on top is described by [I-D.ietf-ace-coap-est], which is in the RFC-EDITOR Q, waiting for DTLS 1.3.¶
The ACE WG adopted this document, and published it.¶
On unconstrained networks with unconstrained nodes, the EST layer and session key management is described by [RFC7030] as modified by [I-D.ietf-anima-bootstrapping-keyinfra] (BRSKI).¶
BRSKI is in the RFC-EDITOR Q, waiting for [I-D.ietf-anima-autonomic-control-plane], which is awaiting IESG go-ahead.¶
On constained networks with constrained nodes, the CoAP transactions are secured by [I-D.ietf-core-object-security] using symmetric keys. The symmetric key may be pre-shared (for 6tisch minimal security), or MAY be derived using EDHOC.¶
The document [I-D.selander-ace-ake-authz]. Version -01 expired in September 2020, but is expected to be reposted for discussion in the ACE WG.¶
Traffic between the Pledge and the JRC does not flow directly as the pledge does not typically have a globally reachable address, nor does it have any network access keys (whether WEP, WPA, 802.1x, or 802.15.4 keys).¶
Communication between the pledge and JRC is mediated by a proxy. This is primarily to protect the network against attacks. The proxy mechanism is provided by as many nodes as can afford to as a benefit to the network, and therefore MUST be as light weight as possible.¶
There are therefore stateless mechanisms and stateful mechanisms. The costs of the various methods is analysized in [I-D.richardson-anima-state-for-joinrouter].¶
The CoAP proxy mechanism uses the OSCORE Context Hint to statelessly store the address of the proxy within the CoAP structure. It is described in [I-D.ietf-6tisch-minimal-security].¶
A DTLS specific mechanism for COAPS, is described in [I-D.vanderstok-anima-constrained-join-proxy].¶
An IPIP proxy mechanism uses a layer of IP-in-IP header (protocol 98) to encapsulate the traffic between Join Proxy and JRC. It has some complexities to implement on typical POSIX platforms.¶
At one point, it was described in [I-D.ietf-6tisch-dtsecurity-zerotouch-join], in an Appendix. Another home for the text is desired.¶
The circuit proxy method utilitizes either an application layer gateway (which in canonical 1990-era implementation requires a process per connection), or the use of NAT66. It maintains some state for each connection whether TCP or UDP.¶
It is this most expensive and most easily abused, but also the most widely available, code-wise.¶
The NETCONF call-home mechanism assumes that the device can get basic connectivity, enough for an out "outgoing" TCP connection to the manufacturer.¶
The NETCONF WG is describing this in [I-D.ietf-netconf-zerotouch] document.¶
The NETCONF Zerotouch mechanism provides configuration and ownership information by having the pledge "call home" to a location determined by a mix of local hints (DHCPv4, DHCPv6, and mDNS), as well as built-in anchors. Additionally, ownership vouchers can be alternatively distributed by portable storage such as USB key.¶
Upon reaching a validated call-home server, Zerotouch typically "reverses" the connection providing either an SSH or TLS connection to the pledge device such that it can be configured automatically.¶
Zerotouch relies upon either open or very easy access to network connectivity, along with the ability to make an outgoing TCP connection to the Internet, or to the provided local configuration agent.¶
Zerotouch is seen as an updated version of TR-69 by some, appropriate for configuration of residential appliances which are drop-shiped by ISPs or other service providers to homes. That is not the only targetted use.¶
The ANIMA WG is describing BRSKI in [I-D.ietf-anima-bootstrapping-keyinfra] document.¶
The ANIMA WG does enrollment with the aim of creating a secure channel with a public-key infrastructure (PKI) Registrar. The secured channel is used to perform Enrollment over Secure Transport (EST, RFC7030). The real goal is the enrollment a new device which was probably been drop-shipped into ANIMA's Autonomic Control Plane.¶
That is, after the pledge has been assigned a certificate within the (autonomic) domain, the device (no longer a pledge) will then form secure channels (typically using IKEv2 to key an IPsec channel). On top of that channel a routing protocol (RPL) is run to form the Autonomic Control Plane (ACP). The ACP is then used as a management network with which to configure the new device.¶
BRSKI is therefore step one of a number of steps, the ultimate goal of which is to bring the pledge into the ACP as a new device.¶
BRSKI itself does not provide for any direct keying of the network (802.11 WEP/WPA, or 802.15.4 security). The provision of a domain certificate at each node can, however, be used to do that kind of keying: for instance 802.15.9 provides for use of HIP and IKEv2 to key 802.15.4 networks.¶
It is distinguished from BRSKI in that it uses DTLS (rather than TLS) and constrained (CBOR) vouchers. It is distinguished from 6tisch Zero Touch in that uses CMS to sign rather than COSE.¶
The ACE WG has adopted [I-D.ietf-ace-coap-est], but this is not a sufficient.¶
The constrained version of BRSKI is current described as part of [I-D.ietf-anima-constrained-voucher].¶
The use of this technology slice is attractive to IoT deployments where the devices are not battery powered (lighting for instance, AMI for electric meters). In such situations, the processors in each device have significantly more resources, and in particular far more code space available. The use of DTLS to secure application traffic (as described in the ACE documents) is already common, and so reuse of DTLS is desireable from a code point of view.¶
However, the network capacity is still limited so TCP and CBOR are still important. The network may also contain extremely constrained devices (kinetically powered light switches for n instance).¶
BRSKI depends upon a local join proxy to direct the pledge device to the location of the Registrar. Not only does this require that a join proxy be widely available, but it also assumes that the owner is able to operate a Registrar.¶
[I-D.friel-anima-brski-cloud] deals with two use cases:¶
BRSKI depends the join proxy being available in the location where the devices are installed, and for that proxy to also be able to communicate to the Registrar (possibly over the Internet).¶
In a number of environments, such as new construction, a number of devices need to go through an onboarding process, but there is no connectivity available. (Possibly not even LTE/3G due to metal walls, lack of towers, etc.).¶
The [I-D.ietf-anima-brski-async-enroll] proposes two amendments to BRSKI:¶
The 6tisch WG is describing this in [I-D.ietf-6tisch-dtsecurity-zerotouch-join] document.¶
The 6tisch use case consists of very constrained devices with very constrained networks. Code space in the devices is larger than typical class 2, but the devices are typically battery powered and wish to sleep significantly.¶
The use of CBOR for vouchers, COSE to sign the vouchers saves significant network bandwidth and code space. Both CBOR, COSE and OSCORE are typically already in use for the application support. The addition of EDHOC to provide asymmetric bootstrap of OSCORE completes the suite of constrained security protocols.¶
The 6tisch WG is describing this in [I-D.ietf-6tisch-minimal-security] document. This mechanism does enrollment in a single request/response message, but requires at least one "touch" to pre-share symmetric keys.¶
The 6tisch WG felt that the number of round trips required to do EDHOC, and the size of the vouchers required an even simpler protocol. As existing 6tisch-type technology is typically deployed with network keys built-in at manufacturer time (no "drop-ship"), the switch from a static network key to a PSK for authenticaiton is considered an incremental improvement.¶
All other methods are considered zero "touch".¶
[I-D.ietf-6tisch-minimal-security] is in the RFC-EDITOR Q, waiting for core-stateless on which is depends to leave the WG.¶
A goal of this document is to provide some guidance in selecting which enrollment profile to use for a given scenario. This section tries to provide some constrasting comments between the various mechanisms.¶
(BUT, it does not yet do that..)¶
This document includes a tradeoff of the security attributes of the different protocols, and so the entire document contains security advice.¶
This document does not define any new protocols, and therefore does not have any IANA Considerations.¶
TBD¶