<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.5 (Ruby 3.1.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-liu-nasr-requirements-00" category="info" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.19.4 -->
  <front>
    <title abbrev="nasr-req">NASR Use Case and Requirements</title>
    <seriesInfo name="Internet-Draft" value="draft-liu-nasr-requirements-00"/>
    <author initials="C." surname="Liu" fullname="Chunchi Liu">
      <organization>Huawei</organization>
      <address>
        <postal>
          <street>101 Ruanjian Ave</street>
          <city>Nanjing</city>
          <code>210012</code>
          <country>China</country>
        </postal>
        <email>liuchunchi@huawei.com</email>
      </address>
    </author>
    <date year="2024" month="February" day="08"/>
    <keyword>Network Attestation</keyword>
    <keyword>Routing Security</keyword>
    <abstract>
      <?line 60?>

<t>This document describes the use cases and requirements that guide the specification of a Network Attestation for Secure Routing framework (NASR).</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://liuchunchi.github.io/draft-liu-nasr-requirements/draft-liu-nasr-requirements.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-liu-nasr-requirements/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/liuchunchi/draft-liu-nasr-requirements"/>.</t>
    </note>
  </front>
  <middle>
    <?line 64?>

<section anchor="intro">
      <name>Introduction</name>
      <t>This document outlines the use cases and requirements that guide the specification of a Network Attestation for Secure Routing framework (NASR).</t>
      <t>NASR is targeted to help attest to a specific network path and verify if actual forwarding result is compliant to this path. This network path can be both an underlay path consists of physical devices or a virtual path consists of virtual network functions.</t>
      <section anchor="note-for-nasr-participants">
        <name>Note for NASR participants</name>
        <t>This document collates and synthesizes discussion outcomes of NASR mailing list and IETF 118 path validation side meeting.</t>
        <t>It is created to help
  1. Foster consensus among list members.
  2. Orient non-list members to NASR goals and current progress</t>
        <t>This document may become a WG-draft but stay informational.</t>
      </section>
    </section>
    <section anchor="term">
      <name>Terminology</name>
      <t>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 <xref target="RFC2119"/>, <xref target="RFC8174"/> when, and only when, they appear in all capitals, as shown here.</t>
    </section>
    <section anchor="back">
      <name>Backgrounds</name>
      <t>TBA</t>
    </section>
    <section anchor="def">
      <name>Definitions</name>
      <t>We summarize the terms discussed in the list.</t>
      <ul spacing="normal">
        <li>
          <t>NASR: Network Attestation For Secure Routing, a proposed framework that mainly does the following:
          </t>
          <ol spacing="normal" type="1"><li>
              <t>Attest to a network path</t>
            </li>
            <li>
              <t>Verify actual forwarding path complies with the attested path</t>
            </li>
            <li>
              <t>Prevent non-compliant forwarding (optional)</t>
            </li>
          </ol>
        </li>
      </ul>
      <t>[Details to be added]</t>
      <ul spacing="normal">
        <li>
          <t>Routing Security: <xref target="RFC4593"/>, <xref target="RFC2828"/></t>
        </li>
        <li>
          <t>Path Validation: <xref target="I-D.liu-path-validation-problem-statement"/></t>
        </li>
        <li>
          <t>Secure Routing: <xref target="I-D.chen-secure-routing-use-cases-00"/></t>
        </li>
        <li>
          <t>Proof-of-Transit: <xref target="I-D.ietf-sfc-proof-of-transit-08"/></t>
        </li>
        <li>
          <t>Trustworthy Path Routing: <xref target="I-D.voit-rats-trustworthy-path-routing"/></t>
        </li>
      </ul>
      <t>...</t>
    </section>
    <section anchor="usecases">
      <name>Use Cases</name>
      <section anchor="use-case-1-network-path-validation">
        <name>Use Case 1: Network Path Validation</name>
        <t>Explicit routing protocols permit explicit control over the traffic path, in order to meet certain performance, security or compliance requirements. For example, operators can use SRv6 to orchestrate a Service Function Chaining (SFC) path and provide packaged security services or compliance services. For either of them, validating the actual traffic path in the forwarding plane as an auditing measure is needed for clients and/or authorties. NASR can help operator to attest to an orchestrated path and provide verifiable forwarding proofs to help clients/authorities audit the service.</t>
        <t>The network element is not limited to Service Function-- it can also be devices that has certain built-in security capabilities (or other attributes), or workloads. Hence the path is not limited to a SFC path.</t>
      </section>
      <section anchor="use-case-2-verifying-path-properties">
        <name>Use Case 2: Verifying Path Properties</name>
        <t>In use case 1, The orchestrated path is explict and specfic down to each network element. Sometimes, the client does not need to know every detail. Rather, the clients will request a path of a certain property, such as trustworthiness, security level, location, vendor, etc, from the operator. With NASR, the operator can orchestrate this path by selecting network elements with requested properties, attest to the path, and verifiably prove to the clients the traffic did follow this path.</t>
        <t>Compared to the first use case, the order of the elements may not be important. This use case is more focused on validating the attributes of the path.</t>
      </section>
      <section anchor="use-case-3-sensitive-data-routing">
        <name>Use Case 3: Sensitive Data Routing</name>
        <t>Clients from specific industries such as finance, governments have very low tolerance of data leakage. These clients require assurance that their data only travels on top of their selected leased line, MPLS VPN or SD-WAN path, and have (preferably real-time) visibility evidence or proof. Some compliance requirements also prohibit customer data escape a specific geolocation without permission. To avoid data leakage risks and compliance risks, some clients are willing to pay a premium for high data routing security guarantees. NASR can detect for such violations and make corrections promptly.</t>
        <t>Compared to the first and second use case, this use case also requires some preventive measures before a wrongful forwarding happens at the first place.</t>
      </section>
      <section anchor="use-case-4-ingress-filtering">
        <name>Use Case 4: Ingress Filtering</name>
        <t>Ingress Filtering techniques, such as uRPF, help prevent source IP address spoofing and denial-of-service (DoS) attacks <xref target="RFC8704"/><xref target="RFC5635"/>. It works by validating the source IP address of a received packet by performing a reverse path lookup in FIB table, all the way to the source. If the path does not exist, the packet is dropped. NASR can be used to regularly validate the path stored in the FIB table, and tell if it continues to exist. This can potentially reduce the false negative rate.</t>
      </section>
    </section>
    <section anchor="requirements">
      <name>Requirements</name>
      <t>(TBA: To add an architecture diagram integrating below components and show basic interactive flows)</t>
      <section anchor="reqpot">
        <name>Requirement 1: Proof-of-Transit (POT) Mechanisms</name>
        <t>All use cases requested public verifiability of packet transit history. Proof-of-Transit (POT) is a proof that a packet DID transit certain network elements. A secure POT mechanism should truthfully reflect the identity of the network element and its attributes. The "attribute" could be different:</t>
        <ul spacing="normal">
          <li>
            <t>For simple POT, the "attribute" means the path it is on, and its relative position/order on the path. This is the goal of POT mechanism defined in <xref target="I-D.ietf-sfc-proof-of-transit-08"/>.</t>
          </li>
          <li>
            <t>For richer POT, the "attribute" means it could be a list of attributes: trustworthiness, security capabilities it has, geolocation, vendor, etc. This needs the definition of attributes of a network element, which is discussed in <xref target="reqattributes"/></t>
          </li>
        </ul>
        <t>According to use case 2, the granularity of POT may also differ. POT can be generated and recorded on a per-hop basis, or can be merged into one collective summary in the path level.</t>
        <t>The most appropriate POT mechanism for each scenarios may differ-- inter-domain or intra-domain, with or without a pre-attest, per-packet or on-demand, privacy-preserving or not, etc.</t>
        <section anchor="per-hop-pot-header-extensions">
          <name>Per-hop POT header extensions</name>
          <t>POT could be either encapsulated and passed along the original path, or sent out-of-band. It depends on the different operation modes: who should verify the POT (other elements on the path, the end host, or external security operation center (SOC)), timeliness of verification, etc.</t>
          <t>When the POT is passed along the path, it should be encapsulated in hop-by-hop header extensions, such as IPv6 hop-by-hop options header, In-situ OAM hop-by-hop option etc. Exact size and specifications of data fields are subject to different POT mechanisms.</t>
        </section>
        <section anchor="out-of-band-pot-extensions">
          <name>Out-of-band POT extensions</name>
          <t>For situations requiring real-time or near-real-time verification, out-of-band methods are needed to encapsulate and transmit POT. For example, traffic monitoring protocols like IPFIX <xref target="RFC7011"/>, SNMP, etc. Similarly, exact size and specifications of data fields are subject to different POT mechanisms.</t>
        </section>
      </section>
      <section anchor="reqattributes">
        <name>Requirement 2: Attributes of a network element</name>
        <t>The identity of a subject should be defined by the attributes (or claims) it owns. Attribute-defined identity is a paradigm widely accepted in SCIM <xref target="RFC7643"/>, OAuth <xref target="RFC7519"/>, SAML <xref target="SAML2"/>, etc. POT proof should reflect the identity and associated attributes, such as element type, security level, security capability it has, remote-attestated or not, vendor, deployed geolocation, current timestamp, path it is on, hop index on the path etc.</t>
        <t>Such attributes/claims/attestation results can reuse existing specifications, for example <xref target="I-D.ietf-rats-eat"/>, <xref target="I-D.ietf-rats-ar4si"/> in RATS WG. Some existing claims that we can reuse:</t>
        <artwork><![CDATA[
hwmodel
hwversion
swname
swversion
location
]]></artwork>
        <t>Some new claim extensions can be made:</t>
        <artwork><![CDATA[
elemtype
pathid
index
secfunctions
vendor
...
]]></artwork>
        <t>(subject to discussion, add, change)</t>
        <t>NASR could work closely with RATS on the standardization of above attributes and means of proving them.</t>
      </section>
      <section anchor="requirement-3-path-attestation-procedures">
        <name>Requirement 3: Path Attestation Procedures</name>
        <t>After a path is selected, it should be</t>
        <ol spacing="normal" type="1"><li>
            <t>commited to prevent changes,</t>
          </li>
          <li>
            <t>publicized for common referencing and retrival.</t>
          </li>
        </ol>
        <t>The stored path should contain these information: univeral ID, all network elements on the path, and attributes of them. (Schemas may vary depending on scenarios)</t>
        <t>TBA</t>
      </section>
    </section>
    <section anchor="no-req">
      <name>Non-Requirements</name>
      <section anchor="non-requirements-1-proof-of-non-transit-pont-mechanisms">
        <name>Non-Requirements 1: Proof-of-Non-Transit (PONT) Mechanisms</name>
        <t>Proof-of-Non-Transit (PONT) is a proof that a packet did NOT transit certain network elements. It is to the opposite to the Req. 1 Proof-of-Transit. Certain customers requested PONT for compliance or security purposes.</t>
        <t>First of all, PONT is a non-inclusion proof, and such non-existence proof cannot be directly given.
Second, under certain circumstances, PONT can be <em>inferred</em> from POT. For example, assume devices are perfectly secure and their behaviors completely compliant to expectations, then POT over A-B-C indicates the packet did not transit X/Y/Z. To relax the security assumptions, if the devices are remote attestated and such claim is proved by POT, then the packet <em>should</em> only transited these trusted devices, assuming the RATS procedure is secure. The reliability of such reasoning decreases as the security level of device decreases.</t>
        <t>NASR mailing list has agreed NOT to provide PONT mechanisms, but could provide some informational measures and conditions that could indicate PONT from POT results. For example, under xxx constraints and circumstances, if traffic passed X AND Y (device or geolocation), then it did NOT (or with a quantifiably low probability it did not) pass Z.</t>
        <t>Since this part is research-related, NASR will work with PANRG and Academia for counseling.</t>
      </section>
      <section anchor="future-requirement-2-packet-steering-and-preventive-mechanisms">
        <name>Future Requirement 2: Packet Steering and Preventive Mechanisms</name>
        <t>In sensitive data routing use case, it is certainly necessary to know and verify the transit path of a packet using POT mechanisms. However, it might be too late to have the data already exposed to the insecure devices and risk leakage. There should be packet steering mechanisms or other preventive measures that help traffic stay in the desired path. For example, doing an egress check before sending to the next hop, preventing sending packet to a device with a non-desirable attribute.</t>
        <t>The mailing list and side meeting has received requests to this requirement, it should fall in NASR interest, but also agreed this may not be part of the initial scope of NASR-- it is a topic to be included in the next stage of NASR when rechartering.</t>
      </section>
    </section>
    <section anchor="commonly-asked-questions-and-answers">
      <name>Commonly Asked Questions and Answers</name>
      <t>(From side meeting and mailing list feedbacks, to be updated)</t>
      <section anchor="why-not-use-static-routing">
        <name>Why not use static routing?</name>
        <t>Static routing severely limits the scalability and flexibility for performance optimizations and reconfigurations. Flexible orchestration of paths will be prohibited. Also, even static routing is used, we still need proof of transit for compliance check.</t>
      </section>
      <section anchor="initially-targeting-for-intradomain-or-interdomain-scenario">
        <name>Initially targeting for intradomain or interdomain scenario?</name>
      </section>
      <section anchor="does-tunneling-solve-the-problem">
        <name>Does tunneling solve the problem?</name>
      </section>
      <section anchor="does-all-nodes-on-the-path-need-to-compute-the-pot">
        <name>Does all nodes on the path need to compute the POT?</name>
        <t>Whether the validation is strict or loose is dependent on the scenario. For example in SFC use case, we are only interested in verifying some important elements of interes processed the traffic.</t>
      </section>
    </section>
    <section anchor="contributors">
      <name>Contributors</name>
      <t>This document is made possible by NASR proponents, active mailing list members and side meeting participants. Including but not limited to: Andrew Alston, Meiling Chen, Diego Lopez, Luigi Iannone, Nicola Rustignoli, Michael Richardson, Adnan Rashid and many others.</t>
      <t>Please create <strong>Github issues</strong> to comment, or raise a question.
Please create new commits and <strong>Github Pull Requests</strong> to propose new contents.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This document has no further security considerations.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>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="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>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="RFC7643">
          <front>
            <title>System for Cross-domain Identity Management: Core Schema</title>
            <author fullname="P. Hunt" initials="P." role="editor" surname="Hunt"/>
            <author fullname="K. Grizzle" initials="K." surname="Grizzle"/>
            <author fullname="E. Wahlstroem" initials="E." surname="Wahlstroem"/>
            <author fullname="C. Mortimore" initials="C." surname="Mortimore"/>
            <date month="September" year="2015"/>
            <abstract>
              <t>The System for Cross-domain Identity Management (SCIM) specifications are designed to make identity management in cloud-based applications and services easier. The specification suite builds upon experience with existing schemas and deployments, placing specific emphasis on simplicity of development and integration, while applying existing authentication, authorization, and privacy models. Its intent is to reduce the cost and complexity of user management operations by providing a common user schema and extension model as well as binding documents to provide patterns for exchanging this schema using HTTP.</t>
              <t>This document provides a platform-neutral schema and extension model for representing users and groups and other resource types in JSON format. This schema is intended for exchange and use with cloud service providers.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7643"/>
          <seriesInfo name="DOI" value="10.17487/RFC7643"/>
        </reference>
        <reference anchor="RFC7519">
          <front>
            <title>JSON Web Token (JWT)</title>
            <author fullname="M. Jones" initials="M." surname="Jones"/>
            <author fullname="J. Bradley" initials="J." surname="Bradley"/>
            <author fullname="N. Sakimura" initials="N." surname="Sakimura"/>
            <date month="May" year="2015"/>
            <abstract>
              <t>JSON Web Token (JWT) is a compact, URL-safe means of representing claims to be transferred between two parties. The claims in a JWT are encoded as a JSON object that is used as the payload of a JSON Web Signature (JWS) structure or as the plaintext of a JSON Web Encryption (JWE) structure, enabling the claims to be digitally signed or integrity protected with a Message Authentication Code (MAC) and/or encrypted.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7519"/>
          <seriesInfo name="DOI" value="10.17487/RFC7519"/>
        </reference>
        <reference anchor="RFC7011">
          <front>
            <title>Specification of the IP Flow Information Export (IPFIX) Protocol for the Exchange of Flow Information</title>
            <author fullname="B. Claise" initials="B." role="editor" surname="Claise"/>
            <author fullname="B. Trammell" initials="B." role="editor" surname="Trammell"/>
            <author fullname="P. Aitken" initials="P." surname="Aitken"/>
            <date month="September" year="2013"/>
            <abstract>
              <t>This document specifies the IP Flow Information Export (IPFIX) protocol, which serves as a means for transmitting Traffic Flow information over the network. In order to transmit Traffic Flow information from an Exporting Process to a Collecting Process, a common representation of flow data and a standard means of communicating them are required. This document describes how the IPFIX Data and Template Records are carried over a number of transport protocols from an IPFIX Exporting Process to an IPFIX Collecting Process. This document obsoletes RFC 5101.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="77"/>
          <seriesInfo name="RFC" value="7011"/>
          <seriesInfo name="DOI" value="10.17487/RFC7011"/>
        </reference>
        <reference anchor="RFC8704">
          <front>
            <title>Enhanced Feasible-Path Unicast Reverse Path Forwarding</title>
            <author fullname="K. Sriram" initials="K." surname="Sriram"/>
            <author fullname="D. Montgomery" initials="D." surname="Montgomery"/>
            <author fullname="J. Haas" initials="J." surname="Haas"/>
            <date month="February" year="2020"/>
            <abstract>
              <t>This document identifies a need for and proposes improvement of the unicast Reverse Path Forwarding (uRPF) techniques (see RFC 3704) for detection and mitigation of source address spoofing (see BCP 38). Strict uRPF is inflexible about directionality, the loose uRPF is oblivious to directionality, and the current feasible-path uRPF attempts to strike a balance between the two (see RFC 3704). However, as shown in this document, the existing feasible-path uRPF still has shortcomings. This document describes enhanced feasible-path uRPF (EFP-uRPF) techniques that are more flexible (in a meaningful way) about directionality than the feasible-path uRPF (RFC 3704). The proposed EFP-uRPF methods aim to significantly reduce false positives regarding invalid detection in source address validation (SAV). Hence, they can potentially alleviate ISPs' concerns about the possibility of disrupting service for their customers and encourage greater deployment of uRPF techniques. This document updates RFC 3704.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="84"/>
          <seriesInfo name="RFC" value="8704"/>
          <seriesInfo name="DOI" value="10.17487/RFC8704"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RFC4593">
          <front>
            <title>Generic Threats to Routing Protocols</title>
            <author fullname="A. Barbir" initials="A." surname="Barbir"/>
            <author fullname="S. Murphy" initials="S." surname="Murphy"/>
            <author fullname="Y. Yang" initials="Y." surname="Yang"/>
            <date month="October" year="2006"/>
            <abstract>
              <t>Routing protocols are subject to attacks that can harm individual users or network operations as a whole. This document provides a description and a summary of generic threats that affect routing protocols in general. This work describes threats, including threat sources and capabilities, threat actions, and threat consequences, as well as a breakdown of routing functions that might be attacked separately. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4593"/>
          <seriesInfo name="DOI" value="10.17487/RFC4593"/>
        </reference>
        <reference anchor="RFC2828">
          <front>
            <title>Internet Security Glossary</title>
            <author fullname="R. Shirey" initials="R." surname="Shirey"/>
            <date month="May" year="2000"/>
            <abstract>
              <t>This Glossary provides abbreviations, explanations, and recommendations for use of information system security terminology. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="2828"/>
          <seriesInfo name="DOI" value="10.17487/RFC2828"/>
        </reference>
        <reference anchor="RFC5635">
          <front>
            <title>Remote Triggered Black Hole Filtering with Unicast Reverse Path Forwarding (uRPF)</title>
            <author fullname="W. Kumari" initials="W." surname="Kumari"/>
            <author fullname="D. McPherson" initials="D." surname="McPherson"/>
            <date month="August" year="2009"/>
            <abstract>
              <t>Remote Triggered Black Hole (RTBH) filtering is a popular and effective technique for the mitigation of denial-of-service attacks. This document expands upon destination-based RTBH filtering by outlining a method to enable filtering by source address as well. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5635"/>
          <seriesInfo name="DOI" value="10.17487/RFC5635"/>
        </reference>
        <reference anchor="I-D.ietf-sfc-proof-of-transit-08">
          <front>
            <title>Proof of Transit</title>
            <author fullname="Frank Brockners" initials="F." surname="Brockners">
              <organization>Cisco Systems, Inc.</organization>
            </author>
            <author fullname="Shwetha Bhandari" initials="S." surname="Bhandari">
              <organization>Thoughtspot</organization>
            </author>
            <author fullname="Tal Mizrahi" initials="T." surname="Mizrahi">
              <organization>Huawei Network.IO Innovation Lab</organization>
            </author>
            <author fullname="Sashank Dara" initials="S." surname="Dara">
              <organization>Seconize</organization>
            </author>
            <author fullname="Stephen Youell" initials="S." surname="Youell">
              <organization>JP Morgan Chase</organization>
            </author>
            <date day="1" month="November" year="2020"/>
            <abstract>
              <t>   Several technologies such as Traffic Engineering (TE), Service
   Function Chaining (SFC), and policy based routing are used to steer
   traffic through a specific, user-defined path.  This document defines
   mechanisms to securely prove that traffic transited a defined path.
   These mechanisms allow to securely verify whether, within a given
   path, all packets traversed all the nodes that they are supposed to
   visit.  This document specifies a data model to enable these
   mechanisms using YANG.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-sfc-proof-of-transit-08"/>
        </reference>
        <reference anchor="I-D.liu-path-validation-problem-statement">
          <front>
            <title>Path Validation Problem Statement, History, Gap Analysis and Use Cases</title>
            <author fullname="Peter Chunchi Liu" initials="P. C." surname="Liu">
              <organization>Huawei</organization>
            </author>
            <author fullname="Qin Wu" initials="Q." surname="Wu">
              <organization>Huawei</organization>
            </author>
            <author fullname="Liang Xia" initials="L." surname="Xia">
              <organization>Huawei</organization>
            </author>
            <date day="23" month="October" year="2023"/>
            <abstract>
              <t>   This document provides a problem statement, history revisiting, gap
   analysis and use cases for path validation techniques.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-liu-path-validation-problem-statement-00"/>
        </reference>
        <reference anchor="I-D.chen-secure-routing-use-cases-00">
          <front>
            <title>The Use Cases for Secure Routing</title>
            <author fullname="Meiling Chen" initials="M." surname="Chen">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Li Su" initials="L." surname="Su">
              <organization>China Mobile</organization>
            </author>
            <date day="5" month="March" year="2023"/>
            <abstract>
              <t>   Traditional path selection conditions include the shortest path, the
   lowest delay, and the least jitter, this paper proposes to add a new
   factor: security, which determines the forwarding path from security
   dimension.

   The frequent occurrence of security incidents, users' demand for
   security services is increasingly strong.  As there are many security
   devices in the ISP's network, this draft proposes secure routing, the
   purpose of secure routing is to converge security and routing to
   ensure the security of the transmission process.

   The scope is transmission process security, end-to-end security and
   processing security are out of scope.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-chen-secure-routing-use-cases-00"/>
        </reference>
        <reference anchor="I-D.voit-rats-trustworthy-path-routing">
          <front>
            <title>Trusted Path Routing</title>
            <author fullname="Eric Voit" initials="E." surname="Voit">
              <organization>Cisco Systems, Inc.</organization>
            </author>
            <author fullname="Chennakesava Reddy Gaddam" initials="C. R." surname="Gaddam">
              <organization>Cisco Systems, Inc.</organization>
            </author>
            <author fullname="Guy Fedorkow" initials="G." surname="Fedorkow">
              <organization>Juniper Networks</organization>
            </author>
            <author fullname="Henk Birkholz" initials="H." surname="Birkholz">
              <organization>Fraunhofer SIT</organization>
            </author>
            <author fullname="Meiling Chen" initials="M." surname="Chen">
              <organization>China Mobile</organization>
            </author>
            <date day="28" month="August" year="2023"/>
            <abstract>
              <t>   There are end-users who believe encryption technologies like IPSec
   alone are insufficient to protect the confidentiality of their highly
   sensitive traffic flows.  These end-users want their flows to
   traverse devices which have been freshly appraised and verified for
   trustworthiness.  This specification describes Trusted Path Routing.
   Trusted Path Routing protects sensitive flows as they transit a
   network by forwarding traffic to/from sensitive subnets across
   network devices recently appraised as trustworthy.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-voit-rats-trustworthy-path-routing-08"/>
        </reference>
        <reference anchor="I-D.ietf-rats-eat">
          <front>
            <title>The Entity Attestation Token (EAT)</title>
            <author fullname="Laurence Lundblade" initials="L." surname="Lundblade">
              <organization>Security Theory LLC</organization>
            </author>
            <author fullname="Giridhar Mandyam" initials="G." surname="Mandyam">
         </author>
            <author fullname="Jeremy O'Donoghue" initials="J." surname="O'Donoghue">
              <organization>Qualcomm Technologies Inc.</organization>
            </author>
            <author fullname="Carl Wallace" initials="C." surname="Wallace">
              <organization>Red Hound Software, Inc.</organization>
            </author>
            <date day="15" month="January" year="2024"/>
            <abstract>
              <t>   An Entity Attestation Token (EAT) provides an attested claims set
   that describes state and characteristics of an entity, a device like
   a smartphone, IoT device, network equipment or such.  This claims set
   is used by a relying party, server or service to determine the type
   and degree of trust placed in the entity.

   An EAT is either a CBOR Web Token (CWT) or JSON Web Token (JWT) with
   attestation-oriented claims.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-rats-eat-25"/>
        </reference>
        <reference anchor="I-D.ietf-rats-ar4si">
          <front>
            <title>Attestation Results for Secure Interactions</title>
            <author fullname="Eric Voit" initials="E." surname="Voit">
              <organization>Cisco Systems</organization>
            </author>
            <author fullname="Henk Birkholz" initials="H." surname="Birkholz">
              <organization>Fraunhofer SIT</organization>
            </author>
            <author fullname="Thomas Hardjono" initials="T." surname="Hardjono">
              <organization>MIT</organization>
            </author>
            <author fullname="Thomas Fossati" initials="T." surname="Fossati">
              <organization>Arm Limited</organization>
            </author>
            <author fullname="Vincent Scarlata" initials="V." surname="Scarlata">
              <organization>Intel</organization>
            </author>
            <date day="30" month="August" year="2023"/>
            <abstract>
              <t>   This document defines reusable Attestation Result information
   elements.  When these elements are offered to Relying Parties as
   Evidence, different aspects of Attester trustworthiness can be
   evaluated.  Additionally, where the Relying Party is interfacing with
   a heterogeneous mix of Attesting Environment and Verifier types,
   consistent policies can be applied to subsequent information exchange
   between each Attester and the Relying Party.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-rats-ar4si-05"/>
        </reference>
        <reference anchor="SAML2" target="https://docs.oasis-open.org/security/saml/v2.0/saml-core-2.0-os.pdf">
          <front>
            <title>Assertions and Protocols for the OASIS Security Assertion Markup Language (SAML) V2.0</title>
            <author>
              <organization/>
            </author>
            <date year="2005" month="March"/>
          </front>
        </reference>
      </references>
    </references>
    <?line 266?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8Vb23IbN7Z951eg5BcpRVKSL0mGLxlashxVWZcRHTuZqakU
2A2SGDcbTKNbMuPSv89aG0B3k3J8zsupk0pFzb4AG/uy9tobyGg0GtS2LsxE
XU9nd+oXb9SZxn90mas780djK7M2Ze0Hej6vzP1EldpXo8r8Mch0bZau2k6U
LRduMMhdVuo1BsorvahHhW1G6d12lNHJycA387X13rqy3m7w+uWb9xdKPVO6
8G6iDmyZm43Bf8r6YKgOTG5rV1ld8Mfl9DX+uApXd+8vDgZls56bajLIIcpk
kLnSm9I3fqLqqjEDCPtigHEroydqevdmih8Prvq0rFyzmaiPb9VH/LLlUr3l
ncEns8XjfDJQI3Vtar6qpnVtfK1rSMvbd66p+cHMZE1l6+3g3pQNpn6mVDsq
f4SV7Q6P22ttC77yd/NZrzeFGWduzfu6ylYTtarrjZ8cH/ceHmM4DG3rVTOH
bqDTbNWU2coef0PJB/ik0JQbn6RBu0/HYbixdd8a5FvPxqt6XRwMBrqpV66i
vjCjghtA82dj9c428jt4w1mYtb3rqqUu7Z+i0on6udEPxsoDE7TTCfr3lTwU
JfEFX1fGYE2nJ6fqrtHlf6wu1fTeyMMM1oAP8265DHdcjumfn56cnD6PN5qy
pr+erWypB4NB6ao15LiHAZW6uzh7fnr6t3j54+kPL+PlD9+/fJEuX7Uv/HBy
epre/eEE7w4YBbvjvXz1t/Tl8x+f/xgvX33/4hUvL0fnY2vqxcgvstGmcm4x
wr91pUtv69HJj5DzcnZ2c3vzPr5MW2x0vRrd68LmokB+Ny/MekQfFeNM1O2H
+H62MuXI01PNqAqOO2q8GWWIb0biRM3enN3d/JLGv3eYt9KIUoSPp//Xq22Y
MX4+Ue9v7/qiy9tGY9a76fvZm+n7Jw919dLb8PjuzQyPZ9Ord88nYpAIPFPv
TcXVeEGd28rVLnOFV9CnqldG3Uxnl7M25rr31ZWuPjUb9U6Xy0YvjTrk4Efq
w/PxiUwguKCen5y8Gp28CFPqakkfSmEB0PJjp731IwfUGcM7j32c6NjrdXF8
j8HkapQ5KBK/Rs6PN/liMBiNRkrP4ZY6qweD9yvrFcZraAaVG59Vdm68rABq
V6J2WWE/lvBY12rZ2NzIm35jMruwmZhXuYXSX8MiUY0oxLSYtKgQb/LiIaH8
aBwEXNs8L8wAMHMJ73d5k8kAX55Z/nzclxuDFbb8/xVbMhGECsYyuaqdWpli
o7QMxZ+6nVGVcR46qsh5byq72CoLIbK60QVnfdBVztkq45ui5uBAlU0BBJHh
auqAA4yVqGNnzAwwMzdq7mR81SA3VYXexodwW+uhEKx5s9p6qKCA8e9tBq1h
tVrd20qkePJ6epAmWwD1JAyggsGzZ+ra1UY0JvrYaPh8ZjeayXjPaIgWAXxZ
vt+WsIi3f+J3bn3WSK6lYbFkIzPLgIRbqqSAPPKhJOLT0x+DpB3IKE8rr4G9
eB2yXQb9Ia32bIPoOh2rC+drU6k2Eyu9dmmKtWGyxuKUej5WN5Wl5CUwrP+U
w4l0Swc+IGLBWyq+CqhbwnxPFr+GKeaGa4OyP74dSeJS86ZGwsCjFpZdqYsx
4+C9qda2dIVbbhEGkHctUWAUCAAJQu7VwdUvs/dkHPyrrm/k+u7NP365vHtz
zuvZz9N379qL9Mbs55tf3p13V92XZzdXV2+uz8PHuKv2bl1Nf8MfLvfg5vb9
5c319N0BRA+O2S4VVIYKgjMieE21qSQ6tG/RJuc3r89u1elL9eVLTGmPj8Pw
g0nt8VE9IC+EuVxZbONPuMxW6c3G6Ipj6KKA329sDSsMOYNfuYcSlq6M6PC1
zoRHlVDWl2dz/KIOX0/57NwsbGkDoH95lpsFHn0ERDTrta7glgIYVHvrn0Fu
3qYvYILvxAkmX8WQiycYAgHpHRvHgTo8EYiCl3ORuYuQtkCouAfmsuCx0x6k
9KM+eOmHACVPcSQGMyEEAz+AUcnoAaAgRRzixRjpzNwnT+8wpzfUodsE5zwa
DP51bmqEpY9W1nlu8n9THfvEcxIsSobRmpcc4/GRb99Sug9tAPPl0e2H8GxX
dfIo0oD4bWIi7wMTkTcSEwmvvO/oQZiqPxgYAt8aj8VPUj1BT0A2kWTyGOCt
LTVOOzvvCT4YvPkMhYHbqchAaOfIDjYM41qZ9AZABwmtUA74H1wMQMAEQVsM
6WAIbT5ygmUqA4mAc3AcQYgyM0OVcj+hO1krMzupbyweGEk6qhF8r1GieMkT
zJizu/vvOYsDqzdkBzWRaWYqJgV1EVEeLBSziwPMLs6OuvSFFd4TcDcIKpCa
vJPJhyH8nnDpdhQMvohVAuXxdz1scRwTiYcGV+7rJsVe370LXRqGPZakG5Rg
vLk22tN1JD+anLFGQQorhACiHzPfSU1QW4ojQE6tSPJOipJY66Ku7Ospf6oG
yeZWg+XuCEgv9S0xiEIch9ktpw9yB3ISFDQOKJ+i3BRiT1mOq4E88KaQz/ZN
BRZF/6IuUKMyMFOCF4hZQU/JmeaNLeoRLlqjAUX1HJlWZDrE8p3YBxoAYDdQ
w5FUtBSpcDqH2n42tCoFD9Z5Ih+c6eIs0JXdSHo+iYhFFUksIZo3RsyBvF22
hE6dDhV18VT1mC1EVOAEZFn0k5zoj6mNzlb7GhyrGZJvbUEuJI9EawTMpej0
Fn78qXQPCmhYAY8F58bqTlMb/c+Ipkg+jDi6iA5iCaNsIzYsaotwRa1IN+0K
FnJX34vjAvMVQ1W4QE0RD6bMHWY0dTZEsnBrmTs551h9JJbTc4c7D8T8/Yhu
KaOaMzILk0mQ7Okm5oa4GpMn2S111UVBMvawI7B0+a1EgUlvJAX1wS23ecxp
PRI7GJwBHsAW8vTpwlaYKZk/Lk3gMABFJy/pFI1GkrHeQKWaFhbK1XoPrtco
hjAxsrchj3gCM617pwm+4q4vUIEa5hiUzOpc1zolEsgflyoGaqm+LXPYuWIk
JcuDagTkXhL3y7CGlb4X4ID5qRdXwIaMKYiSc5rCaEIrl2V8p9eI8hgWOKdD
EGqBEFuFD4UwQfXwKc9V124T14c3ghNAHRieWmEdNVRXt+9m6sPtNYN8dj76
OL3uWVoEPQSPW0BC2hukuhgxlI5QHngrwLFFzAAJZQFVQL4Qcn+VoQJM4cUV
BgBwQWd4Oy4BTFFvTL+AWhqXwkO8FTYIyVUKBygJiHPv4Gd93anK+k+RoPek
4E1EnwiXEgM0ypAW14BY8C/SNbO2zVoyyMouV2HslOTb6EVZD0PUZiebADug
Z/lUvODeukJ3/YO1/kTNoGgI1RQVsd7UxfYvw0KADhUE/vQjpO/xotGoYx/W
twnEjr4bM6NH0CwYF1o9VKh7Fs0OZ1yRXlPIujc3Mq1kpn5cvJygVpdaR10g
nQANGBJPboFDZ6vSElk6JGzubi+GISlGASFtU8E2l7fkkzKE38CHOAJXDs+y
cDowvpgn1eG5mx0xhMFAfCwdfjhB6SCX7F89Po4VykAinSf+7UX/0xkFv2ER
A3XlQm3AwPBhJF8ii6K8lY9pr3COvR3A/cXla1WTAAylLOEED3CiaMIwF8Tp
YKbLPOYz6olhfCBzspwCBG9M3vOoubQ6xCsqs2wKXRXtmnqZGGFUdaVKXyyo
sTaQzS5UZKK2bIzwExEhAijn2qCqx2OshNGeNzHVL+Bh5CZLaSAqphi2AUCh
+114sOh+oINJH6LomkiI5rmwNaQoy/ggU8utXqIckmoRF2KfuSEmMmZdmYib
VHdqrr1gLLwLLJFSLPCqPxLn7ElBwr5fJahDVAdH6goeqUvr11FSLBYyTqGZ
rpXUy4XNHESjTXcB69hHCaaKrVDgAxW/Hf/VpFCsDrAY8FqnAc4vz9tBEnfY
z8+oAAPcGIXBEMlxAVRJU+RkFvUKgSzWWhDgxVzE4zqKW3+FVFKplspt86Ak
G3XQ3jhgPxoTkE3aBfCfzdsBNxnI4r1ldUGRgvf2vwPalL7HD8WpXSzpreSx
IngRKmKpw49jqi+7TBwc0oZx2GzhSnY1kLOOD/6+UwKOWykrm5HLfkNKiYa4
TB36QISCViuTb1C3HeZshWcP+8lqh8u1jTuThzXlbRdid8YARXv2GqqHFdYi
6NBvSXz5Am/tvmVhO5hmSC55zGZtgngeNIAoK4kf0TVEoUx4TB/BzGO5GVFn
aUoTyHdosHLkwKc0oXG0Ar9gWHqpEeJHSOVLEY81Zmmk+2dCwIYeyzZBVABS
MuBY+6wd092GJLSyxLZdizOlCsP3mSmxCBfoYBCcVRCxYZQ7NlUoEFvIOv4e
BqbLUiZyCMnyo0Byh7KcGJcsgspRblBz53hQ2XudbUd4WRIQFIsXgN7BroPB
v46P/z1Rz9TBeSNUGLFhOxWDglkwecFyqRzYfGSP93Z6ffdWltR4KR931hpw
7+wivoLUY82DHx8Q7J6p26h7frIymsFjPtfkqhh8MBALJreOBTf4md5g4taa
Gy1epAsXsyIK0yXYahH5H6M8dtyJaXN8I0k1bH/6FK0tOMRShA69djlD52Hl
EkzFnjc/oHCHochsSX0v8oOfGpJPR7u4sLSKgnXdj3YqOAI7uoezm7MjVKqk
prI/EDrYgtwpGoO1Pq5M2cohBcmeGmI7pk6iU4V93cG1oPrRfCsWeKL9jupc
3t5/33819NF8/GQIDjUC/DXqZnr19LWAGW8+I9Mp9srbarddkG/LhYU1RR6I
rG/m/5Ec4HqG2XWs0L1/pm46u8obfQcKEF83caKQ08P+ROT/EgNGc+M13dnV
ds9tMDkiLkoYWzNkHp1WA0NhKmTLDNLsNbFSNbl2pWy37zTaCvuJXO7i8tfA
Bbn1yabj7PrqNmLvLIRkgZLc/N+odI+CPJ+wc/stSA8EpIfdAQH7iVu3c3eu
mJLefLtfxx5Ks0vbtT+i97qH0o87IUZttkwTBFqC+iW3yzWgKTcFO8mZ2UQv
n51dXkWNfv9S2rg3U5CNeOtVaNxzRxN3ZNeUv0Xd1E4gPFHwr1ITqh/B5zIb
MKldShdCSVc8r/C0afI0E2/bPAw7gMhGdJfxE2inpAwcK9wWD3ZSdtrNkXZR
Dfcb7rMYxigPgXzuo1YEl5nI3S7kONjjWPe2B8IOX+DalWF+FgYuZeWOLw5D
ugshQIYTt7BDP30Ud6wfH2kq/lAf38ayux0wTB9Y54PppiSPwz+rBwJ1Ea9Z
28gxEh5leODhiHjZf5AUhaVyptI8hEl66NHSAKBcnIhmpAnlB9Vl83giA2oM
s5is3V6UG8FKcimt+sOdMEy7hkOWFTAa4nBpjuLObMh8EmtZ4TzdWlK/KCna
DNYoc9a9f3Y7wnO2snoBFZBLB1SQdm/IEOu4/9mP9xeT0M/sbwShHMhQQFXs
bU4XzFK67WGmXsxuohmEPR8UP20vNRXJYYl+GPZ9QmUCDIs9bnwgriXolKXK
uTI1uUsiV7E8DKVimJKVoA5kjG2zbityopoShK1C0r08D3Xtk87hTtKWYN5v
qq3HSMyg4GsdiNq9ltYq+YPQqLIjckdxe27AfeVytFdUlo4HfB7jtvPe4365
x4e96ut6p+YDMfrGe39ZprGFyS3R/7lUCzvPsfBHEc/ypu2OQuaxOn1SJI7V
WRwv9cH6JShFSyZOTSwhZhH5Nk3FbUVmoAvp19CRC2CjfChL4saeLbOikW12
WWAwl4AsnwpeSP8uLB8BHDusuWWXCgG0hDOU48FMulDDcMagVURmq6xZM6Qy
grdMHUHgd/iUAaLmv4dW6dPUzmbmutuxYMZl0yVMGytfYQfSw5yblb63sptF
hZia0b1zVMJ8BorWCUJrsj2mI9l1m45ej86IOsRYk2rU1shcdDLyr8e/Hf9T
eousVj/HfZqodZF5E6ewi1jPdQsIyUf1kk+r74CW1ofOueTxVJ6WfXl+DxH6
e9vSpVQmj5EqRanJ06RRi6m9JUC3SegT4IZ6DCU+1tNvZohUIHHeyWZfbnhw
Qo7U+N1FS9IVgiSTdm+mEzE7Bza46aSXFXdWJHZcu2Em7tFxp6EchQiYnV6R
/uXOwYiuhRk6umUeN/AlVMPXya4xaKK7pYS753bBgz9//iz1GPRrU69pz5tp
3nYzUkqFX9X0+lz9pg6jIjBsj0IcRVvaDjgOY9GJYPyjgZumzRM2unhArsdd
ohseyVzqn6QUNjT6pVSpBGBYiLKPNpJGCpNIV10KIslkob7kiqYZUvHa6ggk
TelZIy1jGrtopBe3x15vgxvOahN6ueHkW9tR7oPqJXcT0zbJTp+861YH+hQB
A0svDZTrmQ7SvlvvZFTcP5I47HbXYmAAxrh5uMu/1c/ugc1ZmWhtlytBr9o5
OWgq27DcyZA4pYC6gOvmW4KF81273ZYRcNpgZha1/tPOjgxrgpaPR6l80lOv
gG/3Ur/WiQ87s2yDJ++Kp4EimHibcvWe4+YumEOZ0G5Hes0+pca+j5k1rqcE
KyNfHbYiyOZFGY+IhC4m92ujJ0cnLaX7AQmkLdFm9dSj2T+X1T9+JXHf9tFj
HvPtEbZec7jPfBbkF1h6OFjHgl5aMgQG6UxFIJEhevt/Eg+xwSm9NLYIMrcx
6QxZ2BiXLChtmPZwErJh3nXKRU1Q/7L9UA4dcR0rTCGGlWBRZ0K0Cp7x/ITv
/8HVtRs709I/IHuDq17IrmBfLWHjp6e4BRbEY0nMUSJUs2EzPw/d7I+rsEgG
kNDJLMXUT0CEnRuwJxyfaVB24CNoZ7pIqMKpUX19Tpt1BIHemRLpN6wjD/Zt
n69c2GUTeiyETvm+6G/IR9ZMD41b4nPT7ulx92IKyw25nV7uLUGFjSvA1gNX
Z4Vbhq1nDOgWbezv8R7x9FBqXwZrMzPKGUw5qJkafjv9P1PFn4lp/hRQ71wO
XDVlKVCIjFNEfIgnlvuvCftlS2un4kunBihhE7dhAEs/SYtJ4p53escUmYcR
Spk0GAvnwkZ1+38TtKVJFHQn7qUevzjrISp0R6oh3phCJrj0fXvEIuTRtEve
Y+6L9EmgCZLWerv24+DrZQh8Vz050yhxmEsD34tfgMaEU6A85ib7NkMVN2l2
3D4do3yCG/3joyDSEqGyHdTUe8dLJgi0vELhCQerWQJemTDBmRwUPLdm6dQ7
oMCfQ/WusUurLslnudd9bTNXaHUH8mSXpSssPraIcfCaO/6tcs8Bp3kJfL3T
HnVqjNxyG7CcZOdW9s/jAVP13Xdv5f9XgE484OC776JPBIxj61ZbbtCqPyJY
jPcGkBpaKr6glnbA2wZ+dxchNIwbTxHGb8payg5Bpvb0+RlP8OaxPfrEcITn
0qlFU4mHdh2Una/E/pfT6+n/bjR5U3dng+VcN8ENl/8F2Zd9dsEzAAA=

-->

</rfc>
