<?xml version='1.0' encoding='utf-8'?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" version="3" category="std" consensus="true" docName="draft-ietf-anima-bootstrapping-keyinfra-45" indexInclude="true" ipr="trust200902" number="8995" prepTime="2021-05-21T13:01:44" scripts="Common,Latin" sortRefs="true" submissionType="IETF" symRefs="true" tocDepth="3" tocInclude="true" xml:lang="en">
  <link href="https://datatracker.ietf.org/doc/draft-ietf-anima-bootstrapping-keyinfra-45" rel="prev"/>
  <link href="https://dx.doi.org/10.17487/rfc8995" rel="alternate"/>
  <link href="urn:issn:2070-1721" rel="alternate"/>
  <front>
    <title abbrev="BRSKI">Bootstrapping Remote Secure Key Infrastructure (BRSKI)</title>
    <seriesInfo name="RFC" value="8995" stream="IETF"/>
    <author fullname="Max Pritikin" initials="M." surname="Pritikin">
      <organization showOnFrontPage="true">Cisco</organization>
      <address>
        <email>pritikin@cisco.com</email>
      </address>
    </author>
    <author fullname="Michael C. Richardson" initials="M." surname="Richardson">
      <organization abbrev="Sandelman Software Works" showOnFrontPage="true">Sandelman Software Works</organization>
      <address>
        <email>mcr+ietf@sandelman.ca</email>
        <uri>http://www.sandelman.ca/</uri>
      </address>
    </author>
    <author fullname="Toerless Eckert" initials="T." surname="Eckert">
      <organization abbrev="Futurewei USA" showOnFrontPage="true">Futurewei Technologies Inc.  USA</organization>
      <address>
        <postal>
          <street>2330 Central Expy</street>
          <city>Santa Clara</city>
          <region>CA</region>
          <code>95050</code>
          <country>USA</country>
        </postal>
        <email>tte+ietf@cs.fau.de</email>
      </address>
    </author>
    <author fullname="Michael H. Behringer" initials="M." surname="Behringer">
      <address>
        <email>Michael.H.Behringer@gmail.com</email>
      </address>
    </author>
    <author fullname="Kent Watsen" initials="K." surname="Watsen">
      <organization showOnFrontPage="true">Watsen Networks</organization>
      <address>
        <email>kent+ietf@watsen.net</email>
      </address>
    </author>
    <date month="05" year="2021"/>
    <area>Operations and Management</area>
    <workgroup>ANIMA</workgroup>
    <abstract pn="section-abstract">
      <t indent="0" pn="section-abstract-1">
        This document specifies automated bootstrapping of an Autonomic
        Control Plane.  To do this, a Secure Key Infrastructure is
        bootstrapped.  This is done using manufacturer-installed
        X.509 certificates, in combination with a manufacturer's authorizing
        service, both online and offline.  We call this process the
        Bootstrapping Remote Secure Key Infrastructure (BRSKI) protocol.
        Bootstrapping a new device can occur when using a routable address and a
        cloud service, only link-local connectivity, or
        limited/disconnected networks. Support for deployment models
        with less stringent security requirements is included.
        Bootstrapping is complete when the cryptographic identity of the new
        key infrastructure is successfully deployed to the device.  The
        established secure connection can be used to deploy a locally issued
        certificate to the device as well.
      </t>
    </abstract>
    <boilerplate>
      <section anchor="status-of-memo" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.1">
        <name slugifiedName="name-status-of-this-memo">Status of This Memo</name>
        <t indent="0" pn="section-boilerplate.1-1">
            This is an Internet Standards Track document.
        </t>
        <t indent="0" pn="section-boilerplate.1-2">
            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.
        </t>
        <t indent="0" pn="section-boilerplate.1-3">
            Information about the current status of this document, any
            errata, and how to provide feedback on it may be obtained at
            <eref target="https://www.rfc-editor.org/info/rfc8995" brackets="none"/>.
        </t>
      </section>
      <section anchor="copyright" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.2">
        <name slugifiedName="name-copyright-notice">Copyright Notice</name>
        <t indent="0" pn="section-boilerplate.2-1">
            Copyright (c) 2021 IETF Trust and the persons identified as the
            document authors. All rights reserved.
        </t>
        <t indent="0" pn="section-boilerplate.2-2">
            This document is subject to BCP 78 and the IETF Trust's Legal
            Provisions Relating to IETF Documents
            (<eref target="https://trustee.ietf.org/license-info" brackets="none"/>) 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.
        </t>
      </section>
    </boilerplate>
    <toc>
      <section anchor="toc" numbered="false" removeInRFC="false" toc="exclude" pn="section-toc.1">
        <name slugifiedName="name-table-of-contents">Table of Contents</name>
        <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1">
          <li pn="section-toc.1-1.1">
            <t indent="0" pn="section-toc.1-1.1.1"><xref derivedContent="1" format="counter" sectionFormat="of" target="section-1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-introduction">Introduction</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.1.2">
              <li pn="section-toc.1-1.1.2.1">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.2.1.1"><xref derivedContent="1.1" format="counter" sectionFormat="of" target="section-1.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-prior-bootstrapping-approac">Prior Bootstrapping Approaches</xref></t>
              </li>
              <li pn="section-toc.1-1.1.2.2">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.2.2.1"><xref derivedContent="1.2" format="counter" sectionFormat="of" target="section-1.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-terminology">Terminology</xref></t>
              </li>
              <li pn="section-toc.1-1.1.2.3">
                <t indent="0" pn="section-toc.1-1.1.2.3.1"><xref derivedContent="1.3" format="counter" sectionFormat="of" target="section-1.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-scope-of-solution">Scope of Solution</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.1.2.3.2">
                  <li pn="section-toc.1-1.1.2.3.2.1">
                    <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.2.3.2.1.1"><xref derivedContent="1.3.1" format="counter" sectionFormat="of" target="section-1.3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-support-environment">Support Environment</xref></t>
                  </li>
                  <li pn="section-toc.1-1.1.2.3.2.2">
                    <t indent="0" pn="section-toc.1-1.1.2.3.2.2.1"><xref derivedContent="1.3.2" format="counter" sectionFormat="of" target="section-1.3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-constrained-environments">Constrained Environments</xref></t>
                  </li>
                  <li pn="section-toc.1-1.1.2.3.2.3">
                    <t indent="0" pn="section-toc.1-1.1.2.3.2.3.1"><xref derivedContent="1.3.3" format="counter" sectionFormat="of" target="section-1.3.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-network-access-controls">Network Access Controls</xref></t>
                  </li>
                  <li pn="section-toc.1-1.1.2.3.2.4">
                    <t indent="0" pn="section-toc.1-1.1.2.3.2.4.1"><xref derivedContent="1.3.4" format="counter" sectionFormat="of" target="section-1.3.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-bootstrapping-is-not-bootin">Bootstrapping is Not Booting</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.1.2.4">
                <t indent="0" pn="section-toc.1-1.1.2.4.1"><xref derivedContent="1.4" format="counter" sectionFormat="of" target="section-1.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-leveraging-the-new-key-infr">Leveraging the New Key Infrastructure / Next Steps</xref></t>
              </li>
              <li pn="section-toc.1-1.1.2.5">
                <t indent="0" pn="section-toc.1-1.1.2.5.1"><xref derivedContent="1.5" format="counter" sectionFormat="of" target="section-1.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-requirements-for-autonomic-">Requirements for Autonomic Networking Infrastructure (ANI) Devices</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.2">
            <t indent="0" pn="section-toc.1-1.2.1"><xref derivedContent="2" format="counter" sectionFormat="of" target="section-2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-architectural-overview">Architectural Overview</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.2.2">
              <li pn="section-toc.1-1.2.2.1">
                <t indent="0" pn="section-toc.1-1.2.2.1.1"><xref derivedContent="2.1" format="counter" sectionFormat="of" target="section-2.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-behavior-of-a-pledge">Behavior of a Pledge</xref></t>
              </li>
              <li pn="section-toc.1-1.2.2.2">
                <t indent="0" pn="section-toc.1-1.2.2.2.1"><xref derivedContent="2.2" format="counter" sectionFormat="of" target="section-2.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-secure-imprinting-using-vou">Secure Imprinting Using Vouchers</xref></t>
              </li>
              <li pn="section-toc.1-1.2.2.3">
                <t indent="0" pn="section-toc.1-1.2.2.3.1"><xref derivedContent="2.3" format="counter" sectionFormat="of" target="section-2.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-initial-device-identifier">Initial Device Identifier</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.2.2.3.2">
                  <li pn="section-toc.1-1.2.2.3.2.1">
                    <t indent="0" pn="section-toc.1-1.2.2.3.2.1.1"><xref derivedContent="2.3.1" format="counter" sectionFormat="of" target="section-2.3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-identification-of-the-pledg">Identification of the Pledge</xref></t>
                  </li>
                  <li pn="section-toc.1-1.2.2.3.2.2">
                    <t indent="0" pn="section-toc.1-1.2.2.3.2.2.1"><xref derivedContent="2.3.2" format="counter" sectionFormat="of" target="section-2.3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-uri-extension">MASA URI Extension</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.2.2.4">
                <t indent="0" pn="section-toc.1-1.2.2.4.1"><xref derivedContent="2.4" format="counter" sectionFormat="of" target="section-2.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-protocol-flow">Protocol Flow</xref></t>
              </li>
              <li pn="section-toc.1-1.2.2.5">
                <t indent="0" pn="section-toc.1-1.2.2.5.1"><xref derivedContent="2.5" format="counter" sectionFormat="of" target="section-2.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-architectural-components">Architectural Components</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.2.2.5.2">
                  <li pn="section-toc.1-1.2.2.5.2.1">
                    <t indent="0" pn="section-toc.1-1.2.2.5.2.1.1"><xref derivedContent="2.5.1" format="counter" sectionFormat="of" target="section-2.5.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge">Pledge</xref></t>
                  </li>
                  <li pn="section-toc.1-1.2.2.5.2.2">
                    <t indent="0" pn="section-toc.1-1.2.2.5.2.2.1"><xref derivedContent="2.5.2" format="counter" sectionFormat="of" target="section-2.5.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-join-proxy">Join Proxy</xref></t>
                  </li>
                  <li pn="section-toc.1-1.2.2.5.2.3">
                    <t indent="0" pn="section-toc.1-1.2.2.5.2.3.1"><xref derivedContent="2.5.3" format="counter" sectionFormat="of" target="section-2.5.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-domain-registrar">Domain Registrar</xref></t>
                  </li>
                  <li pn="section-toc.1-1.2.2.5.2.4">
                    <t indent="0" pn="section-toc.1-1.2.2.5.2.4.1"><xref derivedContent="2.5.4" format="counter" sectionFormat="of" target="section-2.5.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-manufacturer-service">Manufacturer Service</xref></t>
                  </li>
                  <li pn="section-toc.1-1.2.2.5.2.5">
                    <t indent="0" pn="section-toc.1-1.2.2.5.2.5.1"><xref derivedContent="2.5.5" format="counter" sectionFormat="of" target="section-2.5.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-public-key-infrastructure-p">Public Key Infrastructure (PKI)</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.2.2.6">
                <t indent="0" pn="section-toc.1-1.2.2.6.1"><xref derivedContent="2.6" format="counter" sectionFormat="of" target="section-2.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-certificate-time-validation">Certificate Time Validation</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.2.2.6.2">
                  <li pn="section-toc.1-1.2.2.6.2.1">
                    <t indent="0" pn="section-toc.1-1.2.2.6.2.1.1"><xref derivedContent="2.6.1" format="counter" sectionFormat="of" target="section-2.6.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-lack-of-real-time-clock">Lack of Real-Time Clock</xref></t>
                  </li>
                  <li pn="section-toc.1-1.2.2.6.2.2">
                    <t indent="0" pn="section-toc.1-1.2.2.6.2.2.1"><xref derivedContent="2.6.2" format="counter" sectionFormat="of" target="section-2.6.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-infinite-lifetime-of-idevid">Infinite Lifetime of IDevID</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.2.2.7">
                <t indent="0" pn="section-toc.1-1.2.2.7.1"><xref derivedContent="2.7" format="counter" sectionFormat="of" target="section-2.7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-cloud-registrar">Cloud Registrar</xref></t>
              </li>
              <li pn="section-toc.1-1.2.2.8">
                <t indent="0" pn="section-toc.1-1.2.2.8.1"><xref derivedContent="2.8" format="counter" sectionFormat="of" target="section-2.8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-determining-the-masa-to-con">Determining the MASA to Contact</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.3">
            <t indent="0" pn="section-toc.1-1.3.1"><xref derivedContent="3" format="counter" sectionFormat="of" target="section-3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-voucher-request-artifact">Voucher-Request Artifact</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2">
              <li pn="section-toc.1-1.3.2.1">
                <t indent="0" pn="section-toc.1-1.3.2.1.1"><xref derivedContent="3.1" format="counter" sectionFormat="of" target="section-3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-nonceless-voucher-requests">Nonceless Voucher-Requests</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.2">
                <t indent="0" pn="section-toc.1-1.3.2.2.1"><xref derivedContent="3.2" format="counter" sectionFormat="of" target="section-3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-tree-diagram">Tree Diagram</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.3">
                <t indent="0" pn="section-toc.1-1.3.2.3.1"><xref derivedContent="3.3" format="counter" sectionFormat="of" target="section-3.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-examples">Examples</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.4">
                <t indent="0" pn="section-toc.1-1.3.2.4.1"><xref derivedContent="3.4" format="counter" sectionFormat="of" target="section-3.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-yang-module">YANG Module</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.4">
            <t indent="0" pn="section-toc.1-1.4.1"><xref derivedContent="4" format="counter" sectionFormat="of" target="section-4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-proxying-details-pledge-pro">Proxying Details (Pledge -- Proxy -- Registrar)</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.4.2">
              <li pn="section-toc.1-1.4.2.1">
                <t indent="0" pn="section-toc.1-1.4.2.1.1"><xref derivedContent="4.1" format="counter" sectionFormat="of" target="section-4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-discovery-of-proxy">Pledge Discovery of Proxy</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.4.2.1.2">
                  <li pn="section-toc.1-1.4.2.1.2.1">
                    <t indent="0" pn="section-toc.1-1.4.2.1.2.1.1"><xref derivedContent="4.1.1" format="counter" sectionFormat="of" target="section-4.1.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-proxy-grasp-announcements">Proxy GRASP Announcements</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.4.2.2">
                <t indent="0" pn="section-toc.1-1.4.2.2.1"><xref derivedContent="4.2" format="counter" sectionFormat="of" target="section-4.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-coap-connection-to-registra">CoAP Connection to Registrar</xref></t>
              </li>
              <li pn="section-toc.1-1.4.2.3">
                <t indent="0" pn="section-toc.1-1.4.2.3.1"><xref derivedContent="4.3" format="counter" sectionFormat="of" target="section-4.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-proxy-discovery-and-communi">Proxy Discovery and Communication of Registrar</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.5">
            <t indent="0" pn="section-toc.1-1.5.1"><xref derivedContent="5" format="counter" sectionFormat="of" target="section-5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-protocol-details-pledge-reg">Protocol Details (Pledge -- Registrar -- MASA)</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2">
              <li pn="section-toc.1-1.5.2.1">
                <t indent="0" pn="section-toc.1-1.5.2.1.1"><xref derivedContent="5.1" format="counter" sectionFormat="of" target="section-5.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-brski-est-tls-establishment">BRSKI-EST TLS Establishment Details</xref></t>
              </li>
              <li pn="section-toc.1-1.5.2.2">
                <t indent="0" pn="section-toc.1-1.5.2.2.1"><xref derivedContent="5.2" format="counter" sectionFormat="of" target="section-5.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-requests-voucher-fro">Pledge Requests Voucher from the Registrar</xref></t>
              </li>
              <li pn="section-toc.1-1.5.2.3">
                <t indent="0" pn="section-toc.1-1.5.2.3.1"><xref derivedContent="5.3" format="counter" sectionFormat="of" target="section-5.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-authorization-of-">Registrar Authorization of Pledge</xref></t>
              </li>
              <li pn="section-toc.1-1.5.2.4">
                <t indent="0" pn="section-toc.1-1.5.2.4.1"><xref derivedContent="5.4" format="counter" sectionFormat="of" target="section-5.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-brski-masa-tls-establishmen">BRSKI-MASA TLS Establishment Details</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2.4.2">
                  <li pn="section-toc.1-1.5.2.4.2.1">
                    <t indent="0" pn="section-toc.1-1.5.2.4.2.1.1"><xref derivedContent="5.4.1" format="counter" sectionFormat="of" target="section-5.4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-authentication-of-cust">MASA Authentication of Customer Registrar</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.5.2.5">
                <t indent="0" pn="section-toc.1-1.5.2.5.1"><xref derivedContent="5.5" format="counter" sectionFormat="of" target="section-5.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-requests-voucher-">Registrar Requests Voucher from MASA</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2.5.2">
                  <li pn="section-toc.1-1.5.2.5.2.1">
                    <t indent="0" pn="section-toc.1-1.5.2.5.2.1.1"><xref derivedContent="5.5.1" format="counter" sectionFormat="of" target="section-5.5.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-renewal-of-expired-vou">MASA Renewal of Expired Vouchers</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.5.2.2">
                    <t indent="0" pn="section-toc.1-1.5.2.5.2.2.1"><xref derivedContent="5.5.2" format="counter" sectionFormat="of" target="section-5.5.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-pinning-of-registrar">MASA Pinning of Registrar</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.5.2.3">
                    <t indent="0" pn="section-toc.1-1.5.2.5.2.3.1"><xref derivedContent="5.5.3" format="counter" sectionFormat="of" target="section-5.5.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-check-of-the-voucher-r">MASA Check of the Voucher-Request Signature</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.5.2.4">
                    <t indent="0" pn="section-toc.1-1.5.2.5.2.4.1"><xref derivedContent="5.5.4" format="counter" sectionFormat="of" target="section-5.5.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-verification-of-the-do">MASA Verification of the Domain Registrar</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.5.2.5">
                    <t indent="0" pn="section-toc.1-1.5.2.5.2.5.1"><xref derivedContent="5.5.5" format="counter" sectionFormat="of" target="section-5.5.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-verification-of-the-pl">MASA Verification of the Pledge 'prior-signed-voucher-request'</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.5.2.6">
                    <t indent="0" pn="section-toc.1-1.5.2.5.2.6.1"><xref derivedContent="5.5.6" format="counter" sectionFormat="of" target="section-5.5.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-nonce-handling">MASA Nonce Handling</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.5.2.6">
                <t indent="0" pn="section-toc.1-1.5.2.6.1"><xref derivedContent="5.6" format="counter" sectionFormat="of" target="section-5.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-and-registrar-voucher-">MASA and Registrar Voucher Response</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2.6.2">
                  <li pn="section-toc.1-1.5.2.6.2.1">
                    <t indent="0" pn="section-toc.1-1.5.2.6.2.1.1"><xref derivedContent="5.6.1" format="counter" sectionFormat="of" target="section-5.6.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-voucher-verification">Pledge Voucher Verification</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.6.2.2">
                    <t indent="0" pn="section-toc.1-1.5.2.6.2.2.1"><xref derivedContent="5.6.2" format="counter" sectionFormat="of" target="section-5.6.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-authentication-of-pr">Pledge Authentication of Provisional TLS Connection</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.5.2.7">
                <t indent="0" pn="section-toc.1-1.5.2.7.1"><xref derivedContent="5.7" format="counter" sectionFormat="of" target="section-5.7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-brski-status-telemet">Pledge BRSKI Status Telemetry</xref></t>
              </li>
              <li pn="section-toc.1-1.5.2.8">
                <t indent="0" pn="section-toc.1-1.5.2.8.1"><xref derivedContent="5.8" format="counter" sectionFormat="of" target="section-5.8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-audit-log-request">Registrar Audit-Log Request</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2.8.2">
                  <li pn="section-toc.1-1.5.2.8.2.1">
                    <t indent="0" pn="section-toc.1-1.5.2.8.2.1.1"><xref derivedContent="5.8.1" format="counter" sectionFormat="of" target="section-5.8.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-audit-log-response">MASA Audit-Log Response</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.8.2.2">
                    <t indent="0" pn="section-toc.1-1.5.2.8.2.2.1"><xref derivedContent="5.8.2" format="counter" sectionFormat="of" target="section-5.8.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-calculation-of-domainid">Calculation of domainID</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.8.2.3">
                    <t indent="0" pn="section-toc.1-1.5.2.8.2.3.1"><xref derivedContent="5.8.3" format="counter" sectionFormat="of" target="section-5.8.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-audit-log-verific">Registrar Audit-Log Verification</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.5.2.9">
                <t indent="0" pn="section-toc.1-1.5.2.9.1"><xref derivedContent="5.9" format="counter" sectionFormat="of" target="section-5.9"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-est-integration-for-pki-boo">EST Integration for PKI Bootstrapping</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2.9.2">
                  <li pn="section-toc.1-1.5.2.9.2.1">
                    <t indent="0" pn="section-toc.1-1.5.2.9.2.1.1"><xref derivedContent="5.9.1" format="counter" sectionFormat="of" target="section-5.9.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-est-distribution-of-ca-cert">EST Distribution of CA Certificates</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.9.2.2">
                    <t indent="0" pn="section-toc.1-1.5.2.9.2.2.1"><xref derivedContent="5.9.2" format="counter" sectionFormat="of" target="section-5.9.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-est-csr-attributes">EST CSR Attributes</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.9.2.3">
                    <t indent="0" pn="section-toc.1-1.5.2.9.2.3.1"><xref derivedContent="5.9.3" format="counter" sectionFormat="of" target="section-5.9.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-est-client-certificate-requ">EST Client Certificate Request</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.9.2.4">
                    <t indent="0" pn="section-toc.1-1.5.2.9.2.4.1"><xref derivedContent="5.9.4" format="counter" sectionFormat="of" target="section-5.9.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-enrollment-status-telemetry">Enrollment Status Telemetry</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.9.2.5">
                    <t indent="0" pn="section-toc.1-1.5.2.9.2.5.1"><xref derivedContent="5.9.5" format="counter" sectionFormat="of" target="section-5.9.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-multiple-certificates">Multiple Certificates</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.9.2.6">
                    <t indent="0" pn="section-toc.1-1.5.2.9.2.6.1"><xref derivedContent="5.9.6" format="counter" sectionFormat="of" target="section-5.9.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-est-over-coap">EST over CoAP</xref></t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.6">
            <t indent="0" pn="section-toc.1-1.6.1"><xref derivedContent="6" format="counter" sectionFormat="of" target="section-6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-clarification-of-transfer-e">Clarification of Transfer-Encoding</xref></t>
          </li>
          <li pn="section-toc.1-1.7">
            <t indent="0" pn="section-toc.1-1.7.1"><xref derivedContent="7" format="counter" sectionFormat="of" target="section-7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-reduced-security-operationa">Reduced Security Operational Modes</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.7.2">
              <li pn="section-toc.1-1.7.2.1">
                <t indent="0" pn="section-toc.1-1.7.2.1.1"><xref derivedContent="7.1" format="counter" sectionFormat="of" target="section-7.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-trust-model">Trust Model</xref></t>
              </li>
              <li pn="section-toc.1-1.7.2.2">
                <t indent="0" pn="section-toc.1-1.7.2.2.1"><xref derivedContent="7.2" format="counter" sectionFormat="of" target="section-7.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-security-reductions">Pledge Security Reductions</xref></t>
              </li>
              <li pn="section-toc.1-1.7.2.3">
                <t indent="0" pn="section-toc.1-1.7.2.3.1"><xref derivedContent="7.3" format="counter" sectionFormat="of" target="section-7.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-security-reductio">Registrar Security Reductions</xref></t>
              </li>
              <li pn="section-toc.1-1.7.2.4">
                <t indent="0" pn="section-toc.1-1.7.2.4.1"><xref derivedContent="7.4" format="counter" sectionFormat="of" target="section-7.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-security-reductions">MASA Security Reductions</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.7.2.4.2">
                  <li pn="section-toc.1-1.7.2.4.2.1">
                    <t indent="0" pn="section-toc.1-1.7.2.4.2.1.1"><xref derivedContent="7.4.1" format="counter" sectionFormat="of" target="section-7.4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-issuing-nonceless-vouchers">Issuing Nonceless Vouchers</xref></t>
                  </li>
                  <li pn="section-toc.1-1.7.2.4.2.2">
                    <t indent="0" pn="section-toc.1-1.7.2.4.2.2.1"><xref derivedContent="7.4.2" format="counter" sectionFormat="of" target="section-7.4.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-trusting-owners-on-first-us">Trusting Owners on First Use</xref></t>
                  </li>
                  <li pn="section-toc.1-1.7.2.4.2.3">
                    <t indent="0" pn="section-toc.1-1.7.2.4.2.3.1"><xref derivedContent="7.4.3" format="counter" sectionFormat="of" target="section-7.4.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-updating-or-extending-vouch">Updating or Extending Voucher Trust Anchors</xref></t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.8">
            <t indent="0" pn="section-toc.1-1.8.1"><xref derivedContent="8" format="counter" sectionFormat="of" target="section-8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-iana-considerations">IANA Considerations</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.8.2">
              <li pn="section-toc.1-1.8.2.1">
                <t indent="0" pn="section-toc.1-1.8.2.1.1"><xref derivedContent="8.1" format="counter" sectionFormat="of" target="section-8.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-the-ietf-xml-registry">The IETF XML Registry</xref></t>
              </li>
              <li pn="section-toc.1-1.8.2.2">
                <t indent="0" pn="section-toc.1-1.8.2.2.1"><xref derivedContent="8.2" format="counter" sectionFormat="of" target="section-8.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-yang-module-names-registry">YANG Module Names Registry</xref></t>
              </li>
              <li pn="section-toc.1-1.8.2.3">
                <t indent="0" pn="section-toc.1-1.8.2.3.1"><xref derivedContent="8.3" format="counter" sectionFormat="of" target="section-8.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-brski-well-known-considerat">BRSKI Well-Known Considerations</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.8.2.3.2">
                  <li pn="section-toc.1-1.8.2.3.2.1">
                    <t indent="0" pn="section-toc.1-1.8.2.3.2.1.1"><xref derivedContent="8.3.1" format="counter" sectionFormat="of" target="section-8.3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-brski-well-known-registrati">BRSKI .well-known Registration</xref></t>
                  </li>
                  <li pn="section-toc.1-1.8.2.3.2.2">
                    <t indent="0" pn="section-toc.1-1.8.2.3.2.2.1"><xref derivedContent="8.3.2" format="counter" sectionFormat="of" target="section-8.3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-brski-well-known-registry">BRSKI .well-known Registry</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.8.2.4">
                <t indent="0" pn="section-toc.1-1.8.2.4.1"><xref derivedContent="8.4" format="counter" sectionFormat="of" target="section-8.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pkix-registry">PKIX Registry</xref></t>
              </li>
              <li pn="section-toc.1-1.8.2.5">
                <t indent="0" pn="section-toc.1-1.8.2.5.1"><xref derivedContent="8.5" format="counter" sectionFormat="of" target="section-8.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-brski-status-telemetr">Pledge BRSKI Status Telemetry</xref></t>
              </li>
              <li pn="section-toc.1-1.8.2.6">
                <t indent="0" pn="section-toc.1-1.8.2.6.1"><xref derivedContent="8.6" format="counter" sectionFormat="of" target="section-8.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-dns-service-names">DNS Service Names</xref></t>
              </li>
              <li pn="section-toc.1-1.8.2.7">
                <t indent="0" pn="section-toc.1-1.8.2.7.1"><xref derivedContent="8.7" format="counter" sectionFormat="of" target="section-8.7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-grasp-objective-names">GRASP Objective Names</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.9">
            <t indent="0" pn="section-toc.1-1.9.1"><xref derivedContent="9" format="counter" sectionFormat="of" target="section-9"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-applicability-to-the-autono">Applicability to the Autonomic Control Plane (ACP)</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.9.2">
              <li pn="section-toc.1-1.9.2.1">
                <t indent="0" pn="section-toc.1-1.9.2.1.1"><xref derivedContent="9.1" format="counter" sectionFormat="of" target="section-9.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-operational-requirements">Operational Requirements</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.9.2.1.2">
                  <li pn="section-toc.1-1.9.2.1.2.1">
                    <t indent="0" pn="section-toc.1-1.9.2.1.2.1.1"><xref derivedContent="9.1.1" format="counter" sectionFormat="of" target="section-9.1.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-operational-requiremen">MASA Operational Requirements</xref></t>
                  </li>
                  <li pn="section-toc.1-1.9.2.1.2.2">
                    <t indent="0" pn="section-toc.1-1.9.2.1.2.2.1"><xref derivedContent="9.1.2" format="counter" sectionFormat="of" target="section-9.1.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-domain-owner-operational-re">Domain Owner Operational Requirements</xref></t>
                  </li>
                  <li pn="section-toc.1-1.9.2.1.2.3">
                    <t indent="0" pn="section-toc.1-1.9.2.1.2.3.1"><xref derivedContent="9.1.3" format="counter" sectionFormat="of" target="section-9.1.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-device-operational-requirem">Device Operational Requirements</xref></t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.10">
            <t indent="0" pn="section-toc.1-1.10.1"><xref derivedContent="10" format="counter" sectionFormat="of" target="section-10"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-privacy-considerations">Privacy Considerations</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.10.2">
              <li pn="section-toc.1-1.10.2.1">
                <t indent="0" pn="section-toc.1-1.10.2.1.1"><xref derivedContent="10.1" format="counter" sectionFormat="of" target="section-10.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-audit-log">MASA Audit-Log</xref></t>
              </li>
              <li pn="section-toc.1-1.10.2.2">
                <t indent="0" pn="section-toc.1-1.10.2.2.1"><xref derivedContent="10.2" format="counter" sectionFormat="of" target="section-10.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-what-brski-est-reveals">What BRSKI-EST Reveals</xref></t>
              </li>
              <li pn="section-toc.1-1.10.2.3">
                <t indent="0" pn="section-toc.1-1.10.2.3.1"><xref derivedContent="10.3" format="counter" sectionFormat="of" target="section-10.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-what-brski-masa-reveals-to-">What BRSKI-MASA Reveals to the Manufacturer</xref></t>
              </li>
              <li pn="section-toc.1-1.10.2.4">
                <t indent="0" pn="section-toc.1-1.10.2.4.1"><xref derivedContent="10.4" format="counter" sectionFormat="of" target="section-10.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-manufacturers-and-used-or-s">Manufacturers and Used or Stolen Equipment</xref></t>
              </li>
              <li pn="section-toc.1-1.10.2.5">
                <t indent="0" pn="section-toc.1-1.10.2.5.1"><xref derivedContent="10.5" format="counter" sectionFormat="of" target="section-10.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-manufacturers-and-grey-mark">Manufacturers and Grey Market Equipment</xref></t>
              </li>
              <li pn="section-toc.1-1.10.2.6">
                <t indent="0" pn="section-toc.1-1.10.2.6.1"><xref derivedContent="10.6" format="counter" sectionFormat="of" target="section-10.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-some-mitigations-for-meddli">Some Mitigations for Meddling by Manufacturers</xref></t>
              </li>
              <li pn="section-toc.1-1.10.2.7">
                <t indent="0" pn="section-toc.1-1.10.2.7.1"><xref derivedContent="10.7" format="counter" sectionFormat="of" target="section-10.7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-death-of-a-manufacturer">Death of a Manufacturer</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.11">
            <t indent="0" pn="section-toc.1-1.11.1"><xref derivedContent="11" format="counter" sectionFormat="of" target="section-11"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-security-considerations">Security Considerations</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.11.2">
              <li pn="section-toc.1-1.11.2.1">
                <t indent="0" pn="section-toc.1-1.11.2.1.1"><xref derivedContent="11.1" format="counter" sectionFormat="of" target="section-11.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-denial-of-service-dos-again">Denial of Service (DoS) against MASA</xref></t>
              </li>
              <li pn="section-toc.1-1.11.2.2">
                <t indent="0" pn="section-toc.1-1.11.2.2.1"><xref derivedContent="11.2" format="counter" sectionFormat="of" target="section-11.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-domainid-must-be-resistant-">DomainID Must Be Resistant to Second-Preimage Attacks</xref></t>
              </li>
              <li pn="section-toc.1-1.11.2.3">
                <t indent="0" pn="section-toc.1-1.11.2.3.1"><xref derivedContent="11.3" format="counter" sectionFormat="of" target="section-11.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-availability-of-good-random">Availability of Good Random Numbers</xref></t>
              </li>
              <li pn="section-toc.1-1.11.2.4">
                <t indent="0" pn="section-toc.1-1.11.2.4.1"><xref derivedContent="11.4" format="counter" sectionFormat="of" target="section-11.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-freshness-in-voucher-reques">Freshness in Voucher-Requests</xref></t>
              </li>
              <li pn="section-toc.1-1.11.2.5">
                <t indent="0" pn="section-toc.1-1.11.2.5.1"><xref derivedContent="11.5" format="counter" sectionFormat="of" target="section-11.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-trusting-manufacturers">Trusting Manufacturers</xref></t>
              </li>
              <li pn="section-toc.1-1.11.2.6">
                <t indent="0" pn="section-toc.1-1.11.2.6.1"><xref derivedContent="11.6" format="counter" sectionFormat="of" target="section-11.6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-manufacturer-maintenance-of">Manufacturer Maintenance of Trust Anchors</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.11.2.6.2">
                  <li pn="section-toc.1-1.11.2.6.2.1">
                    <t indent="0" pn="section-toc.1-1.11.2.6.2.1.1"><xref derivedContent="11.6.1" format="counter" sectionFormat="of" target="section-11.6.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-compromise-of-manufacturer-">Compromise of Manufacturer IDevID Signing Keys</xref></t>
                  </li>
                  <li pn="section-toc.1-1.11.2.6.2.2">
                    <t indent="0" pn="section-toc.1-1.11.2.6.2.2.1"><xref derivedContent="11.6.2" format="counter" sectionFormat="of" target="section-11.6.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-compromise-of-masa-signing-">Compromise of MASA Signing Keys</xref></t>
                  </li>
                  <li pn="section-toc.1-1.11.2.6.2.3">
                    <t indent="0" pn="section-toc.1-1.11.2.6.2.3.1"><xref derivedContent="11.6.3" format="counter" sectionFormat="of" target="section-11.6.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-compromise-of-masa-web-serv">Compromise of MASA Web Service</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.11.2.7">
                <t indent="0" pn="section-toc.1-1.11.2.7.1"><xref derivedContent="11.7" format="counter" sectionFormat="of" target="section-11.7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-yang-module-security-consid">YANG Module Security Considerations</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.12">
            <t indent="0" pn="section-toc.1-1.12.1"><xref derivedContent="12" format="counter" sectionFormat="of" target="section-12"/>. <xref derivedContent="" format="title" sectionFormat="of" target="name-references">References</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.12.2">
              <li pn="section-toc.1-1.12.2.1">
                <t indent="0" pn="section-toc.1-1.12.2.1.1"><xref derivedContent="12.1" format="counter" sectionFormat="of" target="section-12.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-normative-references">Normative References</xref></t>
              </li>
              <li pn="section-toc.1-1.12.2.2">
                <t indent="0" pn="section-toc.1-1.12.2.2.1"><xref derivedContent="12.2" format="counter" sectionFormat="of" target="section-12.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-informative-references">Informative References</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.13">
            <t indent="0" pn="section-toc.1-1.13.1"><xref derivedContent="Appendix A" format="default" sectionFormat="of" target="section-appendix.a"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-ipv4-and-non-ani-operations">IPv4 and Non-ANI Operations</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.13.2">
              <li pn="section-toc.1-1.13.2.1">
                <t indent="0" pn="section-toc.1-1.13.2.1.1"><xref derivedContent="A.1" format="counter" sectionFormat="of" target="section-a.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-ipv4-link-local-addresses">IPv4 Link-Local Addresses</xref></t>
              </li>
              <li pn="section-toc.1-1.13.2.2">
                <t indent="0" pn="section-toc.1-1.13.2.2.1"><xref derivedContent="A.2" format="counter" sectionFormat="of" target="section-a.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-use-of-dhcpv4">Use of DHCPv4</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.14">
            <t indent="0" pn="section-toc.1-1.14.1"><xref derivedContent="Appendix B" format="default" sectionFormat="of" target="section-appendix.b"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-mdns-dns-sd-proxy-discovery">mDNS / DNS-SD Proxy Discovery Options</xref></t>
          </li>
          <li pn="section-toc.1-1.15">
            <t indent="0" pn="section-toc.1-1.15.1"><xref derivedContent="Appendix C" format="default" sectionFormat="of" target="section-appendix.c"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-example-vouchers">Example Vouchers</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.15.2">
              <li pn="section-toc.1-1.15.2.1">
                <t indent="0" pn="section-toc.1-1.15.2.1.1"><xref derivedContent="C.1" format="counter" sectionFormat="of" target="section-c.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-keys-involved">Keys Involved</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.15.2.1.2">
                  <li pn="section-toc.1-1.15.2.1.2.1">
                    <t indent="0" pn="section-toc.1-1.15.2.1.2.1.1"><xref derivedContent="C.1.1" format="counter" sectionFormat="of" target="section-c.1.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-manufacturer-certification-">Manufacturer Certification Authority for IDevID Signatures</xref></t>
                  </li>
                  <li pn="section-toc.1-1.15.2.1.2.2">
                    <t indent="0" pn="section-toc.1-1.15.2.1.2.2.1"><xref derivedContent="C.1.2" format="counter" sectionFormat="of" target="section-c.1.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-key-pair-for-voucher-s">MASA Key Pair for Voucher Signatures</xref></t>
                  </li>
                  <li pn="section-toc.1-1.15.2.1.2.3">
                    <t indent="0" pn="section-toc.1-1.15.2.1.2.3.1"><xref derivedContent="C.1.3" format="counter" sectionFormat="of" target="section-c.1.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-certification-aut">Registrar Certification Authority</xref></t>
                  </li>
                  <li pn="section-toc.1-1.15.2.1.2.4">
                    <t indent="0" pn="section-toc.1-1.15.2.1.2.4.1"><xref derivedContent="C.1.4" format="counter" sectionFormat="of" target="section-c.1.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-key-pair">Registrar Key Pair</xref></t>
                  </li>
                  <li pn="section-toc.1-1.15.2.1.2.5">
                    <t indent="0" pn="section-toc.1-1.15.2.1.2.5.1"><xref derivedContent="C.1.5" format="counter" sectionFormat="of" target="section-c.1.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-key-pair">Pledge Key Pair</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.15.2.2">
                <t indent="0" pn="section-toc.1-1.15.2.2.1"><xref derivedContent="C.2" format="counter" sectionFormat="of" target="section-c.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-example-process">Example Process</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.15.2.2.2">
                  <li pn="section-toc.1-1.15.2.2.2.1">
                    <t indent="0" pn="section-toc.1-1.15.2.2.2.1.1"><xref derivedContent="C.2.1" format="counter" sectionFormat="of" target="section-c.2.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-pledge-to-registrar">Pledge to Registrar</xref></t>
                  </li>
                  <li pn="section-toc.1-1.15.2.2.2.2">
                    <t indent="0" pn="section-toc.1-1.15.2.2.2.2.1"><xref derivedContent="C.2.2" format="counter" sectionFormat="of" target="section-c.2.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-registrar-to-masa">Registrar to MASA</xref></t>
                  </li>
                  <li pn="section-toc.1-1.15.2.2.2.3">
                    <t indent="0" pn="section-toc.1-1.15.2.2.2.3.1"><xref derivedContent="C.2.3" format="counter" sectionFormat="of" target="section-c.2.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-masa-to-registrar">MASA to Registrar</xref></t>
                  </li>
                  <li pn="section-toc.1-1.15.2.2.2.4">
                    <t indent="0" pn="section-toc.1-1.15.2.2.2.4.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-c.2.4"/><xref derivedContent="" format="title" sectionFormat="of" target="name-acknowledgements">Acknowledgements</xref></t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.16">
            <t indent="0" pn="section-toc.1-1.16.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.d"/><xref derivedContent="" format="title" sectionFormat="of" target="name-authors-addresses">Authors' Addresses</xref></t>
          </li>
        </ul>
      </section>
    </toc>
  </front>
  <middle>
    <section numbered="true" toc="include" removeInRFC="false" pn="section-1">
      <name slugifiedName="name-introduction">Introduction</name>
      <t indent="0" pn="section-1-1">
        The Bootstrapping Remote Secure Key Infrastructure (BRSKI) protocol
        provides a solution for secure zero-touch (automated) bootstrap of
        new (unconfigured) devices that are called "pledges" in this
        document.  Pledges have an Initial Device Identifier (IDevID) installed in them at the factory.
      </t>
      <t indent="0" pn="section-1-2">
        "BRSKI", pronounced like "brewski", is a colloquial term for beer in
        Canada and parts of the Midwestern United States <xref target="brewski" format="default" sectionFormat="of" derivedContent="brewski"/>.
      </t>
      <t indent="0" pn="section-1-3">
        This document primarily provides for the needs of
        the ISP and enterprise-focused Autonomic Networking Integrated Model and Approach (ANIMA)
        Autonomic Control Plane (ACP) <xref target="RFC8994" format="default" sectionFormat="of" derivedContent="RFC8994"/>.

	This bootstrap process satisfies
        the requirement of making all operations
        secure by default per <xref target="RFC7575" sectionFormat="of" section="3.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7575#section-3.3" derivedContent="RFC7575"/>.

	Other users of the BRSKI protocol
        will need to provide separate applicability statements that
        include privacy and security considerations appropriate to that
        deployment.  <xref target="acpapplicability" format="default" sectionFormat="of" derivedContent="Section 9"/> explains the detailed
        applicability for this ACP usage.
      </t>
      <t indent="0" pn="section-1-4">
        The BRSKI protocol requires a significant amount of communication
        between manufacturer and owner: in its default modes, it provides a
        cryptographic transfer of control to the initial owner.  In its
        strongest modes, it leverages sales channel information to identify
        the owner in advance.  Resale of devices is possible, provided that
        the manufacturer is willing to authorize the transfer.  Mechanisms
        to enable transfers of ownership without manufacturer authorization
        are not included in this version of the protocol, but it could be
        designed into future versions.
      </t>
      <t indent="0" pn="section-1-5">
        This document describes how a pledge discovers (or are discovered by) an
        element of the network domain that it will belong to and that will perform
        its bootstrap.  This element (device) is called the
        "registrar".  Before any other operation, the pledge and registrar need to
        establish mutual trust:
      </t>
      <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-1-6">
        <li pn="section-1-6.1" derivedCounter="1.">Registrar authenticating the pledge: "Who is this device? What is
          its identity?"</li>
        <li pn="section-1-6.2" derivedCounter="2.">Registrar authorizing the pledge: "Is it mine? Do I want it?
          What are the chances it has been compromised?"</li>
        <li pn="section-1-6.3" derivedCounter="3.">Pledge authenticating the registrar: "What is this
          registrar's identity?"</li>
        <li pn="section-1-6.4" derivedCounter="4.">Pledge authorizing the registrar: "Should I join this network?"</li>
      </ol>
      <t indent="0" pn="section-1-7">
          This document details protocols and messages to answer the above questions.
          It uses a TLS connection and a PKIX-shaped (X.509v3) certificate (an IEEE
          802.1AR IDevID <xref target="IDevID" format="default" sectionFormat="of" derivedContent="IDevID"/>) of the pledge to answer
          points 1 and 2.
          It uses a new artifact called a "voucher" that the registrar
          receives from a Manufacturer Authorized Signing Authority (MASA) and
          passes it to the pledge to answer points 3 and 4.
      </t>
      <t indent="0" pn="section-1-8">
          A proxy provides very limited connectivity between the pledge and
          the registrar.
      </t>
      <t indent="0" pn="section-1-9">The syntactic details of vouchers are described in detail in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>. This document details automated
      protocol mechanisms to obtain vouchers, including the definition
      of a "voucher-request" message that is a minor extension
      to the voucher format (see <xref target="voucher-request" format="default" sectionFormat="of" derivedContent="Section 3"/>) as defined
      by <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.</t>
      <t indent="0" pn="section-1-10">BRSKI results in the pledge storing an X.509 root
    certificate sufficient for verifying the registrar identity. In the
    process, a TLS connection is established that can be directly used for
    Enrollment over Secure Transport (EST).

    In effect, BRSKI provides
    an automated mechanism for "Bootstrap Distribution of CA Certificates"
    described in <xref target="RFC7030" sectionFormat="comma" section="4.1.1" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-4.1.1" derivedContent="RFC7030"/>, wherein
    the pledge "<bcp14>MUST</bcp14> [...] engage a human user to authorize the CA certificate using
    out-of-band data". With BRSKI, the pledge now can automate
    this process using the voucher. Integration with a complete EST
      enrollment is optional but trivial.</t>
      <t indent="0" pn="section-1-11">BRSKI is agile enough to support
      bootstrapping alternative key infrastructures, such as a symmetric key
      solution, but no such system is described in this document.</t>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-1.1">
        <name slugifiedName="name-prior-bootstrapping-approac">Prior Bootstrapping Approaches</name>
        <t indent="0" pn="section-1.1-1">To literally "pull yourself up by the bootstraps" is an impossible
        action. Similarly, the secure establishment of a key infrastructure
        without external help is also an impossibility. Today, it is commonly
        accepted that the initial connections between nodes are insecure, until
        key distribution is complete, or that domain-specific keying material
        (often pre-shared keys, including mechanisms like Subscriber Identification Module (SIM) cards)
        is pre-provisioned on each new device in a costly and non-scalable
        manner.

	Existing automated mechanisms are known as non-secured "Trust on
        First Use (TOFU)" <xref target="RFC7435" format="default" sectionFormat="of" derivedContent="RFC7435"/>, "resurrecting duckling"
        <xref target="Stajano99theresurrecting" format="default" sectionFormat="of" derivedContent="Stajano99theresurrecting"/>, or "pre-staging".</t>
        <t indent="0" pn="section-1.1-2">Another prior approach has been to try and
        minimize user actions during bootstrapping, but not eliminate all
        user actions.
        The original EST protocol <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> does reduce user actions during bootstrapping
        but does not provide solutions for how the following protocol steps
        can be made autonomic (not involving user actions):
        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-1.1-3">
          <li pn="section-1.1-3.1">using the Implicit Trust Anchor (TA) <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> database to authenticate
                an owner-specific service (not an autonomic solution because
                the URL must be securely distributed),</li>
          <li pn="section-1.1-3.2">engaging a human user to authorize the CA certificate using
                  out-of-band data (not an autonomic solution because the human user
                  is involved),</li>
          <li pn="section-1.1-3.3">using a configured Explicit TA database (not an autonomic
                  solution because the distribution of an explicit TA database is
                  not autonomic), and</li>
          <li pn="section-1.1-3.4">using a certificate-less TLS mutual authentication method
                  (not an autonomic solution because the distribution of symmetric
                  key material is not autonomic).
              </li>
        </ul>
        <t indent="0" pn="section-1.1-4">
            These "touch" methods do not meet the requirements for
            zero-touch.
        </t>
        <t indent="0" pn="section-1.1-5">There are "call home" technologies where the pledge first
              establishes a connection to a well-known manufacturer service using a common
              client-server authentication model. After mutual authentication,
              appropriate credentials to authenticate the target domain are
              transferred to the pledge. This creates several problems and
              limitations:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-1.1-6">
          <li pn="section-1.1-6.1">the pledge requires real-time connectivity to the manufacturer
                  service,</li>
          <li pn="section-1.1-6.2">the domain identity is exposed to the manufacturer service (this is a
                  privacy concern), and</li>
          <li pn="section-1.1-6.3">the manufacturer is responsible for making the authorization
                  decisions (this is a liability concern).</li>
        </ul>
        <t indent="0" pn="section-1.1-7">BRSKI addresses these issues by defining extensions to the EST protocol
             for the automated distribution of vouchers.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-1.2">
        <name slugifiedName="name-terminology">Terminology</name>
        <t indent="0" pn="section-1.2-1">
    The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
    "<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
    described in BCP 14 <xref target="RFC2119" format="default" sectionFormat="of" derivedContent="RFC2119"/> <xref target="RFC8174" format="default" sectionFormat="of" derivedContent="RFC8174"/>
    when, and only when, they appear in all capitals, as shown here.
        </t>
        <t indent="0" pn="section-1.2-2">The following terms are defined for clarity:</t>
        <dl newline="false" spacing="normal" indent="3" pn="section-1.2-3">
          <dt pn="section-1.2-3.1">ANI:</dt>
          <dd pn="section-1.2-3.2">The Autonomic Networking Infrastructure as
            defined by <xref target="RFC8993" format="default" sectionFormat="of" derivedContent="RFC8993"/>.
            <xref target="acpapplicability" format="default" sectionFormat="of" derivedContent="Section 9"/> details specific requirements for pledges,
            proxies, and registrars when they are part of an ANI.</dd>
          <dt pn="section-1.2-3.3">Circuit Proxy:</dt>
          <dd pn="section-1.2-3.4">A stateful implementation
              of the Join Proxy. This is the assumed type of proxy.</dd>
          <dt pn="section-1.2-3.5">drop-ship:</dt>
          <dd pn="section-1.2-3.6">The physical distribution of equipment
            containing the "factory default" configuration to a final
            destination. In zero-touch scenarios, there is no staging or
            preconfiguration during drop-ship.</dd>
          <dt pn="section-1.2-3.7">Domain:</dt>
          <dd pn="section-1.2-3.8">The set of entities that share a common local
            trust anchor. This includes the proxy, registrar,
            domain CA, management components, and any
          existing entity that is already a member of the domain.</dd>
          <dt pn="section-1.2-3.9">Domain CA:</dt>
          <dd pn="section-1.2-3.10">The domain Certification Authority (CA)
            provides certification functionalities to the domain. At a minimum,
            it provides certification functionalities to a registrar and
            manages the private key that defines the domain. Optionally, it
            certifies all elements.</dd>
          <dt pn="section-1.2-3.11">domainID:</dt>
          <dd pn="section-1.2-3.12">The domain IDentity is a unique value
            based upon the registrar's CA certificate.
            <xref target="domainID" format="default" sectionFormat="of" derivedContent="Section 5.8.2"/> specifies how it is calculated.
            </dd>
          <dt pn="section-1.2-3.13">enrollment:</dt>
          <dd pn="section-1.2-3.14">The process where a device presents key
            material to a network and acquires a network-specific identity.
            For example, when a certificate signing request is presented to a
            CA, and a certificate is obtained in
          response.</dd>
          <dt pn="section-1.2-3.15">IDevID:</dt>
          <dd pn="section-1.2-3.16">An Initial Device Identifier X.509 certificate
            installed by the vendor on new equipment. This is a term from
            802.1AR <xref target="IDevID" format="default" sectionFormat="of" derivedContent="IDevID"/>.</dd>
          <dt pn="section-1.2-3.17">imprint:</dt>
          <dd pn="section-1.2-3.18">The process where a device obtains the
            cryptographic key material to identify and trust future
            interactions with a network. This term is taken from Konrad
            Lorenz's work in biology with new ducklings: during a critical
            period, the duckling would assume that anything that looks like a
            mother duck is in fact their mother. An equivalent for a device is
            to obtain the fingerprint of the network's root CA certificate. A device that imprints on an attacker
            suffers a similar fate to a duckling that imprints on a hungry
            wolf. Securely imprinting is a primary focus of this
            document <xref target="imprinting" format="default" sectionFormat="of" derivedContent="imprinting"/>. The analogy to
            Lorenz's work was first noted in <xref target="Stajano99theresurrecting" format="default" sectionFormat="of" derivedContent="Stajano99theresurrecting"/>.</dd>
          <dt pn="section-1.2-3.19">IPIP Proxy:</dt>
          <dd pn="section-1.2-3.20">A stateless proxy alternative.</dd>
          <dt pn="section-1.2-3.21">Join Proxy:</dt>
          <dd pn="section-1.2-3.22">A domain entity that helps the pledge join
            the domain. A Join Proxy facilitates communication for devices that
            find themselves in an environment where they are not provided
            connectivity until after they are validated as members of the
            domain. For simplicity, this document sometimes uses the
            term of "proxy" to indicate the Join Proxy. The pledge
            is unaware that they are communicating with a
            proxy rather than directly with a registrar.</dd>
          <dt pn="section-1.2-3.23">Join Registrar (and Coordinator):</dt>
          <dd pn="section-1.2-3.24">A representative of the domain that is
            configured, perhaps autonomically, to decide whether a new device
            is allowed to join the domain. The administrator of the domain
            interfaces with a "Join Registrar (and Coordinator)" to control this process. Typically, a
            Join Registrar is "inside" its domain. For simplicity, this document
            often refers to this as just "registrar". Within <xref target="RFC8993" format="default" sectionFormat="of" derivedContent="RFC8993"/>, it is
            referred to as the "Join Registrar Autonomic Service Agent (ASA)".
            Other communities use the abbreviation "JRC".
            </dd>
          <dt pn="section-1.2-3.25">LDevID:</dt>
          <dd pn="section-1.2-3.26">A Local Device Identifier X.509 certificate
            installed by the owner of the equipment. This is a term from
            802.1AR <xref target="IDevID" format="default" sectionFormat="of" derivedContent="IDevID"/>.</dd>
          <dt pn="section-1.2-3.27">manufacturer:</dt>
          <dd pn="section-1.2-3.28">The term manufacturer is used
            throughout this document as the entity that created the
            device.  This is typically the original equipment manufacturer
            (OEM), but in more complex situations, it could be a value added
            retailer (VAR), or possibly even a systems integrator.  In
            general, a goal of BRSKI is to eliminate small distinctions
            between different sales channels.  The reason for this is
            that it permits a single device, with a uniform firmware load, to
            be shipped directly to all customers.  This eliminates costs
            for the manufacturer.  This also reduces the number of products
            supported in the field, increasing the chance that firmware will
            be more up to date.
            </dd>
          <dt pn="section-1.2-3.29">MASA Audit-Log:</dt>
          <dd pn="section-1.2-3.30">An anonymized list of previous owners
            maintained by the MASA on a per-device (per-pledge)
            basis, as described in <xref target="MASAauditlog" format="default" sectionFormat="of" derivedContent="Section 5.8.1"/>.
            </dd>
          <dt pn="section-1.2-3.31">MASA Service:</dt>
          <dd pn="section-1.2-3.32">A third-party MASA service on the global Internet. The MASA
            signs vouchers. It also provides a repository for audit-log
            information of privacy-protected bootstrapping events. It does
            not track ownership. </dd>
          <dt pn="section-1.2-3.33">nonced:</dt>
          <dd pn="section-1.2-3.34">A voucher (or request) that contains a nonce (the normal
          case).</dd>
          <dt pn="section-1.2-3.35">nonceless:</dt>
          <dd pn="section-1.2-3.36">A voucher (or request) that does not
            contain a nonce and either relies upon accurate clocks for expiration or
            does not expire.</dd>
          <dt pn="section-1.2-3.37">offline:</dt>
          <dd pn="section-1.2-3.38">When an architectural component cannot
              perform real-time communications with a peer, due to
              either network connectivity or the peer being turned off, the
              operation is said to be occurring offline.</dd>
          <dt pn="section-1.2-3.39">Ownership Tracker:</dt>
          <dd pn="section-1.2-3.40">An Ownership Tracker service on
            the global Internet. The Ownership Tracker uses business processes
            to accurately track ownership of all devices shipped against
            domains that have purchased them. Although optional, this component
            allows vendors to provide additional value in cases where their
            sales and distribution channels allow for accurate tracking of
            such ownership.
	    Tracking information about ownership is indicated in
            vouchers, as described in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.</dd>
          <dt pn="section-1.2-3.41">Pledge:</dt>
          <dd pn="section-1.2-3.42">The prospective (unconfigured) device, which has an
            identity installed at the factory.</dd>
          <dt pn="section-1.2-3.43">(Public) Key Infrastructure:</dt>
          <dd pn="section-1.2-3.44"> The collection of systems and
            processes that sustains the activities of a public key system.
            The registrar acts as a "Registration Authority"; see
            <xref target="RFC5280" format="default" sectionFormat="of" derivedContent="RFC5280"/> and <xref target="RFC5272" sectionFormat="of" section="7" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5272#section-7" derivedContent="RFC5272"/>.</dd>
          <dt pn="section-1.2-3.45">TOFU:</dt>
          <dd pn="section-1.2-3.46">Trust on First Use. Used similarly to how it is described in <xref target="RFC7435" format="default" sectionFormat="of" derivedContent="RFC7435"/>. This is where a pledge
            device makes no security decisions but rather simply trusts the
            first registrar it is contacted by. This is also known as the
            "resurrecting duckling" model.</dd>
          <dt pn="section-1.2-3.47">Voucher:</dt>
          <dd pn="section-1.2-3.48">A signed artifact from the MASA
            that indicates the cryptographic identity of the
            registrar it should trust to a pledge. There are different types of vouchers
            depending on how that trust is asserted. Multiple voucher types are
            defined in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.</dd>
        </dl>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-1.3">
        <name slugifiedName="name-scope-of-solution">Scope of Solution</name>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-1.3.1">
          <name slugifiedName="name-support-environment">Support Environment</name>
          <t indent="0" pn="section-1.3.1-1">
          This solution (BRSKI) can support large router
        platforms with multi-gigabit inter-connections, mounted in controlled
        access data centers. But this solution is not exclusive to large equipment:
        it is intended to scale to thousands of devices located in hostile
        environments, such as ISP-provided Customer Premises Equipment (CPE) devices that are drop-shipped
        to the end user. The situation where an order is fulfilled from a
        distributed warehouse from a common stock and shipped directly to the
        target location at the request of a domain owner is explicitly
        supported. That stock ("SKU") could be provided to a number of
        potential domain owners, and the eventual domain owner will not know
        a priori which device will go to which location.
          </t>
          <t indent="0" pn="section-1.3.1-2">
          The bootstrapping process can take minutes to complete depending on
          the network infrastructure and device processing speed. The network
          communication itself is not optimized for speed; for privacy reasons,
          the discovery process allows for the pledge to avoid announcing its
          presence through broadcasting.
          </t>
          <t indent="0" pn="section-1.3.1-3">
          Nomadic or mobile devices often need to acquire credentials to
          access the network at the new location.  An example of this is
          mobile phone roaming among network operators, or even between
          cell towers.  This is usually called "handoff".
          BRSKI does not provide a low-latency handoff, which is usually a
          requirement in such situations.
          For these solutions, BRSKI can be used to create a relationship
          (an LDevID) with the "home" domain owner. The resulting credentials
          are then used to provide credentials more appropriate for a
          low-latency handoff.
          </t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-1.3.2">
          <name slugifiedName="name-constrained-environments">Constrained Environments</name>
          <t indent="0" pn="section-1.3.2-1">Questions have been posed as to whether this solution is suitable
        in general for Internet of Things (IoT) networks. This depends on the
        capabilities of the devices in question. The terminology of <xref target="RFC7228" format="default" sectionFormat="of" derivedContent="RFC7228"/> is best used to describe the boundaries.</t>
          <t indent="0" pn="section-1.3.2-2">The solution described in this document is aimed in general at
        non-constrained (i.e., Class 2+ <xref target="RFC7228" format="default" sectionFormat="of" derivedContent="RFC7228"/>) devices operating on a non-challenged
        network. The entire solution as described here is not intended to be
        usable as is by constrained devices operating on challenged networks
          (such as 802.15.4 Low-Power and Lossy Networks (LLNs)).</t>
          <t indent="0" pn="section-1.3.2-3">Specifically, there are protocol aspects described here that might
        result in congestion collapse or energy exhaustion of intermediate
        battery-powered routers in an LLN. Those types of networks should not
        use this solution. These limitations are predominately related to the
        large credential and key sizes required for device authentication.
        Defining symmetric key techniques that meet the operational
        requirements is out of scope, but the underlying protocol operations
        (TLS handshake and signing structures) have sufficient algorithm
          agility to support such techniques when defined.</t>
          <t indent="0" pn="section-1.3.2-4">The imprint protocol described here could, however, be used by
        non-energy constrained devices joining a non-constrained network (for
        instance, smart light bulbs are usually mains powered and use
        802.11 wireless technology). It could also be used by non-constrained devices across a
        non-energy constrained, but challenged, network (such as 802.15.4). The
        certificate contents, and the process by which the four
        questions above are resolved, do apply to constrained devices. It is
        simply the actual on-the-wire imprint protocol that could be
        inappropriate.</t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-1.3.3">
          <name slugifiedName="name-network-access-controls">Network Access Controls</name>
          <t indent="0" pn="section-1.3.3-1">This document presumes that network access control has
        already occurred, is not required, or is integrated by the proxy
        and registrar in such a way that the device itself does not need to
        be aware of the details. Although the use of an X.509 IDevID is consistent with IEEE 802.1AR <xref target="IDevID" format="default" sectionFormat="of" derivedContent="IDevID"/>, and allows for alignment with 802.1X
        network access control methods, its use here is for pledge
        authentication rather than network access control. Integrating
        this protocol with network access control, perhaps as an
        Extensible Authentication Protocol (EAP) method
        (see <xref target="RFC3748" format="default" sectionFormat="of" derivedContent="RFC3748"/>), is out of scope for this document.</t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-1.3.4">
          <name slugifiedName="name-bootstrapping-is-not-bootin">Bootstrapping is Not Booting</name>
          <t indent="0" pn="section-1.3.4-1">This document describes "bootstrapping" as the protocol
        used to obtain a local trust anchor. It is expected that this
        trust anchor, along with any additional configuration
        information subsequently installed, is persisted on the device
        across system restarts ("booting"). Bootstrapping occurs only
        infrequently such as when a device is transferred to a new
        owner or has been reset to factory default settings.</t>
        </section>
      </section>
      <section anchor="PostEnrollment" numbered="true" toc="include" removeInRFC="false" pn="section-1.4">
        <name slugifiedName="name-leveraging-the-new-key-infr">Leveraging the New Key Infrastructure / Next Steps</name>
        <t indent="0" pn="section-1.4-1">
          As a result of the protocol described herein, bootstrapped devices
          have the domain CA trust anchor in common. An end-entity (EE) certificate has
          optionally been issued from the domain CA. This makes it possible
          to securely deploy functionalities across the domain; for example:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-1.4-2">
          <li pn="section-1.4-2.1">Device management</li>
          <li pn="section-1.4-2.2">Routing authentication</li>
          <li pn="section-1.4-2.3">Service discovery</li>
        </ul>
        <t indent="0" pn="section-1.4-3">
          The major intended benefit is the ability to use the credentials
     deployed by this protocol to secure the
          Autonomic Control Plane (ACP) <xref target="RFC8994" format="default" sectionFormat="of" derivedContent="RFC8994"/>.
        </t>
      </section>
      <section anchor="ANIrequirements" numbered="true" toc="include" removeInRFC="false" pn="section-1.5">
        <name slugifiedName="name-requirements-for-autonomic-">Requirements for Autonomic Networking Infrastructure (ANI) Devices</name>
        <t indent="0" pn="section-1.5-1">
          The BRSKI protocol can be used in a number of environments. Some of
          the options in this document are the result of requirements that
          are out of the ANI scope.  This section defines the base
          requirements for ANI devices.
        </t>
        <t indent="0" pn="section-1.5-2">
          For devices that intend to become part of an ANI
          <xref target="RFC8993" format="default" sectionFormat="of" derivedContent="RFC8993"/> that includes an
          Autonomic Control Plane
          <xref target="RFC8994" format="default" sectionFormat="of" derivedContent="RFC8994"/>, the
          BRSKI protocol <bcp14>MUST</bcp14> be implemented.
        </t>
        <t indent="0" pn="section-1.5-3">
          The pledge must perform discovery of the proxy as described in
          <xref target="discovery" format="default" sectionFormat="of" derivedContent="Section 4.1"/> using the Discovery Unsolicited
   Link-Local (DULL) <xref target="RFC8990" format="default" sectionFormat="of" derivedContent="RFC8990"/> M_FLOOD announcements of the GeneRic Autonomic Signaling Protocol (GRASP).
        </t>
        <t indent="0" pn="section-1.5-4">
          Upon successfully validating a voucher artifact, a status telemetry
          <bcp14>MUST</bcp14> be returned; see <xref target="pledgestatus" format="default" sectionFormat="of" derivedContent="Section 5.7"/>.
        </t>
        <t indent="0" pn="section-1.5-5">
          An ANIMA ANI pledge <bcp14>MUST</bcp14> implement the EST automation
          extensions described in <xref target="ESTintegration" format="default" sectionFormat="of" derivedContent="Section 5.9"/>.
          They supplement the EST <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> to better
          support automated devices that do not have an end user.
        </t>
        <t indent="0" pn="section-1.5-6">
          The ANI Join Registrar ASA <bcp14>MUST</bcp14> support all the BRSKI and above-listed EST operations.
        </t>
        <t indent="0" pn="section-1.5-7">
          All ANI devices <bcp14>SHOULD</bcp14> support the BRSKI proxy function, using
          Circuit Proxies over the Autonomic Control Plane (ACP) (see <xref target="JRCgrasp" format="default" sectionFormat="of" derivedContent="Section 4.3"/>).
        </t>
      </section>
    </section>
    <section numbered="true" toc="include" removeInRFC="false" pn="section-2">
      <name slugifiedName="name-architectural-overview">Architectural Overview</name>
      <t indent="0" pn="section-2-1">The logical elements of the bootstrapping framework are described in
      this section. <xref target="architecturefigure" format="default" sectionFormat="of" derivedContent="Figure 1"/> provides a simplified overview of the components.
      </t>
      <figure anchor="architecturefigure" align="left" suppress-title="false" pn="figure-1">
        <name slugifiedName="name-architecture-overview">Architecture Overview</name>
        <artwork name="" type="" align="left" alt="" pn="section-2-2.1">
                                           +------------------------+
   +--------------Drop-Ship----------------| Vendor Service         |
   |                                       +------------------------+
   |                                       | M anufacturer|         |
   |                                       | A uthorized  |Ownership|
   |                                       | S igning     |Tracker  |
   |                                       | A uthority   |         |
   |                                       +--------------+---------+
   |                                                      ^
   |                                                      |  BRSKI-
   V                                                      |   MASA
+-------+     ............................................|...
|       |     .                                           |  .
|       |     .  +------------+       +-----------+       |  .
|       |     .  |            |       |           |       |  .
|Pledge |     .  |   Join     |       | Domain    &lt;-------+  .
|       |     .  |   Proxy    |       | Registrar |          .
|       &lt;--------&gt;............&lt;-------&gt; (PKI RA)  |          .
|       |        |        BRSKI-EST   |           |          .
|       |     .  |            |       +-----+-----+          .
|IDevID |     .  +------------+             | e.g., RFC 7030 .
|       |     .           +-----------------+----------+     .
|       |     .           | Key Infrastructure         |     .
|       |     .           | (e.g., PKI CA)             |     .
+-------+     .           |                            |     .
              .           +----------------------------+     .
              .                                              .
              ................................................
                            "Domain" Components
</artwork>
      </figure>
      <t indent="0" pn="section-2-3">We assume a multivendor network. In such an environment, there could
      be a manufacturer service for each manufacturer that supports devices following this
      document's specification, or an integrator could provide a generic
      service authorized by multiple manufacturers. It is unlikely that an
      integrator could provide ownership tracking services for multiple
      manufacturers due to the required sales channel integrations necessary to
      track ownership.</t>
      <t indent="0" pn="section-2-4">The domain is the managed network infrastructure with a key infrastructure that the pledge is
      joining. The domain provides initial device connectivity
      sufficient for bootstrapping through a proxy. The domain
      registrar authenticates the pledge, makes authorization decisions, and distributes
      vouchers obtained from the manufacturer service. Optionally, the registrar
      also acts as a PKI CA.</t>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-2.1">
        <name slugifiedName="name-behavior-of-a-pledge">Behavior of a Pledge</name>
        <t indent="0" pn="section-2.1-1">The pledge goes through a series of steps, which are outlined here
        at a high level.</t>
        <figure anchor="pledgestatusfigure" align="left" suppress-title="false" pn="figure-2">
          <name slugifiedName="name-pledge-state-diagram">Pledge State Diagram</name>
          <artwork name="" type="" align="left" alt="" pn="section-2.1-2.1">
               ------------
              /  Factory   \
              \  default   /
               -----+------
                    |
             +------v-------+
             | (1) Discover |
+------------&gt;              |
|            +------+-------+
|                   |
|            +------v-------+
|            | (2) Identify |
^------------+              |
| rejected   +------+-------+
|                   |
|            +------v-------+
|            | (3) Request  |
|            |     Join     |
|            +------+-------+
|                   |
|            +------v-------+
|            | (4) Imprint  |
^------------+              |
| Bad MASA   +------+-------+
| response          |  send Voucher Status Telemetry
|            +------v-------+
|            | (5) Enroll   |&lt;---+ (non-error HTTP codes)
^------------+              |\___/ (e.g., 202 "Retry-After")
| Enroll     +------+-------+
| failure           |
|              -----v------
|             /  Enrolled  \
^------------+             |
 Factory      \------------/
 reset

</artwork>
        </figure>
        <t indent="0" pn="section-2.1-3">State descriptions for the pledge are as follows:</t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-2.1-4">
          <li pn="section-2.1-4.1" derivedCounter="1.">Discover a communication channel to a registrar.</li>
          <li pn="section-2.1-4.2" derivedCounter="2.">Identify itself. This is done by presenting an X.509 IDevID
                credential to the discovered registrar (via the proxy) in a TLS
                handshake. (The registrar credentials are only provisionally
                accepted at this time.)</li>
          <li pn="section-2.1-4.3" derivedCounter="3.">Request to join the discovered registrar. A unique nonce is
                included, ensuring that any responses can be associated with this
                particular bootstrapping attempt.</li>
          <li pn="section-2.1-4.4" derivedCounter="4.">Imprint on the registrar. This requires verification of the
                manufacturer-service-provided voucher. A voucher contains sufficient
                information for the pledge to complete authentication of a
                registrar.  This document details this step in depth.
            </li>
          <li pn="section-2.1-4.5" derivedCounter="5.">Enroll. After imprint, an authenticated TLS (HTTPS) connection exists
            between the pledge and registrar.
            EST <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> can then be used to obtain a domain
            certificate from a registrar.</li>
        </ol>
        <t indent="0" pn="section-2.1-5">
          The pledge is now a member of, and can be managed by, the
          domain and will only repeat the discovery aspects of bootstrapping
          if it is returned to factory default settings.
        </t>
        <t indent="0" pn="section-2.1-6">
          This specification details integration with EST enrollment so that pledges can
          optionally obtain a locally issued certificate, although any
          Representational State Transfer (REST) (see <xref target="REST" format="default" sectionFormat="of" derivedContent="REST"/>)
          interface could be integrated in future work.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-2.2">
        <name slugifiedName="name-secure-imprinting-using-vou">Secure Imprinting Using Vouchers</name>
        <t indent="0" pn="section-2.2-1">A voucher is a cryptographically protected artifact (using a digital signature) to the pledge
        device authorizing a zero-touch imprint on the registrar
        domain. </t>
        <t indent="0" pn="section-2.2-2">The format and cryptographic mechanism of vouchers is described in
        detail in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.</t>
        <t indent="0" pn="section-2.2-3">Vouchers provide a flexible mechanism to secure imprinting: the
        pledge device only imprints when a voucher can be validated.
        At the lowest security levels, the MASA can indiscriminately issue
        vouchers and log claims of ownership by domains.  At the highest security
        levels, issuance of vouchers can be integrated with complex sales channel
        integrations that are beyond the scope of this document. The sales
        channel integration would verify actual (legal) ownership of the
        pledge by the domain.
            This
            provides the flexibility for a number of use cases via a single
            common protocol mechanism on the pledge and registrar devices that
            are to be widely deployed in the field. The MASA services have
            the flexibility to either leverage the currently defined claim
            mechanisms or experiment with higher or lower security levels.
        </t>
        <t indent="0" pn="section-2.2-4">
          Vouchers provide a signed but non-encrypted communication channel among
          the pledge, the MASA, and the registrar. The registrar maintains
          control over the transport and policy decisions, allowing the
          local security policy of the domain network to be enforced.
        </t>
      </section>
      <section anchor="IDevIDextension" numbered="true" toc="include" removeInRFC="false" pn="section-2.3">
        <name slugifiedName="name-initial-device-identifier">Initial Device Identifier</name>
        <t indent="0" pn="section-2.3-1">
          Pledge authentication and pledge voucher-request signing is via
          a PKIX-shaped certificate installed
          during the manufacturing process. This is the 802.1AR
          IDevID, and it
          provides a basis for authenticating the pledge during
          the protocol exchanges described here.
          There is no requirement for a common root PKI hierarchy.
          Each device manufacturer can generate its own root certificate.
          Specifically, the IDevID enables:
        </t>
        <ul bare="false" empty="false" indent="3" spacing="normal" pn="section-2.3-2">
          <li pn="section-2.3-2.1">
              Uniquely identifying the pledge by the Distinguished Name (DN)
              and subjectAltName (SAN) parameters in the IDevID. The
              unique identification of a pledge in the voucher objects are derived
              from those parameters as described below. <xref target="idevidprivacy" format="default" sectionFormat="of" derivedContent="Section 10.3"/> discusses privacy implications of the identifier.
            </li>
          <li pn="section-2.3-2.2">
              Providing a cryptographic authentication of the pledge to the
              registrar (see <xref target="pledgeauthorization" format="default" sectionFormat="of" derivedContent="Section 5.3"/>).
            </li>
          <li pn="section-2.3-2.3">
              Securing auto-discovery of the pledge's MASA by the registrar
              (see <xref target="obtainmasaurl" format="default" sectionFormat="of" derivedContent="Section 2.8"/>).
            </li>
          <li pn="section-2.3-2.4">
              Signing of a voucher-request by the pledge's IDevID
              (see <xref target="voucher-request" format="default" sectionFormat="of" derivedContent="Section 3"/>).
            </li>
          <li pn="section-2.3-2.5">
              Providing a cryptographic authentication of the pledge to the
              MASA (see <xref target="MASAassertion" format="default" sectionFormat="of" derivedContent="Section 5.5.5"/>).
            </li>
        </ul>
        <t indent="0" pn="section-2.3-3">
          Sections 7.2.13 (2009 edition) and 8.10.3 (2018 edition) of
          <xref target="IDevID" format="default" sectionFormat="of" derivedContent="IDevID"/> discuss keyUsage and
          extendedKeyUsage extensions in the IDevID certificate.
          <xref target="IDevID" format="default" sectionFormat="of" derivedContent="IDevID"/> acknowledges that adding restrictions
          in the certificate limits applicability of these long-lived
          certificates.  This specification emphasizes this point and
          therefore RECOMMENDS that no key usage restrictions be included.
          This is consistent with <xref target="RFC5280" sectionFormat="comma" section="4.2.1.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#section-4.2.1.3" derivedContent="RFC5280"/>,
          which does not
          require key usage restrictions for end-entity certificates.
        </t>
        <section anchor="PledgeIdentification" numbered="true" toc="include" removeInRFC="false" pn="section-2.3.1">
          <name slugifiedName="name-identification-of-the-pledg">Identification of the Pledge</name>
          <t indent="0" pn="section-2.3.1-1">

            In the context of BRSKI, pledges have a 1:1 relationship
            with a "serial-number".
            This serial-number is used both in the serial-number
            field of a voucher or voucher-requests (see <xref target="voucher-request" format="default" sectionFormat="of" derivedContent="Section 3"/>)
            and in local policies on the registrar or MASA
            (see <xref target="ProtocolDetails" format="default" sectionFormat="of" derivedContent="Section 5"/>).
          </t>
          <t indent="0" pn="section-2.3.1-2">
   There is a (certificate) serialNumber field defined in <xref target="RFC5280" sectionFormat="comma" section="4.1.2.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#section-4.1.2.2" derivedContent="RFC5280"/>.  In ASN.1, this is referred to as the
   CertificateSerialNumber.  This field is NOT relevant to this
   specification.  Do not confuse this field with the serial-number
   defined by this document, or by <xref target="IDevID" format="default" sectionFormat="of" derivedContent="IDevID"/> and <xref target="RFC4519" sectionFormat="comma" section="2.31" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4519#section-2.31" derivedContent="RFC4519"/>.
          </t>
          <t indent="0" pn="section-2.3.1-3">
The device serial number is defined in <xref target="RFC5280" section="A.1" sectionFormat="of" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#appendix-A.1" derivedContent="RFC5280"/> as the X520SerialNumber, with the OID tag id-at-serialNumber.
          </t>
          <t indent="0" pn="section-2.3.1-4">
   The device <em>serialNumber</em> field (X520SerialNumber) is used as follows
   by the pledge to build the <strong>serial-number</strong> that is placed in the
   voucher-request.  In order to build it, the fields need to be
   converted into a serial-number of "type string".
          </t>
          <t indent="0" pn="section-2.3.1-5">
            An example of a printable form of the serialNumber field
            is provided in <xref target="RFC4519" sectionFormat="comma" section="2.31" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4519#section-2.31" derivedContent="RFC4519"/> ("WI-3005").
            That section further provides equality and syntax attributes.
          </t>
          <t indent="0" pn="section-2.3.1-6">
            Due to the reality of existing device identity provisioning
            processes, some
            manufacturers have stored serial-numbers in other
            fields.
	    Registrars <bcp14>SHOULD</bcp14> be configurable, on a per-manufacturer
            basis, to look for serial-number equivalents in other fields.
          </t>
          <t indent="0" pn="section-2.3.1-7">
            As explained in <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/>, the registrar <bcp14>MUST</bcp14> again extract the
            serialNumber itself from the pledge's TLS certificate.  It
            can consult the serial-number in the pledge request if there is
            any possible confusion about the source of the serial-number.
          </t>
        </section>
        <section anchor="MASAURL" numbered="true" toc="include" removeInRFC="false" pn="section-2.3.2">
          <name slugifiedName="name-masa-uri-extension">MASA URI Extension</name>
          <t indent="0" pn="section-2.3.2-1">
            This document defines a new PKIX non-critical certificate
            extension to carry the MASA URI.
            This extension is intended to be used in the IDevID certificate.
            The URI is represented as described in <xref target="RFC5280" sectionFormat="of" section="7.4" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#section-7.4" derivedContent="RFC5280"/>.
          </t>
          <t indent="0" pn="section-2.3.2-2">
            The URI provides the authority information.
            The BRSKI "/.well-known" tree <xref target="RFC8615" format="default" sectionFormat="of" derivedContent="RFC8615"/> is
            described in <xref target="ProtocolDetails" format="default" sectionFormat="of" derivedContent="Section 5"/>.
          </t>
          <t indent="0" pn="section-2.3.2-3">
            A complete URI <bcp14>MAY</bcp14> be in this extension, including the "scheme", "authority", and "path".
            The complete URI will typically be used in diagnostic or
            experimental situations.


            Typically (and in consideration to constrained systems), this
            <bcp14>SHOULD</bcp14> be reduced to only the "authority", in which
            case a scheme of "https://"
            (see <xref target="RFC7230" sectionFormat="comma" section="2.7.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7230#section-2.7.3" derivedContent="RFC7230"/>)
            and a "path" of "/.well-known/brski" is to be
            assumed.

          </t>
          <t indent="0" pn="section-2.3.2-4">
            The registrar can assume that only the "authority" is present in
            the extension, if there are no slash ("/") characters in the
            extension.
          </t>
          <t indent="0" pn="section-2.3.2-5">
            <xref target="RFC5280" sectionFormat="of" section="7.4" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#section-7.4" derivedContent="RFC5280"/> calls out various
            schemes that <bcp14>MUST</bcp14> be supported, including the Lightweight Directory Access Protocol (LDAP), HTTP, and FTP.
            However, the registrar <bcp14>MUST</bcp14> use HTTPS for the BRSKI-MASA connection.
          </t>
          <t indent="0" pn="section-2.3.2-6">The new extension is identified as follows:</t>
          <figure anchor="masaurlmodule" align="left" suppress-title="false" pn="figure-3">
            <name slugifiedName="name-masaurl-asn1-module">MASAURL ASN.1 Module</name>
            <sourcecode name="" type="asn.1" markers="true" pn="section-2.3.2-7.1">
MASAURLExtnModule-2016 { iso(1) identified-organization(3) dod(6)
internet(1) security(5) mechanisms(5) pkix(7)
id-mod(0) id-mod-MASAURLExtn2016(96) }

DEFINITIONS IMPLICIT TAGS ::= BEGIN

-- EXPORTS ALL --

IMPORTS
EXTENSION
FROM PKIX-CommonTypes-2009
  { iso(1) identified-organization(3) dod(6) internet(1)
    security(5) mechanisms(5) pkix(7) id-mod(0)
    id-mod-pkixCommon-02(57) }

id-pe FROM PKIX1Explicit-2009
  { iso(1) identified-organization(3) dod(6) internet(1)
     security(5) mechanisms(5) pkix(7) id-mod(0)
     id-mod-pkix1-explicit-02(51) } ;

MASACertExtensions EXTENSION ::= { ext-MASAURL, ... }
ext-MASAURL EXTENSION ::= { SYNTAX MASAURLSyntax
IDENTIFIED BY id-pe-masa-url }

id-pe-masa-url OBJECT IDENTIFIER ::= { id-pe 32 }

MASAURLSyntax ::= IA5String

END

</sourcecode>
          </figure>
          <t indent="0" pn="section-2.3.2-8">The choice of id-pe is based on guidance found in <xref target="RFC5280" sectionFormat="of" section="4.2.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#section-4.2.2" derivedContent="RFC5280"/>: "These extensions may
be used to direct applications to on-line
          information about the issuer or the subject". The MASA URL is precisely
          that: online information about the particular subject. </t>
        </section>
      </section>
      <section anchor="flow" numbered="true" toc="include" removeInRFC="false" pn="section-2.4">
        <name slugifiedName="name-protocol-flow">Protocol Flow</name>
        <t indent="0" pn="section-2.4-1">A representative flow is shown in
        <xref target="protocoltimesequencefigure" format="default" sectionFormat="of" derivedContent="Figure 4"/>.</t>
        <figure anchor="protocoltimesequencefigure" align="left" suppress-title="false" pn="figure-4">
          <name slugifiedName="name-protocol-time-sequence-diag">Protocol Time Sequence Diagram</name>
          <artwork name="" type="" align="left" alt="" pn="section-2.4-2.1">
+--------+         +---------+    +------------+     +------------+
| Pledge |         | Circuit |    | Domain     |     | Vendor     |
|        |         | Join    |    | Registrar  |     | Service    |
|        |         | Proxy   |    |  (JRC)     |     | (MASA)     |
+--------+         +---------+    +------------+     +------------+
  |                     |                   |           Internet |
[discover]              |                   |                    |
  |&lt;-RFC 4862 IPv6 addr |                   |                    |
  |&lt;-RFC 3927 IPv4 addr | Appendix A        |  Legend            |
  |-++++++++++++++++++-&gt;|                   | C - Circuit        |
  | optional: mDNS query| Appendix B        |     Join Proxy     |
  | RFCs 6763/6762 (+)  |                   | P - Provisional TLS|
  |&lt;-++++++++++++++++++-|                   |     Connection     |
  | GRASP M_FLOOD       |                   |                    |
  |   periodic broadcast|                   |                    |
[identity]              |                   |                    |
  |&lt;-------------------&gt;C&lt;-----------------&gt;|                    |
  |         TLS via the Join Proxy          |                    |
  |&lt;--Registrar TLS server authentication---|                    |
[PROVISIONAL accept of server cert]         |                    |
  P---X.509 client authentication----------&gt;|                    |
[request join]                              |                    |
  P---Voucher-Request(w/nonce for voucher)-&gt;|                    |
  P                  /-------------------   |                    |
  P                  |                 [accept device?]          |
  P                  |                 [contact vendor]          |
  P                  |                      |--Pledge ID--------&gt;|
  P                  |                      |--Domain ID--------&gt;|
  P                  |                      |--optional:nonce---&gt;|
  P              optional:                  |     [extract DomainID]
  P        can occur in advance             |     [update audit-log]
  P            if nonceless                 |                    |
  P                  |                      |&lt;- voucher ---------|
  P                  \-------------------   | w/nonce if provided|
  P&lt;------voucher---------------------------|                    |
[imprint]                                   |                    |
  |-------voucher status telemetry---------&gt;|                    |
  |                                         |&lt;-device audit-log--|
  |                             [verify audit-log and voucher]   |
  |&lt;---------------------------------------&gt;|                    |
[enroll]                                    |                    |
  | Continue with enrollment using now      |                    |
  | bidirectionally authenticated TLS       |                    |
  | session per RFC 7030.                   |                    |
[enrolled]                                  |                    |
</artwork>
        </figure>
        <t indent="0" pn="section-2.4-3">
          On initial bootstrap, a new device (the pledge) uses a local service
          auto-discovery (the GeneRic Autonomic Signaling Protocol (GRASP) or Multicast DNS (mDNS)) to locate a Join Proxy.  The
          Join Proxy connects the pledge to a local registrar (the JRC).
        </t>
        <t indent="0" pn="section-2.4-4">
          Having found a candidate registrar, the fledgling pledge sends
          some information about itself to the registrar, including its
          serial number in the form of a voucher-request and its
          IDevID certificate as part of the TLS session.
        </t>
        <t indent="0" pn="section-2.4-5">
          The registrar can determine whether it expected such a device to
          appear and locates a MASA.  The location of the MASA is usually found in
          an extension in the IDevID.  Having determined that the MASA is
          suitable, the entire information from the initial voucher-request
          (including the device's serial number) is transmitted over the Internet in a
          TLS-protected channel to the manufacturer, along with information about
          the registrar/owner.
        </t>
        <t indent="0" pn="section-2.4-6">
          The manufacturer can then apply policy based on the provided
          information, as well as other sources of information (such as sales
          records), to decide whether
          to approve the claim  by the registrar to own the device; if the claim
          is accepted, a voucher is issued that directs the device to accept its
          new owner.
        </t>
        <t indent="0" pn="section-2.4-7">
          The voucher is returned to the registrar, but not immediately to
          the device -- the registrar has an opportunity to examine the
          voucher, the MASA's audit-logs, and other sources of information to
          determine whether the device has been tampered with and whether
          the bootstrap should be accepted.
        </t>
        <t indent="0" pn="section-2.4-8">
          No filtering of information is possible in the signed voucher, so
          this is a binary yes-or-no decision.  After the registrar has applied any local policy to the voucher, if it accepts the voucher, then the voucher is returned to the pledge for imprinting.
        </t>
        <t indent="0" pn="section-2.4-9">
          The voucher also includes a trust anchor that the pledge uses to
          represent the owner.
	  This is used to successfully bootstrap from an environment
          where only the manufacturer has built-in trust by the
          device to an environment where the owner now has a PKI footprint on the
          device.
        </t>
        <t indent="0" pn="section-2.4-10">
          When BRSKI is followed with EST, this single footprint is further
          leveraged into the full owner's PKI and an LDevID for the
          device. Subsequent reporting steps provide flows of  information to
          indicate success/failure of the process.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-2.5">
        <name slugifiedName="name-architectural-components">Architectural Components</name>
        <section anchor="pledge-overview" numbered="true" toc="include" removeInRFC="false" pn="section-2.5.1">
          <name slugifiedName="name-pledge">Pledge</name>
          <t indent="0" pn="section-2.5.1-1">
            The pledge is the device that is attempting to join. It is assumed that
            the pledge talks to the Join Proxy using link-local network
            connectivity.  In most cases, the pledge has no other
            connectivity until the pledge completes the enrollment process
            and receives some kind of network credential.
          </t>
        </section>
        <section anchor="proxy-overview" numbered="true" toc="include" removeInRFC="false" pn="section-2.5.2">
          <name slugifiedName="name-join-proxy">Join Proxy</name>
          <t indent="0" pn="section-2.5.2-1">
            The Join Proxy provides HTTPS connectivity between the
            pledge and the registrar. A Circuit Proxy mechanism is
            described in <xref target="proxydetails" format="default" sectionFormat="of" derivedContent="Section 4"/>. Additional
            mechanisms, including a Constrained Application Protocol (CoAP) mechanism and a stateless
            IP in IP (IPIP) mechanism, are the subject of future work.
          </t>
        </section>
        <section anchor="registrar-overview" numbered="true" toc="include" removeInRFC="false" pn="section-2.5.3">
          <name slugifiedName="name-domain-registrar">Domain Registrar</name>
          <t indent="0" pn="section-2.5.3-1">
            The domain's registrar operates as the BRSKI-MASA client when
            requesting vouchers from the MASA (see <xref target="brskimasatls" format="default" sectionFormat="of" derivedContent="Section 5.4"/>). The registrar
            operates as the BRSKI-EST server when pledges request
            vouchers (see <xref target="brskiesttls" format="default" sectionFormat="of" derivedContent="Section 5.1"/>). The registrar operates as the BRSKI-EST server
            "Registration Authority" if the pledge requests an end-entity certificate
          over the BRSKI-EST connection (see <xref target="ESTintegration" format="default" sectionFormat="of" derivedContent="Section 5.9"/>).
          </t>
          <t indent="0" pn="section-2.5.3-2">
            The registrar uses an Implicit Trust Anchor database for
            authenticating the BRSKI-MASA connection's MASA TLS server certificate.
            Configuration or distribution of trust anchors is out of scope
            for this specification.
          </t>
          <t indent="0" pn="section-2.5.3-3">
            The registrar uses a different Implicit Trust Anchor database for
            authenticating the BRSKI-EST connection's pledge TLS Client Certificate.
            Configuration or distribution of the BRSKI-EST client trust
            anchors is out of scope of this specification.  Note that the
            trust anchors
            in / excluded from the database will affect which manufacturers' devices are
            acceptable to the registrar as pledges, and they can also be used to limit the
            set of MASAs that are trusted for enrollment.
          </t>
        </section>
        <section anchor="masa-overview" numbered="true" toc="include" removeInRFC="false" pn="section-2.5.4">
          <name slugifiedName="name-manufacturer-service">Manufacturer Service</name>
          <t indent="0" pn="section-2.5.4-1">
            The manufacturer service provides two logically separate functions:
            the MASA as described in Sections
            <xref target="RequestVoucherFromMASA" format="counter" sectionFormat="of" derivedContent="5.5"/> and
            <xref target="VoucherResponse" format="counter" sectionFormat="of" derivedContent="5.6"/>
            and an ownership tracking/auditing function as described
            in Sections <xref target="pledgestatus" format="counter" sectionFormat="of" derivedContent="5.7"/>
            and <xref target="authzLogRequest" format="counter" sectionFormat="of" derivedContent="5.8"/>.
          </t>
        </section>
        <section anchor="pki-overview" numbered="true" toc="include" removeInRFC="false" pn="section-2.5.5">
          <name slugifiedName="name-public-key-infrastructure-p">Public Key Infrastructure (PKI)</name>
          <t indent="0" pn="section-2.5.5-1">
            The Public Key Infrastructure (PKI) administers certificates for the
            domain of concern, providing the trust anchor(s) for it and
            allowing enrollment of pledges with domain certificates.
          </t>
          <t indent="0" pn="section-2.5.5-2">
            The voucher provides a method for the distribution of a
            single PKI trust anchor (as the "pinned-domain-cert"). A distribution
            of the full set of current trust anchors is possible using the
            optional EST integration.
          </t>
          <t indent="0" pn="section-2.5.5-3">
            The domain's registrar acts as a
            Registration Authority <xref target="RFC5272" format="default" sectionFormat="of" derivedContent="RFC5272"/>, requesting certificates for pledges from
            the PKI.
          </t>
          <t indent="0" pn="section-2.5.5-4">
            The expectations of the PKI are unchanged from EST <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>.  This document does
            not place any additional architectural requirements on the PKI.
          </t>
        </section>
      </section>
      <section anchor="certificatevalidaty" numbered="true" toc="include" removeInRFC="false" pn="section-2.6">
        <name slugifiedName="name-certificate-time-validation">Certificate Time Validation</name>
        <section anchor="timeunknown" numbered="true" toc="include" removeInRFC="false" pn="section-2.6.1">
          <name slugifiedName="name-lack-of-real-time-clock">Lack of Real-Time Clock</name>
          <t indent="0" pn="section-2.6.1-1">
            When bootstrapping, many devices do not have knowledge of the
            current time. Mechanisms such as Network Time Protocols cannot be
            secured until bootstrapping is complete. Therefore, bootstrapping is
            defined with a framework that does not require knowledge of the current
            time.  A pledge <bcp14>MAY</bcp14> ignore all time stamps in the voucher and
            in the certificate validity periods if it does not know
            the current time.
          </t>
          <t indent="0" pn="section-2.6.1-2">
            The pledge is exposed to dates in the following five places:
            registrar certificate notBefore, registrar certificate
            notAfter,
            voucher created-on, and voucher expires-on.
            Additionally, Cryptographic Message Syntax (CMS) signatures contain a signingTime.
          </t>
          <t indent="0" pn="section-2.6.1-3">
            A pledge with a real-time clock in which it has confidence
            <bcp14>MUST</bcp14> check the above time fields in all certificates and
            signatures that it processes.
          </t>
          <t indent="0" pn="section-2.6.1-4">
            If the voucher contains a nonce,
            then the pledge <bcp14>MUST</bcp14> confirm the nonce matches the original
            pledge voucher-request. This ensures the voucher is fresh.
            See <xref target="RequestVoucherFromRegistrar" format="default" sectionFormat="of" derivedContent="Section 5.2"/>.
          </t>
        </section>
        <section anchor="infinitelifetime" numbered="true" toc="include" removeInRFC="false" pn="section-2.6.2">
          <name slugifiedName="name-infinite-lifetime-of-idevid">Infinite Lifetime of IDevID</name>
          <t indent="0" pn="section-2.6.2-1">
            Long-lived pledge certificates "<bcp14>SHOULD</bcp14> be assigned the
            GeneralizedTime value of 99991231235959Z" for the notAfter field as explained in <xref target="RFC5280" format="default" sectionFormat="of" derivedContent="RFC5280"/>.
          </t>
          <t indent="0" pn="section-2.6.2-2">
            Some deployed IDevID management systems are not compliant
            with the 802.1AR requirement for infinite lifetimes and
            are put in typical &lt;= 3 year certificate lifetimes.
            Registrars <bcp14>SHOULD</bcp14> be configurable on a per-manufacturer basis
            to ignore pledge lifetimes when the pledge does not follow the recommendations in <xref target="RFC5280" format="default" sectionFormat="of" derivedContent="RFC5280"/>.
          </t>
        </section>
      </section>
      <section anchor="cloudregistrar" numbered="true" toc="include" removeInRFC="false" pn="section-2.7">
        <name slugifiedName="name-cloud-registrar">Cloud Registrar</name>
        <t indent="0" pn="section-2.7-1">
          There exist operationally open networks wherein devices gain
          unauthenticated access to the Internet at large.
          In these use cases, the
          management domain for the device needs to be discovered within the
          larger Internet. The case where a device can boot and get access to
          a larger Internet is less likely within the ANIMA ACP scope but may
          be more important in the future.  In the ANIMA ACP scope, new
          devices will be quarantined behind a Join Proxy.
        </t>
        <t indent="0" pn="section-2.7-2">
          Additionally, there are some greenfield situations involving an
          entirely new installation where a device may have some kind of
          management uplink that it can use (such as via a 3G network, for
          instance).   In such a future situation, the device might use
          this management interface to learn that it should
          configure itself to become the local registrar.
        </t>
        <t indent="0" pn="section-2.7-3">
          In order to support these scenarios, the pledge <bcp14>MAY</bcp14> contact a well-known
          URI of a cloud registrar if a
              local registrar cannot be discovered or if the pledge's target use
              cases do not include a local registrar.</t>
        <t indent="0" pn="section-2.7-4">If the pledge uses a well-known URI for contacting a cloud registrar,
              a manufacturer-assigned Implicit Trust Anchor database (see <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>) <bcp14>MUST</bcp14>
              be used to authenticate that service as described in <xref target="RFC6125" format="default" sectionFormat="of" derivedContent="RFC6125"/>.  The use of a DNS-ID for validation is
              appropriate, and it may include wildcard components on the
              left-mode side. This is
              consistent with the human-user configuration of an EST server URI in
              <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>, which also depends on
<xref target="RFC6125" format="default" sectionFormat="of" derivedContent="RFC6125"/>.</t>
      </section>
      <section anchor="obtainmasaurl" numbered="true" toc="include" removeInRFC="false" pn="section-2.8">
        <name slugifiedName="name-determining-the-masa-to-con">Determining the MASA to Contact</name>
        <t indent="0" pn="section-2.8-1">
The registrar needs to be able to contact a MASA that is trusted by the pledge in order to obtain vouchers.</t>
        <t indent="0" pn="section-2.8-2">The device's IDevID will normally contain the MASA URL as detailed in <xref target="IDevIDextension" format="default" sectionFormat="of" derivedContent="Section 2.3"/>. This is the <bcp14>RECOMMENDED</bcp14>
        mechanism.</t>
        <t indent="0" pn="section-2.8-3">In some cases, it can be operationally difficult to ensure the necessary X.509 extensions are in the pledge's IDevID due to the difficulty of aligning current pledge manufacturing with software releases and development; thus, as a final fallback, the registrar <bcp14>MAY</bcp14> be manually configured or distributed with a MASA URL for each manufacturer. Note that the registrar can only select the configured MASA URL based on the trust anchor -- so manufacturers can only leverage this approach if they ensure a single MASA URL works for all pledges associated with each trust anchor.</t>
      </section>
    </section>
    <section anchor="voucher-request" numbered="true" toc="include" removeInRFC="false" pn="section-3">
      <name slugifiedName="name-voucher-request-artifact">Voucher-Request Artifact</name>
      <t indent="0" pn="section-3-1">
        Voucher-requests are how vouchers are requested.
        The semantics of the voucher-request are described below, in the YANG module.
      </t>
      <t indent="0" pn="section-3-2">
        A pledge forms the "pledge voucher-request", signs it with its
        IDevID, and submits it to the registrar.
      </t>
      <t indent="0" pn="section-3-3">
        In turn, the registrar forms the "registrar voucher-request",
        signs it with its registrar key pair, and submits it to the MASA.
      </t>
      <t indent="0" pn="section-3-4">
        The "proximity-registrar-cert" leaf is used in the pledge
        voucher-requests. This provides a method for the pledge to
        assert the registrar's proximity.
      </t>
      <t indent="0" pn="section-3-5">
        This network proximity results from the following properties in the
        ACP context:  the pledge is connected to the Join Proxy
        (<xref target="proxydetails" format="default" sectionFormat="of" derivedContent="Section 4"/>) using a link-local IPv6 connection.
        While the Join Proxy does not participate in any meaningful sense in
        the cryptography of the TLS connection (such as via a Channel
        Binding), the registrar can observe that the connection is via the
        private ACP (ULA) address of the Join Proxy, and it cannot come from
        outside the ACP.  The pledge must therefore be at most one IPv6
        link-local hop away from an existing node on the ACP.
      </t>
      <t indent="0" pn="section-3-6">
        Other users of BRSKI will need to define other kinds of assertions if
        the network proximity described above does not match their needs.
      </t>
      <t indent="0" pn="section-3-7">
        The "prior-signed-voucher-request" leaf is used in registrar
        voucher-requests. If present, it is the signed pledge voucher-request
        artifact. This provides a method for
        the registrar to forward the pledge's signed request to the
        MASA. This completes transmission of the signed
        proximity-registrar-cert leaf.
      </t>
      <t indent="0" pn="section-3-8">
        Unless otherwise signaled (outside the voucher-request artifact), the
        signing structure is as defined for vouchers; see
        <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.
      </t>
      <section anchor="noncelessVoucherRequest" numbered="true" toc="include" removeInRFC="false" pn="section-3.1">
        <name slugifiedName="name-nonceless-voucher-requests">Nonceless Voucher-Requests</name>
        <t indent="0" pn="section-3.1-1">
            A registrar <bcp14>MAY</bcp14> also retrieve nonceless vouchers by sending
            nonceless voucher-requests to the MASA in order to obtain
            vouchers for use when the registrar does not have connectivity to the
            MASA.
            No prior-signed-voucher-request leaf
            would be included.  The registrar will also need to know the serial number of
            the pledge. This document does not provide a mechanism for the
            registrar to learn that in an automated fashion. Typically, this will
            be done via the scanning of a bar code or QR code on packaging, or via
            some sales channel integration.
        </t>
      </section>
      <section anchor="voucher-request-tree-diagram" numbered="true" toc="include" removeInRFC="false" pn="section-3.2">
        <name slugifiedName="name-tree-diagram">Tree Diagram</name>
        <t indent="0" pn="section-3.2-1">The following tree diagram illustrates a high-level view of a
                voucher-request document.  The voucher-request builds upon
                the voucher artifact described in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.
                The tree diagram is described in <xref target="RFC8340" format="default" sectionFormat="of" derivedContent="RFC8340"/>.
                Each node in the diagram is
                fully described by the YANG module in <xref target="voucher-request-yang-module" format="default" sectionFormat="of" derivedContent="Section 3.4"/>.
                Please review the YANG module for a detailed description of the
                voucher-request format.</t>
        <figure anchor="voucherrequest_tree" align="left" suppress-title="false" pn="figure-5">
          <name slugifiedName="name-yang-tree-diagram-for-a-vou">YANG Tree Diagram for a Voucher-Request</name>
          <artwork name="" type="yangtree" align="left" alt="" pn="section-3.2-2.1">
module: ietf-voucher-request

 grouping voucher-request-grouping
  +-- voucher
     +-- created-on?                      yang:date-and-time
     +-- expires-on?                      yang:date-and-time
     +-- assertion?                       enumeration
     +-- serial-number                    string
     +-- idevid-issuer?                   binary
     +-- pinned-domain-cert?              binary
     +-- domain-cert-revocation-checks?   boolean
     +-- nonce?                           binary
     +-- last-renewal-date?               yang:date-and-time
     +-- prior-signed-voucher-request?    binary
     +-- proximity-registrar-cert?        binary
</artwork>
        </figure>
      </section>
      <section anchor="voucher-request-examples" numbered="true" toc="include" removeInRFC="false" pn="section-3.3">
        <name slugifiedName="name-examples">Examples</name>
        <t indent="0" pn="section-3.3-1">This section provides voucher-request examples for illustration
                purposes.
                These examples show JSON prior to CMS wrapping.
                JSON encoding rules specify that any binary
                content be base64 encoded (<xref target="RFC4648" sectionFormat="comma" section="4" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4648#section-4" derivedContent="RFC4648"/>).
                The contents of the (base64) encoded certificates have been elided
                to save space. For detailed examples, see <xref target="exampleprocess" format="default" sectionFormat="of" derivedContent="Appendix C.2"/>. These examples conform to the encoding rules
                defined in <xref target="RFC7951" format="default" sectionFormat="of" derivedContent="RFC7951"/>.</t>
        <ol group="examples" spacing="normal" type="Example (%d):" start="1" indent="adaptive" pn="section-3.3-2">
          <li pn="section-3.3-2.1" derivedCounter="Example (1):">The following example illustrates a pledge voucher-request. The
            assertion leaf is indicated as "proximity", and the registrar's TLS server
            certificate is included in the proximity-registrar-cert leaf. See
            <xref target="RequestVoucherFromRegistrar" format="default" sectionFormat="of" derivedContent="Section 5.2"/>.</li>
        </ol>
        <figure anchor="voucherrequest_example1" align="left" suppress-title="false" pn="figure-6">
          <name slugifiedName="name-json-representation-of-an-e">JSON Representation of an Example Voucher-Request</name>
          <sourcecode type="json" markers="false" pn="section-3.3-3.1">
{
    "ietf-voucher-request:voucher": {
        "assertion": "proximity",
        "nonce": "62a2e7693d82fcda2624de58fb6722e5",
        "serial-number" : "JADA123456789",
        "created-on": "2017-01-01T00:00:00.000Z",
        "proximity-registrar-cert": "base64encodedvalue=="
    }
}
</sourcecode>
        </figure>
        <ol group="examples" spacing="normal" type="Example (%d):" start="2" indent="adaptive" pn="section-3.3-4">
          <li pn="section-3.3-4.1" derivedCounter="Example (2):">The following example illustrates a registrar voucher-request.
                The prior-signed-voucher-request leaf is populated with the pledge's
                voucher-request (such as the prior example).  The pledge's
                voucher-request is a binary CMS-signed object.  In the JSON encoding used
                here, it must be base64 encoded. The nonce and
                assertion have been carried forward from the pledge request to
                the registrar request.
                The serial-number is extracted from
                the pledge's Client Certificate from the TLS connection. See
                <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/>.</li>
        </ol>
        <figure anchor="voucherrequest_prior_example1" align="left" suppress-title="false" pn="figure-7">
          <name slugifiedName="name-json-representation-of-an-ex">JSON Representation of an Example Prior-Signed Voucher-Request</name>
          <sourcecode type="json" markers="false" pn="section-3.3-5.1">
{
    "ietf-voucher-request:voucher": {
        "assertion" : "proximity",
        "nonce": "62a2e7693d82fcda2624de58fb6722e5",
        "created-on": "2017-01-01T00:00:02.000Z",
        "idevid-issuer": "base64encodedvalue==",
        "serial-number": "JADA123456789",
        "prior-signed-voucher-request": "base64encodedvalue=="
    }
}
</sourcecode>
        </figure>
        <ol group="examples" spacing="normal" type="Example (%d):" start="3" indent="adaptive" pn="section-3.3-6">
          <li pn="section-3.3-6.1" derivedCounter="Example (3):">The following example illustrates a registrar voucher-request.
                The prior-signed-voucher-request leaf is not populated with the pledge's
                voucher-request nor is the nonce leaf. This form might be used by a
                registrar requesting a voucher when the pledge cannot
                communicate with the registrar (such as when it is powered
                down or still in packaging)
                and therefore cannot submit a nonce.
                This scenario is most useful when the registrar is aware that
                it will not be able to reach the MASA during deployment.
                See
                <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/>.</li>
        </ol>
        <figure anchor="voucherrequest_offline_example1" align="left" suppress-title="false" pn="figure-8">
          <name slugifiedName="name-json-representation-of-an-o">JSON Representation of an Offline Voucher-Request</name>
          <sourcecode type="json" markers="false" pn="section-3.3-7.1">
{
    "ietf-voucher-request:voucher": {
        "created-on":    "2017-01-01T00:00:02.000Z",
        "idevid-issuer": "base64encodedvalue==",
        "serial-number": "JADA123456789"
    }
}
</sourcecode>
        </figure>
      </section>
      <section anchor="voucher-request-yang-module" numbered="true" toc="include" removeInRFC="false" pn="section-3.4">
        <name slugifiedName="name-yang-module">YANG Module</name>
        <t indent="0" pn="section-3.4-1">Following is a YANG module <xref target="RFC7950" format="default" sectionFormat="of" derivedContent="RFC7950"/> that formally
          extends a voucher <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/> into
        a voucher-request.  This YANG module references <xref target="ITU.X690" format="default" sectionFormat="of" derivedContent="ITU.X690"/>. </t>
        <figure anchor="voucherrequest_yang" align="left" suppress-title="false" pn="figure-9">
          <name slugifiedName="name-yang-module-for-voucher-req">YANG Module for Voucher-Request</name>
          <sourcecode name="ietf-voucher-request@2021-05-20.yang" type="yang" markers="true" pn="section-3.4-2.1">
module ietf-voucher-request {
  yang-version 1.1;
  namespace "urn:ietf:params:xml:ns:yang:ietf-voucher-request";
  prefix vcr;

  import ietf-restconf {
    prefix rc;
    description
      "This import statement is only present to access
       the yang-data extension defined in RFC 8040.";
    reference
      "RFC 8040: RESTCONF Protocol";
  }
  import ietf-voucher {
    prefix vch;
    description
      "This module defines the format for a voucher,
       which is produced by a pledge's manufacturer or
       delegate (MASA) to securely assign a pledge to
       an 'owner', so that the pledge may establish a secure
       connection to the owner's network infrastructure.";
    reference
      "RFC 8366: A Voucher Artifact for
       Bootstrapping Protocols";
  }

  organization
    "IETF ANIMA Working Group";
  contact
    "WG Web:   &lt;https://datatracker.ietf.org/wg/anima/&gt;
     WG List:  &lt;mailto:anima@ietf.org&gt;
     Author:   Kent Watsen
               &lt;mailto:kent+ietf@watsen.net&gt;
     Author:   Michael H. Behringer
               &lt;mailto:Michael.H.Behringer@gmail.com&gt;
     Author:   Toerless Eckert
               &lt;mailto:tte+ietf@cs.fau.de&gt;
     Author:   Max Pritikin
               &lt;mailto:pritikin@cisco.com&gt;
     Author:   Michael Richardson
               &lt;mailto:mcr+ietf@sandelman.ca&gt;";
  description
    "This module defines the format for a voucher-request.
     It is a superset of the voucher itself.
     It provides content to the MASA for consideration
     during a voucher-request.

     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 (RFC 2119) (RFC 8174) when, and only when,
     they appear in all capitals, as shown here.

     Copyright (c) 2021 IETF Trust and the persons identified as
     authors of the code. All rights reserved.

     Redistribution and use in source and binary forms, with or
     without modification, is permitted pursuant to, and subject
     to the license terms contained in, the Simplified BSD License
     set forth in Section 4.c of the IETF Trust's Legal Provisions
     Relating to IETF Documents
     (https://trustee.ietf.org/license-info).

     This version of this YANG module is part of RFC 8995; see the
     RFC itself for full legal notices.";

  revision 2021-05-20 {
    description
      "Initial version";
    reference
      "RFC 8995: Bootstrapping Remote Secure Key Infrastructure
       (BRSKI)";
  }

  // Top-level statement
  rc:yang-data voucher-request-artifact {
    uses voucher-request-grouping;
  }

  // Grouping defined for future usage

  grouping voucher-request-grouping {
    description
      "Grouping to allow reuse/extensions in future work.";
    uses vch:voucher-artifact-grouping {
      refine "voucher/created-on" {
        mandatory false;
      }
      refine "voucher/pinned-domain-cert" {
        mandatory false;
        description
          "A pinned-domain-cert field is not valid in a
           voucher-request, and any occurrence MUST be ignored.";
      }
      refine "voucher/last-renewal-date" {
        description
          "A last-renewal-date field is not valid in a
           voucher-request, and any occurrence MUST be ignored.";
      }
      refine "voucher/domain-cert-revocation-checks" {
        description
          "The domain-cert-revocation-checks field is not valid in a
           voucher-request, and any occurrence MUST be ignored.";
      }
      refine "voucher/assertion" {
        mandatory false;
        description
          "Any assertion included in registrar voucher-requests
           SHOULD be ignored by the MASA.";
      }
      augment "voucher" {
        description
          "Adds leaf nodes appropriate for requesting vouchers.";
        leaf prior-signed-voucher-request {
          type binary;
          description
            "If it is necessary to change a voucher, or re-sign and
             forward a voucher that was previously provided along a
             protocol path, then the previously signed voucher SHOULD
             be included in this field.

             For example, a pledge might sign a voucher-request
             with a proximity-registrar-cert, and the registrar
             then includes it as the prior-signed-voucher-request
             field.  This is a simple mechanism for a chain of
             trusted parties to change a voucher-request, while
             maintaining the prior signature information.

             The registrar and MASA MAY examine the prior-signed
             voucher information for the
             purposes of policy decisions.  For example, this
             information could be useful to a MASA to determine
             that both the pledge and registrar agree on proximity
             assertions.  The MASA SHOULD remove all
             prior-signed-voucher-request information when
             signing a voucher for imprinting so as to minimize
             the final voucher size.";
        }
        leaf proximity-registrar-cert {
          type binary;
          description
            "An X.509 v3 certificate structure, as specified by
             RFC 5280, Section 4, encoded using the ASN.1
             distinguished encoding rules (DER), as specified
             in ITU X.690.

             The first certificate in the registrar TLS server
             certificate_list sequence (the end-entity TLS
             certificate; see RFC 8446) presented by the registrar
             to the pledge.  This MUST be populated in a pledge's
             voucher-request when a proximity assertion is
             requested.";
          reference
            "ITU X.690: Information Technology - ASN.1 encoding
             rules: Specification of Basic Encoding Rules (BER),
             Canonical Encoding Rules (CER) and Distinguished
             Encoding Rules (DER)
             RFC 5280: Internet X.509 Public Key Infrastructure
             Certificate and Certificate Revocation List (CRL)
             Profile
             RFC 8446: The Transport Layer Security (TLS)
             Protocol Version 1.3";
        }
      }
    }
  }
}
</sourcecode>
        </figure>
      </section>
    </section>
    <section anchor="proxydetails" numbered="true" toc="include" removeInRFC="false" pn="section-4">
      <name slugifiedName="name-proxying-details-pledge-pro">Proxying Details (Pledge -- Proxy -- Registrar)</name>
      <t indent="0" pn="section-4-1">
        This section is normative for uses with an ANIMA ACP.
        The use of the GRASP mechanism is part of the ACP.
        Other users of BRSKI will need to define an equivalent proxy
        mechanism and an equivalent mechanism to configure the proxy.
      </t>
      <t indent="0" pn="section-4-2">
        The role of the proxy is to facilitate communications. The proxy
        forwards packets between the pledge and a registrar that has been
        provisioned to the proxy via full GRASP ACP discovery.
      </t>
      <t indent="0" pn="section-4-3">
        This section defines a stateful proxy mechanism that is referred
        to as a "circuit" proxy.  This is a form of Application Level Gateway
        (see <xref target="RFC2663" sectionFormat="comma" section="2.9" format="default" derivedLink="https://rfc-editor.org/rfc/rfc2663#section-2.9" derivedContent="RFC2663"/>).
      </t>
      <t indent="0" pn="section-4-4">
        The proxy does not terminate the TLS handshake: it passes streams
        of bytes onward without examination.
        A proxy <bcp14>MUST NOT</bcp14> assume any specific TLS version.  Please see
        <xref target="RFC8446" sectionFormat="comma" section="9.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8446#section-9.3" derivedContent="RFC8446"/> for
details on TLS invariants.
      </t>
      <t indent="0" pn="section-4-5">
        A registrar can directly provide the proxy announcements
        described below, in which case the
        announced port can point directly to the registrar itself.  In this
        scenario, the pledge is unaware that there is no proxying occurring.
        This is useful for registrars that are servicing pledges on directly
        connected networks.
      </t>
      <t indent="0" pn="section-4-6">
        As a result of the proxy discovery process in <xref target="brskigrasp" format="default" sectionFormat="of" derivedContent="Section 4.1.1"/>,
        the port number exposed by the proxy
        does not need to be well known or require an IANA allocation.
      </t>
      <t indent="0" pn="section-4-7">
        During the discovery of the registrar by the Join Proxy, the
        Join Proxy will also learn which kinds of proxy mechanisms are
        available.  This will allow the Join Proxy to use the lowest impact
        mechanism that the Join Proxy and registrar have in common.
      </t>
      <t indent="0" pn="section-4-8">
        In order to permit the proxy functionality to be implemented on the
        maximum variety of devices, the chosen mechanism should use the minimum
        amount of state on the proxy device. While many devices in the ANIMA
        target space will be rather large routers, the proxy function is
        likely to be implemented in the control-plane CPU of such a device,
        with available capabilities for the proxy function similar to many
        class 2 IoT devices.
      </t>
      <t indent="0" pn="section-4-9">
        The document <xref target="I-D.richardson-anima-state-for-joinrouter" format="default" sectionFormat="of" derivedContent="ANIMA-STATE"/> provides a
        more extensive analysis and background of the alternative proxy methods.
      </t>
      <section anchor="discovery" numbered="true" toc="include" removeInRFC="false" pn="section-4.1">
        <name slugifiedName="name-pledge-discovery-of-proxy">Pledge Discovery of Proxy</name>
        <t indent="0" pn="section-4.1-1">
              The result of discovery is a logical communication with a
              registrar, through a proxy.
              The proxy is transparent to the pledge.  The communication
              between the pledge and Join Proxy is over IPv6 link-local addresses.
        </t>
        <t indent="0" pn="section-4.1-2">To discover the proxy, the pledge performs the following
                actions:</t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-4.1-3">
          <li pn="section-4.1-3.1" derivedCounter="1.">
            <bcp14>MUST</bcp14>: Obtain a local address using IPv6
                    methods as described in "IPv6
                    Stateless Address Autoconfiguration" <xref target="RFC4862" format="default" sectionFormat="of" derivedContent="RFC4862"/>.
                    Use of temporary addresses <xref target="RFC8981" format="default" sectionFormat="of" derivedContent="RFC8981"/> is
                    encouraged.  To limit pervasive monitoring
                    <xref target="RFC7258" format="default" sectionFormat="of" derivedContent="RFC7258"/>, a new temporary address <bcp14>MAY</bcp14>
                    use a short lifetime (that is, set TEMP_PREFERRED_LIFETIME
                    to be short).
                    Pledges will generally prefer use of IPv6 link-local
                    addresses, and discovery of the proxy will be by link-local
                    mechanisms.
                    IPv4 methods are described in <xref target="IPv4operations" format="default" sectionFormat="of" derivedContent="Appendix A"/>.</li>
          <li pn="section-4.1-3.2" derivedCounter="2.">
            <bcp14>MUST</bcp14>: Listen for GRASP M_FLOOD
                    <xref target="RFC8990" format="default" sectionFormat="of" derivedContent="RFC8990"/>
                    announcements of the objective: "AN_Proxy".
                    See <xref target="brskigrasp" format="default" sectionFormat="of" derivedContent="Section 4.1.1"/> for the details of
                    the objective.  The pledge <bcp14>MAY</bcp14> listen concurrently for
                    other sources of information; see <xref target="mdnsmethods" format="default" sectionFormat="of" derivedContent="Appendix B"/>.
                </li>
        </ol>
        <t indent="0" pn="section-4.1-4">

            Once a proxy is
            discovered, the pledge communicates with a registrar through the
            proxy using the bootstrapping protocol defined in <xref target="ProtocolDetails" format="default" sectionFormat="of" derivedContent="Section 5"/>.
        </t>
        <t indent="0" pn="section-4.1-5">
              While the GRASP M_FLOOD mechanism is passive for the pledge, the
              non-normative other methods (mDNS and IPv4 methods) described in
              <xref target="mdnsmethods" format="default" sectionFormat="of" derivedContent="Appendix B"/> are active.
              The pledge <bcp14>SHOULD</bcp14> run those methods in parallel with listening
              for the M_FLOOD.  The active methods <bcp14>SHOULD</bcp14>
              back off by doubling to a maximum of one hour to avoid overloading the
              network with discovery attempts.  Detection of
              physical link status change (Ethernet carrier, for instance) <bcp14>SHOULD</bcp14>
              reset the back-off timers.
        </t>
        <t indent="0" pn="section-4.1-6">
              The pledge could discover more than one proxy on a given physical
              interface.  The pledge can have a multitude of physical
              interfaces as well: a Layer 2/3 Ethernet switch may have
              hundreds of physical ports.
        </t>
        <t indent="0" pn="section-4.1-7">
              Each possible proxy offer <bcp14>SHOULD</bcp14> be attempted up to the point
              where a valid voucher is received: while there are many ways in which
              the attempt may fail, it does not succeed until the voucher has
              been validated.
        </t>
        <t indent="0" pn="section-4.1-8">
              The connection attempts via a single proxy <bcp14>SHOULD</bcp14> exponentially
              back off to a maximum of one hour to avoid overloading the network
              infrastructure.   The back-off timer for each  <bcp14>MUST</bcp14> be
              independent of other connection attempts.
        </t>
        <t indent="0" pn="section-4.1-9">
                Connection attempts <bcp14>SHOULD</bcp14> be run in
                parallel to avoid head-of-queue problems wherein an attacker
                running a fake proxy or registrar could intentionally perform protocol
                actions slowly.  Connection attempts to
                different proxies <bcp14>SHOULD</bcp14> be sent with an interval of 3 to
                5s. The pledge <bcp14>SHOULD</bcp14> continue to
                listen for additional GRASP M_FLOOD messages during
                the connection attempts.
        </t>
        <t indent="0" pn="section-4.1-10">
              Each connection attempt through a distinct Join Proxy <bcp14>MUST</bcp14>
              have a unique nonce in the voucher-request.
        </t>
        <t indent="0" pn="section-4.1-11">
              Once a connection to a
              registrar is established (e.g., establishment of a TLS session key),
              there are expectations of more timely responses; see <xref target="RequestVoucherFromRegistrar" format="default" sectionFormat="of" derivedContent="Section 5.2"/>.
        </t>
        <t indent="0" pn="section-4.1-12">
              Once all discovered services are attempted (assuming that none
              succeeded), the device <bcp14>MUST</bcp14> return to listening for GRASP M_FLOOD.
              It <bcp14>SHOULD</bcp14> periodically retry any manufacturer-specific mechanisms.
              The pledge <bcp14>MAY</bcp14> prioritize selection order as
              appropriate for the anticipated environment.
        </t>
        <section anchor="brskigrasp" numbered="true" toc="include" removeInRFC="false" pn="section-4.1.1">
          <name slugifiedName="name-proxy-grasp-announcements">Proxy GRASP Announcements</name>
          <t indent="0" pn="section-4.1.1-1">
               A proxy uses the DULL GRASP M_FLOOD mechanism to announce
               itself.
               This announcement can be within the same message as the ACP
               announcement detailed in
               <xref target="RFC8994" format="default" sectionFormat="of" derivedContent="RFC8994"/>.

          </t>
          <t indent="0" pn="section-4.1.1-2">
               The formal Concise Data Definition Language (CDDL) <xref target="RFC8610" format="default" sectionFormat="of" derivedContent="RFC8610"/> definition is:
</t>
          <figure anchor="proxy_discovery_cddl" align="left" suppress-title="false" pn="figure-10">
            <name slugifiedName="name-cddl-definition-of-proxy-di">CDDL Definition of Proxy Discovery Message</name>
            <sourcecode name="proxygrasp.cddl" type="CDDL" markers="true" pn="section-4.1.1-3.1">
flood-message = [M_FLOOD, session-id, initiator, ttl,
                 +[objective, (locator-option / [])]]

objective = ["AN_Proxy", objective-flags, loop-count,
                                       objective-value]

ttl             = 180000     ; 180,000 ms (3 minutes)
initiator = ACP address to contact registrar
objective-flags   = sync-only  ; as in the GRASP spec
sync-only         =  4         ; M_FLOOD only requires
                               ; synchronization
loop-count        =  1         ; one hop only
objective-value   =  any       ; none

locator-option    = [ O_IPv6_LOCATOR, ipv6-address,
                    transport-proto, port-number ]
ipv6-address      = the v6 LL of the Proxy
$transport-proto /= IPPROTO_TCP   ; note that this can be any value
                                 ; from the IANA protocol registry,
                                 ; as per RFC 8990, Section 2.9.5.1,
                                 ; Note 3.
port-number      = selected by Proxy
</sourcecode>
          </figure>
          <t indent="0" pn="section-4.1.1-4">
               Here is an example M_FLOOD announcing a proxy at fe80::1,
               on TCP port 4443.
          </t>
          <figure anchor="proxy_discovery_mflood" align="left" suppress-title="false" pn="figure-11">
            <name slugifiedName="name-example-of-proxy-discovery-">Example of Proxy Discovery Message</name>
            <artwork name="" type="" align="left" alt="" pn="section-4.1.1-5.1">
[M_FLOOD, 12340815, h'fe800000000000000000000000000001', 180000,
            [["AN_Proxy", 4, 1, ""],
             [O_IPv6_LOCATOR,
              h'fe800000000000000000000000000001', IPPROTO_TCP, 4443]]]
</artwork>
          </figure>
          <t indent="0" pn="section-4.1.1-6">
               On a small network, the registrar <bcp14>MAY</bcp14> include the GRASP
               M_FLOOD announcements to locally connected networks.
          </t>
          <t indent="0" pn="section-4.1.1-7">
               The $transport-proto above indicates the method that the
               pledge-proxy-registrar will use.  The TCP method described
               here is mandatory, and other proxy methods, such as CoAP
               methods not defined in this document, are optional. Other
               methods <bcp14>MUST NOT</bcp14> be enabled unless the Join Registrar ASA
               indicates support for them in its own announcement.
          </t>
        </section>
      </section>
      <section anchor="coapconnection" numbered="true" toc="include" removeInRFC="false" pn="section-4.2">
        <name slugifiedName="name-coap-connection-to-registra">CoAP Connection to Registrar</name>
        <t indent="0" pn="section-4.2-1">
          The use of CoAP to connect from pledge to registrar
          is out of scope for this document and is described in future
          work. See <xref target="I-D.ietf-anima-constrained-voucher" format="default" sectionFormat="of" derivedContent="ANIMA-CONSTRAINED-VOUCHER"/>.
        </t>
      </section>
      <section anchor="JRCgrasp" numbered="true" toc="include" removeInRFC="false" pn="section-4.3">
        <name slugifiedName="name-proxy-discovery-and-communi">Proxy Discovery and Communication of Registrar</name>
        <t indent="0" pn="section-4.3-1"> The registrar <bcp14>SHOULD</bcp14> announce itself so that proxies can find it
        and determine what kind of connections can be terminated.
        </t>
        <t indent="0" pn="section-4.3-2">
          The registrar announces itself using GRASP M_FLOOD messages,
          with the "AN_join_registrar" objective, within the ACP instance.
          A registrar may announce any convenient port
          number, including use of stock port 443.
          ANI proxies <bcp14>MUST</bcp14> support GRASP discovery of registrars.
        </t>
        <t indent="0" pn="section-4.3-3">
          The M_FLOOD is formatted as follows:
</t>
        <figure anchor="registrar_discovery_example1" align="left" suppress-title="false" pn="figure-12">
          <name slugifiedName="name-an-example-of-a-registrar-a">An Example of a Registrar Announcement Message</name>
          <artwork name="" type="" align="left" alt="" pn="section-4.3-4.1">
[M_FLOOD, 51804321, h'fda379a6f6ee00000200000064000001', 180000,
            [["AN_join_registrar", 4, 255, "EST-TLS"],
             [O_IPv6_LOCATOR,
              h'fda379a6f6ee00000200000064000001', IPPROTO_TCP, 8443]]]
</artwork>
        </figure>
        <t indent="0" pn="section-4.3-5">
          The formal CDDL definition is:
</t>
        <figure anchor="registrar_discovery_cddl" align="left" suppress-title="false" pn="figure-13">
          <name slugifiedName="name-cddl-definition-for-registr">CDDL Definition for Registrar Announcement Message</name>
          <sourcecode name="jrcgrasp.cddl" type="CDDL" markers="true" pn="section-4.3-6.1">
flood-message = [M_FLOOD, session-id, initiator, ttl,
                 +[objective, (locator-option / [])]]

objective = ["AN_join_registrar", objective-flags, loop-count,
                                       objective-value]

initiator = ACP address to contact registrar
objective-flags = sync-only  ; as in the GRASP spec
sync-only =  4               ; M_FLOOD only requires
                             ; synchronization
loop-count      = 255        ; mandatory maximum
objective-value = text       ; name of the (list of) supported
                             ; protocols: "EST-TLS" for RFC 7030.
</sourcecode>
        </figure>
        <t indent="0" pn="section-4.3-7">
          The M_FLOOD message <bcp14>MUST</bcp14> be sent periodically.  The default period <bcp14>SHOULD</bcp14> be
          60 seconds, and the value <bcp14>SHOULD</bcp14> be operator configurable but <bcp14>SHOULD NOT</bcp14> be smaller than 60 seconds.  The frequency of sending <bcp14>MUST</bcp14> be such
          that the aggregate amount of periodic M_FLOODs from all flooding
          sources causes only negligible traffic across the ACP.
        </t>
        <t indent="0" pn="section-4.3-8">
               Here are some examples of locators for illustrative purposes.
               Only the first one ($transport-protocol = 6, TCP) is defined in
               this document and is mandatory to implement.
        </t>
        <artwork name="" type="" align="left" alt="" pn="section-4.3-9">
locator1  = [O_IPv6_LOCATOR, fd45:1345::6789, 6,  443]
locator2  = [O_IPv6_LOCATOR, fd45:1345::6789, 17, 5683]
locator3  = [O_IPv6_LOCATOR, fe80::1234, 41, nil]</artwork>
        <t indent="0" pn="section-4.3-10">
               A protocol of 6 indicates that TCP proxying on the
               indicated port is desired.
        </t>
        <t indent="0" pn="section-4.3-11">
               Registrars <bcp14>MUST</bcp14> announce the set of protocols that they
               support, and they <bcp14>MUST</bcp14> support TCP traffic.
        </t>
        <t indent="0" pn="section-4.3-12">
               Registrars <bcp14>MUST</bcp14> accept HTTPS/EST traffic on the TCP ports
               indicated.
        </t>
        <t indent="0" pn="section-4.3-13">
               Registrars <bcp14>MUST</bcp14> support the ANI TLS Circuit Proxy and
               therefore BRSKI across HTTPS/TLS native across the ACP.
        </t>
        <t indent="0" pn="section-4.3-14">
               In the ANI, the ACP-secured instance of
               GRASP <xref target="RFC8990" format="default" sectionFormat="of" derivedContent="RFC8990"/> <bcp14>MUST</bcp14> be used for
               discovery of ANI registrar ACP addresses
               and ports by ANI proxies.  Therefore, the TCP leg of the proxy connection between
               the ANI proxy and ANI registrar also runs across the ACP.
        </t>
      </section>
    </section>
    <section anchor="ProtocolDetails" numbered="true" toc="include" removeInRFC="false" pn="section-5">
      <name slugifiedName="name-protocol-details-pledge-reg">Protocol Details (Pledge -- Registrar -- MASA)</name>
      <t indent="0" pn="section-5-1">The pledge <bcp14>MUST</bcp14> initiate BRSKI after boot if it is unconfigured.
        The pledge <bcp14>MUST NOT</bcp14> automatically initiate BRSKI if it has been
        configured or is in the process of being configured.</t>
      <t indent="0" pn="section-5-2">
          BRSKI is described as extensions to EST <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>.
          The goal of these extensions is to reduce the number of TLS
          connections and crypto operations required on the pledge.
          The registrar implements the BRSKI REST interface within
          the "/.well-known/brski" URI tree and implements the existing EST URIs as
          described in
          EST <xref target="RFC7030" sectionFormat="comma" section="3.2.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.2.2" derivedContent="RFC7030"/>. The communication channel
          between the pledge and the registrar is referred to as "BRSKI-EST"
          (see <xref target="architecturefigure" format="default" sectionFormat="of" derivedContent="Figure 1"/>).
      </t>
      <t indent="0" pn="section-5-3">
	The communication channel between the registrar and MASA is a new
   communication channel, similar to EST, within the newly registered
   "/.well-known/brski" tree.  For clarity, this channel is referred to
   as "BRSKI-MASA" (see <xref target="architecturefigure" format="default" sectionFormat="of" derivedContent="Figure 1"/>).
      </t>
      <t indent="0" pn="section-5-4">The MASA URI is "https://" authority "/.well-known/brski".</t>
      <t indent="0" pn="section-5-5">
          BRSKI uses existing CMS message formats for existing EST
          operations.  BRSKI uses JSON
          <xref target="RFC8259" format="default" sectionFormat="of" derivedContent="RFC8259"/> for all new operations defined here and
          for voucher formats. In all places where a binary value must be carried
          in a JSON string, a base64 format (<xref target="RFC4648" sectionFormat="comma" section="4" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4648#section-4" derivedContent="RFC4648"/>) is to be used, as per
          <xref target="RFC7951" sectionFormat="comma" section="6.6" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7951#section-6.6" derivedContent="RFC7951"/>.
      </t>
      <t indent="0" pn="section-5-6">
          While EST (<xref target="RFC7030" sectionFormat="comma" section="3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.2" derivedContent="RFC7030"/>) does not insist upon use of HTTP
          persistent connections
          (<xref target="RFC7230" sectionFormat="comma" section="6.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7230#section-6.3" derivedContent="RFC7230"/>),
          BRSKI-EST connections <bcp14>SHOULD</bcp14> use persistent
          connections.  The intention of this guidance is to ensure the
          provisional TLS state occurs only once, and that the subsequent
          resolution of the provision state is not subject to a Man-in-the-Middle (MITM) attack
          during a critical phase.
      </t>
      <t indent="0" pn="section-5-7">
          If non-persistent connections are used, then both the pledge and
          the registrar <bcp14>MUST</bcp14> remember the certificates that have been seen and also sent
          for the first connection.  They <bcp14>MUST</bcp14> check each subsequent
          connection for the same certificates, and each end <bcp14>MUST</bcp14> use
          the same certificates as well.  This places a difficult restriction
          on rolling certificates on the registrar.
      </t>
      <t indent="0" pn="section-5-8">Summarized automation extensions for the BRSKI-EST flow are:</t>
      <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-5-9">
        <li pn="section-5-9.1">
              The pledge either attempts concurrent connections via each
              discovered proxy or times out quickly and tries connections
              in series, as explained at the end of <xref target="brskiesttls" format="default" sectionFormat="of" derivedContent="Section 5.1"/>.
            </li>
        <li pn="section-5-9.2">
              The pledge provisionally accepts the registrar certificate during
              the TLS handshake as detailed in <xref target="brskiesttls" format="default" sectionFormat="of" derivedContent="Section 5.1"/>.
            </li>
        <li pn="section-5-9.3">
              The pledge requests a voucher using
              the new REST calls described below.  This voucher is then validated.
            </li>
        <li pn="section-5-9.4">
              The pledge completes authentication of the server certificate as
              detailed in <xref target="CompletingAuthenticationBootstrapping" format="default" sectionFormat="of" derivedContent="Section 5.6.1"/>. This
              moves the BRSKI-EST TLS connection out of the provisional
              state.
            </li>
        <li pn="section-5-9.5">
              Mandatory bootstrap steps conclude with voucher status
              telemetry (see <xref target="pledgestatus" format="default" sectionFormat="of" derivedContent="Section 5.7"/>).
            </li>
      </ul>
      <t indent="0" pn="section-5-10">
          The BRSKI-EST TLS connection can now be used for EST enrollment.
      </t>
      <t indent="0" pn="section-5-11">The extensions for a registrar (equivalent to an EST server) are:</t>
      <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-5-12">
        <li pn="section-5-12.1">
            Client authentication is automated using IDevID as per the EST certificate-based client authentication.
            The subject field's DN encoding <bcp14>MUST</bcp14> include the "serialNumber"
            attribute   with the device's unique serial number
            as explained in <xref target="PledgeIdentification" format="default" sectionFormat="of" derivedContent="Section 2.3.1"/>.
        </li>
        <li pn="section-5-12.2">The registrar requests and validates the voucher from the MASA.</li>
        <li pn="section-5-12.3">The registrar forwards the voucher to the pledge when
          requested.</li>
        <li pn="section-5-12.4">
            The registrar performs log verifications (described in
            <xref target="auditLogVerification" format="default" sectionFormat="of" derivedContent="Section 5.8.3"/>) in addition to local
            authorization checks before accepting optional pledge device
            enrollment requests.
          </li>
      </ul>
      <section anchor="brskiesttls" numbered="true" toc="include" removeInRFC="false" pn="section-5.1">
        <name slugifiedName="name-brski-est-tls-establishment">BRSKI-EST TLS Establishment Details</name>
        <t indent="0" pn="section-5.1-1">The pledge establishes the TLS connection with the registrar through
                the Circuit Proxy (see <xref target="proxydetails" format="default" sectionFormat="of" derivedContent="Section 4"/>),
                but the TLS handshake is with the registrar. The BRSKI-EST pledge
                is the TLS client, and the BRSKI-EST registrar is the TLS server.
                All security associations established are
                between the pledge and the registrar regardless of proxy
                operations.
        </t>
        <t indent="0" pn="section-5.1-2">
              Use of TLS 1.3 (or newer) is encouraged.
              TLS 1.2 or newer is <bcp14>REQUIRED</bcp14> on the pledge side.
              TLS 1.3 (or newer) <bcp14>SHOULD</bcp14> be available on the registrar server interface,
              and the registrar client interface, but TLS 1.2 <bcp14>MAY</bcp14> be used.
              TLS 1.3 (or newer) <bcp14>SHOULD</bcp14> be available on the MASA server interface, but TLS
              1.2 <bcp14>MAY</bcp14> be used.
        </t>
        <t indent="0" pn="section-5.1-3">
              Establishment of the BRSKI-EST TLS connection is as
              specified in "Bootstrap Distribution of CA Certificates" (Section <xref target="RFC7030" section="4.1.1" sectionFormat="bare" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-4.1.1" derivedContent="RFC7030"/>) of <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>, wherein
              the client is authenticated with the IDevID certificate, and the
              EST server (the registrar) is provisionally authenticated with an unverified
              server certificate.

              Configuration or distribution of the trust anchor database
              used for validating the IDevID certificate is out of scope of
              this specification.  Note that the trust anchors
              in / excluded from the database will affect which manufacturers'
              devices are acceptable to the registrar as pledges and can
              also be used to limit the set of MASAs that are trusted for
              enrollment.
        </t>
        <t indent="0" pn="section-5.1-4">
              The signature in the certificate <bcp14>MUST</bcp14> be validated even if a
              signing key cannot (yet) be validated.  The certificate (or
              chain) <bcp14>MUST</bcp14> be retained for later validation.
        </t>
        <t indent="0" pn="section-5.1-5">
              A self-signed
              certificate for the registrar is acceptable as the voucher
              can validate it upon successful enrollment.
        </t>
        <t indent="0" pn="section-5.1-6">The pledge performs input validation of all data received
               until a voucher is verified as specified in <xref target="CompletingAuthenticationBootstrapping" format="default" sectionFormat="of" derivedContent="Section 5.6.1"/> and
               the TLS connection leaves the provisional state. Until these
               operations are complete, the pledge could be communicating
               with an attacker.
        </t>
        <t indent="0" pn="section-5.1-7">
              The pledge code needs to be written with the assumption that
              all data is being transmitted at this point to an
              unauthenticated peer, and that received data, while inside a
              TLS connection, <bcp14>MUST</bcp14> be considered untrusted.  This
              particularly applies to HTTP headers and CMS structures that
              make up the voucher.
        </t>
        <t indent="0" pn="section-5.1-8">
              A pledge that can connect to multiple registrars concurrently
              <bcp14>SHOULD</bcp14> do so.  Some devices may be unable to do so for lack of
              threading, or resource issues.   Concurrent connections defeat
              attempts by a malicious proxy from causing a TCP Slowloris-like
              attack (see <xref target="slowloris" format="default" sectionFormat="of" derivedContent="slowloris"/>).
        </t>
        <t indent="0" pn="section-5.1-9">
              A pledge that cannot maintain as many connections as there are
              eligible proxies will need to rotate among the various choices,
              terminating connections that do not appear to be making
              progress.
              If no connection is making progress after 5 seconds, then the
              pledge <bcp14>SHOULD</bcp14> drop the oldest connection and go on to a
              different proxy: the proxy that has been communicated with least recently.


              If there were no
              other proxies discovered, the pledge <bcp14>MAY</bcp14> continue to wait,
              as long as it is concurrently listening for new proxy
              announcements.
        </t>
      </section>
      <section anchor="RequestVoucherFromRegistrar" numbered="true" toc="include" removeInRFC="false" pn="section-5.2">
        <name slugifiedName="name-pledge-requests-voucher-fro">Pledge Requests Voucher from the Registrar</name>
        <t indent="0" pn="section-5.2-1">When the pledge bootstraps, it makes a request for a voucher from a
        registrar.</t>
        <t indent="0" pn="section-5.2-2">This is done with an HTTPS POST using the operation path value of
        "/.well-known/brski/requestvoucher".</t>
        <t indent="0" pn="section-5.2-3">The pledge voucher-request Content-Type is as follows.</t>
        <dl newline="false" spacing="normal" indent="3" pn="section-5.2-4">
          <dt pn="section-5.2-4.1">application/voucher-cms+json:</dt>
          <dd pn="section-5.2-4.2">
            <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/> defines a "YANG-defined JSON document that has been signed using a Cryptographic Message Syntax (CMS)
           structure", and the voucher-request described in
           <xref target="voucher-request" format="default" sectionFormat="of" derivedContent="Section 3"/> is created in the same way.
           The media type is the same as defined in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.
           This is also used for the pledge voucher-request.
           The pledge <bcp14>MUST</bcp14> sign the request using the
           credentials in <xref target="IDevIDextension" format="default" sectionFormat="of" derivedContent="Section 2.3"/>.
          </dd>
        </dl>
        <t indent="0" pn="section-5.2-5">Registrar
        implementations <bcp14>SHOULD</bcp14> anticipate future media types but, of course, will simply fail the request if those
        types are not yet known.</t>
        <t indent="0" pn="section-5.2-6">
          The pledge <bcp14>SHOULD</bcp14> include an
          "Accept" header field (see <xref target="RFC7231" sectionFormat="comma" section="5.3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7231#section-5.3.2" derivedContent="RFC7231"/>) indicating the acceptable media type for the voucher
          response. The  "application/voucher-cms+json" media type is defined
          in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>, but constrained voucher formats are
          expected in the future. Registrars and MASA are expected to be
          flexible in what they accept.
        </t>
        <t indent="0" pn="section-5.2-7">The pledge populates the voucher-request fields as follows:</t>
        <dl newline="false" spacing="normal" indent="3" pn="section-5.2-8">
          <dt pn="section-5.2-8.1">created-on:</dt>
          <dd pn="section-5.2-8.2">Pledges that have a real-time clock are
            <bcp14>RECOMMENDED</bcp14> to populate this field with the current date and
            time in yang:date-and-time format. This provides additional
            information to the MASA.
            Pledges that have no real-time clocks <bcp14>MAY</bcp14> omit this field.
            </dd>
          <dt pn="section-5.2-8.3">nonce:</dt>
          <dd pn="section-5.2-8.4">The pledge voucher-request <bcp14>MUST</bcp14> contain a
            cryptographically strong random or pseudo-random number
            nonce (see <xref target="RFC4086" sectionFormat="comma" section="6.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4086#section-6.2" derivedContent="RFC4086"/>).
            As the nonce is usually generated very early in the boot sequence,
            there is a concern that the same nonce might be generated across
            multiple boots, or after a factory reset.
            Different nonces <bcp14>MUST</bcp14> be generated for each bootstrapping
            attempt, whether in series or concurrently.
            The freshness of this nonce mitigates against the lack of a real-time
            clock as explained in <xref target="timeunknown" format="default" sectionFormat="of" derivedContent="Section 2.6.1"/>.
            </dd>
          <dt pn="section-5.2-8.5">assertion:</dt>
          <dd pn="section-5.2-8.6">
              The pledge indicates support for the mechanism
              described in this document, by putting the value "proximity" in the
              voucher-request, and <bcp14>MUST</bcp14> include the
              proximity-registrar-cert field (below).
            </dd>
          <dt pn="section-5.2-8.7">proximity-registrar-cert:</dt>
          <dd pn="section-5.2-8.8">In a pledge
            voucher-request, this is the first certificate in the TLS server
            "certificate_list" sequence (see <xref target="RFC8446" sectionFormat="comma" section="4.4.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8446#section-4.4.2" derivedContent="RFC8446"/>) presented by the
            registrar to the pledge. That is, it is the end-entity
            certificate. This <bcp14>MUST</bcp14> be populated in a pledge voucher-request.
            </dd>
          <dt pn="section-5.2-8.9">serial-number:</dt>
          <dd pn="section-5.2-8.10">The serial number of the pledge
            is included in the voucher-request from the pledge. This value is
            included as a sanity check only, but it is not to be forwarded
            by the registrar as described in <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/>.
            </dd>
        </dl>
        <t indent="0" pn="section-5.2-9">All other fields <bcp14>MAY</bcp14> be omitted in the pledge voucher-request.</t>
        <t indent="0" pn="section-5.2-10">See an example JSON payload of a pledge voucher-request in
            <xref target="voucher-request-examples" format="default" sectionFormat="of" derivedContent="Section 3.3"/>, Example 1.</t>
        <t indent="0" pn="section-5.2-11">
          The registrar confirms that the
          assertion is "proximity" and that pinned
          proximity-registrar-cert is the registrar's certificate.
          If this validation fails, then there is an on-path attacker (MITM),
          and the connection <bcp14>MUST</bcp14> be closed after the returning of an
          HTTP 401 error code.
        </t>
      </section>
      <section anchor="pledgeauthorization" numbered="true" toc="include" removeInRFC="false" pn="section-5.3">
        <name slugifiedName="name-registrar-authorization-of-">Registrar Authorization of Pledge</name>
        <t indent="0" pn="section-5.3-1">
          In a fully automated network, all devices must be securely identified
          and authorized to join the domain.
        </t>
        <t indent="0" pn="section-5.3-2">
          A registrar accepts or declines a request to join the domain, based
          on the authenticated identity presented.  For different networks,
          examples of automated acceptance may include the allowance of:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-5.3-3">
          <li pn="section-5.3-3.1">any device of a specific type (as determined by the X.509
          IDevID),</li>
          <li pn="section-5.3-3.2">any device from a specific vendor (as determined by the
          X.509 IDevID),</li>
          <li pn="section-5.3-3.3">a specific device from a vendor (as determined by the X.509
          IDevID) against a domain acceptlist.  (The mechanism for checking
          a shared acceptlist potentially used by multiple registrars is out
          of scope.)</li>
        </ul>
        <t indent="0" pn="section-5.3-4">
          If validation fails, the registrar <bcp14>SHOULD</bcp14> respond with the
          HTTP 404 error code.  If the voucher-request is in an unknown
          format, then an HTTP 406 error code is more appropriate.
          A situation that could be resolved with administrative action
          (such as adding a vendor to an acceptlist) <bcp14>MAY</bcp14> be responded to with a
          403 HTTP error code.
        </t>
        <t indent="0" pn="section-5.3-5">If authorization is successful, the registrar obtains a voucher from the MASA service (see
            <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/>) and returns that MASA-signed voucher to the pledge
        as described in <xref target="VoucherResponse" format="default" sectionFormat="of" derivedContent="Section 5.6"/>.</t>
      </section>
      <section anchor="brskimasatls" numbered="true" toc="include" removeInRFC="false" pn="section-5.4">
        <name slugifiedName="name-brski-masa-tls-establishmen">BRSKI-MASA TLS Establishment Details</name>
        <t indent="0" pn="section-5.4-1">
          The BRSKI-MASA TLS connection is a "normal" TLS connection
          appropriate for HTTPS REST interfaces. The registrar initiates the
          connection and uses the MASA URL that is obtained as described in
          <xref target="obtainmasaurl" format="default" sectionFormat="of" derivedContent="Section 2.8"/>. The mechanisms in
          <xref target="RFC6125" format="default" sectionFormat="of" derivedContent="RFC6125"/> <bcp14>SHOULD</bcp14> be used in authentication of the
          MASA using a DNS-ID that matches that which is found in the IDevID.
          Registrars <bcp14>MAY</bcp14> include a mechanism to override the MASA URL on a
          manufacturer-by-manufacturer basis, and within that override, it is
          appropriate to provide alternate anchors.
          This will typically be used by some vendors to establish explicit
          (or private) trust
          anchors for validating their MASA that is part of a sales channel
          integration.
        </t>
        <t indent="0" pn="section-5.4-2">
          Use of TLS 1.3 (or newer) is encouraged. TLS 1.2 or newer is
          <bcp14>REQUIRED</bcp14>.  TLS 1.3 (or newer) <bcp14>SHOULD</bcp14> be available.
        </t>
        <t indent="0" pn="section-5.4-3">
          As described in <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>, the MASA and the
          registrars <bcp14>SHOULD</bcp14> be prepared to support TLS Client
          Certificate authentication and/or HTTP Basic, Digest, or Salted Challenge Response Authentication Mechanism (SCRAM) authentication.
          This connection <bcp14>MAY</bcp14> also have no client authentication at all.
        </t>
        <t indent="0" pn="section-5.4-4">
          Registrars <bcp14>SHOULD</bcp14> permit
          trust anchors to be preconfigured on a per-vendor (MASA) basis.
          Registrars <bcp14>SHOULD</bcp14> include the ability to configure a TLS
          Client Certificate on a per-MASA basis, or to use no Client
          Certificate.  Registrars <bcp14>SHOULD</bcp14> also permit HTTP Basic and
          Digest authentication to be configured.
        </t>
        <t indent="0" pn="section-5.4-5">
          The authentication of the BRSKI-MASA
          connection does not change the voucher-request process, as
          voucher-requests are already signed by the registrar.
          Instead, this authentication provides access control to the
          audit-log as described in <xref target="authzLogRequest" format="default" sectionFormat="of" derivedContent="Section 5.8"/>.
        </t>
        <t indent="0" pn="section-5.4-6">
          Implementers are advised that
          contacting the MASA establishes a secured API connection with a
          web service, and that there are a number of authentication models
          being explored within the industry. Registrars are <bcp14>RECOMMENDED</bcp14> to
          fail gracefully and generate useful administrative notifications or
          logs in the advent of unexpected HTTP 401 (Unauthorized) responses
          from the MASA.
        </t>
        <section anchor="masaauthentication" numbered="true" toc="include" removeInRFC="false" pn="section-5.4.1">
          <name slugifiedName="name-masa-authentication-of-cust">MASA Authentication of Customer Registrar</name>
          <t indent="0" pn="section-5.4.1-1">
            Providing per-customer options requires the customer's
            registrar to be uniquely identified.  This can be done by any stateless
            method that HTTPS supports such as HTTP Basic
            or Digest authentication (that is using a password), but the use
            of TLS Client Certificate authentication is <bcp14>RECOMMENDED</bcp14>.
          </t>
          <t indent="0" pn="section-5.4.1-2">
            Stateful methods involving API tokens, or HTTP Cookies, are not
            recommended.
          </t>
          <t indent="0" pn="section-5.4.1-3">
            It is expected that the setup and configuration of per-customer
            Client Certificates is done as part of a sales ordering process.
          </t>
          <t indent="0" pn="section-5.4.1-4">
            The use of public PKI (i.e., WebPKI) end-entity certificates to
            identify the registrar is reasonable, and if done universally,
            this would permit a MASA to identify a customer's registrar simply by a
            Fully Qualified Domain Name (FQDN).
          </t>
          <t indent="0" pn="section-5.4.1-5">
            The use of DANE records in DNSSEC-signed zones would also permit use of
            a FQDN to identify customer registrars.
          </t>
          <t indent="0" pn="section-5.4.1-6">
            A third (and simplest, but least flexible) mechanism would be for
            the MASA to simply store the registrar's certificate pinned in a
            database.
          </t>
          <t indent="0" pn="section-5.4.1-7">
            A MASA without any supply-chain integration can simply accept
            registrars without any authentication or on a
            blind TOFU basis as described in <xref target="masasecurityreduction_tofu" format="default" sectionFormat="of" derivedContent="Section 7.4.2"/>.
          </t>
          <t indent="0" pn="section-5.4.1-8">
            This document does not make a specific recommendation on how the
            MASA authenticates the registrar as there are
            likely different tradeoffs in different environments and product
            values. Even within the ANIMA ACP applicability, there is a
            significant difference between supply-chain logistics for $100
            CPE devices and $100,000 core routers.
          </t>
        </section>
      </section>
      <section anchor="RequestVoucherFromMASA" numbered="true" toc="include" removeInRFC="false" pn="section-5.5">
        <name slugifiedName="name-registrar-requests-voucher-">Registrar Requests Voucher from MASA</name>
        <t indent="0" pn="section-5.5-1">
          When a registrar receives a pledge voucher-request, it in turn
          submits a registrar voucher-request to the MASA service via an
          HTTPS interface <xref target="RFC7231" format="default" sectionFormat="of" derivedContent="RFC7231"/>.
        </t>
        <t indent="0" pn="section-5.5-2">This is done with an HTTP POST using the operation path value of
        "/.well-known/brski/requestvoucher".</t>
        <t indent="0" pn="section-5.5-3">The voucher media type "application/voucher-cms+json" is defined in
          <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/> and is also used for the registrar voucher-request. It is a JSON document that has been
          signed using a CMS structure.
          The registrar <bcp14>MUST</bcp14> sign the registrar voucher-request.
        </t>
        <t indent="0" pn="section-5.5-4">
          MASA implementations <bcp14>SHOULD</bcp14> anticipate future media
          ntypes but, of course, will simply fail the request if those types are
          not yet known.
        </t>
        <t indent="0" pn="section-5.5-5">
          The voucher-request CMS object includes some number of certificates
          that are input to the MASA as it populates the
          pinned-domain-cert. As
          <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/> is quite flexible in what may be put into
          the pinned-domain-cert, the MASA needs some signal as to what
          certificate would be effective to populate the field with: it may
          range from the end-entity certificate that the registrar uses
          to the entire private Enterprise CA certificate.
          More-specific certificates result in a tighter binding of the
          voucher to the domain, while less-specific certificates result in
          more flexibility in how the domain is represented by certificates.
        </t>
        <t indent="0" pn="section-5.5-6">
          A registrar that is seeking a nonceless voucher for later offline use
          benefits from a less-specific certificate, as it permits the actual
          key pair used by a future registrar to be determined by the pinned
          CA.
        </t>
        <t indent="0" pn="section-5.5-7">
          In some cases, a less-specific certificate, such as a public WebPKI
          CA, could be too open and could permit any
          entity issued a certificate by that
          authority to assume ownership of a device
          that has a voucher pinned.
          Future work may provide a solution to pin both a certificate and a
          name that would reduce such risk of malicious ownership assertions.
        </t>
        <t indent="0" pn="section-5.5-8">
          The registrar <bcp14>SHOULD</bcp14> request a voucher with the most specificity
          consistent with the mode that it is operating in.
          In order to do this, when the registrar prepares the CMS structure
          for the signed voucher-request, it <bcp14>SHOULD</bcp14> include only certificates
          that are a part of the chain that it wishes the MASA to pin.
          This <bcp14>MAY</bcp14> be as small as only the end-entity certificate (with id-kp-cmcRA set) that
          it uses as its TLS server certificate, or it <bcp14>MAY</bcp14> be the entire
          chain, including the domain CA.
        </t>
        <t indent="0" pn="section-5.5-9">
          The registrar <bcp14>SHOULD</bcp14> include an "Accept" header field (see <xref target="RFC7231" sectionFormat="comma" section="5.3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7231#section-5.3.2" derivedContent="RFC7231"/>) indicating the response
media types that are
          acceptable. This list <bcp14>SHOULD</bcp14> be the entire list presented to the
          registrar in the pledge's original request (see <xref target="RequestVoucherFromRegistrar" format="default" sectionFormat="of" derivedContent="Section 5.2"/>), but it <bcp14>MAY</bcp14> be a subset.
          The MASA is expected to be flexible in what it accepts.
        </t>
        <t indent="0" pn="section-5.5-10">The registrar populates the voucher-request fields as follows:</t>
        <dl newline="false" spacing="normal" indent="3" pn="section-5.5-11">
          <dt pn="section-5.5-11.1">created-on:</dt>
          <dd pn="section-5.5-11.2">
          The registrar <bcp14>SHOULD</bcp14> populate this field with the current date and
          time when the voucher-request is formed. This field
          provides additional information to the MASA.
        </dd>
          <dt pn="section-5.5-11.3">nonce:</dt>
          <dd pn="section-5.5-11.4">This value, if present, is copied from the pledge
            voucher-request. The registrar voucher-request <bcp14>MAY</bcp14> omit
            the nonce as per <xref target="noncelessVoucherRequest" format="default" sectionFormat="of" derivedContent="Section 3.1"/>.
        </dd>
          <dt pn="section-5.5-11.5">serial-number:</dt>
          <dd pn="section-5.5-11.6">The serial number of the pledge the registrar would like a voucher for. The registrar
        determines this value by parsing the authenticated pledge IDevID certificate; see <xref target="IDevIDextension" format="default" sectionFormat="of" derivedContent="Section 2.3"/>.
        The registrar <bcp14>MUST</bcp14> verify that the serial-number field it parsed matches the serial-number field the pledge
        provided in its voucher-request. This provides a sanity check useful for detecting error conditions and logging.
        The registrar <bcp14>MUST NOT</bcp14> simply copy the serial-number field from a pledge voucher-request as that field is claimed but
        not certified.</dd>
          <dt pn="section-5.5-11.7">idevid-issuer:</dt>
          <dd pn="section-5.5-11.8">The Issuer value from the
        pledge IDevID certificate is included to ensure unique interpretation of the
        serial-number. In the case of a nonceless (offline) voucher-request, an
        appropriate value needs to be configured from the same out-of-band source as the serial-number.
        </dd>
          <dt pn="section-5.5-11.9">prior-signed-voucher-request:</dt>
          <dd pn="section-5.5-11.10">The signed pledge
        voucher-request <bcp14>SHOULD</bcp14> be included in the registrar voucher-request.
        The entire CMS-signed structure is to be included and base64 encoded for
        transport in the JSON structure.
        </dd>
        </dl>
        <t indent="0" pn="section-5.5-12">
          A nonceless registrar voucher-request <bcp14>MAY</bcp14> be
          submitted to the MASA. Doing so allows
          the registrar to request a voucher when the pledge is offline, or
          when the registrar anticipates not being able to connect to the
          MASA
          while the pledge is being deployed. Some use cases require the
          registrar to learn the
          appropriate IDevID serialNumber field and appropriate "Accept" header field values from the physical device
          labeling or from the sales channel (which is out of scope for this
          document).
        </t>
        <t indent="0" pn="section-5.5-13">All other fields <bcp14>MAY</bcp14> be omitted in the registrar
        voucher-request.</t>
        <t indent="0" pn="section-5.5-14">
          The proximity-registrar-cert field <bcp14>MUST NOT</bcp14> be present in the
          registrar voucher-request.
        </t>
        <t indent="0" pn="section-5.5-15">See example JSON payloads of registrar voucher-requests in
            <xref target="voucher-request-examples" format="default" sectionFormat="of" derivedContent="Section 3.3"/>, Examples 2 through 4.</t>
        <t indent="0" pn="section-5.5-16">The MASA verifies that the registrar voucher-request is internally consistent
        but does not necessarily authenticate the registrar certificate since the
        registrar <bcp14>MAY</bcp14> be unknown to the MASA in advance. The MASA
        performs the actions and validation checks described in the following
        subsections before issuing a voucher.</t>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-5.5.1">
          <name slugifiedName="name-masa-renewal-of-expired-vou">MASA Renewal of Expired Vouchers</name>
          <t indent="0" pn="section-5.5.1-1">
            As described in
            <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>, vouchers
            are normally short lived to avoid revocation issues. If the request
            is for a previous (expired) voucher using the same registrar
            (that is, a registrar with the same domain CA),
            then the request for
            a renewed voucher <bcp14>SHOULD</bcp14> be automatically authorized. The MASA has
            sufficient information to determine this by examining the request, the registrar
            authentication, and the existing audit-log. The issuance of a renewed voucher is
            logged as detailed in <xref target="VoucherResponse" format="default" sectionFormat="of" derivedContent="Section 5.6"/>.
          </t>
          <t indent="0" pn="section-5.5.1-2">To inform the MASA that existing vouchers are not to be renewed, one
            can update or revoke the registrar credentials used to authorize the request (see Sections
            <xref target="MASAauthenticationOfRegistrar" format="counter" sectionFormat="of" derivedContent="5.5.4"/> and <xref target="revocationcheck" format="counter" sectionFormat="of" derivedContent="5.5.3"/>). More
            flexible methods will likely involve sales channel integration and
            authorizations (details are out of scope of this document).</t>
        </section>
        <section anchor="MASApinned" numbered="true" toc="include" removeInRFC="false" pn="section-5.5.2">
          <name slugifiedName="name-masa-pinning-of-registrar">MASA Pinning of Registrar</name>
          <t indent="0" pn="section-5.5.2-1">
            A certificate chain is extracted from the registrar's signed CMS container.
            This chain may be as short as a single end-entity certificate, up
            to the entire registrar certificate chain, including the domain
            CA certificate,
            as specified in <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/>.
          </t>
          <t indent="0" pn="section-5.5.2-2">
            If the domain's CA is unknown to the MASA, then it is
            considered a temporary trust anchor for the rest of the steps
            in this section.  The intention is not to authenticate the
            message as having come from a fully validated origin but
            to establish the consistency of the domain PKI.
          </t>
          <t indent="0" pn="section-5.5.2-3">
            The MASA <bcp14>MAY</bcp14> use the certificate in the chain that is farthest
            from the end-entity certificate of the registrar, as determined by MASA policy.
            A MASA <bcp14>MAY</bcp14> have a local policy in which it only pins the end-entity
            certificate. This is consistent with <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.
            Details of the policy will typically depend upon the degree of
            supply-chain integration and the mechanism used by the registrar to
            authenticate.  Such a policy would also determine how
            the MASA will respond to a request for a nonceless voucher.
          </t>
        </section>
        <section anchor="revocationcheck" numbered="true" toc="include" removeInRFC="false" pn="section-5.5.3">
          <name slugifiedName="name-masa-check-of-the-voucher-r">MASA Check of the Voucher-Request Signature</name>
          <t indent="0" pn="section-5.5.3-1">
            As described in <xref target="MASApinned" format="default" sectionFormat="of" derivedContent="Section 5.5.2"/>, the MASA has
            extracted the registrar's domain CA.  This is used to validate the
            CMS signature <xref target="RFC5652" format="default" sectionFormat="of" derivedContent="RFC5652"/> on the voucher-request.
          </t>
          <t indent="0" pn="section-5.5.3-2">
            Normal PKIX revocation
            checking is assumed during voucher-request signature validation.
            This CA certificate <bcp14>MAY</bcp14> have
            Certificate Revocation List (CRL) distribution points or Online
            Certificate Status Protocol (OCSP) information <xref target="RFC6960" format="default" sectionFormat="of" derivedContent="RFC6960"/>.  If they are present, the MASA <bcp14>MUST</bcp14>
            be able to reach the relevant servers belonging to the
            registrar's domain CA to perform the revocation checks.
          </t>
          <t indent="0" pn="section-5.5.3-3">
            The use of OCSP Stapling is preferred.
          </t>
        </section>
        <section anchor="MASAauthenticationOfRegistrar" numbered="true" toc="include" removeInRFC="false" pn="section-5.5.4">
          <name slugifiedName="name-masa-verification-of-the-do">MASA Verification of the Domain Registrar</name>
          <t indent="0" pn="section-5.5.4-1">
            The MASA <bcp14>MUST</bcp14> verify that the registrar voucher-request is signed
            by a registrar. This is confirmed by verifying that the
            id-kp-cmcRA extended key usage extension field (as detailed in
            EST <xref target="RFC7030" sectionFormat="comma" section="3.6.1" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.6.1" derivedContent="RFC7030"/>) exists in the certificate of the
            entity that signed the registrar voucher-request. This
            verification is only a consistency check to ensure that the unauthenticated
            domain CA intended the voucher-request signer to be a registrar. Performing this check
            provides value to the domain PKI by assuring the domain administrator
            that the MASA service will only respect claims from authorized
            registration authorities of the domain.
          </t>
          <t indent="0" pn="section-5.5.4-2">
            Even when a domain CA is authenticated to the MASA, and there is
            strong sales channel integration to understand who the legitimate
            owner is, the above id-kp-cmcRA check prevents arbitrary end-entity
            certificates (such as an LDevID certificate) from
            having vouchers issued against them.
          </t>
          <t indent="0" pn="section-5.5.4-3">
            Other cases of inappropriate voucher issuance are detected
            by examination of the audit-log.
          </t>
          <t indent="0" pn="section-5.5.4-4">
            If a nonceless voucher-request is submitted, the MASA <bcp14>MUST</bcp14>
            authenticate the registrar either as described in
            EST (see Sections <xref target="RFC7030" sectionFormat="bare" section="3.2.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.2.3" derivedContent="RFC7030"/> and
<xref target="RFC7030" sectionFormat="bare" section="3.3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.3.2" derivedContent="RFC7030"/> of
<xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>)
            or by validating the registrar's certificate used to
            sign the registrar voucher-request using a configured trust anchor.
            Any of these methods reduce the risk of DDoS attacks
            and provide an authenticated identity as an input to
            sales channel integration and authorizations
            (details are out of scope of this document).
          </t>
          <t indent="0" pn="section-5.5.4-5">
            In the nonced case, validation of the registrar's identity (via
            TLS Client Certificate or HTTP authentication) <bcp14>MAY</bcp14> be omitted
            if the MASA knows that the device policy is to accept audit-only vouchers.
          </t>
        </section>
        <section anchor="MASAassertion" numbered="true" toc="include" removeInRFC="false" pn="section-5.5.5">
          <name slugifiedName="name-masa-verification-of-the-pl">MASA Verification of the Pledge 'prior-signed-voucher-request'</name>
          <t indent="0" pn="section-5.5.5-1">
            The MASA <bcp14>MAY</bcp14> verify that the registrar voucher-request
            includes the prior-signed-voucher-request field. If so, the
            prior-signed-voucher-request <bcp14>MUST</bcp14> include a
            proximity-registrar-cert that is consistent with the
            certificate used to sign the registrar voucher-request.
            Additionally, the
            voucher-request serial-number leaf <bcp14>MUST</bcp14> match the pledge
            serial-number that the MASA extracts from the signing certificate
            of the prior-signed-voucher-request.
            The consistency check described above entails checking that the
            proximity-registrar-cert Subject Public Key Info (SPKI) Fingerprint exists within the
            registrar voucher-request CMS signature's certificate chain.
            This is substantially the same as the pin validation described in
            <xref target="RFC7469" sectionFormat="comma" section="2.6" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7469#section-2.6" derivedContent="RFC7469"/>.
          </t>
          <t indent="0" pn="section-5.5.5-2">
            If these checks succeed, the MASA updates
            the voucher and audit-log assertion leafs with the "proximity"
            assertion, as defined by <xref target="RFC8366" sectionFormat="comma" section="5.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8366#section-5.3" derivedContent="RFC8366"/>.
          </t>
        </section>
        <section anchor="MASAnoncehandling" numbered="true" toc="include" removeInRFC="false" pn="section-5.5.6">
          <name slugifiedName="name-masa-nonce-handling">MASA Nonce Handling</name>
          <t indent="0" pn="section-5.5.6-1">
            The MASA does not verify the nonce itself.
            If the registrar voucher-request contains a nonce, and the
            prior-signed-voucher-request exists, then the MASA <bcp14>MUST</bcp14>
            verify that the nonce is consistent.
            (Recall from above that the
            voucher-request might not contain a nonce; see
            Sections <xref target="RequestVoucherFromMASA" format="counter" sectionFormat="of" derivedContent="5.5"/> and
            <xref target="MASAauthenticationOfRegistrar" format="counter" sectionFormat="of" derivedContent="5.5.4"/>.)
          </t>
          <t indent="0" pn="section-5.5.6-2">
            The MASA populates the audit-log with the nonce that was
            verified. If a nonceless voucher is issued, then the
            audit-log is to be populated with the JSON value "null".
          </t>
        </section>
      </section>
      <section anchor="VoucherResponse" numbered="true" toc="include" removeInRFC="false" pn="section-5.6">
        <name slugifiedName="name-masa-and-registrar-voucher-">MASA and Registrar Voucher Response</name>
        <t indent="0" pn="section-5.6-1">The MASA voucher response to the registrar is forwarded
          without changes to the pledge; therefore, this section applies
          to both the MASA and the registrar. The HTTP signaling described
          applies to both the MASA and registrar responses.
        </t>
        <t indent="0" pn="section-5.6-2">
          When a voucher-request arrives at the registrar, if it has a cached
          response from the MASA for the corresponding registrar
          voucher-request, that cached response can be used according to
          local policy; otherwise, the registrar constructs a new registrar
          voucher-request and sends it to the MASA.
        </t>
        <t indent="0" pn="section-5.6-3">
          Registrar evaluation of the voucher itself is purely for
          transparency and audit purposes to further inform log verification
          (see <xref target="auditLogVerification" format="default" sectionFormat="of" derivedContent="Section 5.8.3"/>); therefore, a
          registrar could accept future voucher formats that are opaque to
          the registrar.
        </t>
        <t indent="0" pn="section-5.6-4">
          If the voucher-request is successful, the server (a MASA responding
          to a registrar or a registrar responding to a pledge) response <bcp14>MUST</bcp14>
          contain an HTTP 200 response code. The server <bcp14>MUST</bcp14> answer with a
          suitable 4xx or 5xx HTTP <xref target="RFC7230" format="default" sectionFormat="of" derivedContent="RFC7230"/> error code when a problem occurs.
          In this case, the response data from the MASA <bcp14>MUST</bcp14> be a plain text
          human-readable (UTF-8) error message containing explanatory
          information describing why the request was rejected.
        </t>
        <t indent="0" pn="section-5.6-5">
          The registrar <bcp14>MAY</bcp14> respond with an HTTP 202 ("the request has been
          accepted for processing, but the processing has not been completed") as
          described in EST <xref target="RFC7030" sectionFormat="comma" section="4.2.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-4.2.3" derivedContent="RFC7030"/>, wherein the
          client "<bcp14>MUST</bcp14> wait at least the specified "retry-after" time before
          repeating the same request"
          (also see <xref target="RFC7231" sectionFormat="comma" section="6.6.4" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7231#section-6.6.4" derivedContent="RFC7231"/>).
          The pledge is <bcp14>RECOMMENDED</bcp14> to provide local
          feedback (blinked LED, etc.) during this wait cycle if mechanisms for this
          are available. To prevent an attacker registrar from significantly
          delaying bootstrapping, the pledge <bcp14>MUST</bcp14> limit the Retry-After time to
          60 seconds. Ideally, the pledge would keep track of the
          appropriate Retry-After header field values for any number of
          outstanding registrars, but this would involve a state table
          on the pledge.  Instead, the
          pledge <bcp14>MAY</bcp14> ignore the exact Retry-After value in favor of a single hard-coded
          value (a registrar that is unable
          to complete the transaction after the first 60 seconds has another chance a minute later). A pledge <bcp14>SHOULD</bcp14> be willing to maintain a 202 retry-state
          for up to 4 days, which is longer than a long weekend, after which
          time the enrollment attempt fails, and the pledge returns to Discovery state. This allows time for an alert to get from the registrar to a human operator who can make a
  decision as to whether or not to proceed with the enrollment.

        </t>
        <t indent="0" pn="section-5.6-6">
          A pledge that retries a request after receiving a 202 message <bcp14>MUST</bcp14>
          resend the same voucher-request.  It <bcp14>MUST NOT</bcp14> sign a new
          voucher-request each time, and in particular, it <bcp14>MUST NOT</bcp14> change
          the nonce value.
        </t>
        <t indent="0" pn="section-5.6-7">
          In order to avoid infinite redirect loops, which a malicious
          registrar might do in order to keep the pledge from
          discovering the correct registrar, the pledge <bcp14>MUST NOT</bcp14>
          follow more than one redirection (3xx code) to another web
          origin. EST supports redirection but requires user
          input; this change allows the pledge to follow a single
          redirection without a user interaction.
        </t>
        <t indent="0" pn="section-5.6-8">A 403 (Forbidden) response is appropriate if the voucher-request
        is not signed correctly or is stale or if the pledge has another
        outstanding voucher that cannot be overridden.</t>
        <t indent="0" pn="section-5.6-9">A 404 (Not Found) response is appropriate when the request is for a
        device that is not known to the MASA.</t>
        <t indent="0" pn="section-5.6-10">A 406 (Not Acceptable) response is appropriate if a voucher of the
        desired type or that uses the desired algorithms (as indicated by the
        "Accept" header fields and algorithms used in the signature) cannot be
        issued as such because the MASA knows the pledge cannot process
        that type. The registrar <bcp14>SHOULD</bcp14> use this response if it determines
        the pledge is unacceptable due to inventory control, MASA audit-logs, or
        any other reason.</t>
        <t indent="0" pn="section-5.6-11">
          A 415 (Unsupported Media Type) response is appropriate
          for a request that has a voucher-request or "Accept" value that is
          not understood.
        </t>
        <t indent="0" pn="section-5.6-12">The voucher response format is as indicated in the submitted
        "Accept" header fields or based on the MASA's prior understanding of proper
        format for this pledge. Only the
        "application/voucher-cms+json" media type <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/> is defined at this
        time. The syntactic details of vouchers are described in detail in
        <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>. <xref target="voucherjsonexample" format="default" sectionFormat="of" derivedContent="Figure 14"/> shows
        a sample of the contents of a voucher.
        </t>
        <figure anchor="voucherjsonexample" align="left" suppress-title="false" pn="figure-14">
          <name slugifiedName="name-an-example-voucher">An Example Voucher</name>
          <sourcecode type="json" markers="false" pn="section-5.6-13.1">
{
  "ietf-voucher:voucher": {
    "nonce": "62a2e7693d82fcda2624de58fb6722e5",
    "assertion": "logged",
    "pinned-domain-cert": "base64encodedvalue==",
    "serial-number": "JADA123456789"
  }
}
</sourcecode>
        </figure>
        <t indent="0" pn="section-5.6-14">The MASA populates the voucher fields as follows:</t>
        <dl newline="false" spacing="normal" indent="3" pn="section-5.6-15">
          <dt pn="section-5.6-15.1">nonce:</dt>
          <dd pn="section-5.6-15.2">The nonce from the pledge if available. See <xref target="MASAnoncehandling" format="default" sectionFormat="of" derivedContent="Section 5.5.6"/>.</dd>
          <dt pn="section-5.6-15.3">assertion:</dt>
          <dd pn="section-5.6-15.4">The method used to verify the relationship
        between the pledge and registrar. See <xref target="MASAassertion" format="default" sectionFormat="of" derivedContent="Section 5.5.5"/>.</dd>
          <dt pn="section-5.6-15.5">pinned-domain-cert:</dt>
          <dd pn="section-5.6-15.6">A certificate; see <xref target="MASApinned" format="default" sectionFormat="of" derivedContent="Section 5.5.2"/>. This figure is illustrative; for an example,
        see <xref target="exampleprocess" format="default" sectionFormat="of" derivedContent="Appendix C.2"/> where an end-entity certificate
        is used. </dd>
          <dt pn="section-5.6-15.7">serial-number:</dt>
          <dd pn="section-5.6-15.8">The serial-number as provided in the
          voucher-request. Also see <xref target="MASAassertion" format="default" sectionFormat="of" derivedContent="Section 5.5.5"/>.</dd>
          <dt pn="section-5.6-15.9">domain-cert-revocation-checks:</dt>
          <dd pn="section-5.6-15.10">Set as appropriate for the
          pledge's capabilities and as documented in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.

          The MASA <bcp14>MAY</bcp14> set this field to "false" since setting it to "true" would
          require that revocation information be available to the pledge, and this
          document does not make normative requirements for
          <xref target="RFC6961" format="default" sectionFormat="of" derivedContent="RFC6961"/>, <xref target="RFC8446" sectionFormat="of" section="4.4.2.1" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8446#section-4.4.2.1" derivedContent="RFC8446"/>, or equivalent integrations.</dd>
          <dt pn="section-5.6-15.11">expires-on:</dt>
          <dd pn="section-5.6-15.12">This is set for nonceless vouchers. The MASA
          ensures the voucher lifetime is consistent with any revocation or
          pinned-domain-cert consistency checks the pledge might perform.
          See <xref target="timeunknown" format="default" sectionFormat="of" derivedContent="Section 2.6.1"/>. There are three times to consider:
          (a) a configured voucher lifetime in the MASA, (b) the expiry time for the
          registrar's certificate, and (c) any CRL lifetime. The expires-on field <bcp14>SHOULD</bcp14> be before
          the earliest of these three values.
          Typically, (b) will be some significant time in the future,
          but (c) will typically be short (on the order of a week or
          less).  The <bcp14>RECOMMENDED</bcp14> period for (a) is on the order of
          20 minutes, so it will typically determine the life span
          of the resulting voucher.
          20 minutes is sufficient time to reach the post-provisional state
          in the pledge, at which point there is an established trust
          relationship between the pledge and registrar.  The subsequent
          operations can take as long as required from that point onwards.
          The lifetime of the voucher has no impact on the life span of the
          ownership relationship.
        </dd>
        </dl>
        <t indent="0" pn="section-5.6-16">
          Whenever a voucher is issued, the MASA <bcp14>MUST</bcp14> update the
          audit-log sufficiently to generate the response as described in
          <xref target="MASAauditlog" format="default" sectionFormat="of" derivedContent="Section 5.8.1"/>.
          The internal state requirements to maintain the audit-log
          are out of scope.
        </t>
        <section anchor="CompletingAuthenticationBootstrapping" numbered="true" toc="include" removeInRFC="false" pn="section-5.6.1">
          <name slugifiedName="name-pledge-voucher-verification">Pledge Voucher Verification</name>
          <t indent="0" pn="section-5.6.1-1">
          The pledge <bcp14>MUST</bcp14> verify the voucher signature using the
          manufacturer-installed
          trust anchor(s) associated with the manufacturer's MASA (this is
          likely included in the pledge's firmware). Management of the
          manufacturer-installed
          trust anchor(s) is out of scope of this document; this protocol
          does not update this trust anchor(s).
          </t>
          <t indent="0" pn="section-5.6.1-2">
          The pledge <bcp14>MUST</bcp14> verify that the serial-number field of the signed voucher
          matches the pledge's own serial-number.
          </t>
          <t indent="0" pn="section-5.6.1-3">
          The pledge <bcp14>MUST</bcp14>
          verify the nonce information in the voucher.  If present, the nonce in
          the voucher must match the nonce the pledge submitted to the
          registrar; vouchers with no nonce can also be accepted (according
          to local policy; see <xref target="pledgeReductions" format="default" sectionFormat="of" derivedContent="Section 7.2"/>).
          </t>
          <t indent="0" pn="section-5.6.1-4">
          The pledge <bcp14>MUST</bcp14> be prepared to parse and fail gracefully from
          a voucher response that does not contain a pinned-domain-cert
          field.
          Such a thing indicates a failure to enroll in this domain,
          and the pledge <bcp14>MUST</bcp14> attempt joining with other available Join Proxies.
          </t>
          <t indent="0" pn="section-5.6.1-5">
          The pledge <bcp14>MUST</bcp14> be prepared to ignore additional fields that it does not recognize.
          </t>
        </section>
        <section anchor="PledgeAuthenticationOfProvisionalTLS" numbered="true" toc="include" removeInRFC="false" pn="section-5.6.2">
          <name slugifiedName="name-pledge-authentication-of-pr">Pledge Authentication of Provisional TLS Connection</name>
          <t indent="0" pn="section-5.6.2-1">
            Following the process described in <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>,
            the pledge should consider the public key from the
            pinned-domain-cert as the sole temporary trust anchor.
          </t>
          <t indent="0" pn="section-5.6.2-2">
            The pledge then evaluates the TLS server certificate chain that it
            received when the TLS connection was formed using this trust
            anchor.
            It is possible that the public key in the pinned-domain-cert directly matches
	    the public key in the end-entity
            certificate provided by the TLS server.
          </t>
          <t indent="0" pn="section-5.6.2-3">
            If a registrar's credentials cannot be verified using the
            pinned-domain-cert trust anchor from the voucher, then the TLS
            connection is
            discarded, and the pledge abandons attempts to bootstrap with this
            discovered registrar. The pledge <bcp14>SHOULD</bcp14> send voucher status
            telemetry (described below) before closing the TLS connection.
            The pledge <bcp14>MUST</bcp14> attempt to enroll using any other proxies
            it has found.  It <bcp14>SHOULD</bcp14> return to the same proxy again after
            unsuccessful attempts with other proxies.  Attempts should be
            made at repeated intervals according to the back-off timer
            described earlier.
            Attempts <bcp14>SHOULD</bcp14> be repeated as failure may be the result of a
            temporary inconsistency (an inconsistently rolled registrar key,
            or some other misconfiguration).  The inconsistency could also
            be the result of an active MITM attack on the EST connection.
          </t>
          <t indent="0" pn="section-5.6.2-4"> The registrar <bcp14>MUST</bcp14> use a certificate that chains to the pinned-domain-cert
            as its TLS server certificate.
          </t>
          <t indent="0" pn="section-5.6.2-5">The pledge's PKIX path validation of a registrar certificate's validity
            period information is as described in <xref target="timeunknown" format="default" sectionFormat="of" derivedContent="Section 2.6.1"/>.
            Once the PKIX path validation is successful, the TLS connection is
            no longer provisional.</t>
          <t indent="0" pn="section-5.6.2-6">The pinned-domain-cert <bcp14>MAY</bcp14> be installed as a
            trust anchor for future operations such as enrollment (e.g., as recommended per <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>) or trust anchor management or raw protocols that do not need full PKI-based key management. It can be used to authenticate any dynamically
            discovered EST server that contains the id-kp-cmcRA extended key
            usage extension as detailed in EST (see <xref target="RFC7030" sectionFormat="comma" section="3.6.1" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.6.1" derivedContent="RFC7030"/>); but to
            reduce system complexity, the pledge <bcp14>SHOULD</bcp14> avoid additional
            discovery operations. Instead, the pledge <bcp14>SHOULD</bcp14> communicate directly
            with the registrar as the EST server. The pinned-domain-cert
            is not a complete
            distribution of the CA certificate response, as described in <xref target="RFC7030" sectionFormat="comma" section="4.1.3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-4.1.3" derivedContent="RFC7030"/>,
            which is
            an additional justification for the recommendation to proceed with EST
            key management operations. Once a full CA certificate response is
            obtained, it is more authoritative for the domain than the limited
            pinned-domain-cert response.</t>
        </section>
      </section>
      <section anchor="pledgestatus" numbered="true" toc="include" removeInRFC="false" pn="section-5.7">
        <name slugifiedName="name-pledge-brski-status-telemet">Pledge BRSKI Status Telemetry</name>
        <t indent="0" pn="section-5.7-1">The domain is expected to provide indications to the system
        administrators concerning device life-cycle status. To facilitate this,
        it needs telemetry information concerning the device's
        status.</t>
        <t indent="0" pn="section-5.7-2">The pledge <bcp14>MUST</bcp14> indicate its pledge status regarding the voucher.
        It does this by sending a status message to the registrar.</t>
        <t indent="0" pn="section-5.7-3">The posted data media type: application/json</t>
        <t indent="0" pn="section-5.7-4">The client sends an HTTP POST to the server at the URI ".well-known/brski/voucher_status".</t>
        <t indent="0" pn="section-5.7-5">
          The format and semantics described below are for version 1.
          A version field is included to permit significant changes to this
          feedback in the future.  A registrar that receives a status
          message with a version larger than it knows about <bcp14>SHOULD</bcp14> log the
          contents and alert a human.
        </t>
        <t indent="0" pn="section-5.7-6">The status field indicates if the voucher was acceptable.
        Boolean values are acceptable, where "true" indicates the voucher was
        acceptable.
        </t>
        <t indent="0" pn="section-5.7-7">
          If the voucher was not acceptable, the Reason string indicates
          why. In a failure case, this message may be sent to an
          unauthenticated, potentially malicious registrar; therefore, the
          Reason string <bcp14>SHOULD NOT</bcp14> provide information beneficial to an
          attacker. The operational benefit of this telemetry information is
          balanced against the operational costs of not recording that a
          voucher was ignored by a client that the registrar expected was going to continue
          joining the domain.
        </t>
        <t indent="0" pn="section-5.7-8">
          The reason-context attribute is an arbitrary JSON object (literal
          value or hash of values) that provides additional information
          specific to this pledge.  The contents of this field are not
          subject to standardization.
        </t>
        <t indent="0" pn="section-5.7-9">
          The version and status fields <bcp14>MUST</bcp14> be present.
          The Reason field <bcp14>SHOULD</bcp14> be present whenever the status field
          is false.  The Reason-Context field is optional.
	  In the case of a SUCCESS, the Reason string <bcp14>MAY</bcp14> be omitted.
        </t>
        <t indent="0" pn="section-5.7-10">
          The keys to this JSON object are case sensitive and <bcp14>MUST</bcp14> be lowercase.
          <xref target="telemetryexample" format="default" sectionFormat="of" derivedContent="Figure 16"/> shows an example JSON.
        </t>
        <figure anchor="cddl-voucherstatus" align="left" suppress-title="false" pn="figure-15">
          <name slugifiedName="name-cddl-for-voucher-status-pos">CDDL for Voucher Status POST</name>
          <sourcecode name="voucherstatus.cddl" type="CDDL" markers="true" pn="section-5.7-11.1">
voucherstatus-post = {
    "version": uint,
    "status": bool,
    ? "reason": text,
    ? "reason-context" : { $$arbitrary-map }
  }
}
</sourcecode>
        </figure>
        <figure anchor="telemetryexample" align="left" suppress-title="false" pn="figure-16">
          <name slugifiedName="name-example-status-telemetry">Example Status Telemetry</name>
          <sourcecode type="json" markers="false" pn="section-5.7-12.1">
{
    "version": 1,
    "status":false,
    "reason":"Informative human-readable message",
    "reason-context": { "additional" : "JSON" }
}
</sourcecode>
        </figure>
        <t indent="0" pn="section-5.7-13">
          The server <bcp14>SHOULD</bcp14> respond with an HTTP 200 but <bcp14>MAY</bcp14> simply
          fail with an HTTP 404 error. The client ignores any response. The server <bcp14>SHOULD</bcp14> capture this telemetry information within the server logs.
        </t>
        <t indent="0" pn="section-5.7-14">
          Additional standard JSON fields in this POST <bcp14>MAY</bcp14> be added; see
          <xref target="pledgestatustelemetryregistry" format="default" sectionFormat="of" derivedContent="Section 8.5"/>.  A server that
          sees unknown fields should log them, but otherwise ignore them.
        </t>
      </section>
      <section anchor="authzLogRequest" numbered="true" toc="include" removeInRFC="false" pn="section-5.8">
        <name slugifiedName="name-registrar-audit-log-request">Registrar Audit-Log Request</name>
        <t indent="0" pn="section-5.8-1">
           After receiving the pledge status telemetry (see <xref target="pledgestatus" format="default" sectionFormat="of" derivedContent="Section 5.7"/>),
           the registrar <bcp14>SHOULD</bcp14> request the MASA audit-log from the MASA
        service.</t>
        <t indent="0" pn="section-5.8-2">
          This is done with an HTTP POST using the operation path value of
          "/.well-known/brski/requestauditlog".
        </t>
        <t indent="0" pn="section-5.8-3">
          The registrar <bcp14>SHOULD</bcp14> HTTP POST the same registrar voucher-request
          as it did when requesting a
          voucher (using the same Content-Type). It is posted to the /requestauditlog URI instead.
          The idevid-issuer and serial-number informs the MASA
          which log is requested, so the appropriate log can be prepared
          for the response.
          Using the same media type and message minimizes
          cryptographic and message operations, although it results in additional
          network traffic.
          The relying MASA implementation <bcp14>MAY</bcp14> leverage internal state
          to associate this request with the original, and by now already
          validated, voucher-request so as to avoid an extra crypto
          validation.
        </t>
        <t indent="0" pn="section-5.8-4">
          A registrar <bcp14>MAY</bcp14> request logs at future times. If the registrar
          generates a new request, then the MASA is forced to perform
          the additional cryptographic operations to verify the new request.
        </t>
        <t indent="0" pn="section-5.8-5">
          A MASA that receives a request for a device that does not exist,
          or for which the requesting owner was never an owner, returns an
          HTTP 404 ("Not found") code.
        </t>
        <t indent="0" pn="section-5.8-6">
          It is reasonable for a registrar, that the MASA does not believe
          to be the current owner, to request the audit-log.  There are
          probably reasons for this, which are hard to predict in advance.
          For instance, such a registrar may not be aware that the device has
          been resold; it may be that the device has been resold
          inappropriately, and this is how the original owner will learn of
          the occurrence.  It is also possible that the device legitimately
          spends time in two different networks.
        </t>
        <t indent="0" pn="section-5.8-7">
          Rather than returning the audit-log as a response to the POST (with
          a return code 200), the MASA <bcp14>MAY</bcp14> instead return a 201 ("Created")
          response (<xref target="RFC7231" format="default" sectionFormat="of" derivedContent="RFC7231"/>, Sections
<xref target="RFC7231" sectionFormat="bare" section="6.3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7231#section-6.3.2" derivedContent="RFC7231"/> and <xref target="RFC7231" sectionFormat="bare" section="7.1" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7231#section-7.1" derivedContent="RFC7231"/>), with
          the URL to the prepared (and idempotent, therefore cachable) audit
          response in the "Location" header field.
        </t>
        <t indent="0" pn="section-5.8-8">
          In order to avoid enumeration of device audit-logs,
          a MASA that returns URLs <bcp14>SHOULD</bcp14> take care to make the returned
          URL unguessable.
          <xref target="W3C.capability-urls" format="default" sectionFormat="of" derivedContent="W3C.capability-urls"/> provides very good additional guidance.
          For instance, rather than returning URLs containing a database number
          such as https://example.com/auditlog/1234 or the Extended Unique Identifier (EUI) of the device
          such https://example.com/auditlog/10-00-00-11-22-33,
          the MASA <bcp14>SHOULD</bcp14> return a randomly generated value (a "slug" in
          web parlance).  The value is used to find the relevant database
          entry.
        </t>
        <t indent="0" pn="section-5.8-9">
          A MASA that returns a code 200 <bcp14>MAY</bcp14> also include a "Location" header
          for future reference by the registrar.
        </t>
        <section anchor="MASAauditlog" numbered="true" toc="include" removeInRFC="false" pn="section-5.8.1">
          <name slugifiedName="name-masa-audit-log-response">MASA Audit-Log Response</name>
          <t indent="0" pn="section-5.8.1-1">A log data file is returned consisting of all log entries
          associated with the device selected by the IDevID presented in
          the request.  The audit-log may be abridged by removal of old or repeated
          values as explained below.
          The returned data is in JSON format <xref target="RFC8259" format="default" sectionFormat="of" derivedContent="RFC8259"/>,
          and the Content-Type <bcp14>SHOULD</bcp14> be "application/json".

          </t>
          <t indent="0" pn="section-5.8.1-2">
            The following CDDL <xref target="RFC8610" format="default" sectionFormat="of" derivedContent="RFC8610"/> explains the
            structure of the JSON format audit-log response:
          </t>
          <figure anchor="cddl-auditlog" align="left" suppress-title="false" pn="figure-17">
            <name slugifiedName="name-cddl-for-audit-log-response">CDDL for Audit-Log Response</name>
            <sourcecode name="auditlog.cddl" type="CDDL" markers="true" pn="section-5.8.1-3.1">
audit-log-response = {
  "version": uint,
  "events": [ + event ]
  "truncation": {
    ? "nonced duplicates": uint,
    ? "nonceless duplicates": uint,
    ? "arbitrary": uint,
  }
}

event = {
  "date": text,
  "domainID": text,
  "nonce": text / null,
  "assertion": "verified" / "logged" / "proximity",
  ? "truncated": uint,
}
</sourcecode>
          </figure>
          <t indent="0" pn="section-5.8.1-4">An example:
          </t>
          <figure anchor="example-auditlog" align="left" suppress-title="false" pn="figure-18">
            <name slugifiedName="name-example-of-an-audit-log-res">Example of an Audit-Log Response</name>
            <sourcecode type="json" markers="false" pn="section-5.8.1-5.1">
{
  "version":"1",
  "events":[
    {
        "date":"2019-05-15T17:25:55.644-04:00",
        "domainID":"BduJhdHPpfhQLyponf48JzXSGZ8=",
        "nonce":"VOUFT-WwrEv0NuAQEHoV7Q",
        "assertion":"proximity",
        "truncated":"0"
    },
    {
        "date":"2017-05-15T17:25:55.644-04:00",
        "domainID":"BduJhdHPpfhQLyponf48JzXSGZ8=",
        "nonce":"f4G6Vi1t8nKo/FieCVgpBg==",
        "assertion":"proximity"
    }
  ],
    "truncation": {
        "nonced duplicates": "0",
        "nonceless duplicates": "1",
        "arbitrary": "2"
     }
}
</sourcecode>
          </figure>
          <t indent="0" pn="section-5.8.1-6">
            The domainID is a binary SubjectKeyIdentifier value calculated
            according to <xref target="domainID" format="default" sectionFormat="of" derivedContent="Section 5.8.2"/>.
            It is encoded once in base64 in order to be transported in this
            JSON container.
          </t>
          <t indent="0" pn="section-5.8.1-7">
            The date is formatted per <xref target="RFC3339" format="default" sectionFormat="of" derivedContent="RFC3339"/>, which is
            consistent with typical JavaScript usage of JSON.
          </t>
          <t indent="0" pn="section-5.8.1-8">
            The truncation structure <bcp14>MAY</bcp14> be omitted if all values are zero.
            Any counter missing from the truncation structure is
            assumed to be zero.
          </t>
          <t indent="0" pn="section-5.8.1-9">
            The nonce is a string, as provided in the voucher-request, and
            is used in the voucher.   If no nonce was placed in the resulting
            voucher, then a value of null <bcp14>SHOULD</bcp14> be used in preference to
            omitting the entry.
            While the nonce is often created as a base64-encoded random
            series of bytes, this should not be assumed.
          </t>
          <t indent="0" pn="section-5.8.1-10">
            Distribution of a large log is less than ideal. This structure can
            be optimized as follows: nonced or nonceless entries for the
            same domainID <bcp14>MAY</bcp14> be abridged from the log leaving only the single
            most recent nonced or nonceless entry for that domainID. In the case of
            truncation, the "event" truncation value <bcp14>SHOULD</bcp14> contain a count of the number of events for this
            domainID that were omitted. The log <bcp14>SHOULD NOT</bcp14> be further
            reduced, but an operational situation could exist where maintaining
            the full log is not possible. In such situations, the log <bcp14>MAY</bcp14> be
            arbitrarily abridged for length, with the number of removed
            entries indicated as "arbitrary".
          </t>
          <t indent="0" pn="section-5.8.1-11">
            If the truncation count exceeds 1024, then the MASA
            <bcp14>MAY</bcp14> use this value without further incrementing it.
          </t>
          <t indent="0" pn="section-5.8.1-12">
            A log where duplicate entries for the same domain have
            been omitted ("nonced duplicates" and/or "nonceless duplicates")
            could still be acceptable for informed decisions. A log that
            has had "arbitrary" truncations is less acceptable, but manufacturer
            transparency is better than hidden truncations.
          </t>
          <t indent="0" pn="section-5.8.1-13">
            A registrar that sees a version value greater than 1 indicates
            an audit-log format that has been enhanced with additional
            information.   No information will be removed in future
            versions; should an incompatible change be desired in the future,
            then a new HTTP endpoint will be used.
          </t>
          <t indent="0" pn="section-5.8.1-14">This document
            specifies a simple log format as provided by the
            MASA service to the registrar. This format could be improved by
            distributed consensus technologies that integrate vouchers
            with technologies such as block-chain or hash trees or optimized
            logging approaches. Doing so is out of the scope of this document
            but is an
            anticipated improvement for future work.  As such, the
            registrar <bcp14>SHOULD</bcp14> anticipate new kinds of responses and
            <bcp14>SHOULD</bcp14> provide operator controls to indicate how to process
            unknown responses.
          </t>
        </section>
        <section anchor="domainID" numbered="true" toc="include" removeInRFC="false" pn="section-5.8.2">
          <name slugifiedName="name-calculation-of-domainid">Calculation of domainID</name>
          <t indent="0" pn="section-5.8.2-1">
            The domainID is a binary value (a BIT STRING) that uniquely
            identifies a registrar by the pinned-domain-cert.
          </t>
          <t indent="0" pn="section-5.8.2-2">
            If the pinned-domain-cert certificate
            includes the SubjectKeyIdentifier (<xref target="RFC5280" sectionFormat="comma" section="4.2.1.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#section-4.2.1.2" derivedContent="RFC5280"/>), then it is used as the domainID.  If not,
            the SPKI Fingerprint as described in
            <xref target="RFC7469" sectionFormat="comma" section="2.4" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7469#section-2.4" derivedContent="RFC7469"/> is used.
            This value needs to be calculated by both the MASA (to
            populate the audit-log) and the registrar (to recognize itself in the audit-log).
          </t>
          <t indent="0" pn="section-5.8.2-3">
            <xref target="RFC5280" sectionFormat="comma" section="4.2.1.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5280#section-4.2.1.2" derivedContent="RFC5280"/> does not mandate that the
            SubjectKeyIdentifier extension be present in non-CA certificates.
            It is <bcp14>RECOMMENDED</bcp14> that registrar certificates (even if
            self-signed) always include the SubjectKeyIdentifier to be
            used as a domainID.
          </t>
          <t indent="0" pn="section-5.8.2-4">
            The domainID is determined
            from the certificate chain associated with the
            pinned-domain-cert and is used to update the audit-log.
          </t>
        </section>
        <section anchor="auditLogVerification" numbered="true" toc="include" removeInRFC="false" pn="section-5.8.3">
          <name slugifiedName="name-registrar-audit-log-verific">Registrar Audit-Log Verification</name>
          <t indent="0" pn="section-5.8.3-1">
            Each time the MASA
            issues a voucher, it appends details of the assignment to
            an internal audit-log for that device.
            The internal audit-log is processed when responding to
            requests for details as described in <xref target="authzLogRequest" format="default" sectionFormat="of" derivedContent="Section 5.8"/>.
            The contents of the audit-log can express a variety of trust
            levels, and this section explains what kind of trust a
            registrar can derive from the entries.
          </t>
          <t indent="0" pn="section-5.8.3-2">
            While the audit-log provides a list of vouchers that were issued
            by the MASA, the vouchers are issued in response to
            voucher-requests, and it is the content of the voucher-requests
            that determines how meaningful the audit-log entries are.
          </t>
          <t indent="0" pn="section-5.8.3-3">A registrar <bcp14>SHOULD</bcp14> use the log information to make an informed decision
          regarding the continued bootstrapping of the pledge. The exact policy is
          out of scope of this document as it depends on the security requirements
          within the registrar domain. Equipment that is purchased preowned can be
          expected to have an extensive history.  The following discussion is provided to help
          explain the value of each log element:</t>
          <dl newline="false" spacing="normal" indent="3" pn="section-5.8.3-4">
            <dt pn="section-5.8.3-4.1">date:</dt>
            <dd pn="section-5.8.3-4.2">The date field provides the registrar an
              opportunity to divide the log around known events such as
              the purchase date. Depending on the context known to the registrar
              or administrator, events before/after certain dates can
              have different levels of importance. For example, for equipment
              that is expected to be new, and thus has no history, it
            would be a surprise to find prior entries.</dd>
            <dt pn="section-5.8.3-4.3">domainID:</dt>
            <dd pn="section-5.8.3-4.4"> If the log includes an unexpected domainID,
              then the pledge could have imprinted on an unexpected domain. The
              registrar can be expected to use a variety of techniques to
              define "unexpected" ranging from acceptlists of prior
              domains to anomaly detection (e.g., "this device was previously
              bound to a different domain than any other device deployed"). Log
              entries can also be compared against local history logs in search of
              discrepancies (e.g., "this device was re-deployed some number of times
              internally, but the external audit-log shows additional re-deployments
              our internal logs are unaware of").</dd>
            <dt pn="section-5.8.3-4.5">nonce:</dt>
            <dd pn="section-5.8.3-4.6">Nonceless entries mean the logged domainID could
              theoretically trigger a reset of the pledge and then take over management
              by using the existing nonceless voucher.</dd>
            <dt pn="section-5.8.3-4.7">assertion:</dt>
            <dd pn="section-5.8.3-4.8">The assertion leaf in the voucher and
            audit-log indicates why the MASA issued the voucher.
              A "verified" entry means that
              the MASA issued the associated voucher as a result of positive
              verification of ownership.
              However, this entry does not indicate whether or not the pledge was
              actually deployed in the prior domain.
              A "logged" assertion informs
              the registrar that the prior vouchers were issued with
              minimal verification. A "proximity" assertion
              assures the registrar that the pledge was truly communicating
              with the prior domain and thus provides assurance that the
              prior domain really has deployed the pledge.</dd>
          </dl>
          <t indent="0" pn="section-5.8.3-5">
            A relatively simple policy is to acceptlist known (internal or
            external) domainIDs and require all vouchers to have a nonce.
            An alternative is to require that all nonceless vouchers be from a
            subset (e.g., only internal) of domainIDs.
            If the policy is violated, a simple action is to revoke any
            locally issued credentials for the pledge in question or to
            refuse to forward the voucher.  The registrar <bcp14>MUST</bcp14> then refuse
            any EST actions and <bcp14>SHOULD</bcp14> inform a human via a log.
            A registrar <bcp14>MAY</bcp14> be configured to ignore (i.e., override the above
            policy) the
            history of the device, but it is <bcp14>RECOMMENDED</bcp14> that this only be
            configured if hardware-assisted (i.e., Transport Performance Metrics (TPM) anchored) Network
            Endpoint Assessment (NEA) <xref target="RFC5209" format="default" sectionFormat="of" derivedContent="RFC5209"/> is supported.
          </t>
        </section>
      </section>
      <section anchor="ESTintegration" numbered="true" toc="include" removeInRFC="false" pn="section-5.9">
        <name slugifiedName="name-est-integration-for-pki-boo">EST Integration for PKI Bootstrapping</name>
        <t indent="0" pn="section-5.9-1">The pledge <bcp14>SHOULD</bcp14> follow the BRSKI operations with EST enrollment operations
        including "CA Certificates Request", "CSR Attributes Request", and "Client Certificate Request"
        or "Server-Side Key Generation", etc. This is a relatively seamless integration
        since BRSKI API calls provide an automated alternative to the manual bootstrapping method
        described in <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>. As noted above, use of HTTP-persistent
        connections simplifies the pledge state machine.</t>
        <t indent="0" pn="section-5.9-2">
          Although EST allows clients to obtain multiple certificates by sending
          multiple Certificate Signing Requests (CSRs), BRSKI does not support this mechanism directly.
          This is because BRSKI pledges <bcp14>MUST</bcp14> use the CSR Attributes request
          (<xref target="RFC7030" sectionFormat="comma" section="4.5" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-4.5" derivedContent="RFC7030"/>).
          The registrar <bcp14>MUST</bcp14> validate the CSR against the expected
          attributes. This implies that client requests will "look the same"
          and therefore result in a single logical certificate being issued
          even if the client were to make multiple requests. Registrars <bcp14>MAY</bcp14>
          contain more complex logic, but doing so is out of scope of this
          specification.
          BRSKI does not signal any enhancement or restriction to this
          capability.
        </t>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-5.9.1">
          <name slugifiedName="name-est-distribution-of-ca-cert">EST Distribution of CA Certificates</name>
          <t indent="0" pn="section-5.9.1-1">The pledge <bcp14>SHOULD</bcp14> request the full EST Distribution of CA
          certificate messages; see <xref target="RFC7030" sectionFormat="comma" section="4.1" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-4.1" derivedContent="RFC7030"/>.</t>
          <t indent="0" pn="section-5.9.1-2">This ensures that the pledge has the complete set of current CA
          certificates beyond the pinned-domain-cert (see <xref target="PledgeAuthenticationOfProvisionalTLS" format="default" sectionFormat="of" derivedContent="Section 5.6.2"/> for a discussion of the
          limitations inherent in having a single certificate instead of a full
          CA certificate response). Although these limitations are acceptable during initial bootstrapping, they are not appropriate for ongoing PKIX end-entity certificate validation.</t>
        </section>
        <section anchor="csrattributes" numbered="true" toc="include" removeInRFC="false" pn="section-5.9.2">
          <name slugifiedName="name-est-csr-attributes">EST CSR Attributes</name>
          <t indent="0" pn="section-5.9.2-1">Automated bootstrapping occurs without local administrative
          configuration of the pledge. In some deployments, it is plausible that
          the pledge generates a certificate request containing only identity
          information known to the pledge (essentially the X.509 IDevID information)
          and ultimately receives a certificate containing domain-specific
          identity information. Conceptually, the CA has complete control over
          all fields issued in the end-entity certificate. Realistically, this
          is operationally difficult with the current status of PKI
          CA deployments, where the CSR is submitted to the
          CA via a number of non-standard protocols. Even with all
          standardized protocols used, it could operationally be problematic
          to expect that service-specific certificate fields can be created
          by a CA that is likely operated by a group that has no insight
          into different network services/protocols used. For example, the
          CA could even be outsourced.</t>
          <t indent="0" pn="section-5.9.2-2">To alleviate these operational difficulties, the pledge <bcp14>MUST</bcp14>
          request the
          EST "CSR Attributes" from the EST server, and the EST server needs
          to be able to reply with the attributes necessary for use of
          the certificate in its intended protocols/services. This approach
          allows for minimal CA integrations, and instead,
          the local infrastructure (EST server) informs the pledge of the proper
          fields to include in the generated CSR (such as rfc822Name).
          This approach is beneficial
          to automated bootstrapping in the widest number of environments.</t>
          <t indent="0" pn="section-5.9.2-3">
            In networks using the BRSKI enrolled certificate to authenticate
            the ACP, the EST CSR Attributes <bcp14>MUST</bcp14> include
            the ACP domain information fields defined in
            <xref target="RFC8994" sectionFormat="comma" section="6.2.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8994#section-6.2.2" derivedContent="RFC8994"/>.
          </t>
          <t indent="0" pn="section-5.9.2-4">The registrar <bcp14>MUST</bcp14> also confirm that the resulting CSR is formatted as
          indicated before forwarding the request to a CA. If the registrar is
          communicating with the CA using a protocol such as full Certificate Management over CMS (CMC), which
          provides mechanisms to override the CSR Attributes, then these
          mechanisms <bcp14>MAY</bcp14> be used even if the client ignores the guidance for the CSR Attributes.</t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-5.9.3">
          <name slugifiedName="name-est-client-certificate-requ">EST Client Certificate Request</name>
          <t indent="0" pn="section-5.9.3-1">The pledge <bcp14>MUST</bcp14> request a new Client
Certificate; see <xref target="RFC7030" sectionFormat="comma" section="4.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-4.2" derivedContent="RFC7030"/>.</t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-5.9.4">
          <name slugifiedName="name-enrollment-status-telemetry">Enrollment Status Telemetry</name>
          <t indent="0" pn="section-5.9.4-1">
            For automated bootstrapping of devices, the administrative elements
            that provide bootstrapping also provide indications to the system
            administrators concerning device life-cycle status.
            This might include information concerning attempted bootstrapping
            messages seen by the client.
            The MASA provides logs and the status of credential
            enrollment.
            Since an end user is assumed per <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>, a final success indication back to the server is not included. This is
            insufficient for automated use cases.
          </t>
          <t indent="0" pn="section-5.9.4-2">
            The client <bcp14>MUST</bcp14> send an indicator to the registrar about its
            enrollment status.  It does this by using an HTTP POST of
            a JSON dictionary with the attributes described below to
            the new EST endpoint at "/.well-known/brski/enrollstatus".
          </t>
          <t indent="0" pn="section-5.9.4-3">
            When indicating a successful enrollment, the client <bcp14>SHOULD</bcp14> first
            re-establish the EST TLS session using the newly obtained
            credentials. TLS 1.3 supports doing this in-band, but
            TLS 1.2 does not.  The client <bcp14>SHOULD</bcp14> therefore always close the existing
            TLS connection and start a new one, using the same Join Proxy.
          </t>
          <t indent="0" pn="section-5.9.4-4">
            In the case of a failed enrollment, the client <bcp14>MUST</bcp14> send the
            telemetry information over the same TLS
            connection that was used for the enrollment attempt, with a
            Reason string indicating why the most recent enrollment failed.
            (For failed attempts, the TLS connection is the most reliable way
            to correlate server-side information with what the client provides.)
          </t>
          <t indent="0" pn="section-5.9.4-5">
            The version and status fields <bcp14>MUST</bcp14> be present.  The Reason field <bcp14>SHOULD</bcp14> be present
            whenever the status field is false.
            In the case of a SUCCESS, the Reason string <bcp14>MAY</bcp14> be omitted.
          </t>
          <t indent="0" pn="section-5.9.4-6">
            The reason-context attribute is an arbitrary JSON object (literal
            value or hash of values) that provides additional information
            specific to the failure to unroll from this pledge.
            The contents of this field are not subject to
            standardization. This is represented by the group-socket
            "$$arbitrary-map" in the CDDL.
          </t>
          <figure anchor="cddl-enrollstatus" align="left" suppress-title="false" pn="figure-19">
            <name slugifiedName="name-cddl-for-enrollment-status-">CDDL for Enrollment Status POST</name>
            <sourcecode name="enrollstatus.cddl" type="CDDL" markers="true" pn="section-5.9.4-7.1">
enrollstatus-post = {
    "version": uint,
    "status": bool,
    ? "reason": text,
    ? "reason-context" : { $$arbitrary-map }
  }
}
</sourcecode>
          </figure>
          <t indent="0" pn="section-5.9.4-8">
            An example status report can be seen below.  It is sent with
            the media type: application/json
          </t>
          <figure anchor="example-enrollstatus" align="left" suppress-title="false" pn="figure-20">
            <name slugifiedName="name-example-of-enrollment-statu">Example of Enrollment Status POST</name>
            <sourcecode type="json" markers="false" pn="section-5.9.4-9.1">
{
    "version": 1,
    "status":true,
    "reason":"Informative human readable message",
    "reason-context": { "additional" : "JSON" }
}
</sourcecode>
          </figure>
          <t indent="0" pn="section-5.9.4-10">The server <bcp14>SHOULD</bcp14> respond with an HTTP 200 but <bcp14>MAY</bcp14> simply fail
          with an HTTP 404 error.</t>
          <t indent="0" pn="section-5.9.4-11">
            Within the server logs, the server <bcp14>MUST</bcp14> capture if this message
            was received over a TLS session with a matching Client
            Certificate.
          </t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-5.9.5">
          <name slugifiedName="name-multiple-certificates">Multiple Certificates</name>
          <t indent="0" pn="section-5.9.5-1">
            Pledges that require multiple certificates could establish
            direct EST connections to the registrar.
          </t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-5.9.6">
          <name slugifiedName="name-est-over-coap">EST over CoAP</name>
          <t indent="0" pn="section-5.9.6-1">This document describes extensions to EST for the purpose
              of bootstrapping remote key infrastructures.
              Bootstrapping is relevant for CoAP enrollment
              discussions as well. The definition of EST and BRSKI over CoAP is not
              discussed within this document beyond ensuring proxy support for
              CoAP operations. Instead, it is anticipated that a definition of
              CoAP mappings will occur in subsequent documents such as
              <xref target="I-D.ietf-ace-coap-est" format="default" sectionFormat="of" derivedContent="ACE-COAP-EST"/> and that
              CoAP mappings for BRSKI will be discussed either there or
              in future work.</t>
        </section>
      </section>
    </section>
    <section anchor="estbase64" numbered="true" toc="include" removeInRFC="false" pn="section-6">
      <name slugifiedName="name-clarification-of-transfer-e">Clarification of Transfer-Encoding</name>
      <t indent="0" pn="section-6-1">
        <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> defines endpoints to include a
        "Content-Transfer-Encoding" heading and payloads to be
         base64-encoded DER <xref target="RFC4648" format="default" sectionFormat="of" derivedContent="RFC4648"/>.
      </t>
      <t indent="0" pn="section-6-2">
        When used within BRSKI, the original EST endpoints remain
        base64 encoded <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> (as clarified by <xref target="RFC8951" format="default" sectionFormat="of" derivedContent="RFC8951"/>), but the new BRSKI endpoints that send and receive binary
        artifacts (specifically, "/.well-known/brski/requestvoucher") are
        binary. That is, no encoding is used.
      </t>
      <t indent="0" pn="section-6-3">
        In the BRSKI context, the EST "Content-Transfer-Encoding" header
        field <bcp14>SHOULD</bcp14> be ignored if present. This header field does not need
        to be included.
      </t>
    </section>
    <section anchor="reducedsecuritymodes" numbered="true" toc="include" removeInRFC="false" pn="section-7">
      <name slugifiedName="name-reduced-security-operationa">Reduced Security Operational Modes</name>
      <t indent="0" pn="section-7-1">
        A common requirement of bootstrapping is to support less secure operational
        modes for support-specific use cases.  This section suggests a range of
        mechanisms that would alter the security assurance of BRSKI to accommodate
        alternative deployment architectures and mitigate life-cycle management issues
        identified in <xref target="privacyconsiderations" format="default" sectionFormat="of" derivedContent="Section 10"/>.  They are presented here as informative
        (non-normative) design guidance for future standardization
        activities.
        <xref target="acpapplicability" format="default" sectionFormat="of" derivedContent="Section 9"/> provides standardization applicability statements
        for the ANIMA ACP. Other users
        would expect that subsets of these mechanisms could be profiled with
        accompanying applicability statements similar to the one described in
        <xref target="acpapplicability" format="default" sectionFormat="of" derivedContent="Section 9"/>.
      </t>
      <t indent="0" pn="section-7-2">
        This section is considered non-normative in the generality of the
        protocol.  Use of the suggested mechanisms here <bcp14>MUST</bcp14> be detailed in
        specific profiles of BRSKI, such as in <xref target="acpapplicability" format="default" sectionFormat="of" derivedContent="Section 9"/>.
      </t>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-7.1">
        <name slugifiedName="name-trust-model">Trust Model</name>
        <t indent="0" pn="section-7.1-1">
        This section explains the trust relationships detailed in <xref target="flow" format="default" sectionFormat="of" derivedContent="Section 2.4"/>:
        </t>
        <figure align="left" suppress-title="false" pn="figure-21">
          <name slugifiedName="name-elements-of-brski-trust-mod">Elements of BRSKI Trust Model</name>
          <artwork name="" type="" align="left" alt="" pn="section-7.1-2.1">
+--------+         +---------+    +------------+     +------------+
| Pledge |         | Join    |    | Domain     |     |Manufacturer|
|        |         | Proxy   |    | Registrar  |     | Service    |
|        |         |         |    |            |     | (Internet) |
+--------+         +---------+    +------------+     +------------+
              </artwork>
        </figure>
        <dl newline="false" spacing="normal" indent="3" pn="section-7.1-3">
          <dt pn="section-7.1-3.1">Pledge:</dt>
          <dd pn="section-7.1-3.2">The pledge could be compromised and
            provide an attack vector for malware. The entity is trusted to
            only imprint using secure methods described in this document.
            Additional endpoint assessment techniques are <bcp14>RECOMMENDED</bcp14> but are
            out of scope of this document.</dd>
          <dt pn="section-7.1-3.3">Join Proxy:</dt>
          <dd pn="section-7.1-3.4">Provides proxy functionalities but is not
            involved in security considerations.</dd>
          <dt pn="section-7.1-3.5">Registrar:</dt>
          <dd pn="section-7.1-3.6">When interacting with a MASA, a
            registrar makes all decisions. For Ownership Audit Vouchers (see <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>), the registrar is provided an opportunity to
            accept MASA decisions.</dd>
          <dt pn="section-7.1-3.7">Vendor Service, MASA:</dt>
          <dd pn="section-7.1-3.8">This form of manufacturer service is
            trusted to accurately log all claim attempts and to provide
            authoritative log information to registrars. The MASA does not
            know which devices are associated with which domains. These claims
            could be strengthened by using cryptographic log techniques to
            provide append only, cryptographic assured, publicly auditable
            logs. </dd>
          <dt pn="section-7.1-3.9">Vendor Service, Ownership Validation:</dt>
          <dd pn="section-7.1-3.10">This form of
            manufacturer service is trusted to accurately know which device is owned
            by which domain.</dd>
        </dl>
      </section>
      <section anchor="pledgeReductions" numbered="true" toc="include" removeInRFC="false" pn="section-7.2">
        <name slugifiedName="name-pledge-security-reductions">Pledge Security Reductions</name>
        <t indent="0" pn="section-7.2-1">
          The following is a list of alternative behaviors that the
          pledge can be programmed to implement.  These behaviors are not
          mutually exclusive, nor are they dependent upon each other.
          Some of these methods enable offline and emergency (touch-based)
          deployment use cases.  Normative language is used as these behaviors
          are referenced in later sections in a normative fashion.

        </t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-7.2-2">
          <li pn="section-7.2-2.1" derivedCounter="1.">
                The pledge <bcp14>MUST</bcp14> accept nonceless vouchers. This allows for
                a use case where the registrar cannot connect to the MASA
                at the deployment time.
                Logging and validity periods address the
                security considerations of supporting these use cases.
              </li>
          <li pn="section-7.2-2.2" derivedCounter="2.">
                Many devices already support "trust on first use" for
                physical interfaces such as console ports. This document does
                not change that reality. Devices supporting this protocol
                <bcp14>MUST NOT</bcp14> support "trust on first use" on network
                interfaces. This is because "trust on first use" over network
                interfaces would undermine the logging based security
                protections provided by this specification.
              </li>
          <li pn="section-7.2-2.3" derivedCounter="3.">
                The pledge <bcp14>MAY</bcp14> have an operational mode where it skips voucher
                validation one time, for example, if a physical button is
                depressed during the bootstrapping operation. This can be
                useful if the manufacturer service is unavailable. This
                behavior <bcp14>SHOULD</bcp14> be available via local configuration or
                physical presence methods (such as use of a serial/craft
                console) to ensure new entities can always be deployed even
                when autonomic methods fail. This allows for unsecured
                imprint.
              </li>
          <li pn="section-7.2-2.4" derivedCounter="4.">
                A craft/serial console could include a command such as
                "est-enroll [2001:db8:0:1]:443" that begins the
                EST process from the point after the voucher is validated.
                This process <bcp14>SHOULD</bcp14> include server certificate verification using
                an on-screen fingerprint.
              </li>
        </ol>
        <t indent="0" pn="section-7.2-3">It is <bcp14>RECOMMENDED</bcp14> that "trust on first use" or any method of skipping voucher
        validation (including use of a craft serial console) only be available if hardware-assisted Network Endpoint
        Assessment (NEA) <xref target="RFC5209" format="default" sectionFormat="of" derivedContent="RFC5209"/>
        is supported. This recommendation ensures that domain network monitoring
        can detect inappropriate use of offline or emergency
        deployment procedures when voucher-based bootstrapping is not used.</t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-7.3">
        <name slugifiedName="name-registrar-security-reductio">Registrar Security Reductions</name>
        <t indent="0" pn="section-7.3-1">
          A registrar can choose to accept devices using less secure methods.
          They <bcp14>MUST NOT</bcp14> be the default behavior.
          These methods may be acceptable in situations where threat
          models indicate that low security is adequate.
          This includes situations where security decisions are being made by
          the local administrator:
        </t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-7.3-2">

          <li pn="section-7.3-2.1" derivedCounter="1.">A registrar <bcp14>MAY</bcp14> choose to accept all devices, or all devices of
          a particular type. The administrator could make this choice in cases where it
          is operationally difficult to configure the registrar with the unique
          identifier of each new device expected.</li>
          <li pn="section-7.3-2.2" derivedCounter="2.">A registrar <bcp14>MAY</bcp14> choose to accept devices that claim a unique
            identity without the benefit of authenticating that claimed
            identity. This could occur when the pledge does not include an
            X.509 IDevID factory-installed credential. New entities without an
            X.509 IDevID credential <bcp14>MAY</bcp14> form the request per <xref target="RequestVoucherFromRegistrar" format="default" sectionFormat="of" derivedContent="Section 5.2"/> using the
            format per <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/> to ensure the
            pledge's serial number information is provided to the registrar
            (this includes the IDevID AuthorityKeyIdentifier value, which would
            be statically configured on the pledge). The pledge <bcp14>MAY</bcp14> refuse to
            provide a TLS Client Certificate (as one is not available). The
            pledge <bcp14>SHOULD</bcp14> support HTTP-based or certificate-less TLS
            authentication as described in EST <xref target="RFC7030" sectionFormat="comma" section="3.3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.3.2" derivedContent="RFC7030"/>. A
            registrar <bcp14>MUST NOT</bcp14> accept unauthenticated new entities unless it
            has been configured to do so by an administrator that has verified
            that only expected new entities can communicate with a registrar
            (presumably via a physically secured perimeter.)</li>
          <li pn="section-7.3-2.3" derivedCounter="3.">A registrar <bcp14>MAY</bcp14> submit a nonceless voucher-request to the MASA
            service (by not including a nonce in the voucher-request). The resulting
            vouchers can then be stored by the registrar until
            they are needed during bootstrapping operations. This is for use
            cases where the target network is protected by an air gap and
            therefore cannot contact the MASA service during pledge
            deployment.</li>
          <li pn="section-7.3-2.4" derivedCounter="4.">
              A registrar <bcp14>MAY</bcp14> ignore unrecognized nonceless log
              entries. This could occur when used equipment is purchased with a
              valid history of being deployed in air gap networks that
              required offline vouchers.
            </li>
          <li pn="section-7.3-2.5" derivedCounter="5.">A registrar <bcp14>MAY</bcp14> accept voucher formats of future types that
              cannot be parsed by the registrar. This reduces the registrar's
              visibility into the exact voucher contents but does not change
              the protocol operations.</li>
        </ol>
      </section>
      <section anchor="masasecurityreductions" numbered="true" toc="include" removeInRFC="false" pn="section-7.4">
        <name slugifiedName="name-masa-security-reductions">MASA Security Reductions</name>
        <t indent="0" pn="section-7.4-1">
          Lower security modes chosen by the MASA service affect all device
          deployments unless the lower security behavior is tied to specific
          device identities.
          The modes described below can be applied to specific devices
          via knowledge of what devices were sold.  They can also be
          bound to specific customers (independent of the device identity) by
          authenticating  the customer's registrar.
        </t>
        <section anchor="masasecurityreduction_nonce" numbered="true" toc="include" removeInRFC="false" pn="section-7.4.1">
          <name slugifiedName="name-issuing-nonceless-vouchers">Issuing Nonceless Vouchers</name>
          <t indent="0" pn="section-7.4.1-1">
            A MASA has the option of not including a nonce in the voucher
            and/or not requiring one to be present in the voucher-request. This
            results in distribution of a voucher that may never expire and, in
            effect, makes the specified domain an always trusted entity to the
            pledge during any subsequent bootstrapping attempts. The log information captures when
            a nonceless voucher is issued so that the registrar
            can make appropriate security decisions when a pledge joins the
            domain. Nonceless vouchers are useful to support use cases where registrars might
            not be online during actual device deployment.
          </t>
          <t indent="0" pn="section-7.4.1-2">
            While a nonceless voucher may include an expiry date, a typical
            use for a nonceless voucher is for it to be long lived.  If
            the device can be trusted to have an accurate clock (the MASA
            will know), then a nonceless voucher CAN be issued with a limited
            lifetime.
          </t>
          <t indent="0" pn="section-7.4.1-3">
            A more typical case for a nonceless voucher is for use with
            offline onboarding scenarios where it is not possible to pass
            a fresh voucher-request to the MASA.  The use of a long-lived
            voucher also eliminates concern about the availability of the
            MASA many years in the future.  Thus, many nonceless vouchers
            will have no expiry dates.
          </t>
          <t indent="0" pn="section-7.4.1-4">
            Thus, the long-lived nonceless voucher does not require proof
            that the device is online.  Issuing such a thing is only accepted
            when the registrar is authenticated by the MASA and the
            MASA is authorized to provide this functionality to this
            customer.
            The MASA is <bcp14>RECOMMENDED</bcp14> to use this
            functionality only in concert with an enhanced level of ownership
            tracking, the details of which are out of scope for this document.
          </t>
          <t indent="0" pn="section-7.4.1-5">
            If the pledge device is known to have
            a real-time clock that is set from the factory, use of a voucher
            validity period is <bcp14>RECOMMENDED</bcp14>.
          </t>
        </section>
        <section anchor="masasecurityreduction_tofu" numbered="true" toc="include" removeInRFC="false" pn="section-7.4.2">
          <name slugifiedName="name-trusting-owners-on-first-us">Trusting Owners on First Use</name>
          <t indent="0" pn="section-7.4.2-1">
            A MASA has the option of not verifying ownership before
            responding with a voucher.
            This is expected to be a common operational model because
            doing so relieves the manufacturer providing MASA services from
            having to track ownership during shipping and throughout the
	    supply chain, and it allows
            for a very low overhead MASA service.
	    A registrar uses the audit-log
            information as an in-depth defense strategy to ensure that this
            does not occur unexpectedly (for example, when purchasing new
            equipment, the registrar would throw an error if any audit-log
            information is reported). The MASA <bcp14>SHOULD</bcp14> verify the
            prior-signed-voucher-request information for pledges that support
            that functionality. This provides a proof-of-proximity
            check that reduces the need for ownership verification.  The
            proof-of-proximity comes from the assumption that the pledge and
            Join Proxy are on the same link-local connection.
          </t>
          <t indent="0" pn="section-7.4.2-2">
            A MASA that practices TOFU for registrar
            identity may wish to annotate the origin of the connection
            by IP address or netblock and restrict future use of that
            identity from other locations.  A MASA that does this <bcp14>SHOULD</bcp14>
            take care to not create nuisance situations for itself when
            a customer has multiple registrars or uses outgoing IPv4-to-IPv4 NAT (NAT44)
            connections that change frequently.
          </t>
        </section>
        <section anchor="masasecurityreduction_newanchor" numbered="true" toc="include" removeInRFC="false" pn="section-7.4.3">
          <name slugifiedName="name-updating-or-extending-vouch">Updating or Extending Voucher Trust Anchors</name>
          <t indent="0" pn="section-7.4.3-1">
            This section deals with two problems: A MASA that is no longer available due to
	    a failed business and a MASA that is uncooperative to a secondary sale.
          </t>
          <t indent="0" pn="section-7.4.3-2">
            A manufacturer could offer a management mechanism that allows the
            list of voucher verification trust anchors to be extended.
            <xref target="I-D.ietf-netconf-keystore" format="default" sectionFormat="of" derivedContent="YANG-KEYSTORE"/> describes one such interface
            that could be implemented using YANG.  Pretty much any
            configuration mechanism used today could be extended to
            provide the needed additional update.
            A manufacturer could even decide to install the domain CA
            trust anchors received during the EST "cacerts" step as voucher
            verification anchors. Some additional signals will be needed to
            clearly identify which keys have voucher validation authority from
            among those signed by the domain CA. This is future work.
          </t>
          <t indent="0" pn="section-7.4.3-3">
            With the above change to the list of anchors, vouchers can be
            issued by an alternate MASA.  This could be the previous owner
            (the seller) or some other trusted third party who is mediating
            the sale.  If it is a third party, the seller would need
            to take steps to introduce the third-party configuration to
            the device prior to disconnection.  The third party
            (e.g., a wholesaler of used equipment) could, however,
            use a mechanism described in <xref target="pledgeReductions" format="default" sectionFormat="of" derivedContent="Section 7.2"/>
            to take control of the device after receiving it physically.
            This would permit the third party to act as the MASA for future
            onboarding actions.  As the IDevID certificate probably cannot
            be replaced, the new owner's registrar would have to support
            an override of the MASA URL.
          </t>
          <t indent="0" pn="section-7.4.3-4">
            To be useful for resale or other transfers of ownership, one of
            two situations will need to occur.  The simplest is that the
            device is not put through any kind of factory default/reset
            before going through onboarding again.  Some other secure, physical
            signal would be needed to initiate it.  This is most suitable for
            redeploying a device within the same enterprise.  This would
            entail having previous configuration in the system until entirely
            replaced by the new owner, and it represents some level of risk.
          </t>
          <t indent="0" pn="section-7.4.3-5">
            For the second scenario, there would need to be two levels
            of factory reset.  One would take the system back entirely to
            manufacturer state, including removing any added trust anchors,
            and the other (more commonly used) one would just restore the
            configuration back to a known default without erasing trust
            anchors.  This weaker factory reset might leave valuable
            credentials on the device, and this may be unacceptable to
            some owners.
          </t>
          <t indent="0" pn="section-7.4.3-6">
            As a third option, the manufacturer's trust anchors could be
            entirely overwritten with local trust anchors.  A factory default
            would never restore those anchors.  This option comes with a lot
            of power but is also a lot of responsibility: if access to
            the private part of the new anchors
            are lost, the manufacturer may be unable to help.
          </t>
        </section>
      </section>
    </section>
    <section numbered="true" toc="include" removeInRFC="false" pn="section-8">
      <name slugifiedName="name-iana-considerations">IANA Considerations</name>
      <t indent="0" pn="section-8-1">Per this document, IANA has completed the following actions.</t>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.1">
        <name slugifiedName="name-the-ietf-xml-registry">The IETF XML Registry</name>
        <t indent="0" pn="section-8.1-1">
          This document registers a URI in the "IETF XML
          Registry" <xref target="RFC3688" format="default" sectionFormat="of" derivedContent="RFC3688"/>.
          IANA has registered the following:</t>
        <dl spacing="compact" indent="3" newline="false" pn="section-8.1-2">
          <dt pn="section-8.1-2.1">URI:</dt>
          <dd pn="section-8.1-2.2">urn:ietf:params:xml:ns:yang:ietf-voucher-request</dd>
          <dt pn="section-8.1-2.3">Registrant Contact:</dt>
          <dd pn="section-8.1-2.4">The ANIMA WG of the IETF.</dd>
          <dt pn="section-8.1-2.5">XML:</dt>
          <dd pn="section-8.1-2.6">N/A; the requested URI is an XML namespace.</dd>
        </dl>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.2">
        <name slugifiedName="name-yang-module-names-registry">YANG Module Names Registry</name>
        <t indent="0" pn="section-8.2-1">
          This document registers a YANG module in the
          "YANG Module Names" registry <xref target="RFC6020" format="default" sectionFormat="of" derivedContent="RFC6020"/>.
          IANA has registered the following:</t>
        <dl spacing="compact" indent="3" newline="false" pn="section-8.2-2">
          <dt pn="section-8.2-2.1">Name:</dt>
          <dd pn="section-8.2-2.2">ietf-voucher-request</dd>
          <dt pn="section-8.2-2.3">Namespace:</dt>
          <dd pn="section-8.2-2.4">urn:ietf:params:xml:ns:yang:ietf-voucher-request</dd>
          <dt pn="section-8.2-2.5">Prefix:</dt>
          <dd pn="section-8.2-2.6">vch</dd>
          <dt pn="section-8.2-2.7">Reference:</dt>
          <dd pn="section-8.2-2.8">RFC 8995</dd>
        </dl>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.3">
        <name slugifiedName="name-brski-well-known-considerat">BRSKI Well-Known Considerations</name>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-8.3.1">
          <name slugifiedName="name-brski-well-known-registrati">BRSKI .well-known Registration</name>
          <t indent="0" pn="section-8.3.1-1">
            To the "Well-Known URIs" registry at
            <eref target="https://www.iana.org/assignments/well-known-uris/" brackets="none"/>,
            this document registers the well-known name "brski" with the
            following filled-in template from <xref target="RFC8615" format="default" sectionFormat="of" derivedContent="RFC8615"/>:
          </t>
          <dl newline="false" spacing="compact" indent="3" pn="section-8.3.1-2">
            <dt pn="section-8.3.1-2.1">URI Suffix:</dt>
            <dd pn="section-8.3.1-2.2">brski</dd>
            <dt pn="section-8.3.1-2.3">Change Controller:</dt>
            <dd pn="section-8.3.1-2.4">IETF</dd>
          </dl>
          <t indent="0" pn="section-8.3.1-3">
            IANA has changed the registration of "est" to now only
            include <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> and no longer this document.
            Earlier draft versions of this document used "/.well-known/est" rather
            than "/.well-known/brski".
          </t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-8.3.2">
          <name slugifiedName="name-brski-well-known-registry">BRSKI .well-known Registry</name>
          <t indent="0" pn="section-8.3.2-1">
            IANA has created a new registry entitled: "BRSKI Well-Known URIs".
            The registry has three columns:  URI, Description, and Reference.
            New items can be added using the Specification Required <xref target="RFC8126" format="default" sectionFormat="of" derivedContent="RFC8126"/> process.
            The initial contents of this registry are:
          </t>
          <table anchor="table_IANA" align="center" pn="table-1">
            <name slugifiedName="name-brski-well-known-uris">BRSKI Well-Known URIs</name>
            <thead>
              <tr>
                <th align="left" colspan="1" rowspan="1">URI</th>
                <th align="left" colspan="1" rowspan="1">Description</th>
                <th align="left" colspan="1" rowspan="1">Reference</th>
              </tr>
            </thead>
            <tbody>
              <tr>
                <td align="left" colspan="1" rowspan="1">requestvoucher</td>
                <td align="left" colspan="1" rowspan="1">pledge to registrar, and from registrar to MASA</td>
                <td align="left" colspan="1" rowspan="1">RFC 8995</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">voucher_status</td>
                <td align="left" colspan="1" rowspan="1">pledge to registrar</td>
                <td align="left" colspan="1" rowspan="1">RFC 8995</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">requestauditlog</td>
                <td align="left" colspan="1" rowspan="1">registrar to MASA</td>
                <td align="left" colspan="1" rowspan="1">RFC 8995</td>
              </tr>
              <tr>
                <td align="left" colspan="1" rowspan="1">enrollstatus</td>
                <td align="left" colspan="1" rowspan="1">pledge to registrar</td>
                <td align="left" colspan="1" rowspan="1">RFC 8995</td>
              </tr>
            </tbody>
          </table>
        </section>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.4">
        <name slugifiedName="name-pkix-registry">PKIX Registry</name>
        <t indent="0" pn="section-8.4-1">IANA has registered the following:</t>
        <t indent="0" pn="section-8.4-2">
          a number for id-mod-MASAURLExtn2016(96)
          from the pkix(7) id-mod(0) Registry.
        </t>
        <t indent="0" pn="section-8.4-3">
          IANA has assigned a number from the id-pe registry
          (Structure of Management Information (SMI) Security for PKIX Certificate Extension) for id-pe-masa-url
          with the value 32, resulting in an OID of 1.3.6.1.5.5.7.1.32.
       

        </t>
      </section>
      <section anchor="pledgestatustelemetryregistry" numbered="true" toc="include" removeInRFC="false" pn="section-8.5">
        <name slugifiedName="name-pledge-brski-status-telemetr">Pledge BRSKI Status Telemetry</name>
        <t indent="0" pn="section-8.5-1">
          IANA has created a new registry entitled "BRSKI
          Parameters" and has created, within that registry, a table called:
          "Pledge BRSKI Status Telemetry Attributes".
          New items can be added using the
          Specification Required process.  The following items are in the
          initial registration, with this document (see <xref target="pledgestatus" format="default" sectionFormat="of" derivedContent="Section 5.7"/>) as the reference:
        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-8.5-2">
          <li pn="section-8.5-2.1">version</li>
          <li pn="section-8.5-2.2">Status</li>
          <li pn="section-8.5-2.3">Reason</li>
          <li pn="section-8.5-2.4">reason-context</li>
        </ul>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.6">
        <name slugifiedName="name-dns-service-names">DNS Service Names</name>
        <t indent="0" pn="section-8.6-1">IANA has registered the following service names:</t>
        <dl spacing="compact" indent="3" newline="false" pn="section-8.6-2">
          <dt pn="section-8.6-2.1">Service Name:</dt>
          <dd pn="section-8.6-2.2">brski-proxy</dd>
          <dt pn="section-8.6-2.3">Transport Protocol(s):</dt>
          <dd pn="section-8.6-2.4">tcp</dd>
          <dt pn="section-8.6-2.5">Assignee:</dt>
          <dd pn="section-8.6-2.6">IESG &lt;iesg@ietf.org&gt;</dd>
          <dt pn="section-8.6-2.7">Contact:</dt>
          <dd pn="section-8.6-2.8">IESG &lt;iesg@ietf.org&gt;</dd>
          <dt pn="section-8.6-2.9">Description:</dt>
          <dd pn="section-8.6-2.10">The Bootstrapping Remote Secure Key Infrastructure
Proxy</dd>
          <dt pn="section-8.6-2.11">Reference:</dt>
          <dd pn="section-8.6-2.12">RFC 8995</dd>
        </dl>
        <dl spacing="compact" indent="3" newline="false" pn="section-8.6-3">
          <dt pn="section-8.6-3.1">Service Name:</dt>
          <dd pn="section-8.6-3.2">brski-registrar</dd>
          <dt pn="section-8.6-3.3">Transport Protocol(s):</dt>
          <dd pn="section-8.6-3.4">tcp</dd>
          <dt pn="section-8.6-3.5">Assignee:</dt>
          <dd pn="section-8.6-3.6">IESG &lt;iesg@ietf.org&gt;</dd>
          <dt pn="section-8.6-3.7">Contact:</dt>
          <dd pn="section-8.6-3.8">IESG &lt;iesg@ietf.org&gt;</dd>
          <dt pn="section-8.6-3.9">Description:</dt>
          <dd pn="section-8.6-3.10">The Bootstrapping Remote Secure Key Infrastructure
Registrar</dd>
          <dt pn="section-8.6-3.11">Reference:</dt>
          <dd pn="section-8.6-3.12">RFC 8995</dd>
        </dl>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-8.7">
        <name slugifiedName="name-grasp-objective-names">GRASP Objective Names</name>
        <t indent="0" pn="section-8.7-1">IANA has registered the following GRASP Objective
        Names:</t>
        <t indent="0" pn="section-8.7-2">
          IANA has registered the value "AN_Proxy" (without quotes)
          to the "GRASP Objective Names" table in the GRASP Parameter registry.
          The specification for this value is <xref target="brskigrasp" format="default" sectionFormat="of" derivedContent="Section 4.1.1"/> of this document.
        </t>
        <t indent="0" pn="section-8.7-3">
          The IANA has registered the value "AN_join_registrar" (without quotes)
          to the "GRASP Objective Names" table in the GRASP Parameter registry.
          The specification for this value is <xref target="JRCgrasp" format="default" sectionFormat="of" derivedContent="Section 4.3"/> of this document.
        </t>
      </section>
    </section>
    <section anchor="acpapplicability" numbered="true" toc="include" removeInRFC="false" pn="section-9">
      <name slugifiedName="name-applicability-to-the-autono">Applicability to the Autonomic Control Plane (ACP)</name>
      <t indent="0" pn="section-9-1">
        This document provides a solution to the requirements for secure
        bootstrapping as defined in "<xref target="RFC8368" format="title" sectionFormat="of" derivedContent="Using an Autonomic Control Plane for Stable Connectivity of Network Operations, Administration, and Maintenance (OAM)"/>" <xref target="RFC8368" format="default" sectionFormat="of" derivedContent="RFC8368"/>,
       "A Reference Model for Autonomic Networking" <xref target="RFC8993" format="default" sectionFormat="of" derivedContent="RFC8993"/>, and specifically
       "An Autonomic Control Plane (ACP)" <xref target="RFC8994" format="default" sectionFormat="of" derivedContent="RFC8994"/>; see Sections <xref target="RFC8994" sectionFormat="bare" section="3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8994#section-3.2" derivedContent="RFC8994"/> ("Secure Bootstrap over an Unconfigured Network") and
        <xref target="RFC8994" sectionFormat="bare" section="6.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8994#section-6.2" derivedContent="RFC8994"/> ("ACP Domain, Certificate, and Network").
      </t>
      <t indent="0" pn="section-9-2">
        The protocol described in this document has appeal in a number of
        other non-ANIMA use cases.  Such uses of the protocol will be
        deployed into other environments with different tradeoffs of
        privacy, security, reliability, and autonomy from manufacturers.
        As such, those use cases will need to provide their own applicability
        statements and will need to address unique privacy and security
        considerations for the environments in which they are used.
      </t>
      <t indent="0" pn="section-9-3">
        The ACP that is bootstrapped by
        the BRSKI protocol is typically used in medium to large Internet
        service provider organizations. Equivalent enterprises that have
        significant Layer 3 router connectivity also will find significant
        benefit, particularly if the enterprise has many sites.
        (A network consisting of primarily Layer 2
        is not excluded, but the adjacencies that the ACP will create and
        maintain will not reflect the topology until all devices participate
        in the ACP.)
      </t>
      <t indent="0" pn="section-9-4">
        In the ACP, the Join Proxy is found to be proximal because
        communication between the pledge and the Join Proxy is exclusively
        on IPv6 link-local addresses.  The proximity of the
        Join Proxy to the registrar is validated by the registrar using ANI
        ACP IPv6 ULAs.
        ULAs are not routable over the Internet, so as long as the Join
        Proxy is operating correctly, the proximity assertion is satisfied.
	Other uses of BRSKI will need similar analysis if they
        use proximity assertions.
      </t>
      <t indent="0" pn="section-9-5">
        As specified in the ANIMA charter, this work "focuses on
        professionally-managed networks."  Such a network has an operator
        and can do things like install, configure, and operate the
        registrar function.  The operator makes purchasing decisions
        and is aware of what manufacturers it expects to see on its
        network.
      </t>
      <t indent="0" pn="section-9-6">
        Such an operator is also capable of performing bootstrapping of a
        device using a serial console (craft console). The zero-touch
        mechanism presented in this and the ACP document <xref target="RFC8994" format="default" sectionFormat="of" derivedContent="RFC8994"/>
        represents a
        significant efficiency: in particular, it reduces the need to
        put senior experts on airplanes to configure devices in person.
      </t>
      <t indent="0" pn="section-9-7">
        As the technology evolves, there is recognition that not every
        situation may work out, and occasionally a human may still have to
        visit.  Given this, some mechanisms are presented in
        <xref target="pledgeReductions" format="default" sectionFormat="of" derivedContent="Section 7.2"/>. The manufacturer <bcp14>MUST</bcp14> provide at
        least one of the one-touch mechanisms described that permit
        enrollment to proceed without the availability of any manufacturer
        server (such as the MASA).
      </t>
      <t indent="0" pn="section-9-8">
        The BRSKI protocol is going into environments where there have
        already been quite a number of vendor proprietary management
        systems.  Those are not expected to go away quickly but rather to
        leverage the secure credentials that are provisioned by BRSKI.  The
        connectivity requirements of the said management systems are provided
        by the ACP.
      </t>
      <section anchor="operationalrequirements" numbered="true" toc="include" removeInRFC="false" pn="section-9.1">
        <name slugifiedName="name-operational-requirements">Operational Requirements</name>
        <t indent="0" pn="section-9.1-1">
          This section collects operational requirements based upon the three
          roles involved in BRSKI: the MASA, the (domain) owner, and the device.
          It should be recognized that the manufacturer may be involved in two
          roles, as it creates the software/firmware for the device and
          may also be the operator of the MASA.
        </t>
        <t indent="0" pn="section-9.1-2">
          The requirements in this section are presented using BCP 14 language
          <xref target="RFC2119" format="default" sectionFormat="of" derivedContent="RFC2119"/> <xref target="RFC8174" format="default" sectionFormat="of" derivedContent="RFC8174"/>.

	  These do not represent new normative statements, just a
          review of a few such things in one place by role.  They also apply
          specifically to the ANIMA ACP use case.  Other use cases likely
          have similar, but <bcp14>MAY</bcp14> have different, requirements.
        </t>
        <section anchor="masarequirements" numbered="true" toc="include" removeInRFC="false" pn="section-9.1.1">
          <name slugifiedName="name-masa-operational-requiremen">MASA Operational Requirements</name>
          <t indent="0" pn="section-9.1.1-1">
            The manufacturer <bcp14>MUST</bcp14> arrange for an online service called the MASA to be available. It <bcp14>MUST</bcp14> be available at the URL that is encoded
            in the IDevID certificate extensions described in <xref target="MASAURL" format="default" sectionFormat="of" derivedContent="Section 2.3.2"/>.
          </t>
          <t indent="0" pn="section-9.1.1-2">
            The online service <bcp14>MUST</bcp14> have access to a private key with which to
            sign voucher artifacts <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>.  The public
            key, certificate, or certificate chain <bcp14>MUST</bcp14> be built into the
            device as part of the firmware.
          </t>
          <t indent="0" pn="section-9.1.1-3">
            It is <bcp14>RECOMMENDED</bcp14> that the manufacturer arrange for this signing
            key (or keys) to be escrowed according to typical software source
            code escrow practices <xref target="softwareescrow" format="default" sectionFormat="of" derivedContent="softwareescrow"/>.
          </t>
          <t indent="0" pn="section-9.1.1-4">
            The MASA accepts voucher-requests from domain owners according to
            an operational practice appropriate for the device.  This can range
            from any domain owner (first-come first-served, on a TOFU-like
            basis), to full sales channel integration where domain owners need
            to be positively identified by TLS pinned Client Certificates or an HTTP
            authentication process.  The MASA creates signed voucher artifacts
            according to its internally defined policies.
          </t>
          <t indent="0" pn="section-9.1.1-5">
            The MASA <bcp14>MUST</bcp14> operate an audit-log for devices that is accessible.
            The audit-log is designed to be easily cacheable, and the MASA <bcp14>MAY</bcp14>
            find it useful to put this content on a Content Delivery Network (CDN).
          </t>
        </section>
        <section anchor="domainownerrequirements" numbered="true" toc="include" removeInRFC="false" pn="section-9.1.2">
          <name slugifiedName="name-domain-owner-operational-re">Domain Owner Operational Requirements</name>
          <t indent="0" pn="section-9.1.2-1">
            The domain owner <bcp14>MUST</bcp14> operate an EST <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/>
            server with the extensions described in this document.  This is
            the JRC or registrar.  This JRC/EST
            server <bcp14>MUST</bcp14> announce itself using GRASP within the ACP.  This EST
            server will typically reside with the Network Operations Center for
            the organization.
          </t>
          <t indent="0" pn="section-9.1.2-2">
            The domain owner <bcp14>MAY</bcp14> operate an internal CA that
            is separate from the EST server, or it <bcp14>MAY</bcp14> combine all activities
            into a single device.  The determination of the architecture
            depends upon the scale and resiliency requirements of the
            organization.  Multiple JRC instances <bcp14>MAY</bcp14> be announced into the ACP
            from multiple locations to achieve an appropriate level of
            redundancy.
          </t>
          <t indent="0" pn="section-9.1.2-3">
            In order to recognize which devices and which manufacturers are
            welcome on the domain owner's network, the domain owner <bcp14>SHOULD</bcp14>
            maintain an acceptlist of manufacturers.  This <bcp14>MAY</bcp14> extend to
            integration with purchasing departments to know the serial numbers
            of devices.
          </t>
          <t indent="0" pn="section-9.1.2-4">
            The domain owner <bcp14>SHOULD</bcp14> use the resulting overlay ACP network to
            manage devices, replacing legacy out-of-band mechanisms.
          </t>
          <t indent="0" pn="section-9.1.2-5">
            The domain owner <bcp14>SHOULD</bcp14> operate one or more EST servers that can
            be used to renew the domain certificates (LDevIDs), which are
            deployed to devices.  These servers <bcp14>MAY</bcp14> be the same as the JRC or
            <bcp14>MAY</bcp14> be a distinct set of devices, as appropriate for resiliency.
          </t>
          <t indent="0" pn="section-9.1.2-6">
            The organization <bcp14>MUST</bcp14> take appropriate precautions against loss of
            access to the CA private key.  Hardware security
            modules and/or secret splitting are appropriate.
          </t>
        </section>
        <section anchor="devicerequirements" numbered="true" toc="include" removeInRFC="false" pn="section-9.1.3">
          <name slugifiedName="name-device-operational-requirem">Device Operational Requirements</name>
          <t indent="0" pn="section-9.1.3-1">
            Devices <bcp14>MUST</bcp14> come with built-in trust anchors that permit the device to
            validate vouchers from the MASA.
          </t>
          <t indent="0" pn="section-9.1.3-2">
            Devices <bcp14>MUST</bcp14> come with (unique, per-device) IDevID certificates that
            include their serial numbers and the MASA URL extension.
          </t>
          <t indent="0" pn="section-9.1.3-3">
            Devices are expected to find Join Proxies using GRASP, and then connect
            to the JRC using the protocol described in this document.
          </t>
          <t indent="0" pn="section-9.1.3-4">
            Once a domain owner has been validated with the voucher, devices
            are expected to enroll into the domain using EST.  Devices are then
            expected to form ACPs using IPsec over IPv6 link-local addresses as
            described in  <xref target="RFC8994" format="default" sectionFormat="of" derivedContent="RFC8994"/>.
          </t>
          <t indent="0" pn="section-9.1.3-5">
            Once a device has been enrolled, it <bcp14>SHOULD</bcp14> listen for the address
            of the JRC using GRASP, and it <bcp14>SHOULD</bcp14> enable itself as a Join
            Proxy and announce itself on all links/interfaces using GRASP DULL.
          </t>
          <t indent="0" pn="section-9.1.3-6">
            Devices are expected to renew their certificates before they
            expire.
          </t>
        </section>
      </section>
    </section>
    <section anchor="privacyconsiderations" numbered="true" toc="include" removeInRFC="false" pn="section-10">
      <name slugifiedName="name-privacy-considerations">Privacy Considerations</name>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-10.1">
        <name slugifiedName="name-masa-audit-log">MASA Audit-Log</name>
        <t indent="0" pn="section-10.1-1">
        The MASA audit-log includes the domainID for each
        domain a voucher has been issued to. This information is closely
        related to the actual domain identity.  A MASA may need additional
        defenses against Denial-of-Service attacks (<xref target="dosmasa" format="default" sectionFormat="of" derivedContent="Section 11.1"/>),
        and this may involve collecting additional (unspecified here)
        information. This could provide sufficient information for the MASA
        service to build a detailed understanding of the devices that have been
        provisioned within a domain.
        </t>
        <t indent="0" pn="section-10.1-2">
        There are a number of design choices that mitigate this
        risk. The domain can maintain some privacy since it has not necessarily
        been authenticated and is not authoritatively bound to the supply
        chain.
        </t>
        <t indent="0" pn="section-10.1-3">
        Additionally, the domainID captures only the unauthenticated
        subject key identifier of the domain. A privacy-sensitive domain could
        theoretically generate a new domainID for each device being
        deployed. Similarly, a privacy-sensitive domain would likely purchase
        devices that support proximity assertions from a manufacturer that does
        not require sales channel integrations. This would result in a
        significant level of privacy while maintaining the security
        characteristics provided by the registrar-based audit-log inspection.
        </t>
      </section>
      <section anchor="idevidregistrar" numbered="true" toc="include" removeInRFC="false" pn="section-10.2">
        <name slugifiedName="name-what-brski-est-reveals">What BRSKI-EST Reveals</name>
        <t indent="0" pn="section-10.2-1">
            During the provisional phase of the BRSKI-EST connection between
            the pledge and the registrar, each party reveals its
            certificates to each other.  For the pledge, this includes the
            serialNumber attribute, the MASA URL, and the identity that
            signed the IDevID certificate.
        </t>
        <t indent="0" pn="section-10.2-2">
            TLS 1.2 reveals the certificate identities to on-path observers,
            including the Join Proxy.
        </t>
        <t indent="0" pn="section-10.2-3">
            TLS 1.3 reveals the certificate identities only to the end
            parties, but as the connection is provisional; an on-path
            attacker (MITM) can see the certificates.  This includes not just
            malicious attackers but also registrars that are visible
            to the pledge but are not part of the intended domain.
        </t>
        <t indent="0" pn="section-10.2-4">
            The certificate of the registrar is rather arbitrary from the
            point of view of the BRSKI protocol. As no
            validations <xref target="RFC6125" format="default" sectionFormat="of" derivedContent="RFC6125"/> are expected to be done, the contents could be easily
            pseudonymized.  Any device that can see a Join Proxy would be
            able to connect to the registrar and learn the identity of the
            network in question.  Even if the contents of the certificate
            are pseudonymized, it would be possible to correlate different
            connections in different locations that belong to the same
            entity. This is unlikely to present a significant privacy concern
            to ANIMA ACP uses of BRSKI, but it may be a concern to other users
            of BRSKI.
        </t>
        <t indent="0" pn="section-10.2-5">
            The certificate of the pledge could be revealed by a malicious
            Join Proxy that performed a MITM attack on the provisional TLS
            connection.   Such an attacker would be able to reveal the
            identity of the pledge to third parties if it chose to do so.
        </t>
        <t indent="0" pn="section-10.2-6">
            Research into a mechanism to do multistep, multiparty authenticated
            key agreement, incorporating some kind of zero-knowledge proof,
            would be valuable.  Such a mechanism would ideally avoid
            disclosing identities until the pledge, registrar, and MASA agree to
            the transaction.  Such a mechanism would need to discover the
            location of the MASA without knowing the identity of the pledge
            or the identity of the MASA.  This part of the problem may be unsolvable.
        </t>
      </section>
      <section anchor="idevidprivacy" numbered="true" toc="include" removeInRFC="false" pn="section-10.3">
        <name slugifiedName="name-what-brski-masa-reveals-to-">What BRSKI-MASA Reveals to the Manufacturer</name>
        <t indent="0" pn="section-10.3-1">
            With consumer-oriented devices, the "call-home" mechanism in IoT
            devices raises significant privacy concerns.  See
            <xref target="livingwithIoT" format="default" sectionFormat="of" derivedContent="livingwithIoT"/> and <xref target="IoTstrangeThings" format="default" sectionFormat="of" derivedContent="IoTstrangeThings"/> for exemplars.  The ACP usage of BRSKI is not targeted at individual usage of
            IoT devices but rather at the enterprise and ISP creation of
            networks in a zero-touch fashion where the "call-home" represents
            a different class of privacy and life-cycle management concerns.
        </t>
        <t indent="0" pn="section-10.3-2">
            It needs to be reiterated that the BRSKI-MASA mechanism
            only occurs once during the commissioning of the device.  It is
            well defined, and although encrypted with TLS, it could in theory
            be made auditable as the contents are well defined.
            This connection does not occur when the device powers on or is
            restarted for normal routines.
            (It is conceivable, but remarkably unusual, that a device could
            be forced to go through a full factory reset during an exceptional firmware update
            situation, after which enrollment would have to be repeated, and a
            new connection would occur.)
        </t>
        <t indent="0" pn="section-10.3-3">
            The BRSKI call-home mechanism is mediated via the owner's
            registrar, and the information that is transmitted is directly
            auditable by the device owner. This is in stark contrast to
            many "call-home" protocols where the device autonomously calls
            home and uses an undocumented protocol.
        </t>
        <t indent="0" pn="section-10.3-4">
            While the contents of the signed part of the pledge voucher-request
            cannot be changed, they are not encrypted at the registrar.
            The ability to audit the messages by the owner of the network
            is a mechanism to defend against exfiltration of data by a nefarious
            pledge. Both are, to reiterate, encrypted by TLS while in transit.
        </t>
        <t indent="0" pn="section-10.3-5">
            The BRSKI-MASA exchange reveals the following information to the
            manufacturer:
        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-10.3-6">
          <li pn="section-10.3-6.1">
                the identity of the device being enrolled.  This is revealed
                by transmission of a signed voucher-request containing the
                serial-number.  The manufacturer can usually link the serial
                number to a device model.
              </li>
          <li pn="section-10.3-6.2">
                an identity of the domain owner in the form of the domain
                trust anchor.  However, this is not a global PKI-anchored
                name within the WebPKI, so this identity could be
                pseudonymous.  If there is sales channel integration, then
                the MASA will have authenticated the domain owner, via either
                a pinned certificate or perhaps another HTTP authentication
                method, as per <xref target="MASAauthenticationOfRegistrar" format="default" sectionFormat="of" derivedContent="Section 5.5.4"/>.
              </li>
          <li pn="section-10.3-6.3">
                the time the device is activated.
              </li>
          <li pn="section-10.3-6.4">
                the IP address of the domain owner's registrar.
                For ISPs and enterprises, the IP address provides very clear
                geolocation of the owner.  No amount of IP address privacy
                extensions <xref target="RFC8981" format="default" sectionFormat="of" derivedContent="RFC8981"/> can do anything about
                this, as a simple whois lookup likely identifies the ISP or
                enterprise from the upper bits anyway.  A passive attacker
                who observes the connection definitely may conclude that the
                given enterprise/ISP is a customer of the particular
                equipment vendor.  The precise model that is being enrolled
                will remain private.
              </li>
        </ul>
        <t indent="0" pn="section-10.3-7">
            Based upon the above information, the manufacturer is able to
            track a specific device from pseudonymous domain identity to the
            next pseudonymous domain identity.  If there is sales-channel
            integration, then the identities are not pseudonymous.
        </t>
        <t indent="0" pn="section-10.3-8">
            The manufacturer knows the IP address of the registrar, but it
            cannot see the IP address of the device itself.  The
            manufacturer cannot track the device to a detailed physical
            or network location, only to the location of the registrar.
            That is likely to be at the enterprise or ISP's headquarters.
        </t>
        <t indent="0" pn="section-10.3-9">
            The above situation is to be distinguished from a
            residential/individual person who registers a device from a
            manufacturer.  Individuals do not tend to have multiple offices,
            and their registrar is likely on the same network as the device.
            A manufacturer that sells switching/routing products to enterprises
            should hardly be surprised if additional purchases of
            switching/routing products are made.
            Deviations from a historical trend or
            an established baseline would, however, be notable.
        </t>
        <t indent="0" pn="section-10.3-10">
            The situation is not improved by the enterprise/ISP using
            anonymization services such as Tor <xref target="Dingledine" format="default" sectionFormat="of" derivedContent="Dingledine"/>, as a TLS 1.2 connection
            will reveal the ClientCertificate used, clearly identifying
            the enterprise/ISP involved.  TLS 1.3 is better in this regard,
            but an active attacker can still discover the parties involved by
            performing a MITM attack on the first attempt
            (breaking/killing it with a TCP reset (RST)), and then letting subsequent
            connection pass through.
        </t>
        <t indent="0" pn="section-10.3-11">
            A manufacturer could attempt to mix the BRSKI-MASA traffic in
            with general traffic on their site by hosting the MASA behind the
            same (set) of load balancers that the company's normal marketing
            site is hosted behind.  This makes a lot of sense from a straight
            capacity planning point of view as the same set of services
            (and the same set of Distributed Denial-of-Service mitigations)
            may be used.  Unfortunately, as the BRSKI-MASA connections
            include TLS ClientCertificate exchanges, this may easily be
            observed in TLS 1.2, and a traffic analysis may reveal it even in
            TLS 1.3.  This does not make such a plan irrelevant.  There may
            be other organizational reasons to keep the marketing site (which
            is often subject to frequent redesigns, outsourcing, etc.)
            separate from the MASA, which may need to operate reliably for
            decades.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-10.4">
        <name slugifiedName="name-manufacturers-and-used-or-s">Manufacturers and Used or Stolen Equipment</name>
        <t indent="0" pn="section-10.4-1">
            As explained above, the manufacturer receives information each
            time a device that is in factory-default mode does a
            zero-touch bootstrap and attempts to enroll into a domain
            owner's registrar.
        </t>
        <t indent="0" pn="section-10.4-2">
            The manufacturer is therefore in a position to decline to
            issue a voucher if it detects that the new owner is not the
            same as the previous owner.
        </t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-10.4-3">
          <li pn="section-10.4-3.1" derivedCounter="1.">
                This can be seen as a feature if the equipment is believed to
                have been stolen.  If the legitimate owner notifies the
                manufacturer of the theft, then when the new owner brings the
                device up, if they use the zero-touch mechanism, the new
                (illegitimate) owner reveals their location and identity.
              </li>
          <li pn="section-10.4-3.2" derivedCounter="2.">
                In the case of used equipment, the initial owner could inform
                the manufacturer of the sale, or the manufacturer may just
                permit resales unless told otherwise.  In which case, the
                transfer of ownership simply occurs.
              </li>
          <li pn="section-10.4-3.3" derivedCounter="3.">
                A manufacturer could, however, decide not to issue a new
                voucher in response to a transfer of ownership.
                This is essentially the same as the stolen case, with the
                manufacturer having decided that the sale was not legitimate.
              </li>
          <li pn="section-10.4-3.4" derivedCounter="4.">
                There is a fourth case, if the manufacturer is providing
                protection against stolen devices.  The manufacturer then
                has a responsibility to protect the legitimate owner against
                fraudulent claims that the equipment was stolen.
                In the absence of such manufacturer protection,
                such a claim would cause the manufacturer to refuse
                to issue a new voucher. Should the device go through
                a deep factory reset (for instance, replacement of a damaged
                main board component), the device would not bootstrap.
              </li>
          <li pn="section-10.4-3.5" derivedCounter="5.">
                Finally, there is a fifth case: the manufacturer has decided to
                end-of-line the device, or the owner has not paid a yearly
                support amount, and the manufacturer refuses to issue new
                vouchers at that point.  This last case is not new to the
                industry: many license systems are already deployed that have
                a significantly worse effect.
              </li>
        </ol>
        <t indent="0" pn="section-10.4-4">
            This section has outlined five situations in which a manufacturer
            could use the voucher system to enforce what are clearly
            license terms.
            A manufacturer that attempted to
            enforce license terms via vouchers would find it rather
            ineffective as the terms would only be enforced when the device
            is enrolled, and this is not (to repeat) a daily or even monthly
            occurrence.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-10.5">
        <name slugifiedName="name-manufacturers-and-grey-mark">Manufacturers and Grey Market Equipment</name>
        <t indent="0" pn="section-10.5-1">
            Manufacturers of devices often sell different products into
            different regional markets.  Which product is available in which
            market can be driven by price differentials, support issues (some
            markets may require manuals and tech support to be done in the
            local language), and government export regulation (such as whether
            strong crypto is permitted to be exported or permitted to be
            used in a particular market).  When a domain owner obtains a
            device from a different market (they can be new) and transfers it
            to a different location, this is called a Grey Market.
        </t>
        <t indent="0" pn="section-10.5-2">
            A manufacturer could decide not to issue a voucher to an
            enterprise/ISP based upon their location.  There are a number of
            ways that this could be determined: from the geolocation of the
            registrar, from sales channel knowledge about the customer, and
            from what products are available or unavailable in that market.  If the device
            has a GPS, the coordinates of the device could even be placed into
            an extension of the voucher.
        </t>
        <t indent="0" pn="section-10.5-3">
            The above actions are not illegal, and not new.  Many
            manufacturers have shipped crypto-weak (exportable) versions of
            firmware as the default on equipment for decades.  The first task
            of an enterprise/ISP has always been to login to a manufacturer
            system, show one's "entitlement" (country information, proof that
            support payments have been made), and receive either a new
            updated firmware or a license key that will activate the correct
            firmware.
        </t>
        <t indent="0" pn="section-10.5-4">
            BRSKI permits the above process to be automated (in an autonomic
            fashion) and therefore perhaps encourages this kind of
            differentiation by reducing the cost of doing it.
        </t>
        <t indent="0" pn="section-10.5-5">
            An issue that manufacturers will need to deal with in the above
            automated process is when a device is shipped to one country
            with one set of rules (or laws or entitlements), but the domain
            registry is in another one.  Which rules apply is something
            that will have to be worked out: the manufacturer could
            believe they are dealing with Grey Market equipment when they
            are simply dealing with a global enterprise.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-10.6">
        <name slugifiedName="name-some-mitigations-for-meddli">Some Mitigations for Meddling by Manufacturers</name>
        <t indent="0" pn="section-10.6-1">
            The most obvious mitigation is not to buy the product.
            Pick manufacturers that are up front about their policies and who do
            not change them gratuitously.
        </t>
        <t indent="0" pn="section-10.6-2">
            <xref target="masasecurityreduction_newanchor" format="default" sectionFormat="of" derivedContent="Section 7.4.3"/>
            describes some ways in which a manufacturer could provide a
            mechanism to manage the trust
            anchors and built-in certificates (IDevID) as an extension.
            There are a variety of mechanisms, and some may take a substantial
            amount of work to get exactly correct.  These mechanisms do
            not change the flow of the protocol described here but rather
            allow the starting trust assumptions to be changed.
            This is an area for
            future standardization work.
        </t>
        <t indent="0" pn="section-10.6-3">
            Replacement of the voucher validation anchors (usually pointing
            to the original manufacturer's MASA) with those of the new
            owner permits the new owner to issue vouchers to subsequent
            owners. This would be done by having the selling (old) owner
            run a MASA.
        </t>
        <t indent="0" pn="section-10.6-4">
            The BRSKI protocol depends upon a trust anchor
            and an identity on the device.  Management of these
            entities facilitates a few new operational modes without
            making any changes to the BRSKI protocol.  Those modes include:
            offline modes where the domain owner operates an internal
            MASA for all devices, resell modes where the first domain owner
            becomes the MASA for the next (resold-to) domain owner,
            and services where an aggregator acquires a large variety
            of devices and then acts as a pseudonymized MASA for a variety
            of devices from a variety of manufacturers.
        </t>
        <t indent="0" pn="section-10.6-5">
            Although replacement of the IDevID is not required for all
            modes described above, a manufacturer could support such a
            thing.   Some may wish to consider replacement of the IDevID
            as an indication that the device's warranty is terminated.
            For others, the privacy requirements of some deployments might
            consider this a standard operating practice.
        </t>
        <t indent="0" pn="section-10.6-6">
            As discussed at the end of <xref target="MASAauditlog" format="default" sectionFormat="of" derivedContent="Section 5.8.1"/>,
            new work could be done to use a
            distributed consensus technology for the audit-log.
            This would permit the audit-log to continue to be useful,
            even when there is a chain of MASA due to changes of ownership.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-10.7">
        <name slugifiedName="name-death-of-a-manufacturer">Death of a Manufacturer</name>
        <t indent="0" pn="section-10.7-1">
            A common concern has been that a manufacturer could go out of
            business, leaving owners of devices unable to get new vouchers
            for existing products.  Said products might have been previously
            deployed but need to be reinitialized, used, or  kept in a warehouse as
            long-term spares.
        </t>
        <t indent="0" pn="section-10.7-2">
            The MASA was named the Manufacturer *Authorized* Signing
            Authority to emphasize that it need not be the manufacturer
            itself that performs this.  It is anticipated that
            specialist service providers will come to exist that deal with the creation
            of vouchers in much the same way that many companies have
            outsourced email, advertising, and janitorial services.
        </t>
        <t indent="0" pn="section-10.7-3">
            Further, it is expected that as part of any service agreement,
            the manufacturer would arrange to escrow appropriate private
            keys such that a MASA service could be provided by a third
            party.  This has routinely been done for source code for decades.
        </t>
      </section>
    </section>
    <section anchor="securityconsiderations" numbered="true" toc="include" removeInRFC="false" pn="section-11">
      <name slugifiedName="name-security-considerations">Security Considerations</name>
      <t indent="0" pn="section-11-1">
        This document details a protocol for bootstrapping that balances
        operational concerns against security concerns. As detailed in the introduction,
        and touched on again in <xref target="reducedsecuritymodes" format="default" sectionFormat="of" derivedContent="Section 7"/>,
        the protocol allows for reduced security modes.
        These attempt to deliver additional
        control to the local administrator and owner in cases where
        less security provides operational benefits. This
        section goes into more detail about a variety of specific
        considerations.
      </t>
      <t indent="0" pn="section-11-2">
        To facilitate logging and administrative oversight, in addition
        to triggering registrar verification of MASA logs, the pledge reports
      on the voucher parsing status to the registrar. In the case of a
      failure, this information is informative to a potentially malicious
      registrar. This is mandated anyway because of the operational
      benefits of an informed administrator in cases where the failure is
      indicative of a problem. The registrar is <bcp14>RECOMMENDED</bcp14> to verify MASA logs
      if voucher status telemetry is not received.</t>
      <t indent="0" pn="section-11-3">To facilitate truly limited clients, EST
      requires that the client <bcp14>MUST</bcp14> support a client authentication model (see <xref target="RFC7030" sectionFormat="comma" section="3.3.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc7030#section-3.3.2" derivedContent="RFC7030"/>);
      <xref target="reducedsecuritymodes" format="default" sectionFormat="of" derivedContent="Section 7"/> updates these requirements by stating that the registrar <bcp14>MAY</bcp14> choose to accept devices
      that fail cryptographic authentication. This reflects
      current (poor) practices in shipping devices without a cryptographic
      identity that are <bcp14>NOT RECOMMENDED</bcp14>.</t>
      <t indent="0" pn="section-11-4">During the provisional period of the connection, the pledge <bcp14>MUST</bcp14> treat all HTTP header and
        content data as untrusted data. HTTP libraries are
        regularly exposed to non-secured HTTP traffic: mature libraries
        should not have any problems.
      </t>
      <t indent="0" pn="section-11-5">Pledges might chose to engage in protocol operations with
      multiple discovered registrars in parallel. As noted above, they
      will only do so with distinct nonce values, but the end result
      could be multiple vouchers issued from the MASA if all registrars
      attempt to claim the device. This is not a failure, and the pledge
      chooses whichever voucher to accept based on internal logic. The
      registrars verifying log information will see multiple entries
      and take this into account for their analytic purposes.</t>
      <section anchor="dosmasa" numbered="true" toc="include" removeInRFC="false" pn="section-11.1">
        <name slugifiedName="name-denial-of-service-dos-again">Denial of Service (DoS) against MASA</name>
        <t indent="0" pn="section-11.1-1">There are use cases where the MASA could be unavailable or
        uncooperative to the registrar. They include active DoS attacks, planned and unplanned
        network partitions, changes to MASA policy, or other instances where
        MASA policy rejects a claim. These introduce an operational risk to the
        registrar owner in that MASA behavior might limit the ability to
        bootstrap a pledge device. For example, this might be an issue during
        disaster recovery. This risk can be mitigated by registrars that
        request and maintain long-term copies of "nonceless" vouchers. In
        that way, they are guaranteed to be able to bootstrap their devices.</t>
        <t indent="0" pn="section-11.1-2">The issuance of nonceless vouchers themselves creates a security
        concern. If the registrar of a previous domain can intercept protocol
        communications, then it can use a previously issued nonceless voucher to
        establish management control of a pledge device even after having sold
        it. This risk is mitigated by recording the issuance of such vouchers
        in the MASA audit-log that is verified by the subsequent registrar
        and by pledges only bootstrapping when in a factory default state. This
        reflects a balance between enabling MASA independence during
        future bootstrapping and the security of bootstrapping itself.
        Registrar control over requesting and auditing nonceless vouchers
        allows device owners to choose an appropriate balance.</t>
        <t indent="0" pn="section-11.1-3">The MASA is exposed to DoS attacks wherein attackers claim
        an unbounded number of devices. Ensuring a registrar is
        representative of a valid manufacturer customer, even without validating
        ownership of specific pledge devices, helps to mitigate this. Pledge
        signatures on the pledge voucher-request, as forwarded by the
        registrar in the prior-signed-voucher-request field of the registrar voucher-request, significantly
        reduce this risk by ensuring the MASA can confirm proximity
        between the pledge and the registrar making the request. Supply-chain
        integration ("know your customer") is an additional
        step that MASA providers and device vendors can explore.</t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-11.2">
        <name slugifiedName="name-domainid-must-be-resistant-">DomainID Must Be Resistant to Second-Preimage Attacks</name>
        <t indent="0" pn="section-11.2-1">
          The domainID is used as the reference in the audit-log to the
          domain.  The domainID is expected to be calculated by a hash that
          is resistant to a second-preimage attack.
          Such an attack would allow a second registrar to create audit-log
          entries that are fake.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-11.3">
        <name slugifiedName="name-availability-of-good-random">Availability of Good Random Numbers</name>
        <t indent="0" pn="section-11.3-1">
          The nonce used by the pledge in the voucher-request <bcp14>SHOULD</bcp14> be
          generated by a Strong Cryptographic Sequence (<xref target="RFC4086" sectionFormat="comma" section="6.2" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4086#section-6.2" derivedContent="RFC4086"/>).  TLS has a similar requirement.
        </t>
        <t indent="0" pn="section-11.3-2">
          In particular, implementations should pay attention to the advance
          in  <xref target="RFC4086" format="default" sectionFormat="of" derivedContent="RFC4086"/>; see Sections <xref target="RFC4086" sectionFormat="bare" section="3" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4086#section-3" derivedContent="RFC4086"/> and, in particular,
 <xref target="RFC4086" sectionFormat="bare" section="3.4" format="default" derivedLink="https://rfc-editor.org/rfc/rfc4086#section-3.4" derivedContent="RFC4086"/>.
          The random seed used by a device at boot <bcp14>MUST</bcp14> be
          unique across all devices and all bootstraps.  Resetting a device to
          factory default state does not obviate this requirement.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-11.4">
        <name slugifiedName="name-freshness-in-voucher-reques">Freshness in Voucher-Requests</name>
        <t indent="0" pn="section-11.4-1">
          A concern has been raised that the pledge voucher-request should contain some content (a nonce) provided by the registrar and/or MASA
          in order for those actors to verify that the pledge voucher-request is fresh.
        </t>
        <t indent="0" pn="section-11.4-2">
          There are a number of operational problems with getting a nonce
          from the MASA to the pledge. It is somewhat easier to collect a
          random value from the registrar, but as the registrar is not yet
          vouched for, such a registrar nonce has little value.
          There are privacy and logistical challenges to addressing these
          operational issues, so if
          such a thing were to be considered, it would have to provide some
          clear value.  This section examines the impacts of not having a
          fresh pledge voucher-request.
        </t>
        <t indent="0" pn="section-11.4-3">
          Because the registrar authenticates the pledge, a full MITM
          attack is not possible, despite the provisional TLS authentication
          by the pledge (see <xref target="ProtocolDetails" format="default" sectionFormat="of" derivedContent="Section 5"/>.)
          Instead, we examine the case of a fake registrar (Rm)
          that communicates with the pledge in parallel or in close-time proximity
          with the intended registrar. (This scenario is intentionally supported as
          described in <xref target="discovery" format="default" sectionFormat="of" derivedContent="Section 4.1"/>.)
        </t>
        <t indent="0" pn="section-11.4-4">
          The fake registrar (Rm) can obtain a voucher signed by the MASA
          either directly or through arbitrary intermediaries.
          Assuming that the MASA accepts the registrar voucher-request (because
          either the Rm is collaborating with a legitimate registrar according to supply-chain
          information or the MASA is in audit-log only mode), then
          a voucher linking the pledge to the registrar Rm is issued.
        </t>
        <t indent="0" pn="section-11.4-5">
          Such a voucher, when passed back to the pledge, would link the
          pledge to registrar Rm and permit the pledge to
          end the provisional state. It now trusts the Rm and, if it has any
          security vulnerabilities leverageable by an Rm with full
          administrative control, can be assumed to be a
          threat against the intended registrar.
        </t>
        <t indent="0" pn="section-11.4-6">
          This flow is mitigated by the intended registrar verifying the audit-logs
          available from the MASA as described in
          <xref target="authzLogRequest" format="default" sectionFormat="of" derivedContent="Section 5.8"/>. The Rm might chose to collect
          a voucher-request but wait until after the intended registrar completes the authorization process before submitting it. This pledge voucher-request would be "stale" in that it has a nonce that no longer matches the internal state of the pledge. In order to successfully use any resulting voucher, the Rm would need to remove the stale nonce or anticipate the pledge's future nonce state. Reducing the possibility of this is why the pledge is mandated to generate a strong random or pseudo-random number nonce.</t>
        <t indent="0" pn="section-11.4-7">
          Additionally, in order to successfully use the resulting voucher, the Rm
          would have to attack the pledge and return it to a bootstrapping-enabled
          state. This would require wiping the pledge of current
          configuration and triggering a rebootstrapping of the pledge.
          This is no more likely than simply taking control of the pledge
          directly, but if this is a consideration, it is
          <bcp14>RECOMMENDED</bcp14> that the target network take the following steps:
        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-11.4-8">
          <li pn="section-11.4-8.1">Ongoing network monitoring for unexpected bootstrapping attempts by pledges.</li>
          <li pn="section-11.4-8.2">Retrieval and examination of MASA log information upon the occurrence
              of any such unexpected events. The Rm will be listed in the logs along with nonce information for analysis.</li>
        </ul>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-11.5">
        <name slugifiedName="name-trusting-manufacturers">Trusting Manufacturers</name>
        <t indent="0" pn="section-11.5-1">
          The BRSKI extensions to EST permit a new pledge to be completely
          configured with domain-specific trust anchors.  The link from
          built-in manufacturer-provided trust anchors to domain-specific
          trust anchors is mediated by the signed voucher artifact.
        </t>
        <t indent="0" pn="section-11.5-2">
          If the manufacturer's IDevID signing key is not properly validated,
          then there is a risk that the network will accept a pledge that
          should not be a member of the network.  As the address of the
          manufacturer's MASA is provided in the IDevID using the extension
          from <xref target="IDevIDextension" format="default" sectionFormat="of" derivedContent="Section 2.3"/>, the malicious pledge will have no problem
          collaborating with its MASA to produce a completely valid voucher.
        </t>
        <t indent="0" pn="section-11.5-3">
          BRSKI does not, however, fundamentally change the trust model from
          domain owner to manufacturer.  Assuming that the pledge used
          its IDevID with EST <xref target="RFC7030" format="default" sectionFormat="of" derivedContent="RFC7030"/> and BRSKI, the domain
(registrar) still needs to trust the manufacturer.
        </t>
        <t indent="0" pn="section-11.5-4">
          Establishing this trust between domain and manufacturer is outside
          the scope of BRSKI.  There are a number of mechanisms that can be
          adopted including:
        </t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-11.5-5">
          <li pn="section-11.5-5.1">
              Manually configuring each manufacturer's trust anchor.
            </li>
          <li pn="section-11.5-5.2">
              A TOFU mechanism. A human would be queried upon
              seeing a manufacturer's trust anchor for the first time, and
              then the trust anchor would be installed to the trusted store.
              There are risks with this; even if the key to name mapping is validated
              using something like the WebPKI, there remains the possibility
              that the name is a look alike: e.g., dem0.example. vs.
              demO.example.
            </li>
          <li pn="section-11.5-5.3">
              scanning the trust anchor from a QR code that came with the
              packaging (this is really a manual TOFU mechanism).
            </li>
          <li pn="section-11.5-5.4">
              some sales integration processing where trust anchors are provided
              as part of the sales process, probably included in a digital
              packing "slip", or a sales invoice.
            </li>
          <li pn="section-11.5-5.5">
              consortium membership, where all manufacturers of a particular
              device category (e.g, a light bulb or a cable modem) are
              signed by a CA specifically for this.
              This is done by CableLabs today.

	      It is used for authentication
              and authorization as part of <xref target="docsisroot" format="default" sectionFormat="of" derivedContent="docsisroot"/> and <xref target="TR069" format="default" sectionFormat="of" derivedContent="TR069"/>.
            </li>
        </ul>
        <t indent="0" pn="section-11.5-6">
          The existing WebPKI provides a reasonable anchor between manufacturer
          name and public key. It authenticates the key.  It does not provide a
          reasonable authorization for the manufacturer, so it is not directly
          usable on its own.
        </t>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-11.6">
        <name slugifiedName="name-manufacturer-maintenance-of">Manufacturer Maintenance of Trust Anchors</name>
        <t indent="0" pn="section-11.6-1">
          BRSKI depends upon the manufacturer building in trust anchors
          to the pledge device.  The voucher artifact that is signed by the
          MASA will be validated by the pledge using that anchor.  This
          implies that the manufacturer needs to maintain access to a signing
          key that the pledge can validate.
        </t>
        <t indent="0" pn="section-11.6-2">
          The manufacturer will need to
          maintain the ability to make signatures that can be validated for
          the lifetime that the device could be onboarded. Whether
          this onboarding lifetime is less than the device lifetime depends
          upon how the device is used.  An inventory of devices kept in a
          warehouse as spares might not be onboarded for many decades.
        </t>
        <t indent="0" pn="section-11.6-3">
          There are good cryptographic hygiene reasons why a manufacturer
          would not want to maintain access to a private key for many
          decades.  A manufacturer in that situation can leverage a long-term
          CA anchor, built-in to the pledge, and then
          a certificate chain may be incorporated using the normal CMS
          certificate set.  This may increase the size of the voucher
          artifacts, but that is not a significant issue in non-constrained
          environments.
        </t>
        <t indent="0" pn="section-11.6-4">
          There are a few other operational variations that manufacturers
          could consider. For instance, there is no reason that every device
          need have the same
          set of trust anchors preinstalled.  Devices built in different
          factories, or on different days, or in any other consideration, could
          have different trust anchors built in, and the record of which
          batch the device is in would be recorded in the asset database.
          The manufacturer would then know which anchor to sign an artifact
          against.
        </t>
        <t indent="0" pn="section-11.6-5">
          Aside from the concern about long-term access to private keys, a
          major limiting factor for the shelf life of many devices will be
          the age of the cryptographic algorithms included.  A device
          produced in 2019 will have hardware and software capable of
          validating algorithms common in 2019 and will have no defense
          against attacks (both quantum and von Neumann brute-force attacks)
          that have not yet been invented.  This concern is orthogonal to
          the concern about access to private keys, but this concern likely
          dominates and limits the life span of a device in a warehouse.
          If any update to the firmware to support new cryptographic mechanisms
          were possible (while the device was in a warehouse), updates to
          trust anchors would also be done at the same time.
        </t>
        <t indent="0" pn="section-11.6-6">
          The set of standard operating procedures for maintaining
          high-value private keys is well documented. For instance,
          the WebPKI provides a number of options for audits in
          <xref target="cabforumaudit" format="default" sectionFormat="of" derivedContent="cabforumaudit"/>, and the DNSSEC root operations are well
          documented in <xref target="dnssecroot" format="default" sectionFormat="of" derivedContent="dnssecroot"/>.
        </t>
        <t indent="0" pn="section-11.6-7">
          It is not clear if manufacturers will take this level of
          precaution, or how strong the economic incentives are to maintain
          an appropriate level of security.
        </t>
        <t indent="0" pn="section-11.6-8">
          The next section examines the risk due to a compromised
          manufacturer IDevID signing key. This is followed by examination of
          the risk due to a compromised MASA key. The third section
          below examines the situation where a MASA web server itself
          is under attacker control, but the MASA signing key itself
          is safe in a not-directly connected hardware module.
        </t>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-11.6.1">
          <name slugifiedName="name-compromise-of-manufacturer-">Compromise of Manufacturer IDevID Signing Keys</name>
          <t indent="0" pn="section-11.6.1-1">
            An attacker that has access to the key that the manufacturer uses
            to sign IDevID certificates can create counterfeit devices.
            Such devices can claim to be from a particular manufacturer
            but can be entirely different devices: Trojan horses in effect.
          </t>
          <t indent="0" pn="section-11.6.1-2">
            As the attacker controls the MASA URL in the certificate,
            the registrar can be convinced to talk to the attacker's MASA.
            The registrar does not need to be in any kind of promiscuous mode
            to be vulnerable.
          </t>
          <t indent="0" pn="section-11.6.1-3">
            In addition to creating fake devices, the attacker may also
            be able to issue revocations for existing certificates if the
            IDevID certificate process relies upon CRL lists that are
            distributed.
          </t>
          <t indent="0" pn="section-11.6.1-4">
            There does not otherwise seem to be any risk from this compromise
            to devices that are already deployed or that are sitting
            locally in boxes waiting for deployment (local spares).
            The issue is that operators will be unable to trust devices
            that have been in an uncontrolled warehouse as they do not know
            if those are real devices.
          </t>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-11.6.2">
          <name slugifiedName="name-compromise-of-masa-signing-">Compromise of MASA Signing Keys</name>
          <t indent="0" pn="section-11.6.2-1">
            There are two periods of time in which to consider: when the MASA
            key has fallen into the hands of an attacker and after the MASA
            recognizes that the key has been compromised.
          </t>
          <section numbered="true" toc="exclude" removeInRFC="false" pn="section-11.6.2.1">
            <name slugifiedName="name-attacker-opportunities-with">Attacker Opportunities with a Compromised MASA Key</name>
            <t indent="0" pn="section-11.6.2.1-1">
              An attacker that has access to the MASA signing key could create
              vouchers.  These vouchers could be for existing deployed
              devices or for devices that are still in a warehouse.
              In order to exploit these vouchers, two things need to occur:
              the device has to go through a factory default boot cycle, and the
              registrar has to be convinced to contact the attacker's MASA.
            </t>
            <t indent="0" pn="section-11.6.2.1-2">
              If the attacker controls a registrar that is visible to the
              device, then there is no difficulty in delivery of the false
              voucher.  A possible practical example of an attack like this
              would be in a data center, at an ISP peering point (whether a
              public IX or a private peering point).  In such a situation,
              there are already cables attached to the equipment that lead
              to other devices (the peers at the IX), and through those
              links, the false voucher could be delivered.  The difficult
              part would be to put the device through a factory reset.
              This might be accomplished through social engineering of data
              center staff.  Most locked cages have ventilation holes, and
              possibly a long "paperclip" could reach through to depress a
              factory reset button.  Once such a piece of ISP equipment has
              been compromised, it could be used to compromise equipment that
              it was connected to (through long haul links even), assuming that
              those pieces of equipment could also be forced through a
              factory reset.
            </t>
            <t indent="0" pn="section-11.6.2.1-3">
              The above scenario seems rather unlikely as it requires some
              element of physical access; but if there was a remote exploit
              that did not cause a direct breach, but rather a fault that
              resulted in a factory reset, this could provide a reasonable
              path.
            </t>
            <t indent="0" pn="section-11.6.2.1-4">
              The above deals with ANI uses of BRSKI.  For cases where IEEE 802.11
              or 802.15.4 is involved, the need to connect directly to the
              device is eliminated, but the need to do a factory reset is
              not.  Physical possession of the device is not required as
              above, provided that there is some way to force a factory
              reset.  With some consumer devices that have low overall
              implementation quality, end users might be familiar with the
              need to reset the device regularly.
            </t>
            <t indent="0" pn="section-11.6.2.1-5">
              The authors are unable to come up with an attack scenario where
              a compromised voucher signature enables an attacker to
              introduce a compromised pledge into an existing operator's
              network.  This is the case because the operator controls the
              communication between registrar and MASA, and there is no
              opportunity to introduce the fake voucher through that conduit.
            </t>
          </section>
          <section numbered="true" toc="exclude" removeInRFC="false" pn="section-11.6.2.2">
            <name slugifiedName="name-risks-after-key-compromise-">Risks after Key Compromise is Known</name>
            <t indent="0" pn="section-11.6.2.2-1">
              Once the operator of the MASA realizes that the voucher signing
              key has been compromised, it has to do a few things.
            </t>
            <t indent="0" pn="section-11.6.2.2-2">
              First, it <bcp14>MUST</bcp14> issue a firmware update to all devices that
              had that key as a trust anchor, such that they will no longer
              trust vouchers from that key.  This will affect devices in the
              field that are operating, but those devices, being in
              operation, are not performing onboarding operations, so this
              is not a critical patch.
            </t>
            <t indent="0" pn="section-11.6.2.2-3">
              Devices in boxes (in warehouses) are vulnerable and remain
              vulnerable until patched.   An operator would be prudent to
              unbox the devices, onboard them in a safe environment, and
              then perform firmware updates.  This does not have to be
              done by the end-operator; it could be done by a distributor
              that stores the spares.  A recommended practice for high-value
              devices (which typically have a &lt;4hr service window) may be to
              validate the device operation on a regular basis anyway.
            </t>
            <t indent="0" pn="section-11.6.2.2-4">
              If the onboarding process includes attestations about firmware
              versions, then through that process, the operator would be
              advised to upgrade the firmware before going into production.
              Unfortunately, this does not help against situations where the
              attacker operates their own registrar (as listed above).
            </t>
            <t indent="0" pn="section-11.6.2.2-5">
              The need for short-lived vouchers is explained in <xref target="RFC8366" sectionFormat="comma" section="6.1" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8366#section-6.1" derivedContent="RFC8366"/>.  The nonce guarantees freshness,
              and the short-lived nature of the voucher means that the window
              to deliver a fake voucher is very short.  A nonceless,
              long-lived voucher would be the only option for the attacker,
              and devices in the warehouse would be vulnerable to such a
              thing.
            </t>
            <t indent="0" pn="section-11.6.2.2-6">
              A key operational recommendation is for manufacturers to sign
              nonceless, long-lived vouchers with a different key than what is used to
              sign short-lived vouchers. That key needs significantly better
              protection.  If both keys come from a common trust-anchor
              (the manufacturer's CA), then a compromise of the
              manufacturer's CA would compromise both keys.  Such a
              compromise of the manufacturer's CA likely compromises
              all keys outlined in this section.
            </t>
          </section>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-11.6.3">
          <name slugifiedName="name-compromise-of-masa-web-serv">Compromise of MASA Web Service</name>
          <t indent="0" pn="section-11.6.3-1">
            An attacker that takes over the MASA web service can inflict a number of
            attacks.  The most obvious one is simply to take the database
            listing of customers and devices and sell the data to other
            attackers who will now know where to find potentially vulnerable
            devices.
          </t>
          <t indent="0" pn="section-11.6.3-2">
            The second most obvious thing that the attacker can do is to
            kill the service, or make it operate unreliably, making
            customers frustrated.  This could have a serious effect on
            the ability to deploy new services by customers and would be a
            significant issue during disaster recovery.
          </t>
          <t indent="0" pn="section-11.6.3-3">
            While the compromise of the MASA web service may lead to the
            compromise of the MASA voucher signing key, if the signing occurs
            offboard (such as in a hardware signing module (HSM)), then the
            key may well be safe, but control over it resides with the attacker.
          </t>
          <t indent="0" pn="section-11.6.3-4">
            Such an attacker can issue vouchers for any device presently in
            service.
	    Said device still needs to be convinced to go through a
            factory reset process before an attack.
          </t>
          <t indent="0" pn="section-11.6.3-5">
            If the attacker has access to a key that is trusted for
            long-lived nonceless vouchers, then they could issue vouchers for
            devices that are not yet in service.  This attack may be very
            hard to verify as it would involve doing firmware updates
            on every device in warehouses (a potentially ruinously expensive
            process); a manufacturer might be reluctant to admit this
            possibility.
          </t>
        </section>
      </section>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-11.7">
        <name slugifiedName="name-yang-module-security-consid">YANG Module Security Considerations</name>
        <t indent="0" pn="section-11.7-1">
          As described in Section <xref target="RFC8366" section="7.4" sectionFormat="bare" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8366#section-7.4" derivedContent="RFC8366"/> (Security Considerations) of <xref target="RFC8366" format="default" sectionFormat="of" derivedContent="RFC8366"/>, the YANG module specified
          in this document defines the schema for data that is subsequently
          encapsulated by a CMS signed-data content type, as described in
          <xref target="RFC5652" sectionFormat="of" section="5" format="default" derivedLink="https://rfc-editor.org/rfc/rfc5652#section-5" derivedContent="RFC5652"/>.
          As such, all of the YANG-modeled data is protected from modification.
        </t>
        <t indent="0" pn="section-11.7-2">
           The use of YANG to define data structures, via the "yang-data"
           statement, is relatively new and distinct from the traditional use
           of YANG to define an API accessed by network management protocols
           such as NETCONF <xref target="RFC6241" format="default" sectionFormat="of" derivedContent="RFC6241"/> and RESTCONF <xref target="RFC8040" format="default" sectionFormat="of" derivedContent="RFC8040"/>. For this
           reason, these guidelines do not follow the template described by
           <xref target="RFC8407" sectionFormat="of" section="3.7" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8407#section-3.7" derivedContent="RFC8407"/>.
        </t>
      </section>
    </section>
  </middle>
  <back>
    <displayreference target="I-D.ietf-ace-coap-est" to="ACE-COAP-EST"/>
    <displayreference target="I-D.richardson-anima-state-for-joinrouter" to="ANIMA-STATE"/>
    <displayreference target="I-D.ietf-anima-constrained-voucher" to="ANIMA-CONSTRAINED-VOUCHER"/>
    <displayreference target="I-D.ietf-netconf-keystore" to="YANG-KEYSTORE"/>
    <references pn="section-12">
      <name slugifiedName="name-references">References</name>
      <references pn="section-12.1">
        <name slugifiedName="name-normative-references">Normative References</name>
        <reference anchor="IDevID" target="https://1.ieee802.org/security/802-1ar" quoteTitle="true" derivedAnchor="IDevID">
          <front>
            <title>IEEE Standard for Local and metropolitan area networks - Secure Device Identity</title>
            <author>
              <organization showOnFrontPage="true">IEEE</organization>
            </author>
          </front>
          <refcontent>IEEE 802.1AR</refcontent>
        </reference>
        <reference anchor="ITU.X690" target="https://www.itu.int/rec/T-REC-X.690" quoteTitle="true" derivedAnchor="ITU.X690">
          <front>
            <title>Information Technology - ASN.1 encoding rules: Specification of Basic Encoding Rules (BER), Canonical Encoding Rules (CER) and Distinguished Encoding Rules (DER)</title>
            <author>
              <organization showOnFrontPage="true">ITU-T</organization>
            </author>
            <date month="August" year="2015"/>
          </front>
          <refcontent>ITU-T Recommendation X.690</refcontent>
          <refcontent>ISO/IEC 8825-1:2015</refcontent>
        </reference>
        <reference anchor="REST" target="http://www.ics.uci.edu/~fielding/pubs/dissertation/fielding_dissertation.pdf" quoteTitle="true" derivedAnchor="REST">
          <front>
            <title>Architectural Styles and the Design of Network-based Software Architectures</title>
            <author initials="R.F." surname="Fielding" fullname="Roy Fielding">
              <organization showOnFrontPage="true">University of California, Irvine</organization>
            </author>
            <date year="2000"/>
          </front>
        </reference>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" quoteTitle="true" derivedAnchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author initials="S." surname="Bradner" fullname="S. Bradner">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="1997" month="March"/>
            <abstract>
              <t indent="0">In many standards track documents several words are used to signify the requirements in the specification.  These words are often capitalized. This document defines these words as they should be interpreted in IETF documents.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC3339" target="https://www.rfc-editor.org/info/rfc3339" quoteTitle="true" derivedAnchor="RFC3339">
          <front>
            <title>Date and Time on the Internet: Timestamps</title>
            <author initials="G." surname="Klyne" fullname="G. Klyne">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="C." surname="Newman" fullname="C. Newman">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2002" month="July"/>
            <abstract>
              <t indent="0">This document defines a date and time format for use in Internet protocols that is a profile of the ISO 8601 standard for representation of dates and times using the Gregorian calendar.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3339"/>
          <seriesInfo name="DOI" value="10.17487/RFC3339"/>
        </reference>
        <reference anchor="RFC3688" target="https://www.rfc-editor.org/info/rfc3688" quoteTitle="true" derivedAnchor="RFC3688">
          <front>
            <title>The IETF XML Registry</title>
            <author initials="M." surname="Mealling" fullname="M. Mealling">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2004" month="January"/>
            <abstract>
              <t indent="0">This document describes an IANA maintained registry for IETF standards which use Extensible Markup Language (XML) related items such as Namespaces, Document Type Declarations (DTDs), Schemas, and Resource Description Framework (RDF) Schemas.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="81"/>
          <seriesInfo name="RFC" value="3688"/>
          <seriesInfo name="DOI" value="10.17487/RFC3688"/>
        </reference>
        <reference anchor="RFC3748" target="https://www.rfc-editor.org/info/rfc3748" quoteTitle="true" derivedAnchor="RFC3748">
          <front>
            <title>Extensible Authentication Protocol (EAP)</title>
            <author initials="B." surname="Aboba" fullname="B. Aboba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="L." surname="Blunk" fullname="L. Blunk">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Vollbrecht" fullname="J. Vollbrecht">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Carlson" fullname="J. Carlson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="H." surname="Levkowetz" fullname="H. Levkowetz" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2004" month="June"/>
            <abstract>
              <t indent="0">This document defines the Extensible Authentication Protocol (EAP), an authentication framework which supports multiple authentication methods.  EAP typically runs directly over data link layers such as Point-to-Point Protocol (PPP) or IEEE 802, without requiring IP.  EAP provides its own support for duplicate elimination and retransmission, but is reliant on lower layer ordering guarantees.  Fragmentation is not supported within EAP itself; however, individual EAP methods may support this.  This document obsoletes RFC 2284.  A summary of the changes between this document and RFC 2284 is available in Appendix A.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3748"/>
          <seriesInfo name="DOI" value="10.17487/RFC3748"/>
        </reference>
        <reference anchor="RFC3927" target="https://www.rfc-editor.org/info/rfc3927" quoteTitle="true" derivedAnchor="RFC3927">
          <front>
            <title>Dynamic Configuration of IPv4 Link-Local Addresses</title>
            <author initials="S." surname="Cheshire" fullname="S. Cheshire">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B." surname="Aboba" fullname="B. Aboba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="E." surname="Guttman" fullname="E. Guttman">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2005" month="May"/>
            <abstract>
              <t indent="0">To participate in wide-area IP networking, a host needs to be configured with IP addresses for its interfaces, either manually by the user or automatically from a source on the network such as a Dynamic Host Configuration Protocol (DHCP) server.  Unfortunately, such address configuration information may not always be available. It is therefore beneficial for a host to be able to depend on a useful subset of IP networking functions even when no address configuration is available.  This document describes how a host may automatically configure an interface with an IPv4 address within the 169.254/16 prefix that is valid for communication with other devices connected to the same physical (or logical) link.</t>
              <t indent="0">IPv4 Link-Local addresses are not suitable for communication with devices not directly connected to the same physical (or logical) link, and are only used where stable, routable addresses are not available (such as on ad hoc or isolated networks).  This document does not recommend that IPv4 Link-Local addresses and routable addresses be configured simultaneously on the same interface.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3927"/>
          <seriesInfo name="DOI" value="10.17487/RFC3927"/>
        </reference>
        <reference anchor="RFC4086" target="https://www.rfc-editor.org/info/rfc4086" quoteTitle="true" derivedAnchor="RFC4086">
          <front>
            <title>Randomness Requirements for Security</title>
            <author initials="D." surname="Eastlake 3rd" fullname="D. Eastlake 3rd">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Schiller" fullname="J. Schiller">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Crocker" fullname="S. Crocker">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2005" month="June"/>
            <abstract>
              <t indent="0">Security systems are built on strong cryptographic algorithms that foil pattern analysis attempts.  However, the security of these systems is dependent on generating secret quantities for passwords, cryptographic keys, and similar quantities.  The use of pseudo-random processes to generate secret quantities can result in pseudo-security. A sophisticated attacker may find it easier to reproduce the environment that produced the secret quantities and to search the resulting small set of possibilities than to locate the quantities in the whole of the potential number space.</t>
              <t indent="0">Choosing random quantities to foil a resourceful and motivated adversary is surprisingly difficult.  This document points out many pitfalls in using poor entropy sources or traditional pseudo-random number generation techniques for generating such quantities.  It recommends the use of truly random hardware techniques and shows that the existing hardware on many systems can be used for this purpose. It provides suggestions to ameliorate the problem when a hardware solution is not available, and it gives examples of how large such quantities need to be for some applications.  This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="106"/>
          <seriesInfo name="RFC" value="4086"/>
          <seriesInfo name="DOI" value="10.17487/RFC4086"/>
        </reference>
        <reference anchor="RFC4519" target="https://www.rfc-editor.org/info/rfc4519" quoteTitle="true" derivedAnchor="RFC4519">
          <front>
            <title>Lightweight Directory Access Protocol (LDAP): Schema for User Applications</title>
            <author initials="A." surname="Sciberras" fullname="A. Sciberras" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2006" month="June"/>
            <abstract>
              <t indent="0">This document is an integral part of the Lightweight Directory Access Protocol (LDAP) technical specification.  It provides a technical specification of attribute types and object classes intended for use by LDAP directory clients for many directory services, such as White Pages.  These objects are widely used as a basis for the schema in many LDAP directories.  This document does not cover attributes used for the administration of directory servers, nor does it include directory objects defined for specific uses in other documents.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4519"/>
          <seriesInfo name="DOI" value="10.17487/RFC4519"/>
        </reference>
        <reference anchor="RFC4648" target="https://www.rfc-editor.org/info/rfc4648" quoteTitle="true" derivedAnchor="RFC4648">
          <front>
            <title>The Base16, Base32, and Base64 Data Encodings</title>
            <author initials="S." surname="Josefsson" fullname="S. Josefsson">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2006" month="October"/>
            <abstract>
              <t indent="0">This document describes the commonly used base 64, base 32, and base 16 encoding schemes.  It also discusses the use of line-feeds in encoded data, use of padding in encoded data, use of non-alphabet characters in encoded data, use of different encoding alphabets, and canonical encodings.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4648"/>
          <seriesInfo name="DOI" value="10.17487/RFC4648"/>
        </reference>
        <reference anchor="RFC4862" target="https://www.rfc-editor.org/info/rfc4862" quoteTitle="true" derivedAnchor="RFC4862">
          <front>
            <title>IPv6 Stateless Address Autoconfiguration</title>
            <author initials="S." surname="Thomson" fullname="S. Thomson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Narten" fullname="T. Narten">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Jinmei" fullname="T. Jinmei">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2007" month="September"/>
            <abstract>
              <t indent="0">This document specifies the steps a host takes in deciding how to autoconfigure its interfaces in IP version 6.  The autoconfiguration process includes generating a link-local address, generating global addresses via stateless address autoconfiguration, and the Duplicate Address Detection procedure to verify the uniqueness of the addresses on a link.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4862"/>
          <seriesInfo name="DOI" value="10.17487/RFC4862"/>
        </reference>
        <reference anchor="RFC5272" target="https://www.rfc-editor.org/info/rfc5272" quoteTitle="true" derivedAnchor="RFC5272">
          <front>
            <title>Certificate Management over CMS (CMC)</title>
            <author initials="J." surname="Schaad" fullname="J. Schaad">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Myers" fullname="M. Myers">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2008" month="June"/>
            <abstract>
              <t indent="0">This document defines the base syntax for CMC, a Certificate Management protocol using the Cryptographic Message Syntax (CMS). This protocol addresses two immediate needs within the Internet Public Key Infrastructure (PKI) community:</t>
              <t indent="0">1.  The need for an interface to public key certification products and services based on CMS and PKCS #10 (Public Key Cryptography Standard), and</t>
              <t indent="0">2.  The need for a PKI enrollment protocol for encryption only keys due to algorithm or hardware design.</t>
              <t indent="0">CMC also requires the use of the transport document and the requirements usage document along with this document for a full definition.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5272"/>
          <seriesInfo name="DOI" value="10.17487/RFC5272"/>
        </reference>
        <reference anchor="RFC5280" target="https://www.rfc-editor.org/info/rfc5280" quoteTitle="true" derivedAnchor="RFC5280">
          <front>
            <title>Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile</title>
            <author initials="D." surname="Cooper" fullname="D. Cooper">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Santesson" fullname="S. Santesson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Farrell" fullname="S. Farrell">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Boeyen" fullname="S. Boeyen">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="R." surname="Housley" fullname="R. Housley">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="W." surname="Polk" fullname="W. Polk">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2008" month="May"/>
            <abstract>
              <t indent="0">This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet.  An overview of this approach and model is provided as an introduction.  The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms.  Standard certificate extensions are described and two Internet-specific extensions are defined.  A set of required certificate extensions is specified.  The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions.  An algorithm for X.509 certification path validation is described.  An ASN.1 module and examples are provided in the appendices.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5280"/>
          <seriesInfo name="DOI" value="10.17487/RFC5280"/>
        </reference>
        <reference anchor="RFC5652" target="https://www.rfc-editor.org/info/rfc5652" quoteTitle="true" derivedAnchor="RFC5652">
          <front>
            <title>Cryptographic Message Syntax (CMS)</title>
            <author initials="R." surname="Housley" fullname="R. Housley">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2009" month="September"/>
            <abstract>
              <t indent="0">This document describes the Cryptographic Message Syntax (CMS).  This syntax is used to digitally sign, digest, authenticate, or encrypt arbitrary message content.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="70"/>
          <seriesInfo name="RFC" value="5652"/>
          <seriesInfo name="DOI" value="10.17487/RFC5652"/>
        </reference>
        <reference anchor="RFC6020" target="https://www.rfc-editor.org/info/rfc6020" quoteTitle="true" derivedAnchor="RFC6020">
          <front>
            <title>YANG - A Data Modeling Language for the Network Configuration Protocol (NETCONF)</title>
            <author initials="M." surname="Bjorklund" fullname="M. Bjorklund" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2010" month="October"/>
            <abstract>
              <t indent="0">YANG is a data modeling language used to model configuration and state data manipulated by the Network Configuration Protocol (NETCONF), NETCONF remote procedure calls, and NETCONF notifications. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6020"/>
          <seriesInfo name="DOI" value="10.17487/RFC6020"/>
        </reference>
        <reference anchor="RFC6125" target="https://www.rfc-editor.org/info/rfc6125" quoteTitle="true" derivedAnchor="RFC6125">
          <front>
            <title>Representation and Verification of Domain-Based Application Service Identity within Internet Public Key Infrastructure Using X.509 (PKIX) Certificates in the Context of Transport Layer Security (TLS)</title>
            <author initials="P." surname="Saint-Andre" fullname="P. Saint-Andre">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Hodges" fullname="J. Hodges">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2011" month="March"/>
            <abstract>
              <t indent="0">Many application technologies enable secure communication between two entities by means of Internet Public Key Infrastructure Using X.509 (PKIX) certificates in the context of Transport Layer Security (TLS). This document specifies procedures for representing and verifying the identity of application services in such interactions.   [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6125"/>
          <seriesInfo name="DOI" value="10.17487/RFC6125"/>
        </reference>
        <reference anchor="RFC6241" target="https://www.rfc-editor.org/info/rfc6241" quoteTitle="true" derivedAnchor="RFC6241">
          <front>
            <title>Network Configuration Protocol (NETCONF)</title>
            <author initials="R." surname="Enns" fullname="R. Enns" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Bjorklund" fullname="M. Bjorklund" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Schoenwaelder" fullname="J. Schoenwaelder" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="A." surname="Bierman" fullname="A. Bierman" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2011" month="June"/>
            <abstract>
              <t indent="0">The Network Configuration Protocol (NETCONF) defined in this document provides mechanisms to install, manipulate, and delete the configuration of network devices.  It uses an Extensible Markup Language (XML)-based data encoding for the configuration data as well as the protocol messages.  The NETCONF protocol operations are realized as remote procedure calls (RPCs).  This document obsoletes RFC 4741.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6241"/>
          <seriesInfo name="DOI" value="10.17487/RFC6241"/>
        </reference>
        <reference anchor="RFC6762" target="https://www.rfc-editor.org/info/rfc6762" quoteTitle="true" derivedAnchor="RFC6762">
          <front>
            <title>Multicast DNS</title>
            <author initials="S." surname="Cheshire" fullname="S. Cheshire">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Krochmal" fullname="M. Krochmal">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2013" month="February"/>
            <abstract>
              <t indent="0">As networked devices become smaller, more portable, and more ubiquitous, the ability to operate with less configured infrastructure is increasingly important.  In particular, the ability to look up DNS resource record data types (including, but not limited to, host names) in the absence of a conventional managed DNS server is useful.</t>
              <t indent="0">Multicast DNS (mDNS) provides the ability to perform DNS-like operations on the local link in the absence of any conventional Unicast DNS server.  In addition, Multicast DNS designates a portion of the DNS namespace to be free for local use, without the need to pay any annual fee, and without the need to set up delegations or otherwise configure a conventional DNS server to answer for those names.</t>
              <t indent="0">The primary benefits of Multicast DNS names are that (i) they require little or no administration or configuration to set them up, (ii) they work when no infrastructure is present, and (iii) they work during infrastructure failures.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6762"/>
          <seriesInfo name="DOI" value="10.17487/RFC6762"/>
        </reference>
        <reference anchor="RFC6763" target="https://www.rfc-editor.org/info/rfc6763" quoteTitle="true" derivedAnchor="RFC6763">
          <front>
            <title>DNS-Based Service Discovery</title>
            <author initials="S." surname="Cheshire" fullname="S. Cheshire">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Krochmal" fullname="M. Krochmal">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2013" month="February"/>
            <abstract>
              <t indent="0">This document specifies how DNS resource records are named and structured to facilitate service discovery.  Given a type of service that a client is looking for, and a domain in which the client is looking for that service, this mechanism allows clients to discover a list of named instances of that desired service, using standard DNS queries. This mechanism is referred to as DNS-based Service Discovery, or DNS-SD.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6763"/>
          <seriesInfo name="DOI" value="10.17487/RFC6763"/>
        </reference>
        <reference anchor="RFC7030" target="https://www.rfc-editor.org/info/rfc7030" quoteTitle="true" derivedAnchor="RFC7030">
          <front>
            <title>Enrollment over Secure Transport</title>
            <author initials="M." surname="Pritikin" fullname="M. Pritikin" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Yee" fullname="P. Yee" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="D." surname="Harkins" fullname="D. Harkins" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2013" month="October"/>
            <abstract>
              <t indent="0">This document profiles certificate enrollment for clients using Certificate Management over CMS (CMC) messages over a secure transport.  This profile, called Enrollment over Secure Transport (EST), describes a simple, yet functional, certificate management protocol targeting Public Key Infrastructure (PKI) clients that need to acquire client certificates and associated Certification Authority (CA) certificates.  It also supports client-generated public/private key pairs as well as key pairs generated by the CA.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7030"/>
          <seriesInfo name="DOI" value="10.17487/RFC7030"/>
        </reference>
        <reference anchor="RFC7230" target="https://www.rfc-editor.org/info/rfc7230" quoteTitle="true" derivedAnchor="RFC7230">
          <front>
            <title>Hypertext Transfer Protocol (HTTP/1.1): Message Syntax and Routing</title>
            <author initials="R." surname="Fielding" fullname="R. Fielding" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Reschke" fullname="J. Reschke" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="June"/>
            <abstract>
              <t indent="0">The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems.  This document provides an overview of HTTP architecture and its associated terminology, defines the "http" and "https" Uniform Resource Identifier (URI) schemes, defines the HTTP/1.1 message syntax and parsing requirements, and describes related security concerns for implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7230"/>
          <seriesInfo name="DOI" value="10.17487/RFC7230"/>
        </reference>
        <reference anchor="RFC7231" target="https://www.rfc-editor.org/info/rfc7231" quoteTitle="true" derivedAnchor="RFC7231">
          <front>
            <title>Hypertext Transfer Protocol (HTTP/1.1): Semantics and Content</title>
            <author initials="R." surname="Fielding" fullname="R. Fielding" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Reschke" fullname="J. Reschke" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="June"/>
            <abstract>
              <t indent="0">The Hypertext Transfer Protocol (HTTP) is a stateless \%application- level protocol for distributed, collaborative, hypertext information systems.  This document defines the semantics of HTTP/1.1 messages, as expressed by request methods, request header fields, response status codes, and response header fields, along with the payload of messages (metadata and body content) and mechanisms for content negotiation.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7231"/>
          <seriesInfo name="DOI" value="10.17487/RFC7231"/>
        </reference>
        <reference anchor="RFC7469" target="https://www.rfc-editor.org/info/rfc7469" quoteTitle="true" derivedAnchor="RFC7469">
          <front>
            <title>Public Key Pinning Extension for HTTP</title>
            <author initials="C." surname="Evans" fullname="C. Evans">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="C." surname="Palmer" fullname="C. Palmer">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="R." surname="Sleevi" fullname="R. Sleevi">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2015" month="April"/>
            <abstract>
              <t indent="0">This document defines a new HTTP header that allows web host operators to instruct user agents to remember ("pin") the hosts' cryptographic identities over a period of time.  During that time, user agents (UAs) will require that the host presents a certificate chain including at least one Subject Public Key Info structure whose fingerprint matches one of the pinned fingerprints for that host.  By effectively reducing the number of trusted authorities who can authenticate the domain during the lifetime of the pin, pinning may reduce the incidence of man-in-the-middle attacks due to compromised Certification Authorities.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7469"/>
          <seriesInfo name="DOI" value="10.17487/RFC7469"/>
        </reference>
        <reference anchor="RFC7950" target="https://www.rfc-editor.org/info/rfc7950" quoteTitle="true" derivedAnchor="RFC7950">
          <front>
            <title>The YANG 1.1 Data Modeling Language</title>
            <author initials="M." surname="Bjorklund" fullname="M. Bjorklund" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2016" month="August"/>
            <abstract>
              <t indent="0">YANG is a data modeling language used to model configuration data, state data, Remote Procedure Calls, and notifications for network management protocols.  This document describes the syntax and semantics of version 1.1 of the YANG language.  YANG version 1.1 is a maintenance release of the YANG language, addressing ambiguities and defects in the original specification.  There are a small number of backward incompatibilities from YANG version 1.  This document also specifies the YANG mappings to the Network Configuration Protocol (NETCONF).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7950"/>
          <seriesInfo name="DOI" value="10.17487/RFC7950"/>
        </reference>
        <reference anchor="RFC7951" target="https://www.rfc-editor.org/info/rfc7951" quoteTitle="true" derivedAnchor="RFC7951">
          <front>
            <title>JSON Encoding of Data Modeled with YANG</title>
            <author initials="L." surname="Lhotka" fullname="L. Lhotka">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2016" month="August"/>
            <abstract>
              <t indent="0">This document defines encoding rules for representing configuration data, state data, parameters of Remote Procedure Call (RPC) operations or actions, and notifications defined using YANG as JavaScript Object Notation (JSON) text.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7951"/>
          <seriesInfo name="DOI" value="10.17487/RFC7951"/>
        </reference>
        <reference anchor="RFC8040" target="https://www.rfc-editor.org/info/rfc8040" quoteTitle="true" derivedAnchor="RFC8040">
          <front>
            <title>RESTCONF Protocol</title>
            <author initials="A." surname="Bierman" fullname="A. Bierman">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Bjorklund" fullname="M. Bjorklund">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="K." surname="Watsen" fullname="K. Watsen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2017" month="January"/>
            <abstract>
              <t indent="0">This document describes an HTTP-based protocol that provides a programmatic interface for accessing data defined in YANG, using the datastore concepts defined in the Network Configuration Protocol (NETCONF).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8040"/>
          <seriesInfo name="DOI" value="10.17487/RFC8040"/>
        </reference>
        <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174" quoteTitle="true" derivedAnchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author initials="B." surname="Leiba" fullname="B. Leiba">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2017" month="May"/>
            <abstract>
              <t indent="0">RFC 2119 specifies common key words that may be used in protocol  specifications.  This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the  defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
        <reference anchor="RFC8259" target="https://www.rfc-editor.org/info/rfc8259" quoteTitle="true" derivedAnchor="RFC8259">
          <front>
            <title>The JavaScript Object Notation (JSON) Data Interchange Format</title>
            <author initials="T." surname="Bray" fullname="T. Bray" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2017" month="December"/>
            <abstract>
              <t indent="0">JavaScript Object Notation (JSON) is a lightweight, text-based, language-independent data interchange format.  It was derived from the ECMAScript Programming Language Standard.  JSON defines a small set of formatting rules for the portable representation of structured data.</t>
              <t indent="0">This document removes inconsistencies with other specifications of JSON, repairs specification errors, and offers experience-based interoperability guidance.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="90"/>
          <seriesInfo name="RFC" value="8259"/>
          <seriesInfo name="DOI" value="10.17487/RFC8259"/>
        </reference>
        <reference anchor="RFC8366" target="https://www.rfc-editor.org/info/rfc8366" quoteTitle="true" derivedAnchor="RFC8366">
          <front>
            <title>A Voucher Artifact for Bootstrapping Protocols</title>
            <author initials="K." surname="Watsen" fullname="K. Watsen">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Richardson" fullname="M. Richardson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Pritikin" fullname="M. Pritikin">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Eckert" fullname="T. Eckert">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2018" month="May"/>
            <abstract>
              <t indent="0">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".</t>
              <t indent="0">This document defines an artifact format as a YANG-defined JSON document that has been signed using a Cryptographic Message Syntax (CMS) structure.  Other YANG-derived formats are possible.  The voucher artifact is normally generated by the pledge's manufacturer (i.e., the Manufacturer Authorized Signing Authority (MASA)).</t>
              <t indent="0">This document only defines the voucher artifact, leaving it to other documents to describe specialized protocols for accessing it.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8366"/>
          <seriesInfo name="DOI" value="10.17487/RFC8366"/>
        </reference>
        <reference anchor="RFC8368" target="https://www.rfc-editor.org/info/rfc8368" quoteTitle="true" derivedAnchor="RFC8368">
          <front>
            <title>Using an Autonomic Control Plane for Stable Connectivity of Network Operations, Administration, and Maintenance (OAM)</title>
            <author initials="T." surname="Eckert" fullname="T. Eckert" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Behringer" fullname="M. Behringer">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2018" month="May"/>
            <abstract>
              <t indent="0">Operations, Administration, and Maintenance (OAM), as per BCP 161, for data networks is often subject to the problem of circular dependencies when relying on connectivity provided by the network to be managed for the OAM purposes.</t>
              <t indent="0">Provisioning while bringing up devices and networks tends to be more difficult to automate than service provisioning later on.  Changes in core network functions impacting reachability cannot be automated because of ongoing connectivity requirements for the OAM equipment itself, and widely used OAM protocols are not secure enough to be carried across the network without security concerns.</t>
              <t indent="0">This document describes how to integrate OAM processes with an autonomic control plane in order to provide stable and secure connectivity for those OAM processes.  This connectivity is not subject to the aforementioned circular dependencies.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8368"/>
          <seriesInfo name="DOI" value="10.17487/RFC8368"/>
        </reference>
        <reference anchor="RFC8407" target="https://www.rfc-editor.org/info/rfc8407" quoteTitle="true" derivedAnchor="RFC8407">
          <front>
            <title>Guidelines for Authors and Reviewers of Documents Containing YANG Data Models</title>
            <author initials="A." surname="Bierman" fullname="A. Bierman">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2018" month="October"/>
            <abstract>
              <t indent="0">This memo provides guidelines for authors and reviewers of specifications containing YANG modules.  Recommendations and procedures are defined, which are intended to increase interoperability and usability of Network Configuration Protocol (NETCONF) and RESTCONF protocol implementations that utilize YANG modules.  This document obsoletes RFC 6087.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="216"/>
          <seriesInfo name="RFC" value="8407"/>
          <seriesInfo name="DOI" value="10.17487/RFC8407"/>
        </reference>
        <reference anchor="RFC8446" target="https://www.rfc-editor.org/info/rfc8446" quoteTitle="true" derivedAnchor="RFC8446">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
            <author initials="E." surname="Rescorla" fullname="E. Rescorla">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2018" month="August"/>
            <abstract>
              <t indent="0">This document specifies version 1.3 of the Transport Layer Security (TLS) protocol.  TLS allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery.</t>
              <t indent="0">This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961.  This document also specifies new requirements for TLS 1.2 implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8446"/>
          <seriesInfo name="DOI" value="10.17487/RFC8446"/>
        </reference>
        <reference anchor="RFC8610" target="https://www.rfc-editor.org/info/rfc8610" quoteTitle="true" derivedAnchor="RFC8610">
          <front>
            <title>Concise Data Definition Language (CDDL): A Notational Convention to Express Concise Binary Object Representation (CBOR) and JSON Data Structures</title>
            <author initials="H." surname="Birkholz" fullname="H. Birkholz">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="C." surname="Vigano" fullname="C. Vigano">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="C." surname="Bormann" fullname="C. Bormann">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2019" month="June"/>
            <abstract>
              <t indent="0">This document proposes a notational convention to express Concise Binary Object Representation (CBOR) data structures (RFC 7049).  Its main goal is to provide an easy and unambiguous way to express structures for protocol messages and data formats that use CBOR or JSON.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8610"/>
          <seriesInfo name="DOI" value="10.17487/RFC8610"/>
        </reference>
        <reference anchor="RFC8951" target="https://www.rfc-editor.org/info/rfc8951" quoteTitle="true" derivedAnchor="RFC8951">
          <front>
            <title>Clarification of Enrollment over Secure Transport (EST): Transfer Encodings and ASN.1</title>
            <author initials="M." surname="Richardson" fullname="M. Richardson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Werner" fullname="T. Werner">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="W." surname="Pan" fullname="W. Pan">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2020" month="November"/>
            <abstract>
              <t indent="0">This document updates RFC 7030: Enrollment over Secure Transport to resolve some errata that were reported and that have proven to cause interoperability issues when RFC 7030 was extended.</t>
              <t indent="0">This document deprecates the specification of "Content-Transfer-Encoding" headers for Enrollment over Secure Transport (EST) endpoints. This document fixes some syntactical errors in ASN.1 that were present.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8951"/>
          <seriesInfo name="DOI" value="10.17487/RFC8951"/>
        </reference>
        <reference anchor="RFC8981" target="https://www.rfc-editor.org/info/rfc8981" quoteTitle="true" derivedAnchor="RFC8981">
          <front>
            <title>Temporary Address Extensions for Stateless Address Autoconfiguration in IPv6</title>
            <author initials="F." surname="Gont" fullname="F. Gont">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Krishnan" fullname="S. Krishnan">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Narten" fullname="T. Narten">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="R." surname="Draves" fullname="R. Draves">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2021" month="February"/>
            <abstract>
              <t indent="0">This document describes an extension to IPv6 Stateless Address Autoconfiguration that causes hosts to generate temporary addresses with randomized interface identifiers for each prefix advertised with autoconfiguration enabled. Changing addresses over time limits the window of time during which eavesdroppers and other information collectors may trivially perform address-based network-activity correlation when the same address is employed for multiple transactions by the same host. Additionally, it reduces the window of exposure of a host as being accessible via an address that becomes revealed as a result of active communication. This document obsoletes RFC 4941.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8981"/>
          <seriesInfo name="DOI" value="10.17487/RFC8981"/>
        </reference>
        <reference anchor="RFC8990" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc8990" derivedAnchor="RFC8990">
          <front>
            <title>GeneRic Autonomic Signaling Protocol (GRASP)</title>
            <author initials="C" surname="Bormann" fullname="Carsten Bormann">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B" surname="Carpenter" fullname="Brian Carpenter" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B" surname="Liu" fullname="Bing Liu" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date month="May" year="2021"/>
          </front>
          <seriesInfo name="RFC" value="8990"/>
          <seriesInfo name="DOI" value="10.17487/RFC8990"/>
        </reference>
        <reference anchor="RFC8994" quoteTitle="true" target="https://www.rfc-editor.org/rfc/rfc8994" derivedAnchor="RFC8994">
          <front>
            <title>An Autonomic Control Plane (ACP)</title>
            <author initials="T" surname="Eckert" fullname="Toerless Eckert" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M" surname="Behringer" fullname="Michael Behringer" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S" surname="Bjarnason" fullname="Steinthor Bjarnason">
              <organization showOnFrontPage="true"/>
            </author>
            <date month="May" year="2021"/>
          </front>
          <seriesInfo name="RFC" value="8994"/>
          <seriesInfo name="DOI" value="10.17487/RFC8994"/>
        </reference>
      </references>
      <references pn="section-12.2">
        <name slugifiedName="name-informative-references">Informative References</name>
        <reference anchor="I-D.ietf-ace-coap-est" quoteTitle="true" target="https://tools.ietf.org/html/draft-ietf-ace-coap-est-18" derivedAnchor="ACE-COAP-EST">
          <front>
            <title>EST over secure CoAP (EST-coaps)</title>
            <author initials="P" surname="van der Stok" fullname="Peter van der Stok">
              <organization showOnFrontPage="true">Consultant</organization>
            </author>
            <author fullname="Panos Kampanakis">
              <organization showOnFrontPage="true">Cisco Systems</organization>
            </author>
            <author fullname="Michael Richardson">
              <organization showOnFrontPage="true">Sandelman Software Works</organization>
            </author>
            <author fullname="Shahid Raza">
              <organization showOnFrontPage="true">RISE SICS</organization>
            </author>
            <date month="January" day="6" year="2020"/>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-ace-coap-est-18"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.ietf-anima-constrained-voucher" quoteTitle="true" target="https://tools.ietf.org/html/draft-ietf-anima-constrained-voucher-10" derivedAnchor="ANIMA-CONSTRAINED-VOUCHER">
          <front>
            <title>Constrained Voucher Artifacts for Bootstrapping Protocols</title>
            <author fullname="Michael Richardson">
              <organization showOnFrontPage="true">Sandelman Software Works</organization>
            </author>
            <author initials="P" surname="van der Stok" fullname="Peter van der Stok">
              <organization showOnFrontPage="true">vanderstok consultancy</organization>
            </author>
            <author fullname="Panos Kampanakis">
              <organization showOnFrontPage="true">Cisco Systems</organization>
            </author>
            <author fullname="Esko Dijk">
              <organization showOnFrontPage="true">IoTconsultancy.nl</organization>
            </author>
            <date month="February" day="21" year="2021"/>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-anima-constrained-voucher-10"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="I-D.richardson-anima-state-for-joinrouter" quoteTitle="true" target="https://tools.ietf.org/html/draft-richardson-anima-state-for-joinrouter-03" derivedAnchor="ANIMA-STATE">
          <front>
            <title>Considerations for stateful vs stateless join router in ANIMA bootstrap</title>
            <author fullname="Michael Richardson">
              <organization showOnFrontPage="true">Sandelman Software Works</organization>
            </author>
            <date month="September" day="22" year="2020"/>
            <abstract>
              <t indent="0">   This document explores a number of issues affecting the decision to
   use a stateful or stateless forwarding mechanism by the join router
   (aka join assistant) during the bootstrap process for ANIMA.
              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-richardson-anima-state-for-joinrouter-03"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="brewski" target="https://www.urbandictionary.com/define.php?term=brewski" quoteTitle="true" derivedAnchor="brewski">
          <front>
            <title>brewski</title>
            <author>
              <organization showOnFrontPage="true">Urban Dictionary</organization>
            </author>
            <date month="March" year="2003"/>
          </front>
        </reference>
        <reference anchor="cabforumaudit" target="https://cabforum.org/information-for-auditors-and-assessors/" quoteTitle="true" derivedAnchor="cabforumaudit">
          <front>
            <title>Information for Auditors and Assessors</title>
            <author>
              <organization showOnFrontPage="true">CA/Browser Forum</organization>
            </author>
            <date month="August" year="2019"/>
          </front>
        </reference>
        <reference anchor="Dingledine" target="https://svn-archive.torproject.org/svn/projects/design-paper/tor-design.pdf" quoteTitle="true" derivedAnchor="Dingledine">
          <front>
            <title>Tor: The Second-Generation Onion Router</title>
            <author initials="R." surname="Dingledine">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="N." surname="Mathewson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="P." surname="Syverson">
              <organization showOnFrontPage="true"/>
            </author>
            <date month="August" year="2004"/>
          </front>
        </reference>
        <reference anchor="dnssecroot" target="https://www.iana.org/dnssec/procedures/zsk-operator/dps-zsk-operator-v2.1.pdf" quoteTitle="true" derivedAnchor="dnssecroot">
          <front>
            <title>DNSSEC Practice Statement for the Root Zone ZSK Operator</title>
            <author surname="Verisign"/>
            <date month="December" year="2017"/>
          </front>
        </reference>
        <reference anchor="docsisroot" target="https://www.cablelabs.com/resources/digital-certificate-issuance-service/" quoteTitle="true" derivedAnchor="docsisroot">
          <front>
            <title>CableLabs Digital Certificate Issuance Service</title>
            <author surname="CableLabs"/>
            <date month="February" year="2018"/>
          </front>
        </reference>
        <reference anchor="imprinting" target="https://en.wikipedia.org/w/index.php?title=Imprinting_(psychology)&amp;=999211441" quoteTitle="true" derivedAnchor="imprinting">
          <front>
            <title>Imprinting (psychology)</title>
            <author>
              <organization showOnFrontPage="true">Wikipedia</organization>
            </author>
            <date month="January" year="2021"/>
          </front>
        </reference>
        <reference anchor="IoTstrangeThings" target="https://www.welivesecurity.com/2017/03/03/internet-of-things-security-privacy-iot-update/" quoteTitle="true" derivedAnchor="IoTstrangeThings">
          <front>
            <title>IoT of toys stranger than fiction: Cybersecurity and data privacy update</title>
            <author>
              <organization showOnFrontPage="true">ESET</organization>
            </author>
            <date month="March" year="2017"/>
          </front>
        </reference>
        <reference anchor="livingwithIoT" target="https://www.siliconrepublic.com/machines/iot-smart-devices-reality" quoteTitle="true" derivedAnchor="livingwithIoT">
          <front>
            <title>What is it actually like to live in a house filled with IoT devices?</title>
            <author>
              <organization showOnFrontPage="true">Silicon Republic</organization>
            </author>
            <date month="February" year="2018"/>
          </front>
        </reference>
        <reference anchor="minerva" target="https://minerva.sandelman.ca/" quoteTitle="true" derivedAnchor="minerva">
          <front>
            <title>Minerva reference implementation for BRSKI</title>
            <author fullname="Michael Richardson" initials="M." surname="Richardson"/>
            <date year="2020"/>
          </front>
        </reference>
        <reference anchor="minervagithub" target="https://github.com/ANIMAgus-minerva" quoteTitle="true" derivedAnchor="minervagithub">
          <front>
            <title>ANIMA Minerva toolkit</title>
            <author/>
            <date/>
          </front>
        </reference>
        <reference anchor="openssl" target="https://www.openssl.org/docs/man1.1.1/man1/openssl-x509.html/" quoteTitle="true" derivedAnchor="openssl">
          <front>
            <title>OpenSSL X509 Utility</title>
            <author>
              <organization showOnFrontPage="true">OpenSSL</organization>
            </author>
            <date month="September" year="2019"/>
          </front>
        </reference>
        <reference anchor="RFC2131" target="https://www.rfc-editor.org/info/rfc2131" quoteTitle="true" derivedAnchor="RFC2131">
          <front>
            <title>Dynamic Host Configuration Protocol</title>
            <author initials="R." surname="Droms" fullname="R. Droms">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="1997" month="March"/>
            <abstract>
              <t indent="0">The Dynamic Host Configuration Protocol (DHCP) provides a framework for passing configuration information to hosts on a TCPIP network.  DHCP is based on the Bootstrap Protocol (BOOTP), adding the capability of automatic allocation of reusable network addresses and additional configuration options.  [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2131"/>
          <seriesInfo name="DOI" value="10.17487/RFC2131"/>
        </reference>
        <reference anchor="RFC2663" target="https://www.rfc-editor.org/info/rfc2663" quoteTitle="true" derivedAnchor="RFC2663">
          <front>
            <title>IP Network Address Translator (NAT) Terminology and Considerations</title>
            <author initials="P." surname="Srisuresh" fullname="P. Srisuresh">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Holdrege" fullname="M. Holdrege">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="1999" month="August"/>
            <abstract>
              <t indent="0">This document attempts to describe the operation of NAT devices and the associated considerations in general, and to define the terminology used to identify various flavors of NAT.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2663"/>
          <seriesInfo name="DOI" value="10.17487/RFC2663"/>
        </reference>
        <reference anchor="RFC5209" target="https://www.rfc-editor.org/info/rfc5209" quoteTitle="true" derivedAnchor="RFC5209">
          <front>
            <title>Network Endpoint Assessment (NEA): Overview and Requirements</title>
            <author initials="P." surname="Sangster" fullname="P. Sangster">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="H." surname="Khosravi" fullname="H. Khosravi">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Mani" fullname="M. Mani">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="K." surname="Narayan" fullname="K. Narayan">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J." surname="Tardo" fullname="J. Tardo">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2008" month="June"/>
            <abstract>
              <t indent="0">This document defines the problem statement, scope, and protocol requirements between the components of the NEA (Network Endpoint Assessment) reference model.  NEA provides owners of networks (e.g., an enterprise offering remote access) a mechanism to evaluate the posture of a system.  This may take place during the request for network access and/or subsequently at any time while connected to the network.  The learned posture information can then be applied to a variety of compliance-oriented decisions.  The posture information is frequently useful for detecting systems that are lacking or have out-of-date security protection mechanisms such as: anti-virus and host-based firewall software.  In order to provide context for the requirements, a reference model and terminology are introduced.  This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5209"/>
          <seriesInfo name="DOI" value="10.17487/RFC5209"/>
        </reference>
        <reference anchor="RFC6960" target="https://www.rfc-editor.org/info/rfc6960" quoteTitle="true" derivedAnchor="RFC6960">
          <front>
            <title>X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP</title>
            <author initials="S." surname="Santesson" fullname="S. Santesson">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Myers" fullname="M. Myers">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="R." surname="Ankney" fullname="R. Ankney">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="A." surname="Malpani" fullname="A. Malpani">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Galperin" fullname="S. Galperin">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="C." surname="Adams" fullname="C. Adams">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2013" month="June"/>
            <abstract>
              <t indent="0">This document specifies a protocol useful in determining the current status of a digital certificate without requiring Certificate Revocation Lists (CRLs). Additional mechanisms addressing PKIX operational requirements are specified in separate documents.  This document obsoletes RFCs 2560 and 6277.  It also updates RFC 5912.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6960"/>
          <seriesInfo name="DOI" value="10.17487/RFC6960"/>
        </reference>
        <reference anchor="RFC6961" target="https://www.rfc-editor.org/info/rfc6961" quoteTitle="true" derivedAnchor="RFC6961">
          <front>
            <title>The Transport Layer Security (TLS) Multiple Certificate Status Request Extension</title>
            <author initials="Y." surname="Pettersen" fullname="Y. Pettersen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2013" month="June"/>
            <abstract>
              <t indent="0">This document defines the Transport Layer Security (TLS) Certificate Status Version 2 Extension to allow clients to specify and support several certificate status methods.  (The use of the Certificate Status extension is commonly referred to as "OCSP stapling".)  Also defined is a new method based on the Online Certificate Status Protocol (OCSP) that servers can use to provide status information about not only the server's own certificate but also the status of intermediate certificates in the chain.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6961"/>
          <seriesInfo name="DOI" value="10.17487/RFC6961"/>
        </reference>
        <reference anchor="RFC7228" target="https://www.rfc-editor.org/info/rfc7228" quoteTitle="true" derivedAnchor="RFC7228">
          <front>
            <title>Terminology for Constrained-Node Networks</title>
            <author initials="C." surname="Bormann" fullname="C. Bormann">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Ersue" fullname="M. Ersue">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="A." surname="Keranen" fullname="A. Keranen">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="May"/>
            <abstract>
              <t indent="0">The Internet Protocol Suite is increasingly used on small devices with severe constraints on power, memory, and processing resources, creating constrained-node networks.  This document provides a number of basic terms that have been useful in the standardization work for constrained-node networks.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7228"/>
          <seriesInfo name="DOI" value="10.17487/RFC7228"/>
        </reference>
        <reference anchor="RFC7258" target="https://www.rfc-editor.org/info/rfc7258" quoteTitle="true" derivedAnchor="RFC7258">
          <front>
            <title>Pervasive Monitoring Is an Attack</title>
            <author initials="S." surname="Farrell" fullname="S. Farrell">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="H." surname="Tschofenig" fullname="H. Tschofenig">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="May"/>
            <abstract>
              <t indent="0">Pervasive monitoring is a technical attack that should be mitigated in the design of IETF protocols, where possible.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="188"/>
          <seriesInfo name="RFC" value="7258"/>
          <seriesInfo name="DOI" value="10.17487/RFC7258"/>
        </reference>
        <reference anchor="RFC7435" target="https://www.rfc-editor.org/info/rfc7435" quoteTitle="true" derivedAnchor="RFC7435">
          <front>
            <title>Opportunistic Security: Some Protection Most of the Time</title>
            <author initials="V." surname="Dukhovni" fullname="V. Dukhovni">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2014" month="December"/>
            <abstract>
              <t indent="0">This document defines the concept "Opportunistic Security" in the context of communications protocols.  Protocol designs based on Opportunistic Security use encryption even when authentication is not available, and use authentication when possible, thereby removing barriers to the widespread use of encryption on the Internet.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7435"/>
          <seriesInfo name="DOI" value="10.17487/RFC7435"/>
        </reference>
        <reference anchor="RFC7575" target="https://www.rfc-editor.org/info/rfc7575" quoteTitle="true" derivedAnchor="RFC7575">
          <front>
            <title>Autonomic Networking: Definitions and Design Goals</title>
            <author initials="M." surname="Behringer" fullname="M. Behringer">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="M." surname="Pritikin" fullname="M. Pritikin">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Bjarnason" fullname="S. Bjarnason">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="A." surname="Clemm" fullname="A. Clemm">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B." surname="Carpenter" fullname="B. Carpenter">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="S." surname="Jiang" fullname="S. Jiang">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="L." surname="Ciavaglia" fullname="L. Ciavaglia">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2015" month="June"/>
            <abstract>
              <t indent="0">Autonomic systems were first described in 2001.  The fundamental goal is self-management, including self-configuration, self-optimization, self-healing, and self-protection.  This is achieved by an autonomic function having minimal dependencies on human administrators or centralized management systems.  It usually implies distribution across network elements.</t>
              <t indent="0">This document defines common language and outlines design goals (and what are not design goals) for autonomic functions.  A high-level reference model illustrates how functional elements in an Autonomic Network interact.  This document is a product of the IRTF's Network Management Research Group.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7575"/>
          <seriesInfo name="DOI" value="10.17487/RFC7575"/>
        </reference>
        <reference anchor="RFC8126" target="https://www.rfc-editor.org/info/rfc8126" quoteTitle="true" derivedAnchor="RFC8126">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author initials="M." surname="Cotton" fullname="M. Cotton">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B." surname="Leiba" fullname="B. Leiba">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T." surname="Narten" fullname="T. Narten">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2017" month="June"/>
            <abstract>
              <t indent="0">Many protocols make use of points of extensibility that use constants to identify various protocol parameters.  To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper.  For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA).</t>
              <t indent="0">To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed.  This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry.</t>
              <t indent="0">This is the third edition of this document; it obsoletes RFC 5226.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="26"/>
          <seriesInfo name="RFC" value="8126"/>
          <seriesInfo name="DOI" value="10.17487/RFC8126"/>
        </reference>
        <reference anchor="RFC8340" target="https://www.rfc-editor.org/info/rfc8340" quoteTitle="true" derivedAnchor="RFC8340">
          <front>
            <title>YANG Tree Diagrams</title>
            <author initials="M." surname="Bjorklund" fullname="M. Bjorklund">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="L." surname="Berger" fullname="L. Berger" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2018" month="March"/>
            <abstract>
              <t indent="0">This document captures the current syntax used in YANG module tree diagrams.  The purpose of this document is to provide a single location for this definition.  This syntax may be updated from time to time based on the evolution of the YANG language.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="215"/>
          <seriesInfo name="RFC" value="8340"/>
          <seriesInfo name="DOI" value="10.17487/RFC8340"/>
        </reference>
        <reference anchor="RFC8615" target="https://www.rfc-editor.org/info/rfc8615" quoteTitle="true" derivedAnchor="RFC8615">
          <front>
            <title>Well-Known Uniform Resource Identifiers (URIs)</title>
            <author initials="M." surname="Nottingham" fullname="M. Nottingham">
              <organization showOnFrontPage="true"/>
            </author>
            <date year="2019" month="May"/>
            <abstract>
              <t indent="0">This memo defines a path prefix for "well-known locations", "/.well-known/", in selected Uniform Resource Identifier (URI) schemes.</t>
              <t indent="0">In doing so, it obsoletes RFC 5785 and updates the URI schemes defined in RFC 7230 to reserve that space.  It also updates RFC 7595 to track URI schemes that support well-known URIs in their registry.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8615"/>
          <seriesInfo name="DOI" value="10.17487/RFC8615"/>
        </reference>
        <reference anchor="RFC8993" target="https://www.rfc-editor.org/info/rfc8993" quoteTitle="true" derivedAnchor="RFC8993">
          <front>
            <title>A Reference Model for Autonomic Networking</title>
            <author initials="M" surname="Behringer" fullname="Michael Behringer" role="editor">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="B" surname="Carpenter" fullname="Brian Carpenter">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="T" surname="Eckert" fullname="Toerless Eckert">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="L" surname="Ciavaglia" fullname="Laurent Ciavaglia">
              <organization showOnFrontPage="true"/>
            </author>
            <author initials="J" surname="Nobre" fullname="Jeferson Nobre">
              <organization showOnFrontPage="true"/>
            </author>
            <date month="May" year="2021"/>
          </front>
          <seriesInfo name="RFC" value="8993"/>
          <seriesInfo name="DOI" value="10.17487/RFC8993"/>
        </reference>
        <reference anchor="slowloris" target="https://en.wikipedia.org/w/index.php?title=Slowloris_(computer_security)&amp;oldid=1001473290/" quoteTitle="true" derivedAnchor="slowloris">
          <front>
            <title>Slowloris (computer security)</title>
            <author>
              <organization showOnFrontPage="true">Wikipedia</organization>
            </author>
            <date month="January" year="2021"/>
          </front>
        </reference>
        <reference anchor="softwareescrow" target="https://en.wikipedia.org/w/index.php?title=Source_code_escrow&amp;oldid=948073074" quoteTitle="true" derivedAnchor="softwareescrow">
          <front>
            <title>Source code escrow</title>
            <author>
              <organization showOnFrontPage="true">Wikipedia</organization>
            </author>
            <date month="March" year="2020"/>
          </front>
        </reference>
        <reference anchor="Stajano99theresurrecting" target="https://www.cl.cam.ac.uk/~fms27/papers/1999-StajanoAnd-duckling.pdf" quoteTitle="true" derivedAnchor="Stajano99theresurrecting">
          <front>
            <title>The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks</title>
            <author fullname="Frank Stajano" initials="F." surname="Stajano"/>
            <author fullname="Ross Anderson" initials="R." surname="Anderson"/>
            <date year="1999"/>
          </front>
        </reference>
        <reference anchor="TR069" target="https://www.broadband-forum.org/download/TR-069_Amendment-6.pdf" quoteTitle="true" derivedAnchor="TR069">
          <front>
            <title>CPE WAN Management Protocol</title>
            <author>
              <organization showOnFrontPage="true">Broadband Forum</organization>
            </author>
            <date month="March" year="2018"/>
          </front>
          <refcontent>TR-069, Issue 1, Amendment 6</refcontent>
        </reference>
        <reference anchor="W3C.capability-urls" target="https://www.w3.org/TR/2014/WD-capability-urls" quoteTitle="true" derivedAnchor="W3C.capability-urls">
          <front>
            <title>Good Practices for Capability URLs</title>
            <seriesInfo name="World Wide Web Consortium WD" value="WD-capability-urls-20140218"/>
            <author initials="J." surname="Tennison" fullname="Jeni Tennison">
              <organization showOnFrontPage="true"/>
            </author>
            <date month="February" year="2014"/>
          </front>
          <refcontent>W3C First Public Working Draft</refcontent>
        </reference>
        <reference anchor="I-D.ietf-netconf-keystore" quoteTitle="true" target="https://tools.ietf.org/html/draft-ietf-netconf-keystore-22" derivedAnchor="YANG-KEYSTORE">
          <front>
            <title>A YANG Data Model for a Keystore</title>
            <author fullname="Kent Watsen">
              <organization showOnFrontPage="true">Watsen Networks</organization>
            </author>
            <date month="May" day="18" year="2021"/>
            <abstract>
              <t indent="0">   This document defines a YANG module called "ietf-keystore" that
   enables centralized configuration of both symmetric and asymmetric
   keys.  The secret value for both key types may be encrypted or
   hidden.  Asymmetric keys may be associated with certificates.
   Notifications are sent when certificates are about to expire.

Editorial Note (To be removed by RFC Editor)

   This draft contains placeholder values that need to be replaced with
   finalized values at the time of publication.  This note summarizes
   all of the substitutions that are needed.  No other RFC Editor
   instructions are specified elsewhere in this document.

   Artwork in this document contains shorthand references to drafts in
   progress.  Please apply the following replacements:

   *  "AAAA" --&gt; the assigned RFC value for draft-ietf-netconf-crypto-
      types

   *  "CCCC" --&gt; the assigned RFC value for this draft

   Artwork in this document contains placeholder values for the date of
   publication of this draft.  Please apply the following replacement:

   *  "2021-05-18" --&gt; the publication date of this draft

   The following Appendix section is to be removed prior to publication:

   *  Appendix A.  Change Log

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-netconf-keystore-22"/>
          <format type="TXT" target="https://www.ietf.org/archive/id/draft-ietf-netconf-keystore-22.txt"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
      </references>
    </references>
    <section anchor="IPv4operations" numbered="true" toc="include" removeInRFC="false" pn="section-appendix.a">
      <name slugifiedName="name-ipv4-and-non-ani-operations">IPv4 and Non-ANI Operations</name>
      <t indent="0" pn="section-appendix.a-1">
        The specification of BRSKI in <xref target="proxydetails" format="default" sectionFormat="of" derivedContent="Section 4"/>
        intentionally covers only the mechanisms for an IPv6 pledge using
        link-local addresses.  This section describes non-normative
        extensions that can be used in other environments.
      </t>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-a.1">
        <name slugifiedName="name-ipv4-link-local-addresses">IPv4 Link-Local Addresses</name>
        <t indent="0" pn="section-a.1-1">Instead of an IPv6 link-local address, an IPv4 address may be
      generated using "Dynamic Configuration of
      IPv4 Link-Local Addresses" <xref target="RFC3927" format="default" sectionFormat="of" derivedContent="RFC3927"/>.
        </t>
        <t indent="0" pn="section-a.1-2"> In the case where an IPv4 link-local address is formed, the
      bootstrap process would continue, as in an IPv6 case, by looking for
      a (circuit) proxy.
        </t>
      </section>
      <section anchor="IPv4dhcp" numbered="true" toc="include" removeInRFC="false" pn="section-a.2">
        <name slugifiedName="name-use-of-dhcpv4">Use of DHCPv4</name>
        <t indent="0" pn="section-a.2-1">
        The pledge <bcp14>MAY</bcp14> obtain an IP address via
        DHCP (<xref target="RFC2131" format="default" sectionFormat="of" derivedContent="RFC2131"/>. The DHCP-provided parameters for the Domain Name
        System can be used to perform DNS operations if all
        local discovery attempts fail.
        </t>
      </section>
    </section>
    <section anchor="mdnsmethods" numbered="true" toc="include" removeInRFC="false" pn="section-appendix.b">
      <name slugifiedName="name-mdns-dns-sd-proxy-discovery">mDNS / DNS-SD Proxy Discovery Options</name>
      <t indent="0" pn="section-appendix.b-1">Pledge discovery of the proxy (<xref target="discovery" format="default" sectionFormat="of" derivedContent="Section 4.1"/>) <bcp14>MAY</bcp14> be performed with DNS-based Service Discovery <xref target="RFC6763" format="default" sectionFormat="of" derivedContent="RFC6763"/> over Multicast DNS <xref target="RFC6762" format="default" sectionFormat="of" derivedContent="RFC6762"/> to discover the proxy at
      "_brski-proxy._tcp.local.". </t>
      <t indent="0" pn="section-appendix.b-2">Proxy discovery of the registrar (<xref target="JRCgrasp" format="default" sectionFormat="of" derivedContent="Section 4.3"/>) <bcp14>MAY</bcp14> be performed with DNS-based Service Discovery over Multicast DNS to discover registrars by searching for the service
        "_brski-registrar._tcp.local.".</t>
      <t indent="0" pn="section-appendix.b-3">
        To prevent unacceptable levels of
        network traffic, when using mDNS, the congestion avoidance mechanisms
        specified in
        <xref target="RFC6762" sectionFormat="comma" section="7" format="default" derivedLink="https://rfc-editor.org/rfc/rfc6762#section-7" derivedContent="RFC6762"/> <bcp14>MUST</bcp14> be followed. The
        pledge <bcp14>SHOULD</bcp14> listen for an unsolicited broadcast response as
        described in <xref target="RFC6762" format="default" sectionFormat="of" derivedContent="RFC6762"/>. This allows devices
        to avoid announcing their presence via mDNS broadcasts and
        instead silently join a network by watching for periodic
        unsolicited broadcast responses.
      </t>
      <t indent="0" pn="section-appendix.b-4">
        Discovery of the registrar <bcp14>MAY</bcp14> also be performed with DNS-based
        Service Discovery by searching for the service "_brski-registrar._tcp.example.com".
        In this case, the domain
        "example.com" is discovered as described in <xref target="RFC6763" sectionFormat="comma" section="11" format="default" derivedLink="https://rfc-editor.org/rfc/rfc6763#section-11" derivedContent="RFC6763"/> (<xref target="IPv4dhcp" format="default" sectionFormat="of" derivedContent="Appendix A.2"/> of this document
        suggests the use of DHCP parameters).
      </t>
      <t indent="0" pn="section-appendix.b-5">
        If no local proxy or registrar service is located using the GRASP
        mechanisms or the above-mentioned DNS-based Service Discovery
        methods, the pledge <bcp14>MAY</bcp14> contact a well-known
        manufacturer-provided bootstrapping server by performing a DNS
        lookup using a well-known URI such as
        "brski-registrar.manufacturer.example.com". The details of the URI are
        manufacturer specific. Manufacturers that leverage this method on the
        pledge
        are responsible for providing the registrar service.
        Also see <xref target="cloudregistrar" format="default" sectionFormat="of" derivedContent="Section 2.7"/>.
      </t>
      <t indent="0" pn="section-appendix.b-6">
        The current DNS services returned
          during each query are maintained until bootstrapping is completed. If
          bootstrapping fails and the pledge returns to the Discovery state, it
          picks up where it left off and continues attempting bootstrapping.
          For example, if the first Multicast DNS _bootstrapks._tcp.local
          response doesn't work, then the second and third responses are tried.
          If these fail, the pledge moves on to normal DNS-based Service
          Discovery.
      </t>
    </section>
    <section numbered="true" toc="include" removeInRFC="false" pn="section-appendix.c">
      <name slugifiedName="name-example-vouchers">Example Vouchers</name>
      <t indent="0" pn="section-appendix.c-1">
        Three entities are involved in a voucher: the MASA issues (signs)
        it, the registrar's public key is mentioned in it, and the
        pledge validates it.  In order to provide reproducible examples,
        the public and private keys for an example MASA and registrar are
        listed first.
      </t>
      <t indent="0" pn="section-appendix.c-2">
        The keys come from an open source reference implementation of BRSKI,
        called "Minerva" <xref target="minerva" format="default" sectionFormat="of" derivedContent="minerva"/>.
        It is available on GitHub <xref target="minervagithub" format="default" sectionFormat="of" derivedContent="minervagithub"/>.
        The keys presented here are used in the unit and integration tests.
        The MASA code is called "highway", the registrar code is called
        "fountain", and the example client is called "reach".
      </t>
      <t indent="0" pn="section-appendix.c-3">
        The public key components of each are presented as base64
        certificates and are decoded by openssl's x509
        utility so that the extensions can be seen.  This was version
        1.1.1c of the library and utility of <xref target="openssl" format="default" sectionFormat="of" derivedContent="openssl"/>.
      </t>
      <section numbered="true" toc="include" removeInRFC="false" pn="section-c.1">
        <name slugifiedName="name-keys-involved">Keys Involved</name>
        <t indent="0" pn="section-c.1-1">
          The manufacturer has a CA that signs the
          pledge's IDevID.  In addition, the Manufacturer's signing authority
          (the MASA) signs the vouchers, and that certificate must
          distributed to the devices at manufacturing time so that vouchers
          can be validated.
        </t>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.1.1">
          <name slugifiedName="name-manufacturer-certification-">Manufacturer Certification Authority for IDevID Signatures</name>
          <t indent="0" pn="section-c.1.1-1">
            This private key is the CA that signs IDevID certificates:
          </t>
          <sourcecode name="vendor.key" type="" markers="true" pn="section-c.1.1-2">
-----BEGIN EC PRIVATE KEY-----
MIGkAgEBBDCAYkoLW1IEA5SKKhMMdkTK7sJxk5ybKqYq9Yr5aR7tNwqXyLGS7z8G
8S4w/UJ58BqgBwYFK4EEACKhZANiAAQu5/yktJbFLjMC87h7b+yTreFuF8GwewKH
L4mS0r0dVAQubqDUQcTrjvpXrXCpTojiLCzgp8fzkcUDkZ9LD/M90LDipiLNIOkP
juF8QkoAbT8pMrY83MS8y76wZ7AalNQ=
-----END EC PRIVATE KEY-----
</sourcecode>
          <t indent="0" keepWithNext="true" pn="section-c.1.1-3">
            This public key validates IDevID certificates:
          </t>
          <t indent="0" pn="section-c.1.1-4">file: examples/vendor.key</t>
          <sourcecode name="vendor.cert" type="example-crypto-material" markers="true" pn="section-c.1.1-5">
Certificate:
    Data:
        Version: 3 (0x2)
        Serial Number: 1216069925 (0x487bc125)
        Signature Algorithm: ecdsa-with-SHA256
        Issuer: CN = highway-test.example.com CA
        Validity
            Not Before: Apr 13 20:34:24 2021 GMT
            Not After : Apr 13 20:34:24 2023 GMT
        Subject: CN = highway-test.example.com CA
        Subject Public Key Info:
            Public Key Algorithm: id-ecPublicKey
                Public-Key: (384 bit)
                pub:
                    04:2e:e7:fc:a4:b4:96:c5:2e:33:02:f3:b8:7b:6f:
                    ec:93:ad:e1:6e:17:c1:b0:7b:02:87:2f:89:92:d2:
                    bd:1d:54:04:2e:6e:a0:d4:41:c4:eb:8e:fa:57:ad:
                    70:a9:4e:88:e2:2c:2c:e0:a7:c7:f3:91:c5:03:91:
                    9f:4b:0f:f3:3d:d0:b0:e2:a6:22:cd:20:e9:0f:8e:
                    e1:7c:42:4a:00:6d:3f:29:32:b6:3c:dc:c4:bc:cb:
                    be:b0:67:b0:1a:94:d4
                ASN1 OID: secp384r1
                NIST CURVE: P-384
        X509v3 extensions:
            X509v3 Basic Constraints: critical
                CA:TRUE
            X509v3 Key Usage: critical
                Certificate Sign, CRL Sign
            X509v3 Subject Key Identifier:
                5E:0C:A9:52:5A:8C:DF:A9:0F:03:14:E9:96:F1:80:76:
                8C:53:8A:08
            X509v3 Authority Key Identifier:
                keyid:5E:0C:A9:52:5A:8C:DF:A9:0F:03:14:E9:96:F1:
                80:76:8C:53:8A:08

    Signature Algorithm: ecdsa-with-SHA256
         30:64:02:30:60:37:a0:66:89:80:27:e1:0d:e5:43:9a:62:f1:
         02:bc:0f:72:6d:a9:e9:cb:84:a5:c6:44:d3:41:9e:5d:ce:7d:
         46:16:6e:15:de:f7:cc:e8:3e:61:f9:03:7c:20:c4:b7:02:30:
         7f:e9:f3:12:bb:06:c6:24:00:2b:41:aa:21:6b:d8:25:ed:81:
         07:11:ef:66:8f:06:bf:c8:be:f0:58:74:24:45:39:4d:04:fc:
         31:69:6f:cf:db:fe:61:7b:c3:24:31:ff
-----BEGIN CERTIFICATE-----
MIIB3TCCAWSgAwIBAgIESHvBJTAKBggqhkjOPQQDAjAmMSQwIgYDVQQDDBtoaWdo
d2F5LXRlc3QuZXhhbXBsZS5jb20gQ0EwHhcNMjEwNDEzMjAzNDI0WhcNMjMwNDEz
MjAzNDI0WjAmMSQwIgYDVQQDDBtoaWdod2F5LXRlc3QuZXhhbXBsZS5jb20gQ0Ew
djAQBgcqhkjOPQIBBgUrgQQAIgNiAAQu5/yktJbFLjMC87h7b+yTreFuF8GwewKH
L4mS0r0dVAQubqDUQcTrjvpXrXCpTojiLCzgp8fzkcUDkZ9LD/M90LDipiLNIOkP
juF8QkoAbT8pMrY83MS8y76wZ7AalNSjYzBhMA8GA1UdEwEB/wQFMAMBAf8wDgYD
VR0PAQH/BAQDAgEGMB0GA1UdDgQWBBReDKlSWozfqQ8DFOmW8YB2jFOKCDAfBgNV
HSMEGDAWgBReDKlSWozfqQ8DFOmW8YB2jFOKCDAKBggqhkjOPQQDAgNnADBkAjBg
N6BmiYAn4Q3lQ5pi8QK8D3JtqenLhKXGRNNBnl3OfUYWbhXe98zoPmH5A3wgxLcC
MH/p8xK7BsYkACtBqiFr2CXtgQcR72aPBr/IvvBYdCRFOU0E/DFpb8/b/mF7wyQx
/w==
-----END CERTIFICATE-----

</sourcecode>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.1.2">
          <name slugifiedName="name-masa-key-pair-for-voucher-s">MASA Key Pair for Voucher Signatures</name>
          <t indent="0" pn="section-c.1.2-1">
            The MASA is the Manufacturer Authorized Signing Authority.  This
            key pair signs vouchers.  An example TLS certificate (see <xref target="brskimasatls" format="default" sectionFormat="of" derivedContent="Section 5.4"/>)
            HTTP authentication is not provided as it is a
            common form.
          </t>
          <t indent="0" pn="section-c.1.2-2">
            This private key signs the vouchers that are presented below:
          </t>
          <sourcecode name="masa.key" type="example-crypto-material" markers="true" pn="section-c.1.2-3">
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIFhdd0eDdzip67kXx72K+KHGJQYJHNy8pkiLJ6CcvxMGoAoGCCqGSM49
AwEHoUQDQgAEqgQVo0S54kT4yfkbBxumdHOcHrpsqbOpMKmiMln3oB1HAW25MJV+
gqi4tMFfSJ0iEwt8kszfWXK4rLgJS2mnpQ==
-----END EC PRIVATE KEY-----
</sourcecode>
          <t indent="0" keepWithNext="true" pn="section-c.1.2-4">
            This public key validates vouchers, and it has been signed by the
            CA above:
          </t>
          <t indent="0" pn="section-c.1.2-5">file: examples/masa.key</t>
          <sourcecode name="masa.cert" type="example-crypto-material" markers="true" pn="section-c.1.2-6">
Certificate:
    Data:
        Version: 3 (0x2)
        Serial Number: 193399345 (0xb870a31)
        Signature Algorithm: ecdsa-with-SHA256
        Issuer: CN = highway-test.example.com CA
        Validity
            Not Before: Apr 13 21:40:16 2021 GMT
            Not After : Apr 13 21:40:16 2023 GMT
        Subject: CN = highway-test.example.com MASA
        Subject Public Key Info:
            Public Key Algorithm: id-ecPublicKey
                Public-Key: (256 bit)
                pub:
                    04:aa:04:15:a3:44:b9:e2:44:f8:c9:f9:1b:07:1b:
                    a6:74:73:9c:1e:ba:6c:a9:b3:a9:30:a9:a2:32:59:
                    f7:a0:1d:47:01:6d:b9:30:95:7e:82:a8:b8:b4:c1:
                    5f:48:9d:22:13:0b:7c:92:cc:df:59:72:b8:ac:b8:
                    09:4b:69:a7:a5
                ASN1 OID: prime256v1
                NIST CURVE: P-256
        X509v3 extensions:
            X509v3 Basic Constraints: critical
                CA:FALSE
    Signature Algorithm: ecdsa-with-SHA256
         30:66:02:31:00:ae:cb:61:2d:d4:5c:8d:6e:86:aa:0b:06:1d:
         c6:d3:60:ba:32:73:36:25:d3:23:85:49:87:1c:ce:94:23:79:
         1a:9e:41:55:24:1d:15:22:a1:48:bb:0a:c0:ab:3c:13:73:02:
         31:00:86:3c:67:b3:95:a2:e2:e5:f9:ad:f9:1d:9c:c1:34:32:
         78:f5:cf:ea:d5:47:03:9f:00:bf:d0:59:cb:51:c2:98:04:81:
         24:8a:51:13:50:b1:75:b2:2f:9d:a8:b4:f4:b9
-----BEGIN CERTIFICATE-----
MIIBcDCB9qADAgECAgQLhwoxMAoGCCqGSM49BAMCMCYxJDAiBgNVBAMMG2hpZ2h3
YXktdGVzdC5leGFtcGxlLmNvbSBDQTAeFw0yMTA0MTMyMTQwMTZaFw0yMzA0MTMy
MTQwMTZaMCgxJjAkBgNVBAMMHWhpZ2h3YXktdGVzdC5leGFtcGxlLmNvbSBNQVNB
MFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAEqgQVo0S54kT4yfkbBxumdHOcHrps
qbOpMKmiMln3oB1HAW25MJV+gqi4tMFfSJ0iEwt8kszfWXK4rLgJS2mnpaMQMA4w
DAYDVR0TAQH/BAIwADAKBggqhkjOPQQDAgNpADBmAjEArsthLdRcjW6GqgsGHcbT
YLoyczYl0yOFSYcczpQjeRqeQVUkHRUioUi7CsCrPBNzAjEAhjxns5Wi4uX5rfkd
nME0Mnj1z+rVRwOfAL/QWctRwpgEgSSKURNQsXWyL52otPS5
-----END CERTIFICATE-----
</sourcecode>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.1.3">
          <name slugifiedName="name-registrar-certification-aut">Registrar Certification Authority</name>
          <t indent="0" pn="section-c.1.3-1">
            This CA enrolls the pledge once it is
            authorized, and it also signs the registrar's certificate.
          </t>
          <sourcecode name="ownerca_secp384r1.key" type="example-crypto-material" markers="true" pn="section-c.1.3-2">
-----BEGIN EC PRIVATE KEY-----
MIGkAgEBBDCHnLI0MSOLf8XndiZqoZdqblcPR5YSoPGhPOuFxWy1gFi9HbWv8b/R
EGdRgGEVSjKgBwYFK4EEACKhZANiAAQbf1m6F8MavGaNjGzgw/oxcQ9l9iKRvbdW
gAfb37h6pUVNeYpGlxlZljGxj2l9Mr48yD5bY7VG9qjVb5v5wPPTuRQ/ckdRpHbd
0vC/9cqPMAF/+MJf0/UgA0SLi/IHbLQ=
-----END EC PRIVATE KEY-----
</sourcecode>
          <t indent="0" keepWithNext="true" pn="section-c.1.3-3">
            The public key is indicated in a pledge voucher-request to show proximity.
          </t>
          <t indent="0" pn="section-c.1.3-4">file: examples/ownerca_secp384r1.key</t>
          <sourcecode name="ownerca_secp384r1.cert" type="example-crypto-material" markers="true" pn="section-c.1.3-5">
Certificate:
    Data:
        Version: 3 (0x2)
        Serial Number: 694879833 (0x296b0659)
        Signature Algorithm: ecdsa-with-SHA256
        Issuer: DC = ca, DC = sandelman,
         CN = fountain-test.example.com Unstrung Fountain Root CA
        Validity
            Not Before: Feb 25 21:31:45 2020 GMT
            Not After : Feb 24 21:31:45 2022 GMT
        Subject: DC = ca, DC = sandelman,
         CN = fountain-test.example.com Unstrung Fountain Root CA
        Subject Public Key Info:
            Public Key Algorithm: id-ecPublicKey
                Public-Key: (384 bit)
                pub:
                    04:1b:7f:59:ba:17:c3:1a:bc:66:8d:8c:6c:e0:c3:
                    fa:31:71:0f:65:f6:22:91:bd:b7:56:80:07:db:df:
                    b8:7a:a5:45:4d:79:8a:46:97:19:59:96:31:b1:8f:
                    69:7d:32:be:3c:c8:3e:5b:63:b5:46:f6:a8:d5:6f:
                    9b:f9:c0:f3:d3:b9:14:3f:72:47:51:a4:76:dd:d2:
                    f0:bf:f5:ca:8f:30:01:7f:f8:c2:5f:d3:f5:20:03:
                    44:8b:8b:f2:07:6c:b4
                ASN1 OID: secp384r1
                NIST CURVE: P-384
        X509v3 extensions:
            X509v3 Basic Constraints: critical
                CA:TRUE
            X509v3 Key Usage: critical
                Certificate Sign, CRL Sign
            X509v3 Subject Key Identifier:
                B9:A5:F6:CB:11:E1:07:A4:49:2C:A7:08:C6:7C:10:BC:
                87:B3:74:26
            X509v3 Authority Key Identifier:
                keyid:B9:A5:F6:CB:11:E1:07:A4:49:2C:A7:08:C6:7C:
                10:BC:87:B3:74:26

    Signature Algorithm: ecdsa-with-SHA256
         30:64:02:30:20:83:06:ce:8d:98:a4:54:7a:66:4c:4a:3a:70:
         c2:52:36:5a:52:8d:59:7d:20:9b:2a:69:14:58:87:38:d8:55:
         79:dd:fd:29:38:95:1e:91:93:76:b4:f5:66:29:44:b4:02:30:
         6f:38:f9:af:12:ed:30:d5:85:29:7c:b1:16:58:bd:67:91:43:
         c4:0d:30:f9:d8:1c:ac:2f:06:dd:bc:d5:06:42:2c:84:a2:04:
         ea:02:a4:5f:17:51:26:fb:d9:2f:d2:5c
-----BEGIN CERTIFICATE-----
MIICazCCAfKgAwIBAgIEKWsGWTAKBggqhkjOPQQDAjBtMRIwEAYKCZImiZPyLGQB
GRYCY2ExGTAXBgoJkiaJk/IsZAEZFglzYW5kZWxtYW4xPDA6BgNVBAMMM2ZvdW50
YWluLXRlc3QuZXhhbXBsZS5jb20gVW5zdHJ1bmcgRm91bnRhaW4gUm9vdCBDQTAe
Fw0yMDAyMjUyMTMxNDVaFw0yMjAyMjQyMTMxNDVaMG0xEjAQBgoJkiaJk/IsZAEZ
FgJjYTEZMBcGCgmSJomT8ixkARkWCXNhbmRlbG1hbjE8MDoGA1UEAwwzZm91bnRh
aW4tdGVzdC5leGFtcGxlLmNvbSBVbnN0cnVuZyBGb3VudGFpbiBSb290IENBMHYw
EAYHKoZIzj0CAQYFK4EEACIDYgAEG39ZuhfDGrxmjYxs4MP6MXEPZfYikb23VoAH
29+4eqVFTXmKRpcZWZYxsY9pfTK+PMg+W2O1Rvao1W+b+cDz07kUP3JHUaR23dLw
v/XKjzABf/jCX9P1IANEi4vyB2y0o2MwYTAPBgNVHRMBAf8EBTADAQH/MA4GA1Ud
DwEB/wQEAwIBBjAdBgNVHQ4EFgQUuaX2yxHhB6RJLKcIxnwQvIezdCYwHwYDVR0j
BBgwFoAUuaX2yxHhB6RJLKcIxnwQvIezdCYwCgYIKoZIzj0EAwIDZwAwZAIwIIMG
zo2YpFR6ZkxKOnDCUjZaUo1ZfSCbKmkUWIc42FV53f0pOJUekZN2tPVmKUS0AjBv
OPmvEu0w1YUpfLEWWL1nkUPEDTD52BysLwbdvNUGQiyEogTqAqRfF1Em+9kv0lw=
-----END CERTIFICATE-----
</sourcecode>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.1.4">
          <name slugifiedName="name-registrar-key-pair">Registrar Key Pair</name>
          <t indent="0" pn="section-c.1.4-1">
            The registrar is the representative of the domain owner.
            This key signs registrar voucher-requests and terminates
            the TLS connection from the pledge.
          </t>
          <sourcecode name="jrc_prime256v1.key" type="example-crypto-material" markers="true" pn="section-c.1.4-2">
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIFZodk+PC5Mu24+ra0sbOjKzan+dW5rvDAR7YuJUOC1YoAoGCCqGSM49
AwEHoUQDQgAElmVQcjS6n+Xd5l/28IFv6UiegQwSBztGj5dkK2MAjQIPV8l8lH+E
jLIOYdbJiI0VtEIf1/Jqt+TOBfinTNOLOg==
-----END EC PRIVATE KEY-----
</sourcecode>
          <t indent="0" pn="section-c.1.4-3">
            The public key is indicated in a pledge voucher-request to show proximity.
          </t>
          <sourcecode name="jrc_prime256v1.cert" type="example-crypto-material" markers="true" pn="section-c.1.4-4">
Certificate:
    Data:
        Version: 3 (0x2)
        Serial Number: 1066965842 (0x3f989b52)
        Signature Algorithm: ecdsa-with-SHA256
        Issuer: DC = ca, DC = sandelman,
         CN = fountain-test.example.com Unstrung Fountain Root CA
        Validity
            Not Before: Feb 25 21:31:54 2020 GMT
            Not After : Feb 24 21:31:54 2022 GMT
        Subject: DC = ca, DC = sandelman,
         CN = fountain-test.example.com
        Subject Public Key Info:
            Public Key Algorithm: id-ecPublicKey
                Public-Key: (256 bit)
                pub:
                    04:96:65:50:72:34:ba:9f:e5:dd:e6:5f:f6:f0:81:
                    6f:e9:48:9e:81:0c:12:07:3b:46:8f:97:64:2b:63:
                    00:8d:02:0f:57:c9:7c:94:7f:84:8c:b2:0e:61:d6:
                    c9:88:8d:15:b4:42:1f:d7:f2:6a:b7:e4:ce:05:f8:
                    a7:4c:d3:8b:3a
                ASN1 OID: prime256v1
                NIST CURVE: P-256
        X509v3 extensions:
            X509v3 Extended Key Usage: critical
                CMC Registration Authority
            X509v3 Key Usage: critical
                Digital Signature
    Signature Algorithm: ecdsa-with-SHA256
         30:65:02:30:66:4f:60:4c:55:48:1e:96:07:f8:dd:1f:b9:c8:
         12:8d:45:36:87:9b:23:c0:bc:bb:f1:cb:3d:26:15:56:6f:5f:
         1f:bf:d5:1c:0e:6a:09:af:1b:76:97:99:19:23:fd:7e:02:31:
         00:bc:ac:c3:41:b0:ba:0d:af:52:f9:9c:6e:7a:7f:00:1d:23:
         c8:62:01:61:bc:4b:c5:c0:47:99:35:0a:0c:77:61:44:01:4a:
         07:52:70:57:00:75:ff:be:07:0e:98:cb:e5
-----BEGIN CERTIFICATE-----
MIIB/DCCAYKgAwIBAgIEP5ibUjAKBggqhkjOPQQDAjBtMRIwEAYKCZImiZPyLGQB
GRYCY2ExGTAXBgoJkiaJk/IsZAEZFglzYW5kZWxtYW4xPDA6BgNVBAMMM2ZvdW50
YWluLXRlc3QuZXhhbXBsZS5jb20gVW5zdHJ1bmcgRm91bnRhaW4gUm9vdCBDQTAe
Fw0yMDAyMjUyMTMxNTRaFw0yMjAyMjQyMTMxNTRaMFMxEjAQBgoJkiaJk/IsZAEZ
FgJjYTEZMBcGCgmSJomT8ixkARkWCXNhbmRlbG1hbjEiMCAGA1UEAwwZZm91bnRh
aW4tdGVzdC5leGFtcGxlLmNvbTBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABJZl
UHI0up/l3eZf9vCBb+lInoEMEgc7Ro+XZCtjAI0CD1fJfJR/hIyyDmHWyYiNFbRC
H9fyarfkzgX4p0zTizqjKjAoMBYGA1UdJQEB/wQMMAoGCCsGAQUFBwMcMA4GA1Ud
DwEB/wQEAwIHgDAKBggqhkjOPQQDAgNoADBlAjBmT2BMVUgelgf43R+5yBKNRTaH
myPAvLvxyz0mFVZvXx+/1RwOagmvG3aXmRkj/X4CMQC8rMNBsLoNr1L5nG56fwAd
I8hiAWG8S8XAR5k1Cgx3YUQBSgdScFcAdf++Bw6Yy+U=
-----END CERTIFICATE-----
</sourcecode>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.1.5">
          <name slugifiedName="name-pledge-key-pair">Pledge Key Pair</name>
          <t indent="0" pn="section-c.1.5-1">
            The pledge has an IDevID key pair built in at manufacturing time:
          </t>
          <sourcecode name="idevid_00-D0-E5-F2-00-02.key" type="example-crypto-material" markers="true" pn="section-c.1.5-2">
-----BEGIN EC PRIVATE KEY-----
MHcCAQEEIBHNh6r8QRevRuo+tEmBJeFjQKf6bpFA/9NGoltv+9sNoAoGCCqGSM49
AwEHoUQDQgAEA6N1Q4ezfMAKmoecrfb0OBMc1AyEH+BATkF58FsTSyBxs0SbSWLx
FjDOuwB9gLGn2TsTUJumJ6VPw5Z/TP4hJw==
-----END EC PRIVATE KEY-----
</sourcecode>
          <t indent="0" pn="section-c.1.5-3">
            The certificate is used by the registrar to find the MASA.
          </t>
          <sourcecode name="idevid_00-D0-E5-F2-00-02.cert" type="example-crypto-material" markers="true" pn="section-c.1.5-4">
Certificate:
    Data:
        Version: 3 (0x2)
        Serial Number: 521731815 (0x1f18fee7)
        Signature Algorithm: ecdsa-with-SHA256
        Issuer: CN = highway-test.example.com CA
        Validity
            Not Before: Apr 27 18:29:30 2021 GMT
            Not After : Dec 31 00:00:00 2999 GMT
        Subject: serialNumber = 00-D0-E5-F2-00-02
        Subject Public Key Info:
            Public Key Algorithm: id-ecPublicKey
                Public-Key: (256 bit)
                pub:
                    04:03:a3:75:43:87:b3:7c:c0:0a:9a:87:9c:ad:f6:
                    f4:38:13:1c:d4:0c:84:1f:e0:40:4e:41:79:f0:5b:
                    13:4b:20:71:b3:44:9b:49:62:f1:16:30:ce:bb:00:
                    7d:80:b1:a7:d9:3b:13:50:9b:a6:27:a5:4f:c3:96:
                    7f:4c:fe:21:27
                ASN1 OID: prime256v1
                NIST CURVE: P-256
        X509v3 extensions:
            X509v3 Subject Key Identifier:
                45:88:CC:96:96:00:64:37:B0:BA:23:65:64:64:54:08:
                06:6C:56:AD
            X509v3 Basic Constraints:
                CA:FALSE
            1.3.6.1.5.5.7.1.32:
                ..highway-test.example.com:9443
    Signature Algorithm: ecdsa-with-SHA256
         30:65:02:30:62:2a:db:be:34:f7:1b:cb:85:de:26:8e:43:00:
         f9:0d:88:c8:77:a8:dd:3c:08:40:54:bc:ec:3d:b6:dc:70:2b:
         c3:7f:ca:19:21:9a:a0:ab:c5:51:8e:aa:df:36:de:8b:02:31:
         00:b2:5d:59:f8:47:c7:ed:03:97:a8:c0:c7:a8:81:fa:a8:86:
         ed:67:64:37:51:7a:6e:9c:a3:82:4d:6d:ad:bc:f3:35:9e:9d:
         6a:a2:6d:7f:7f:25:1c:03:ef:f0:ba:9b:71
-----BEGIN CERTIFICATE-----
MIIBrzCCATWgAwIBAgIEHxj+5zAKBggqhkjOPQQDAjAmMSQwIgYDVQQDDBtoaWdo
d2F5LXRlc3QuZXhhbXBsZS5jb20gQ0EwIBcNMjEwNDI3MTgyOTMwWhgPMjk5OTEy
MzEwMDAwMDBaMBwxGjAYBgNVBAUTETAwLUQwLUU1LUYyLTAwLTAyMFkwEwYHKoZI
zj0CAQYIKoZIzj0DAQcDQgAEA6N1Q4ezfMAKmoecrfb0OBMc1AyEH+BATkF58FsT
SyBxs0SbSWLxFjDOuwB9gLGn2TsTUJumJ6VPw5Z/TP4hJ6NZMFcwHQYDVR0OBBYE
FEWIzJaWAGQ3sLojZWRkVAgGbFatMAkGA1UdEwQCMAAwKwYIKwYBBQUHASAEHxYd
aGlnaHdheS10ZXN0LmV4YW1wbGUuY29tOjk0NDMwCgYIKoZIzj0EAwIDaAAwZQIw
YirbvjT3G8uF3iaOQwD5DYjId6jdPAhAVLzsPbbccCvDf8oZIZqgq8VRjqrfNt6L
AjEAsl1Z+EfH7QOXqMDHqIH6qIbtZ2Q3UXpunKOCTW2tvPM1np1qom1/fyUcA+/w
uptx
-----END CERTIFICATE-----


</sourcecode>
        </section>
      </section>
      <section anchor="exampleprocess" numbered="true" toc="include" removeInRFC="false" pn="section-c.2">
        <name slugifiedName="name-example-process">Example Process</name>
        <t indent="0" pn="section-c.2-1">
          The JSON examples below are wrapped at 60 columns.
          This results in strings that have newlines in them, which
          makes them invalid JSON as is.  The strings would otherwise
          be too long, so they need to be unwrapped before processing.
        </t>
        <t indent="0" pn="section-c.2-2">

          For readability, the output of the asn1parse has been truncated at
          68 columns rather than wrapped.
        </t>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.2.1">
          <name slugifiedName="name-pledge-to-registrar">Pledge to Registrar</name>
          <t indent="0" pn="section-c.2.1-1">
            As described in <xref target="RequestVoucherFromRegistrar" format="default" sectionFormat="of" derivedContent="Section 5.2"/>,
            the pledge will sign a pledge voucher-request containing the
            registrar's public key in the proximity-registrar-cert field.
            The base64 has been wrapped at 60 characters for presentation reasons.
          </t>
          <sourcecode name="vr_00-D0-E5-F2-00-02.b64" type="" markers="true" pn="section-c.2.1-2">
MIIGcAYJKoZIhvcNAQcCoIIGYTCCBl0CAQExDTALBglghkgBZQMEAgEwggOJBgkqhkiG
9w0BBwGgggN6BIIDdnsiaWV0Zi12b3VjaGVyLXJlcXVlc3Q6dm91Y2hlciI6eyJhc3Nl
cnRpb24iOiJwcm94aW1pdHkiLCJjcmVhdGVkLW9uIjoiMjAyMS0wNC0xM1QxNzo0Mzoy
My43NDctMDQ6MDAiLCJzZXJpYWwtbnVtYmVyIjoiMDAtRDAtRTUtRjItMDAtMDIiLCJu
b25jZSI6Ii1fWEU5eks5cThMbDFxeWxNdExLZWciLCJwcm94aW1pdHktcmVnaXN0cmFy
LWNlcnQiOiJNSUlCL0RDQ0FZS2dBd0lCQWdJRVA1aWJVakFLQmdncWhrak9QUVFEQWpC
dE1SSXdFQVlLQ1pJbWlaUHlMR1FCR1JZQ1kyRXhHVEFYQmdvSmtpYUprL0lzWkFFWkZn
bHpZVzVrWld4dFlXNHhQREE2QmdOVkJBTU1NMlp2ZFc1MFlXbHVMWFJsYzNRdVpYaGhi
WEJzWlM1amIyMGdWVzV6ZEhKMWJtY2dSbTkxYm5SaGFXNGdVbTl2ZENCRFFUQWVGdzB5
TURBeU1qVXlNVE14TlRSYUZ3MHlNakF5TWpReU1UTXhOVFJhTUZNeEVqQVFCZ29Ka2lh
SmsvSXNaQUVaRmdKallURVpNQmNHQ2dtU0pvbVQ4aXhrQVJrV0NYTmhibVJsYkcxaGJq
RWlNQ0FHQTFVRUF3d1pabTkxYm5SaGFXNHRkR1Z6ZEM1bGVHRnRjR3hsTG1OdmJUQlpN
Qk1HQnlxR1NNNDlBZ0VHQ0NxR1NNNDlBd0VIQTBJQUJKWmxVSEkwdXAvbDNlWmY5dkNC
YitsSW5vRU1FZ2M3Um8rWFpDdGpBSTBDRDFmSmZKUi9oSXl5RG1IV3lZaU5GYlJDSDlm
eWFyZmt6Z1g0cDB6VGl6cWpLakFvTUJZR0ExVWRKUUVCL3dRTU1Bb0dDQ3NHQVFVRkJ3
TWNNQTRHQTFVZER3RUIvd1FFQXdJSGdEQUtCZ2dxaGtqT1BRUURBZ05vQURCbEFqQm1U
MkJNVlVnZWxnZjQzUis1eUJLTlJUYUhteVBBdkx2eHl6MG1GVlp2WHgrLzFSd09hZ212
RzNhWG1Sa2ovWDRDTVFDOHJNTkJzTG9OcjFMNW5HNTZmd0FkSThoaUFXRzhTOFhBUjVr
MUNneDNZVVFCU2dkU2NGY0FkZisrQnc2WXkrVT0ifX2gggGyMIIBrjCCATWgAwIBAgIE
DYOv2TAKBggqhkjOPQQDAjAmMSQwIgYDVQQDDBtoaWdod2F5LXRlc3QuZXhhbXBsZS5j
b20gQ0EwIBcNMjEwNDEzMjAzNzM5WhgPMjk5OTEyMzEwMDAwMDBaMBwxGjAYBgNVBAUM
ETAwLUQwLUU1LUYyLTAwLTAyMFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAEA6N1Q4ez
fMAKmoecrfb0OBMc1AyEH+BATkF58FsTSyBxs0SbSWLxFjDOuwB9gLGn2TsTUJumJ6VP
w5Z/TP4hJ6NZMFcwHQYDVR0OBBYEFEWIzJaWAGQ3sLojZWRkVAgGbFatMAkGA1UdEwQC
MAAwKwYIKwYBBQUHASAEHxYdaGlnaHdheS10ZXN0LmV4YW1wbGUuY29tOjk0NDMwCgYI
KoZIzj0EAwIDZwAwZAIwTmlG8sXkKGNbwbKQcYMapFbmSbnHHURFUoFuRqvbgYX7FlXp
BczfwF2kllNuujigAjAow1kc4r55EmiH+OMEXjBNlWlBSZC5QuJjEf0Jsmxssc+pucjO
J4ShqnexMEy7bjAxggEEMIIBAAIBATAuMCYxJDAiBgNVBAMMG2hpZ2h3YXktdGVzdC5l
eGFtcGxlLmNvbSBDQQIEDYOv2TALBglghkgBZQMEAgGgaTAYBgkqhkiG9w0BCQMxCwYJ
KoZIhvcNAQcBMBwGCSqGSIb3DQEJBTEPFw0yMTA0MTMyMTQzMjNaMC8GCSqGSIb3DQEJ
BDEiBCBJwhyYibIjeqeR3bOaLURzMlGrc3F2X+kvJ1errtoCtTAKBggqhkjOPQQDAgRH
MEUCIQCmYuCE61HFQXH/E16GDOCsVquDtgr+Q/6/Du/9QkzA7gIgf7MFhAIPW2PNwRa2
vZFQAKXUbimkiHKzXBA8md0VHbU=
</sourcecode>
          <t indent="0" keepWithNext="true" pn="section-c.2.1-3">
            The ASN1 decoding of the artifact:
          </t>
          <t indent="0" pn="section-c.2.1-4">file: examples/vr_00-D0-E5-F2-00-02.b64</t>
          <artwork name="" type="" align="left" alt="" pn="section-c.2.1-5">
    0:d=0  hl=4 l=1648 cons: SEQUENCE
    4:d=1  hl=2 l=   9 prim: OBJECT            :pkcs7-signedData
   15:d=1  hl=4 l=1633 cons: cont [ 0 ]
   19:d=2  hl=4 l=1629 cons: SEQUENCE
   23:d=3  hl=2 l=   1 prim: INTEGER           :01
   26:d=3  hl=2 l=  13 cons: SET
   28:d=4  hl=2 l=  11 cons: SEQUENCE
   30:d=5  hl=2 l=   9 prim: OBJECT            :sha256
   41:d=3  hl=4 l= 905 cons: SEQUENCE
   45:d=4  hl=2 l=   9 prim: OBJECT            :pkcs7-data
   56:d=4  hl=4 l= 890 cons: cont [ 0 ]
   60:d=5  hl=4 l= 886 prim: OCTET STRING      :{"ietf-voucher-request:v
  950:d=3  hl=4 l= 434 cons: cont [ 0 ]
  954:d=4  hl=4 l= 430 cons: SEQUENCE
  958:d=5  hl=4 l= 309 cons: SEQUENCE
  962:d=6  hl=2 l=   3 cons: cont [ 0 ]
  964:d=7  hl=2 l=   1 prim: INTEGER           :02
  967:d=6  hl=2 l=   4 prim: INTEGER           :0D83AFD9
  973:d=6  hl=2 l=  10 cons: SEQUENCE
  975:d=7  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
  985:d=6  hl=2 l=  38 cons: SEQUENCE
  987:d=7  hl=2 l=  36 cons: SET
  989:d=8  hl=2 l=  34 cons: SEQUENCE
  991:d=9  hl=2 l=   3 prim: OBJECT            :commonName
  996:d=9  hl=2 l=  27 prim: UTF8STRING        :highway-test.example.com
 1025:d=6  hl=2 l=  32 cons: SEQUENCE
 1027:d=7  hl=2 l=  13 prim: UTCTIME           :210413203739Z
 1042:d=7  hl=2 l=  15 prim: GENERALIZEDTIME   :29991231000000Z
 1059:d=6  hl=2 l=  28 cons: SEQUENCE
 1061:d=7  hl=2 l=  26 cons: SET
 1063:d=8  hl=2 l=  24 cons: SEQUENCE
 1065:d=9  hl=2 l=   3 prim: OBJECT            :serialNumber
 1070:d=9  hl=2 l=  17 prim: UTF8STRING        :00-D0-E5-F2-00-02
 1089:d=6  hl=2 l=  89 cons: SEQUENCE
 1091:d=7  hl=2 l=  19 cons: SEQUENCE
 1093:d=8  hl=2 l=   7 prim: OBJECT            :id-ecPublicKey
 1102:d=8  hl=2 l=   8 prim: OBJECT            :prime256v1
 1112:d=7  hl=2 l=  66 prim: BIT STRING
 1180:d=6  hl=2 l=  89 cons: cont [ 3 ]
 1182:d=7  hl=2 l=  87 cons: SEQUENCE
 1184:d=8  hl=2 l=  29 cons: SEQUENCE
 1186:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Subject Key Ident
 1191:d=9  hl=2 l=  22 prim: OCTET STRING      [HEX DUMP]:04144588CC9696
 1215:d=8  hl=2 l=   9 cons: SEQUENCE
 1217:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Basic Constraints
 1222:d=9  hl=2 l=   2 prim: OCTET STRING      [HEX DUMP]:3000
 1226:d=8  hl=2 l=  43 cons: SEQUENCE
 1228:d=9  hl=2 l=   8 prim: OBJECT            :1.3.6.1.5.5.7.1.32
 1238:d=9  hl=2 l=  31 prim: OCTET STRING      [HEX DUMP]:161D6869676877
 1271:d=5  hl=2 l=  10 cons: SEQUENCE
 1273:d=6  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 1283:d=5  hl=2 l= 103 prim: BIT STRING
 1388:d=3  hl=4 l= 260 cons: SET
 1392:d=4  hl=4 l= 256 cons: SEQUENCE
 1396:d=5  hl=2 l=   1 prim: INTEGER           :01
 1399:d=5  hl=2 l=  46 cons: SEQUENCE
 1401:d=6  hl=2 l=  38 cons: SEQUENCE
 1403:d=7  hl=2 l=  36 cons: SET
 1405:d=8  hl=2 l=  34 cons: SEQUENCE
 1407:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 1412:d=9  hl=2 l=  27 prim: UTF8STRING        :highway-test.example.com
 1441:d=6  hl=2 l=   4 prim: INTEGER           :0D83AFD9
 1447:d=5  hl=2 l=  11 cons: SEQUENCE
 1449:d=6  hl=2 l=   9 prim: OBJECT            :sha256
 1460:d=5  hl=2 l= 105 cons: cont [ 0 ]
 1462:d=6  hl=2 l=  24 cons: SEQUENCE
 1464:d=7  hl=2 l=   9 prim: OBJECT            :contentType
 1475:d=7  hl=2 l=  11 cons: SET
 1477:d=8  hl=2 l=   9 prim: OBJECT            :pkcs7-data
 1488:d=6  hl=2 l=  28 cons: SEQUENCE
 1490:d=7  hl=2 l=   9 prim: OBJECT            :signingTime
 1501:d=7  hl=2 l=  15 cons: SET
 1503:d=8  hl=2 l=  13 prim: UTCTIME           :210413214323Z
 1518:d=6  hl=2 l=  47 cons: SEQUENCE
 1520:d=7  hl=2 l=   9 prim: OBJECT            :messageDigest
 1531:d=7  hl=2 l=  34 cons: SET
 1533:d=8  hl=2 l=  32 prim: OCTET STRING      [HEX DUMP]:49C21C9889B223
 1567:d=5  hl=2 l=  10 cons: SEQUENCE
 1569:d=6  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 1579:d=5  hl=2 l=  71 prim: OCTET STRING      [HEX DUMP]:3045022100A662

</artwork>
          <t indent="0" pn="section-c.2.1-6">
            The JSON contained in the voucher-request:
          </t>
          <sourcecode type="json" markers="false" pn="section-c.2.1-7">
{"ietf-voucher-request:voucher":{"assertion":"proximity","cr
eated-on":"2021-04-13T17:43:23.747-04:00","serial-number":"0
0-D0-E5-F2-00-02","nonce":"-_XE9zK9q8Ll1qylMtLKeg","proximit
y-registrar-cert":"MIIB/DCCAYKgAwIBAgIEP5ibUjAKBggqhkjOPQQDA
jBtMRIwEAYKCZImiZPyLGQBGRYCY2ExGTAXBgoJkiaJk/IsZAEZFglzYW5kZ
WxtYW4xPDA6BgNVBAMMM2ZvdW50YWluLXRlc3QuZXhhbXBsZS5jb20gVW5zd
HJ1bmcgRm91bnRhaW4gUm9vdCBDQTAeFw0yMDAyMjUyMTMxNTRaFw0yMjAyM
jQyMTMxNTRaMFMxEjAQBgoJkiaJk/IsZAEZFgJjYTEZMBcGCgmSJomT8ixkA
RkWCXNhbmRlbG1hbjEiMCAGA1UEAwwZZm91bnRhaW4tdGVzdC5leGFtcGxlL
mNvbTBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABJZlUHI0up/l3eZf9vCBb
+lInoEMEgc7Ro+XZCtjAI0CD1fJfJR/hIyyDmHWyYiNFbRCH9fyarfkzgX4p
0zTizqjKjAoMBYGA1UdJQEB/wQMMAoGCCsGAQUFBwMcMA4GA1UdDwEB/wQEA
wIHgDAKBggqhkjOPQQDAgNoADBlAjBmT2BMVUgelgf43R+5yBKNRTaHmyPAv
Lvxyz0mFVZvXx+/1RwOagmvG3aXmRkj/X4CMQC8rMNBsLoNr1L5nG56fwAdI
8hiAWG8S8XAR5k1Cgx3YUQBSgdScFcAdf++Bw6Yy+U="}}
</sourcecode>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.2.2">
          <name slugifiedName="name-registrar-to-masa">Registrar to MASA</name>
          <t indent="0" pn="section-c.2.2-1">
            As described in <xref target="RequestVoucherFromMASA" format="default" sectionFormat="of" derivedContent="Section 5.5"/>,
            the registrar will sign a registrar voucher-request and will
            include the pledge's voucher-request in the prior-signed-voucher-request.
          </t>
          <sourcecode name="parboiled_vr_00-D0-E5-F2-00-02.b64" type="" markers="true" pn="section-c.2.2-2">
MIIPYwYJKoZIhvcNAQcCoIIPVDCCD1ACAQExDTALBglghkgBZQMEAgEwggl4BgkqhkiG
9w0BBwGggglpBIIJZXsiaWV0Zi12b3VjaGVyLXJlcXVlc3Q6dm91Y2hlciI6eyJhc3Nl
cnRpb24iOiJwcm94aW1pdHkiLCJjcmVhdGVkLW9uIjoiMjAyMS0wNC0xM1QyMTo0Mzoy
My43ODdaIiwic2VyaWFsLW51bWJlciI6IjAwLUQwLUU1LUYyLTAwLTAyIiwibm9uY2Ui
OiItX1hFOXpLOXE4TGwxcXlsTXRMS2VnIiwicHJpb3Itc2lnbmVkLXZvdWNoZXItcmVx
dWVzdCI6Ik1JSUdjQVlKS29aSWh2Y05BUWNDb0lJR1lUQ0NCbDBDQVFFeERUQUxCZ2xn
aGtnQlpRTUVBZ0V3Z2dPSkJna3Foa2lHOXcwQkJ3R2dnZ042QklJRGRuc2lhV1YwWmkx
MmIzVmphR1Z5TFhKbGNYVmxjM1E2ZG05MVkyaGxjaUk2ZXlKaGMzTmxjblJwYjI0aU9p
SndjbTk0YVcxcGRIa2lMQ0pqY21WaGRHVmtMVzl1SWpvaU1qQXlNUzB3TkMweE0xUXhO
em8wTXpveU15NDNORGN0TURRNk1EQWlMQ0p6WlhKcFlXd3RiblZ0WW1WeUlqb2lNREF0
UkRBdFJUVXRSakl0TURBdE1ESWlMQ0p1YjI1alpTSTZJaTFmV0VVNWVrczVjVGhNYkRG
eGVXeE5kRXhMWldjaUxDSndjbTk0YVcxcGRIa3RjbVZuYVhOMGNtRnlMV05sY25RaU9p
Sk5TVWxDTDBSRFEwRlpTMmRCZDBsQ1FXZEpSVkExYVdKVmFrRkxRbWRuY1docmFrOVFV
VkZFUVdwQ2RFMVNTWGRGUVZsTFExcEpiV2xhVUhsTVIxRkNSMUpaUTFreVJYaEhWRUZZ
UW1kdlNtdHBZVXByTDBseldrRkZXa1puYkhwWlZ6VnJXbGQ0ZEZsWE5IaFFSRUUyUW1k
T1ZrSkJUVTFOTWxwMlpGYzFNRmxYYkhWTVdGSnNZek5SZFZwWWFHaGlXRUp6V2xNMWFt
SXlNR2RXVnpWNlpFaEtNV0p0WTJkU2JUa3hZbTVTYUdGWE5HZFZiVGwyWkVOQ1JGRlVR
V1ZHZHpCNVRVUkJlVTFxVlhsTlZFMTRUbFJTWVVaM01IbE5ha0Y1VFdwUmVVMVVUWGhP
VkZKaFRVWk5lRVZxUVZGQ1oyOUthMmxoU21zdlNYTmFRVVZhUm1kS2FsbFVSVnBOUW1O
SFEyZHRVMHB2YlZRNGFYaHJRVkpyVjBOWVRtaGliVkpzWWtjeGFHSnFSV2xOUTBGSFFU
RlZSVUYzZDFwYWJUa3hZbTVTYUdGWE5IUmtSMVo2WkVNMWJHVkhSblJqUjNoc1RHMU9k
bUpVUWxwTlFrMUhRbmx4UjFOTk5EbEJaMFZIUTBOeFIxTk5ORGxCZDBWSVFUQkpRVUpL
V214VlNFa3dkWEF2YkRObFdtWTVka05DWWl0c1NXNXZSVTFGWjJNM1VtOHJXRnBEZEdw
QlNUQkRSREZtU21aS1VpOW9TWGw1UkcxSVYzbFphVTVHWWxKRFNEbG1lV0Z5Wm10Nlox
ZzBjREI2VkdsNmNXcExha0Z2VFVKWlIwRXhWV1JLVVVWQ0wzZFJUVTFCYjBkRFEzTkhR
VkZWUmtKM1RXTk5RVFJIUVRGVlpFUjNSVUl2ZDFGRlFYZEpTR2RFUVV0Q1oyZHhhR3Rx
VDFCUlVVUkJaMDV2UVVSQ2JFRnFRbTFVTWtKTlZsVm5aV3huWmpRelVpczFlVUpMVGxK
VVlVaHRlVkJCZGt4MmVIbDZNRzFHVmxwMldIZ3JMekZTZDA5aFoyMTJSek5oV0cxU2Ey
b3ZXRFJEVFZGRE9ISk5Ua0p6VEc5T2NqRk1OVzVITlRabWQwRmtTVGhvYVVGWFJ6aFRP
RmhCVWpWck1VTm5lRE5aVlZGQ1UyZGtVMk5HWTBGa1ppc3JRbmMyV1hrclZUMGlmWDJn
Z2dHeU1JSUJyakNDQVRXZ0F3SUJBZ0lFRFlPdjJUQUtCZ2dxaGtqT1BRUURBakFtTVNR
d0lnWURWUVFEREJ0b2FXZG9kMkY1TFhSbGMzUXVaWGhoYlhCc1pTNWpiMjBnUTBFd0lC
Y05NakV3TkRFek1qQXpOek01V2hnUE1qazVPVEV5TXpFd01EQXdNREJhTUJ3eEdqQVlC
Z05WQkFVTUVUQXdMVVF3TFVVMUxVWXlMVEF3TFRBeU1Ga3dFd1lIS29aSXpqMENBUVlJ
S29aSXpqMERBUWNEUWdBRUE2TjFRNGV6Zk1BS21vZWNyZmIwT0JNYzFBeUVIK0JBVGtG
NThGc1RTeUJ4czBTYlNXTHhGakRPdXdCOWdMR24yVHNUVUp1bUo2VlB3NVovVFA0aEo2
TlpNRmN3SFFZRFZSME9CQllFRkVXSXpKYVdBR1Ezc0xvalpXUmtWQWdHYkZhdE1Ba0dB
MVVkRXdRQ01BQXdLd1lJS3dZQkJRVUhBU0FFSHhZZGFHbG5hSGRoZVMxMFpYTjBMbVY0
WVcxd2JHVXVZMjl0T2prME5ETXdDZ1lJS29aSXpqMEVBd0lEWndBd1pBSXdUbWxHOHNY
a0tHTmJ3YktRY1lNYXBGYm1TYm5ISFVSRlVvRnVScXZiZ1lYN0ZsWHBCY3pmd0Yya2xs
TnV1amlnQWpBb3cxa2M0cjU1RW1pSCtPTUVYakJObFdsQlNaQzVRdUpqRWYwSnNteHNz
YytwdWNqT0o0U2hxbmV4TUV5N2JqQXhnZ0VFTUlJQkFBSUJBVEF1TUNZeEpEQWlCZ05W
QkFNTUcyaHBaMmgzWVhrdGRHVnpkQzVsZUdGdGNHeGxMbU52YlNCRFFRSUVEWU92MlRB
TEJnbGdoa2dCWlFNRUFnR2dhVEFZQmdrcWhraUc5dzBCQ1FNeEN3WUpLb1pJaHZjTkFR
Y0JNQndHQ1NxR1NJYjNEUUVKQlRFUEZ3MHlNVEEwTVRNeU1UUXpNak5hTUM4R0NTcUdT
SWIzRFFFSkJERWlCQ0JKd2h5WWliSWplcWVSM2JPYUxVUnpNbEdyYzNGMlgra3ZKMWVy
cnRvQ3RUQUtCZ2dxaGtqT1BRUURBZ1JITUVVQ0lRQ21ZdUNFNjFIRlFYSC9FMTZHRE9D
c1ZxdUR0Z3IrUS82L0R1LzlRa3pBN2dJZ2Y3TUZoQUlQVzJQTndSYTJ2WkZRQUtYVWJp
bWtpSEt6WEJBOG1kMFZIYlU9In19oIIEbzCCAfwwggGCoAMCAQICBD+Ym1IwCgYIKoZI
zj0EAwIwbTESMBAGCgmSJomT8ixkARkWAmNhMRkwFwYKCZImiZPyLGQBGRYJc2FuZGVs
bWFuMTwwOgYDVQQDDDNmb3VudGFpbi10ZXN0LmV4YW1wbGUuY29tIFVuc3RydW5nIEZv
dW50YWluIFJvb3QgQ0EwHhcNMjAwMjI1MjEzMTU0WhcNMjIwMjI0MjEzMTU0WjBTMRIw
EAYKCZImiZPyLGQBGRYCY2ExGTAXBgoJkiaJk/IsZAEZFglzYW5kZWxtYW4xIjAgBgNV
BAMMGWZvdW50YWluLXRlc3QuZXhhbXBsZS5jb20wWTATBgcqhkjOPQIBBggqhkjOPQMB
BwNCAASWZVByNLqf5d3mX/bwgW/pSJ6BDBIHO0aPl2QrYwCNAg9XyXyUf4SMsg5h1smI
jRW0Qh/X8mq35M4F+KdM04s6oyowKDAWBgNVHSUBAf8EDDAKBggrBgEFBQcDHDAOBgNV
HQ8BAf8EBAMCB4AwCgYIKoZIzj0EAwIDaAAwZQIwZk9gTFVIHpYH+N0fucgSjUU2h5sj
wLy78cs9JhVWb18fv9UcDmoJrxt2l5kZI/1+AjEAvKzDQbC6Da9S+Zxuen8AHSPIYgFh
vEvFwEeZNQoMd2FEAUoHUnBXAHX/vgcOmMvlMIICazCCAfKgAwIBAgIEKWsGWTAKBggq
hkjOPQQDAjBtMRIwEAYKCZImiZPyLGQBGRYCY2ExGTAXBgoJkiaJk/IsZAEZFglzYW5k
ZWxtYW4xPDA6BgNVBAMMM2ZvdW50YWluLXRlc3QuZXhhbXBsZS5jb20gVW5zdHJ1bmcg
Rm91bnRhaW4gUm9vdCBDQTAeFw0yMDAyMjUyMTMxNDVaFw0yMjAyMjQyMTMxNDVaMG0x
EjAQBgoJkiaJk/IsZAEZFgJjYTEZMBcGCgmSJomT8ixkARkWCXNhbmRlbG1hbjE8MDoG
A1UEAwwzZm91bnRhaW4tdGVzdC5leGFtcGxlLmNvbSBVbnN0cnVuZyBGb3VudGFpbiBS
b290IENBMHYwEAYHKoZIzj0CAQYFK4EEACIDYgAEG39ZuhfDGrxmjYxs4MP6MXEPZfYi
kb23VoAH29+4eqVFTXmKRpcZWZYxsY9pfTK+PMg+W2O1Rvao1W+b+cDz07kUP3JHUaR2
3dLwv/XKjzABf/jCX9P1IANEi4vyB2y0o2MwYTAPBgNVHRMBAf8EBTADAQH/MA4GA1Ud
DwEB/wQEAwIBBjAdBgNVHQ4EFgQUuaX2yxHhB6RJLKcIxnwQvIezdCYwHwYDVR0jBBgw
FoAUuaX2yxHhB6RJLKcIxnwQvIezdCYwCgYIKoZIzj0EAwIDZwAwZAIwIIMGzo2YpFR6
ZkxKOnDCUjZaUo1ZfSCbKmkUWIc42FV53f0pOJUekZN2tPVmKUS0AjBvOPmvEu0w1YUp
fLEWWL1nkUPEDTD52BysLwbdvNUGQiyEogTqAqRfF1Em+9kv0lwxggFLMIIBRwIBATB1
MG0xEjAQBgoJkiaJk/IsZAEZFgJjYTEZMBcGCgmSJomT8ixkARkWCXNhbmRlbG1hbjE8
MDoGA1UEAwwzZm91bnRhaW4tdGVzdC5leGFtcGxlLmNvbSBVbnN0cnVuZyBGb3VudGFp
biBSb290IENBAgQ/mJtSMAsGCWCGSAFlAwQCAaBpMBgGCSqGSIb3DQEJAzELBgkqhkiG
9w0BBwEwHAYJKoZIhvcNAQkFMQ8XDTIxMDQxMzIxNDMyM1owLwYJKoZIhvcNAQkEMSIE
IEnOrdWjlG70K74IhCJ7UXi+wPS+r2C8DFEqjabGP+G8MAoGCCqGSM49BAMCBEcwRQIh
AMhO3M+tSWb2wKTBOXPArN+XvjSzAhaQA/uLj3qhPwi/AiBDDthf6mjMuirqXE0yjMif
C2UY9oNUFF9Nl0wEQpBBAA==
</sourcecode>
          <t indent="0" keepWithNext="true" pn="section-c.2.2-3">
            The ASN1 decoding of the artifact:
          </t>
          <t indent="0" pn="section-c.2.2-4">file: examples/parboiled_vr_00_D0-E5-02-00-2D.b64</t>
          <artwork name="" type="" align="left" alt="" pn="section-c.2.2-5">
    0:d=0  hl=4 l=3939 cons: SEQUENCE
    4:d=1  hl=2 l=   9 prim: OBJECT            :pkcs7-signedData
   15:d=1  hl=4 l=3924 cons: cont [ 0 ]
   19:d=2  hl=4 l=3920 cons: SEQUENCE
   23:d=3  hl=2 l=   1 prim: INTEGER           :01
   26:d=3  hl=2 l=  13 cons: SET
   28:d=4  hl=2 l=  11 cons: SEQUENCE
   30:d=5  hl=2 l=   9 prim: OBJECT            :sha256
   41:d=3  hl=4 l=2424 cons: SEQUENCE
   45:d=4  hl=2 l=   9 prim: OBJECT            :pkcs7-data
   56:d=4  hl=4 l=2409 cons: cont [ 0 ]
   60:d=5  hl=4 l=2405 prim: OCTET STRING      :{"ietf-voucher-request:v
 2469:d=3  hl=4 l=1135 cons: cont [ 0 ]
 2473:d=4  hl=4 l= 508 cons: SEQUENCE
 2477:d=5  hl=4 l= 386 cons: SEQUENCE
 2481:d=6  hl=2 l=   3 cons: cont [ 0 ]
 2483:d=7  hl=2 l=   1 prim: INTEGER           :02
 2486:d=6  hl=2 l=   4 prim: INTEGER           :3F989B52
 2492:d=6  hl=2 l=  10 cons: SEQUENCE
 2494:d=7  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 2504:d=6  hl=2 l= 109 cons: SEQUENCE
 2506:d=7  hl=2 l=  18 cons: SET
 2508:d=8  hl=2 l=  16 cons: SEQUENCE
 2510:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 2522:d=9  hl=2 l=   2 prim: IA5STRING         :ca
 2526:d=7  hl=2 l=  25 cons: SET
 2528:d=8  hl=2 l=  23 cons: SEQUENCE
 2530:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 2542:d=9  hl=2 l=   9 prim: IA5STRING         :sandelman
 2553:d=7  hl=2 l=  60 cons: SET
 2555:d=8  hl=2 l=  58 cons: SEQUENCE
 2557:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 2562:d=9  hl=2 l=  51 prim: UTF8STRING        :fountain-test.example.co
 2615:d=6  hl=2 l=  30 cons: SEQUENCE
 2617:d=7  hl=2 l=  13 prim: UTCTIME           :200225213154Z
 2632:d=7  hl=2 l=  13 prim: UTCTIME           :220224213154Z
 2647:d=6  hl=2 l=  83 cons: SEQUENCE
 2649:d=7  hl=2 l=  18 cons: SET
 2651:d=8  hl=2 l=  16 cons: SEQUENCE
 2653:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 2665:d=9  hl=2 l=   2 prim: IA5STRING         :ca
 2669:d=7  hl=2 l=  25 cons: SET
 2671:d=8  hl=2 l=  23 cons: SEQUENCE
 2673:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 2685:d=9  hl=2 l=   9 prim: IA5STRING         :sandelman
 2696:d=7  hl=2 l=  34 cons: SET
 2698:d=8  hl=2 l=  32 cons: SEQUENCE
 2700:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 2705:d=9  hl=2 l=  25 prim: UTF8STRING        :fountain-test.example.co
 2732:d=6  hl=2 l=  89 cons: SEQUENCE
 2734:d=7  hl=2 l=  19 cons: SEQUENCE
 2736:d=8  hl=2 l=   7 prim: OBJECT            :id-ecPublicKey
 2745:d=8  hl=2 l=   8 prim: OBJECT            :prime256v1
 2755:d=7  hl=2 l=  66 prim: BIT STRING
 2823:d=6  hl=2 l=  42 cons: cont [ 3 ]
 2825:d=7  hl=2 l=  40 cons: SEQUENCE
 2827:d=8  hl=2 l=  22 cons: SEQUENCE
 2829:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Extended Key Usag
 2834:d=9  hl=2 l=   1 prim: BOOLEAN           :255
 2837:d=9  hl=2 l=  12 prim: OCTET STRING      [HEX DUMP]:300A06082B0601
 2851:d=8  hl=2 l=  14 cons: SEQUENCE
 2853:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Key Usage
 2858:d=9  hl=2 l=   1 prim: BOOLEAN           :255
 2861:d=9  hl=2 l=   4 prim: OCTET STRING      [HEX DUMP]:03020780
 2867:d=5  hl=2 l=  10 cons: SEQUENCE
 2869:d=6  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 2879:d=5  hl=2 l= 104 prim: BIT STRING
 2985:d=4  hl=4 l= 619 cons: SEQUENCE
 2989:d=5  hl=4 l= 498 cons: SEQUENCE
 2993:d=6  hl=2 l=   3 cons: cont [ 0 ]
 2995:d=7  hl=2 l=   1 prim: INTEGER           :02
 2998:d=6  hl=2 l=   4 prim: INTEGER           :296B0659
 3004:d=6  hl=2 l=  10 cons: SEQUENCE
 3006:d=7  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 3016:d=6  hl=2 l= 109 cons: SEQUENCE
 3018:d=7  hl=2 l=  18 cons: SET
 3020:d=8  hl=2 l=  16 cons: SEQUENCE
 3022:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 3034:d=9  hl=2 l=   2 prim: IA5STRING         :ca
 3038:d=7  hl=2 l=  25 cons: SET
 3040:d=8  hl=2 l=  23 cons: SEQUENCE
 3042:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 3054:d=9  hl=2 l=   9 prim: IA5STRING         :sandelman
 3065:d=7  hl=2 l=  60 cons: SET
 3067:d=8  hl=2 l=  58 cons: SEQUENCE
 3069:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 3074:d=9  hl=2 l=  51 prim: UTF8STRING        :fountain-test.example.co
 3127:d=6  hl=2 l=  30 cons: SEQUENCE
 3129:d=7  hl=2 l=  13 prim: UTCTIME           :200225213145Z
 3144:d=7  hl=2 l=  13 prim: UTCTIME           :220224213145Z
 3159:d=6  hl=2 l= 109 cons: SEQUENCE
 3161:d=7  hl=2 l=  18 cons: SET
 3163:d=8  hl=2 l=  16 cons: SEQUENCE
 3165:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 3177:d=9  hl=2 l=   2 prim: IA5STRING         :ca
 3181:d=7  hl=2 l=  25 cons: SET
 3183:d=8  hl=2 l=  23 cons: SEQUENCE
 3185:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 3197:d=9  hl=2 l=   9 prim: IA5STRING         :sandelman
 3208:d=7  hl=2 l=  60 cons: SET
 3210:d=8  hl=2 l=  58 cons: SEQUENCE
 3212:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 3217:d=9  hl=2 l=  51 prim: UTF8STRING        :fountain-test.example.co
 3270:d=6  hl=2 l= 118 cons: SEQUENCE
 3272:d=7  hl=2 l=  16 cons: SEQUENCE
 3274:d=8  hl=2 l=   7 prim: OBJECT            :id-ecPublicKey
 3283:d=8  hl=2 l=   5 prim: OBJECT            :secp384r1
 3290:d=7  hl=2 l=  98 prim: BIT STRING
 3390:d=6  hl=2 l=  99 cons: cont [ 3 ]
 3392:d=7  hl=2 l=  97 cons: SEQUENCE
 3394:d=8  hl=2 l=  15 cons: SEQUENCE
 3396:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Basic Constraints
 3401:d=9  hl=2 l=   1 prim: BOOLEAN           :255
 3404:d=9  hl=2 l=   5 prim: OCTET STRING      [HEX DUMP]:30030101FF
 3411:d=8  hl=2 l=  14 cons: SEQUENCE
 3413:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Key Usage
 3418:d=9  hl=2 l=   1 prim: BOOLEAN           :255
 3421:d=9  hl=2 l=   4 prim: OCTET STRING      [HEX DUMP]:03020106
 3427:d=8  hl=2 l=  29 cons: SEQUENCE
 3429:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Subject Key Ident
 3434:d=9  hl=2 l=  22 prim: OCTET STRING      [HEX DUMP]:0414B9A5F6CB11
 3458:d=8  hl=2 l=  31 cons: SEQUENCE
 3460:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Authority Key Ide
 3465:d=9  hl=2 l=  24 prim: OCTET STRING      [HEX DUMP]:30168014B9A5F6
 3491:d=5  hl=2 l=  10 cons: SEQUENCE
 3493:d=6  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 3503:d=5  hl=2 l= 103 prim: BIT STRING
 3608:d=3  hl=4 l= 331 cons: SET
 3612:d=4  hl=4 l= 327 cons: SEQUENCE
 3616:d=5  hl=2 l=   1 prim: INTEGER           :01
 3619:d=5  hl=2 l= 117 cons: SEQUENCE
 3621:d=6  hl=2 l= 109 cons: SEQUENCE
 3623:d=7  hl=2 l=  18 cons: SET
 3625:d=8  hl=2 l=  16 cons: SEQUENCE
 3627:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 3639:d=9  hl=2 l=   2 prim: IA5STRING         :ca
 3643:d=7  hl=2 l=  25 cons: SET
 3645:d=8  hl=2 l=  23 cons: SEQUENCE
 3647:d=9  hl=2 l=  10 prim: OBJECT            :domainComponent
 3659:d=9  hl=2 l=   9 prim: IA5STRING         :sandelman
 3670:d=7  hl=2 l=  60 cons: SET
 3672:d=8  hl=2 l=  58 cons: SEQUENCE
 3674:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 3679:d=9  hl=2 l=  51 prim: UTF8STRING        :fountain-test.example.co
 3732:d=6  hl=2 l=   4 prim: INTEGER           :3F989B52
 3738:d=5  hl=2 l=  11 cons: SEQUENCE
 3740:d=6  hl=2 l=   9 prim: OBJECT            :sha256
 3751:d=5  hl=2 l= 105 cons: cont [ 0 ]
 3753:d=6  hl=2 l=  24 cons: SEQUENCE
 3755:d=7  hl=2 l=   9 prim: OBJECT            :contentType
 3766:d=7  hl=2 l=  11 cons: SET
 3768:d=8  hl=2 l=   9 prim: OBJECT            :pkcs7-data
 3779:d=6  hl=2 l=  28 cons: SEQUENCE
 3781:d=7  hl=2 l=   9 prim: OBJECT            :signingTime
 3792:d=7  hl=2 l=  15 cons: SET
 3794:d=8  hl=2 l=  13 prim: UTCTIME           :210413214323Z
 3809:d=6  hl=2 l=  47 cons: SEQUENCE
 3811:d=7  hl=2 l=   9 prim: OBJECT            :messageDigest
 3822:d=7  hl=2 l=  34 cons: SET
 3824:d=8  hl=2 l=  32 prim: OCTET STRING      [HEX DUMP]:49CEADD5A3946E
 3858:d=5  hl=2 l=  10 cons: SEQUENCE
 3860:d=6  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 3870:d=5  hl=2 l=  71 prim: OCTET STRING      [HEX DUMP]:3045022100C84E

</artwork>
          <t indent="0" pn="section-c.2.2-6">
            The JSON contained in the voucher-request. Note that the previous
            voucher-request is in the prior-signed-voucher-request attribute.
          </t>
          <sourcecode type="json" markers="false" pn="section-c.2.2-7">
{"ietf-voucher-request:voucher":{"assertion":"proximity","cr
eated-on":"2021-04-13T21:43:23.787Z","serial-number":"00-D0-
E5-F2-00-02","nonce":"-_XE9zK9q8Ll1qylMtLKeg","prior-signed-
voucher-request":"MIIGcAYJKoZIhvcNAQcCoIIGYTCCBl0CAQExDTALBg
lghkgBZQMEAgEwggOJBgkqhkiG9w0BBwGgggN6BIIDdnsiaWV0Zi12b3VjaG
VyLXJlcXVlc3Q6dm91Y2hlciI6eyJhc3NlcnRpb24iOiJwcm94aW1pdHkiLC
JjcmVhdGVkLW9uIjoiMjAyMS0wNC0xM1QxNzo0MzoyMy43NDctMDQ6MDAiLC
JzZXJpYWwtbnVtYmVyIjoiMDAtRDAtRTUtRjItMDAtMDIiLCJub25jZSI6Ii
1fWEU5eks5cThMbDFxeWxNdExLZWciLCJwcm94aW1pdHktcmVnaXN0cmFyLW
NlcnQiOiJNSUlCL0RDQ0FZS2dBd0lCQWdJRVA1aWJVakFLQmdncWhrak9QUV
FEQWpCdE1SSXdFQVlLQ1pJbWlaUHlMR1FCR1JZQ1kyRXhHVEFYQmdvSmtpYU
prL0lzWkFFWkZnbHpZVzVrWld4dFlXNHhQREE2QmdOVkJBTU1NMlp2ZFc1MF
lXbHVMWFJsYzNRdVpYaGhiWEJzWlM1amIyMGdWVzV6ZEhKMWJtY2dSbTkxYm
5SaGFXNGdVbTl2ZENCRFFUQWVGdzB5TURBeU1qVXlNVE14TlRSYUZ3MHlNak
F5TWpReU1UTXhOVFJhTUZNeEVqQVFCZ29Ka2lhSmsvSXNaQUVaRmdKallURV
pNQmNHQ2dtU0pvbVQ4aXhrQVJrV0NYTmhibVJsYkcxaGJqRWlNQ0FHQTFVRU
F3d1pabTkxYm5SaGFXNHRkR1Z6ZEM1bGVHRnRjR3hsTG1OdmJUQlpNQk1HQn
lxR1NNNDlBZ0VHQ0NxR1NNNDlBd0VIQTBJQUJKWmxVSEkwdXAvbDNlWmY5dk
NCYitsSW5vRU1FZ2M3Um8rWFpDdGpBSTBDRDFmSmZKUi9oSXl5RG1IV3lZaU
5GYlJDSDlmeWFyZmt6Z1g0cDB6VGl6cWpLakFvTUJZR0ExVWRKUUVCL3dRTU
1Bb0dDQ3NHQVFVRkJ3TWNNQTRHQTFVZER3RUIvd1FFQXdJSGdEQUtCZ2dxaG
tqT1BRUURBZ05vQURCbEFqQm1UMkJNVlVnZWxnZjQzUis1eUJLTlJUYUhteV
BBdkx2eHl6MG1GVlp2WHgrLzFSd09hZ212RzNhWG1Sa2ovWDRDTVFDOHJNTk
JzTG9OcjFMNW5HNTZmd0FkSThoaUFXRzhTOFhBUjVrMUNneDNZVVFCU2dkU2
NGY0FkZisrQnc2WXkrVT0ifX2gggGyMIIBrjCCATWgAwIBAgIEDYOv2TAKBg
gqhkjOPQQDAjAmMSQwIgYDVQQDDBtoaWdod2F5LXRlc3QuZXhhbXBsZS5jb2
0gQ0EwIBcNMjEwNDEzMjAzNzM5WhgPMjk5OTEyMzEwMDAwMDBaMBwxGjAYBg
NVBAUMETAwLUQwLUU1LUYyLTAwLTAyMFkwEwYHKoZIzj0CAQYIKoZIzj0DAQ
cDQgAEA6N1Q4ezfMAKmoecrfb0OBMc1AyEH+BATkF58FsTSyBxs0SbSWLxFj
DOuwB9gLGn2TsTUJumJ6VPw5Z/TP4hJ6NZMFcwHQYDVR0OBBYEFEWIzJaWAG
Q3sLojZWRkVAgGbFatMAkGA1UdEwQCMAAwKwYIKwYBBQUHASAEHxYdaGlnaH
dheS10ZXN0LmV4YW1wbGUuY29tOjk0NDMwCgYIKoZIzj0EAwIDZwAwZAIwTm
lG8sXkKGNbwbKQcYMapFbmSbnHHURFUoFuRqvbgYX7FlXpBczfwF2kllNuuj
igAjAow1kc4r55EmiH+OMEXjBNlWlBSZC5QuJjEf0Jsmxssc+pucjOJ4Shqn
exMEy7bjAxggEEMIIBAAIBATAuMCYxJDAiBgNVBAMMG2hpZ2h3YXktdGVzdC
5leGFtcGxlLmNvbSBDQQIEDYOv2TALBglghkgBZQMEAgGgaTAYBgkqhkiG9w
0BCQMxCwYJKoZIhvcNAQcBMBwGCSqGSIb3DQEJBTEPFw0yMTA0MTMyMTQzMj
NaMC8GCSqGSIb3DQEJBDEiBCBJwhyYibIjeqeR3bOaLURzMlGrc3F2X+kvJ1
errtoCtTAKBggqhkjOPQQDAgRHMEUCIQCmYuCE61HFQXH/E16GDOCsVquDtg
r+Q/6/Du/9QkzA7gIgf7MFhAIPW2PNwRa2vZFQAKXUbimkiHKzXBA8md0VHb
U="}}
</sourcecode>
        </section>
        <section numbered="true" toc="include" removeInRFC="false" pn="section-c.2.3">
          <name slugifiedName="name-masa-to-registrar">MASA to Registrar</name>
          <t indent="0" pn="section-c.2.3-1">
            The MASA will return a voucher to the registrar, which is to be relayed to
            the pledge.
          </t>
          <sourcecode name="voucher_00-D0-E5-F2-00-02.b64" type="" markers="true" pn="section-c.2.3-2">
MIIGIgYJKoZIhvcNAQcCoIIGEzCCBg8CAQExDTALBglghkgBZQMEAgEwggN4BgkqhkiG
9w0BBwGgggNpBIIDZXsiaWV0Zi12b3VjaGVyOnZvdWNoZXIiOnsiYXNzZXJ0aW9uIjoi
bG9nZ2VkIiwiY3JlYXRlZC1vbiI6IjIwMjEtMDQtMTNUMTc6NDM6MjQuNTg5LTA0OjAw
Iiwic2VyaWFsLW51bWJlciI6IjAwLUQwLUU1LUYyLTAwLTAyIiwibm9uY2UiOiItX1hF
OXpLOXE4TGwxcXlsTXRMS2VnIiwicGlubmVkLWRvbWFpbi1jZXJ0IjoiTUlJQi9EQ0NB
WUtnQXdJQkFnSUVQNWliVWpBS0JnZ3Foa2pPUFFRREFqQnRNUkl3RUFZS0NaSW1pWlB5
TEdRQkdSWUNZMkV4R1RBWEJnb0praWFKay9Jc1pBRVpGZ2x6WVc1a1pXeHRZVzR4UERB
NkJnTlZCQU1NTTJadmRXNTBZV2x1TFhSbGMzUXVaWGhoYlhCc1pTNWpiMjBnVlc1emRI
SjFibWNnUm05MWJuUmhhVzRnVW05dmRDQkRRVEFlRncweU1EQXlNalV5TVRNeE5UUmFG
dzB5TWpBeU1qUXlNVE14TlRSYU1GTXhFakFRQmdvSmtpYUprL0lzWkFFWkZnSmpZVEVa
TUJjR0NnbVNKb21UOGl4a0FSa1dDWE5oYm1SbGJHMWhiakVpTUNBR0ExVUVBd3daWm05
MWJuUmhhVzR0ZEdWemRDNWxlR0Z0Y0d4bExtTnZiVEJaTUJNR0J5cUdTTTQ5QWdFR0ND
cUdTTTQ5QXdFSEEwSUFCSlpsVUhJMHVwL2wzZVpmOXZDQmIrbElub0VNRWdjN1JvK1ha
Q3RqQUkwQ0QxZkpmSlIvaEl5eURtSFd5WWlORmJSQ0g5ZnlhcmZremdYNHAwelRpenFq
S2pBb01CWUdBMVVkSlFFQi93UU1NQW9HQ0NzR0FRVUZCd01jTUE0R0ExVWREd0VCL3dR
RUF3SUhnREFLQmdncWhrak9QUVFEQWdOb0FEQmxBakJtVDJCTVZVZ2VsZ2Y0M1IrNXlC
S05SVGFIbXlQQXZMdnh5ejBtRlZadlh4Ky8xUndPYWdtdkczYVhtUmtqL1g0Q01RQzhy
TU5Cc0xvTnIxTDVuRzU2ZndBZEk4aGlBV0c4UzhYQVI1azFDZ3gzWVVRQlNnZFNjRmNB
ZGYrK0J3Nll5K1U9In19oIIBdDCCAXAwgfagAwIBAgIEC4cKMTAKBggqhkjOPQQDAjAm
MSQwIgYDVQQDDBtoaWdod2F5LXRlc3QuZXhhbXBsZS5jb20gQ0EwHhcNMjEwNDEzMjE0
MDE2WhcNMjMwNDEzMjE0MDE2WjAoMSYwJAYDVQQDDB1oaWdod2F5LXRlc3QuZXhhbXBs
ZS5jb20gTUFTQTBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABKoEFaNEueJE+Mn5Gwcb
pnRznB66bKmzqTCpojJZ96AdRwFtuTCVfoKouLTBX0idIhMLfJLM31lyuKy4CUtpp6Wj
EDAOMAwGA1UdEwEB/wQCMAAwCgYIKoZIzj0EAwIDaQAwZgIxAK7LYS3UXI1uhqoLBh3G
02C6MnM2JdMjhUmHHM6UI3kankFVJB0VIqFIuwrAqzwTcwIxAIY8Z7OVouLl+a35HZzB
NDJ49c/q1UcDnwC/0FnLUcKYBIEkilETULF1si+dqLT0uTGCAQUwggEBAgEBMC4wJjEk
MCIGA1UEAwwbaGlnaHdheS10ZXN0LmV4YW1wbGUuY29tIENBAgQLhwoxMAsGCWCGSAFl
AwQCAaBpMBgGCSqGSIb3DQEJAzELBgkqhkiG9w0BBwEwHAYJKoZIhvcNAQkFMQ8XDTIx
MDQxMzIxNDMyNFowLwYJKoZIhvcNAQkEMSIEIFUUjg4WYVO+MpX122Qfk/7zm/G6/B59
HD/xrVR0lGIjMAoGCCqGSM49BAMCBEgwRgIhAOhUfxbH2dwpB2BrTDcsYSjRkCCk/WE6
Mdt+y4z5KD9IAiEAphwdIUb40A0noNIUpH7N2lTyAFZgyn1lNHTteY9DmYI=
</sourcecode>
          <t indent="0" keepWithNext="true" pn="section-c.2.3-3">
            The ASN1 decoding of the artifact:
          </t>
          <t indent="0" pn="section-c.2.3-4">file: examples/voucher_00-D0-E5-F2-00-02.b64</t>
          <artwork name="" type="" align="left" alt="" pn="section-c.2.3-5">
    0:d=0  hl=4 l=1570 cons: SEQUENCE
    4:d=1  hl=2 l=   9 prim: OBJECT            :pkcs7-signedData
   15:d=1  hl=4 l=1555 cons: cont [ 0 ]
   19:d=2  hl=4 l=1551 cons: SEQUENCE
   23:d=3  hl=2 l=   1 prim: INTEGER           :01
   26:d=3  hl=2 l=  13 cons: SET
   28:d=4  hl=2 l=  11 cons: SEQUENCE
   30:d=5  hl=2 l=   9 prim: OBJECT            :sha256
   41:d=3  hl=4 l= 888 cons: SEQUENCE
   45:d=4  hl=2 l=   9 prim: OBJECT            :pkcs7-data
   56:d=4  hl=4 l= 873 cons: cont [ 0 ]
   60:d=5  hl=4 l= 869 prim: OCTET STRING      :{"ietf-voucher:voucher":
  933:d=3  hl=4 l= 372 cons: cont [ 0 ]
  937:d=4  hl=4 l= 368 cons: SEQUENCE
  941:d=5  hl=3 l= 246 cons: SEQUENCE
  944:d=6  hl=2 l=   3 cons: cont [ 0 ]
  946:d=7  hl=2 l=   1 prim: INTEGER           :02
  949:d=6  hl=2 l=   4 prim: INTEGER           :0B870A31
  955:d=6  hl=2 l=  10 cons: SEQUENCE
  957:d=7  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
  967:d=6  hl=2 l=  38 cons: SEQUENCE
  969:d=7  hl=2 l=  36 cons: SET
  971:d=8  hl=2 l=  34 cons: SEQUENCE
  973:d=9  hl=2 l=   3 prim: OBJECT            :commonName
  978:d=9  hl=2 l=  27 prim: UTF8STRING        :highway-test.example.com
 1007:d=6  hl=2 l=  30 cons: SEQUENCE
 1009:d=7  hl=2 l=  13 prim: UTCTIME           :210413214016Z
 1024:d=7  hl=2 l=  13 prim: UTCTIME           :230413214016Z
 1039:d=6  hl=2 l=  40 cons: SEQUENCE
 1041:d=7  hl=2 l=  38 cons: SET
 1043:d=8  hl=2 l=  36 cons: SEQUENCE
 1045:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 1050:d=9  hl=2 l=  29 prim: UTF8STRING        :highway-test.example.com
 1081:d=6  hl=2 l=  89 cons: SEQUENCE
 1083:d=7  hl=2 l=  19 cons: SEQUENCE
 1085:d=8  hl=2 l=   7 prim: OBJECT            :id-ecPublicKey
 1094:d=8  hl=2 l=   8 prim: OBJECT            :prime256v1
 1104:d=7  hl=2 l=  66 prim: BIT STRING
 1172:d=6  hl=2 l=  16 cons: cont [ 3 ]
 1174:d=7  hl=2 l=  14 cons: SEQUENCE
 1176:d=8  hl=2 l=  12 cons: SEQUENCE
 1178:d=9  hl=2 l=   3 prim: OBJECT            :X509v3 Basic Constraints
 1183:d=9  hl=2 l=   1 prim: BOOLEAN           :255
 1186:d=9  hl=2 l=   2 prim: OCTET STRING      [HEX DUMP]:3000
 1190:d=5  hl=2 l=  10 cons: SEQUENCE
 1192:d=6  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 1202:d=5  hl=2 l= 105 prim: BIT STRING
 1309:d=3  hl=4 l= 261 cons: SET
 1313:d=4  hl=4 l= 257 cons: SEQUENCE
 1317:d=5  hl=2 l=   1 prim: INTEGER           :01
 1320:d=5  hl=2 l=  46 cons: SEQUENCE
 1322:d=6  hl=2 l=  38 cons: SEQUENCE
 1324:d=7  hl=2 l=  36 cons: SET
 1326:d=8  hl=2 l=  34 cons: SEQUENCE
 1328:d=9  hl=2 l=   3 prim: OBJECT            :commonName
 1333:d=9  hl=2 l=  27 prim: UTF8STRING        :highway-test.example.com
 1362:d=6  hl=2 l=   4 prim: INTEGER           :0B870A31
 1368:d=5  hl=2 l=  11 cons: SEQUENCE
 1370:d=6  hl=2 l=   9 prim: OBJECT            :sha256
 1381:d=5  hl=2 l= 105 cons: cont [ 0 ]
 1383:d=6  hl=2 l=  24 cons: SEQUENCE
 1385:d=7  hl=2 l=   9 prim: OBJECT            :contentType
 1396:d=7  hl=2 l=  11 cons: SET
 1398:d=8  hl=2 l=   9 prim: OBJECT            :pkcs7-data
 1409:d=6  hl=2 l=  28 cons: SEQUENCE
 1411:d=7  hl=2 l=   9 prim: OBJECT            :signingTime
 1422:d=7  hl=2 l=  15 cons: SET
 1424:d=8  hl=2 l=  13 prim: UTCTIME           :210413214324Z
 1439:d=6  hl=2 l=  47 cons: SEQUENCE
 1441:d=7  hl=2 l=   9 prim: OBJECT            :messageDigest
 1452:d=7  hl=2 l=  34 cons: SET
 1454:d=8  hl=2 l=  32 prim: OCTET STRING      [HEX DUMP]:55148E0E166153
 1488:d=5  hl=2 l=  10 cons: SEQUENCE
 1490:d=6  hl=2 l=   8 prim: OBJECT            :ecdsa-with-SHA256
 1500:d=5  hl=2 l=  72 prim: OCTET STRING      [HEX DUMP]:3046022100E854

 </artwork>
        </section>
        <section numbered="false" toc="include" removeInRFC="false" pn="section-c.2.4">
          <name slugifiedName="name-acknowledgements">Acknowledgements</name>
          <t indent="0" pn="section-c.2.4-1">We would like to thank the various reviewers for their input, in
      particular
      <contact fullname="William Atwood"/>,
      <contact fullname="Brian Carpenter"/>,
      <contact fullname="Fuyu Eleven"/>,
      <contact fullname="Eliot Lear"/>,
      <contact fullname="Sergey Kasatkin"/>,
      <contact fullname="Anoop Kumar"/>,
      <contact fullname="Tom Petch"/>,
      <contact fullname="Markus Stenberg"/>,
      <contact fullname="Peter van der Stok"/>,
      and
      <contact fullname="Thomas Werner"/>.
          </t>
          <t indent="0" pn="section-c.2.4-2">
        Significant reviews were done by <contact fullname="Jari Arkko"/>,
<contact fullname="Christian Huitema"/>, and <contact fullname="Russ Housley"/>.
          </t>
          <t indent="0" pn="section-c.2.4-3">
        <contact fullname="Henk Birkholz"/> contributed the CDDL for the audit-log response.
          </t>
          <t indent="0" pn="section-c.2.4-4">
        This document started its life as a two-page idea from <contact fullname="Steinthor Bjarnason"/>.
          </t>
          <t indent="0" pn="section-c.2.4-5">
        In addition, significant review comments were provided by many IESG
        members, including <contact fullname="Adam Roach"/>, <contact fullname="Alexey Melnikov"/>, <contact fullname="Alissa Cooper"/>, <contact fullname="Benjamin Kaduk"/>, <contact fullname="Éric Vyncke"/>, <contact fullname="Roman Danyliw"/>, and <contact fullname="Magnus Westerlund"/>.
          </t>
        </section>
      </section>
    </section>
    <section anchor="authors-addresses" numbered="false" removeInRFC="false" toc="include" pn="section-appendix.d">
      <name slugifiedName="name-authors-addresses">Authors' Addresses</name>
      <author fullname="Max Pritikin" initials="M." surname="Pritikin">
        <organization showOnFrontPage="true">Cisco</organization>
        <address>
          <email>pritikin@cisco.com</email>
        </address>
      </author>
      <author fullname="Michael C. Richardson" initials="M." surname="Richardson">
        <organization abbrev="Sandelman Software Works" showOnFrontPage="true">Sandelman Software Works</organization>
        <address>
          <email>mcr+ietf@sandelman.ca</email>
          <uri>http://www.sandelman.ca/</uri>
        </address>
      </author>
      <author fullname="Toerless Eckert" initials="T." surname="Eckert">
        <organization abbrev="Futurewei USA" showOnFrontPage="true">Futurewei Technologies Inc.  USA</organization>
        <address>
          <postal>
            <street>2330 Central Expy</street>
            <city>Santa Clara</city>
            <region>CA</region>
            <code>95050</code>
            <country>USA</country>
          </postal>
          <email>tte+ietf@cs.fau.de</email>
        </address>
      </author>
      <author fullname="Michael H. Behringer" initials="M." surname="Behringer">
        <address>
          <email>Michael.H.Behringer@gmail.com</email>
        </address>
      </author>
      <author fullname="Kent Watsen" initials="K." surname="Watsen">
        <organization showOnFrontPage="true">Watsen Networks</organization>
        <address>
          <email>kent+ietf@watsen.net</email>
        </address>
      </author>
    </section>
  </back>
</rfc>
