Constrained Voucher Profile for Bootstrapping Protocols
draft-richardson-anima-ace-constrained-voucher-02
6tisch Working Group M. Richardson
Internet-Draft Sandelman Software Works
Intended status: Informational December 11, 2017
Expires: June 14, 2018
Constrained Voucher Profile for Bootstrapping Protocols
draft-richardson-anima-ace-constrained-voucher-02
Abstract
This document defines a strategy to securely assign a pledge to an
owner, using an artifact signed, directly or indirectly, by the
pledge's manufacturer. This artifact is known as a "voucher".
This document builds upon the work in [I-D.ietf-anima-voucher],
encoding the resulting artifact in CBOR. Use with two signature
technologies are described.
Additionally, this document explains how constrained vouchers may be
transported in the [I-D.vanderstok-ace-coap-est] protocol.
Status of This Memo
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 June 14, 2018.
Copyright Notice
Copyright (c) 2017 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
Richardson Expires June 14, 2018 [Page 1]
Internet-Draft Constrained Vouchers December 2017
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.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Requirements Language . . . . . . . . . . . . . . . . . . . . 3
4. Survey of Voucher Types . . . . . . . . . . . . . . . . . . . 3
5. Artifacts . . . . . . . . . . . . . . . . . . . . . . . . . . 4
5.1. Voucher Request artifact . . . . . . . . . . . . . . . . 4
5.1.1. Tree Diagram . . . . . . . . . . . . . . . . . . . . 4
5.1.2. SID values . . . . . . . . . . . . . . . . . . . . . 5
5.1.3. YANG Module . . . . . . . . . . . . . . . . . . . . . 5
5.1.4. Example voucher request artifacts . . . . . . . . . . 6
5.2. Voucher artifact . . . . . . . . . . . . . . . . . . . . 6
5.3. Tree Diagram . . . . . . . . . . . . . . . . . . . . . . 7
5.4. SID values . . . . . . . . . . . . . . . . . . . . . . . 7
5.5. YANG Module . . . . . . . . . . . . . . . . . . . . . . . 7
5.5.1. Example voucher artifacts . . . . . . . . . . . . . . 9
5.6. CMS format voucher and voucher-request artifacts . . . . 9
5.7. COSE format voucher and voucher-request artifacts . . . . 10
6. Design Considerations . . . . . . . . . . . . . . . . . . . . 10
7. Security Considerations . . . . . . . . . . . . . . . . . . . 10
7.1. Clock Sensitivity . . . . . . . . . . . . . . . . . . . . 10
7.2. Protect Voucher PKI in HSM . . . . . . . . . . . . . . . 10
7.3. Test Domain Certificate Validity when Signing . . . . . . 10
8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 11
8.1. The IETF XML Registry . . . . . . . . . . . . . . . . . . 11
8.2. The YANG Module Names Registry . . . . . . . . . . . . . 11
8.3. The SMI Security for S/MIME CMS Content Type Registry . . 11
8.4. The SID registry . . . . . . . . . . . . . . . . . . . . 11
8.5. CoAP Content-Type . . . . . . . . . . . . . . . . . . . . 12
9. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 12
10. References . . . . . . . . . . . . . . . . . . . . . . . . . 12
10.1. Normative References . . . . . . . . . . . . . . . . . . 12
10.2. Informative References . . . . . . . . . . . . . . . . . 13
Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 14
1. Introduction
Enrollment of new nodes into constrained networks with constrained
nodes present unique challenges.
Show full document text