<?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.6 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-liu-nasr-requirements-01" category="info" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.20.0 -->
  <front>
    <title abbrev="nasr-req">NASR Use Case and Requirements</title>
    <seriesInfo name="Internet-Draft" value="draft-liu-nasr-requirements-01"/>
    <author initials="C." surname="Liu" fullname="Chunchi Liu">
      <organization>Huawei</organization>
      <address>
        <email>liuchunchi@huawei.com</email>
      </address>
    </author>
    <author initials="L." surname="Iannone" fullname="Luigi Iannone">
      <organization>Huawei</organization>
      <address>
        <email>luigi.iannone@huawei.com</email>
      </address>
    </author>
    <author initials="D." surname="Lopez" fullname="Diego Lopez">
      <organization>Telefonica</organization>
      <address>
        <email>diego.r.lopez@telefonica.com</email>
      </address>
    </author>
    <author initials="A." surname="Pastor" fullname="Antonio Pastor">
      <organization>Telefonica</organization>
      <address>
        <email>antonio.pastorperales@telefonica.com</email>
      </address>
    </author>
    <author initials="M." surname="Chen" fullname="Meiling Chen">
      <organization>China Mobile</organization>
      <address>
        <email>chenmeiling@chinamobile.com</email>
      </address>
    </author>
    <author initials="L." surname="Su" fullname="Li Su">
      <organization>China Mobile</organization>
      <address>
        <email>suli@chinamobile.com</email>
      </address>
    </author>
    <date year="2024" month="March" day="03"/>
    <keyword>Network Attestation</keyword>
    <keyword>Routing Security</keyword>
    <abstract>
      <?line 83?>

<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 87?>

<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 a specific network path and verify if actual forwarding result is compliant to the attested path and attributes. The components of this network path can be any combination of physical devices and links, and virtual links and virtual network functions. The target network path can correspond to a network overlay, or to an underlay supporting it, at any level in the applicable overlay recursion hierarchy.</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 will stay as an informational draft.</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 authorities. NASR can help operator to attest to an orchestrated path and provide verifiable forwarding proofs to help clients/authorities audit the service.</t>
        <t>SFC is used as an (possibly canon cal) example, therefor network elements are not limited to Service Functions, and paths are not limited to a SFC path. Other devices or network functions may incorporate features (built-in security capabilities, roots of trust and attestation mechanisms, etc.) suitable to support path validation.</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 explicit and specific down to each network element. Sometimes, clients do not need to know every detail of the network path. Rather, clients will request the verification of a certain property within the path, such as trustworthiness, security level, geolocation, vendor characteristics, transit provider, etc. from the operator. Using NASR, the operator can orchestrate this path by selecting network elements and links with the requested properties, attest to the path, and verifiably prove to clients the path properties and that the traffic did follow this path.</t>
        <t>In both this and the previous case, the order of the elements in the path may not be important, as the requests may be limited to a set of attributes for the path nodes, or the guarantee that traffic traversed a certain (set of) node(s).</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 or governments have very low tolerance to 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 and compliance risks, some clients are willing to pay a premium for high data routing security guarantees. NASR can detect such violations and make corrections promptly, therefore supporting SLAs incorporating these guarantees.</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 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. Furthermore, when uRPF is not available and source address cannot be trusted, NASR can offer a way to filter malicious traffic based on the path used to carry out such an attack <xref target="Yaar03"/>. The other usage is to check if a packet carries a valid trail of transit proofs. If it does then the packet is verified.</t>
      </section>
    </section>
    <section anchor="requirements">
      <name>Requirements</name>
      <t>Based on the main use-cases described in the previous section the following requirements are identified.</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, and it can include a verification of the order in which those elements where transited (Ordered POT, OPoO) or not. A secure POT mechanism should verifiably reflect the identity of the transited network elements and their relevant attributes, if applicable:</t>
        <ul spacing="normal">
          <li>
            <t>For basic POT, there is no further attribute than the identity of the transited element and, optionally, its relative position/order within the path. This is the goal of the POT mechanism defined in <xref target="I-D.ietf-sfc-proof-of-transit-08"/>.</t>
          </li>
          <li>
            <t>For extended POT, different attributes can be considered from a list of relevant ones: trustworthiness measure, available security capabilities, geolocation, vendor, etc. This needs the definition of the relevant 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 at 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, meaning some external security operation center (SOC) wishes to have real-time visibility of the forwarding path, out-of-band methods are needed to encapsulate and transmit POT. In this way, the SOC can verify the POT of each packet in order to make sure the forwarding is correct. For example, traffic monitoring protocols like IPFIX <xref target="RFC7011"/> or ICMP <xref target="RFC792"/>, specific management and control protocols, 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, remotely-attested 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>
        <ul spacing="normal">
          <li>
            <t>hwmodel (Hardware Model)</t>
          </li>
          <li>
            <t>hwversion (Hardware Version)</t>
          </li>
          <li>
            <t>swname (Software Name )</t>
          </li>
          <li>
            <t>swversion (Software Version)</t>
          </li>
          <li>
            <t>location (location)</t>
          </li>
        </ul>
        <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>Committed to prevent changes,</t>
          </li>
          <li>
            <t>Publicized for common referencing and retrieval.</t>
          </li>
        </ol>
        <t>The stored path should contain this information: unique ID (within a domain), 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, essentially, the opposite to Req. 1 Proof-of-Transit. Certain potential user have expressed their interest on 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, especially when Ordered POT (OPOT) is enforced. 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 remotely attested 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 the 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 further stages of NASR, in case of a 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 when static routing is used, we still need proof of transit for compliance checks.</t>
      </section>
      <section anchor="initially-targeting-for-intra-domain-or-inter-domain-scenario">
        <name>Initially targeting for intra-domain or inter-domain scenario?</name>
        <t>Limited domain with some trust assumptions and controls to devices will be easy to start with. Then we can go do the interdomain.</t>
      </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 depends on the scenario. For example, in SFC use cases, we are only interested in verifying some important elements of interest 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, Nicola Rustignoli, Michael Richardson, Mingxing Liu, 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>
        <reference anchor="RFC792">
          <front>
            <title>Internet Control Message Protocol</title>
            <author fullname="J. Postel" initials="J." surname="Postel"/>
            <date month="September" year="1981"/>
          </front>
          <seriesInfo name="STD" value="5"/>
          <seriesInfo name="RFC" value="792"/>
          <seriesInfo name="DOI" value="10.17487/RFC0792"/>
        </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="22" month="February" year="2024"/>
            <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-09"/>
        </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>
        <reference anchor="Yaar03">
          <front>
            <title>Pi: a path identification mechanism to defend against DDoS attacks</title>
            <author fullname="A. Yaar" initials="A." surname="Yaar">
              <organization/>
            </author>
            <author fullname="A. Perrig" initials="A." surname="Perrig">
              <organization/>
            </author>
            <author fullname="D. Song" initials="D." surname="Song">
              <organization/>
            </author>
            <date month="May" year="2004"/>
          </front>
          <seriesInfo name="Proceedings 19th International Conference on Data Engineering (Cat." value="No.03CH37405)"/>
          <seriesInfo name="DOI" value="10.1109/secpri.2003.1199330"/>
          <refcontent>IEEE Comput. Soc</refcontent>
        </reference>
      </references>
    </references>
    <?line 289?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8Vba28bN7P+HiD/gXC+2IVWviRpG395q9hxKsC313KT9j04
KKhdSuLJ7lJd7tpWA//388wMuRfZTfvl4ABFI6245HAuzzwzpJMkefmitnVu
jtXlZHajfvFGnWj8T5eZujF/NLYyhSlr//KFns8rc3esSu2rpDJ/vHyR6tos
XbU5VrZcuJcvXr7IXFrqApNllV7USW6bJA5vZ0oODl++8M28sN5bV9abNcZP
P9yeKfVK6dy7Y7Vjy8ysDf5X1jsjtWMyW7vK6py+TCfv8Y+r8Onm9mzn5Yuy
KeamOsbqkAf/pK70pvSNP1Z11ZiXLyD065cvMHll9LGa3HyY0Ld7V31ZVq5Z
H6vPH9VnfLPlUn2kJy9ffDEb/J5hNpWoS1PTYDWpa+NrXUNqfn7jmpremZm0
qWy9wUqmbEiEV0q1U/M32eXWInheaJvToJ/Mgy7WuRmnruAfdJWujtWqrtf+
eH+/9+s+zYjpbb1q5lAVdJyumjJd2f1vKH2H3sk1yY934rTdu2OZb2zdt2b5
1m/jVV3kO+QEuqlXrmLV0aq2hCFOxurcNvRV/ONElo0PXbXUpf2TVXusfm70
vbH03Ih+Ojl/WvFvoqbe/OdjNdVl6UrTrXHe2KXtP/67VWj82Mr4v1roFBtx
a/Nnt8ypRRB0D4eL3JrcLFxpU91baCejV8bVOKeXfqrbMbTazmC5yVhdaw/n
79ablDUGu97zf7KklrfGa35rbSqdG//NpS/GsJIpu4UvjM3Je+PT4bInK1tq
deHmNjf9hVOMLuTNn1IaU/CQp+vBhLOeh5zb8PWfLeOb3D4zP9DBVQXevaOw
VOrm7OTo8PBd/Pzj4Q9v4ucfvn/zuv38thvzw8HhYTv+h4Nu/LujY1qAsG9r
iTdv37VTHf149GP8/Pb712/58zQ5HVtTLxK/SJN15dwiwX91pUtv6+TgR+xz
Oju5ur66jaMp5ta6XiV3OrcZK4NenOemSAiTOAiP1fWn+ALpPfGETCapBKiS
xpskBboDgw+O1ezDyc3VL+0Kdw5LVxoADdT0hHj1aiNrhvfhW9c3A/F5uNFY
+GZyO/swuX36q67eeCu/33yY0e+zycX5EasBuCi5Z+K9qWhPnhPPdeVql7rc
K6hW1Sujriaz6awF2m68utDVl2atznW5bPTSqF2afU99OhofyAqcFNTRwcHb
5OB1WFRXS1N36Iqs5cdOe+sTBGQ5hsft+7DUvtdFvn+H6fhTkjroE98S58fr
bEEOoNRvWlcHrwEFV9Px4cH48PDg3T60e30zHWPh13jw7t3r1wc0OEkSpece
pk5r+n67sl5BgIbspzLj08rOjedNw1yKzcVK6YMtfta1WjY2MzzSr01qFwhj
1olbKP1c0mJtsg5Nm7sWFaKNB+4SAdgbRyELm2UUYpSNpmVduaxJeZKvryx9
fXwqPaZEmP9/C888BmKJlU2maqdWJl8rzZNh9rigKsMy5OQs5p2p7GKjLGRI
60bntOi9rjJarDLAmJpmBrSsc+SJmqamHcjMWKqdCE9gxwaPx+oWI+gVZBXa
PTZYk9oGi6e6VHNiXRsaOgeMRWWsVxsP3eTwjTubBnVCzV/8SES2FUvKjwZP
4gILZE6OLRFF9PJ0eXg2tggpWWO6HeCglFxvmHLRD6VqQMzokfLNeg2YIO3Y
GuLUvIHc3JkcmC6qWUNVqQZOxYmgSBiRqJ9aWeQhEJ0NG+7VK3XpasOGZiOu
NeZO7Voz/9z2NuADExres9+UWM3bP/E9sz5tmFuSR0KdhpXOU1K2IHFzS56A
F5l4Hh7+KHrowFV5cs/CGNodizcV24ND9pyKov9wrM4czF+plnkqZKG4SmGI
nvoxDT0aq6vKkvTgGEn/Z5qQJVw6cGAWDVqqaChgfgnLPKOCAtqcG9oh7PX5
Y8L0TMHt1L3Nc4XI2ShNk6k2SbmSXInGic5BF6rCli53yw1CG7soQmQbBRJM
LDnzaufil9ktkW/6V11e8eebD//+ZXrz4ZQ+z36enJ+3H+KI2c9Xv5yfdp+6
N0+uLi4+XJ7Ky3iqth5dTH7bEf/eubq+nV5dTs53xKX6+wehJ70hcABJplpX
HO/YccTRjN55f3KtDt+or19D8n98HMkXyv6Pj+oemVLWcmW+CV/hTRtyXqMr
mkNDnale2xrGGdEKfuXu4cCmMkGP73XK5UQJdX19Ncc30eP7ifx+aha2tJLj
vr7KzIJ//gz4a4pCV/BcjhcyQOvCIj89Jlfhhb5jLzl+FiHPniAkRCX3WTua
qkNLBmCEAm03cwGwF4gnd09pPji1TD0EA4qS4MifBCufAqUgCmMkpr5HYfEU
JGmO1+C2qChjNHSo2ptr163FZ/do8/91amoEsA9G11lmsv8WrWzXYsdiYmJi
rb2Jij0+yvhrEvJTG+40PLn+FH8dapF/DGypfT+StlshbTwmkrY46LYjUrJg
f0JwKRk3HgcXisU3OQjSJ2dPHsHY2Jbmh531t3ZBIz88EODaWgXSRvYPZGpN
oV4rE0cArpDIcwZmcT7gAuVFstCIXA/Bbxj1CQhVCs4Fp6F5GE3K1IxUJEqU
HqIJUzNI+GP2zFDDIo9Q9YEixHPaIZ4wu7n7nlZxyAWGuFFNgDYzFWU8dRby
F7g/VmevmJ2d7HXJFju8I7ReI+jAAbNOJi9T+C3h4uMgGDwUu+S8bIpRmwSw
EPutOHhfNzEq+06f69IEsNVNZvn1wmhPfsTZ3mQUgyRIbpkIQPR9fJVyGS+Q
PJwCSC3MWKKmOAa7aCz7isqe6oFZjOWc25eQPNa3bChIsd9bXgQXTiYaYseE
smkHjRdsxfK7ABRv50APiArDgJ7sdfYlbRraaAQNFJlC/AivS1cDzeCHkkS3
jRxYDe3p2fFwC4hDPyOVst0iL+ot2DIezpC2BLUBTyGvWiB7wyJe7c4bm9cJ
DNk6C/Bdo3RkVYwQPi6QNQriSOparC1MukJZ6gsMNXU63gOOIzuQziFlIEbb
pGK8HcpHxwFGyUAczMCVNZU2htP9tGx5tDpkzT5jetimDWnmQpHeZpSiII3R
6WrbGCi2QRtqW9Beo0dmjtVNvkrvfSndvQJAV8gSDLwhRgbZYKxuNNmhm4W5
B8U/++sq+mOf37dIIrvdcJYIQSXg4xvIDG/ralGqLHwPb5hmjtTSgLvI3Ahd
U2YUYStN9RWW9SCQeClU1jFCKrEZMqIrRKkh0MYwDZmCwnA0+IWDso9PzERY
/3PCmdykHPJPfT7S9S4TBt2YLO6fHa4L8E4LbU1C0bxh8dm/oqrjyN5E/A4n
+D6iZzYLCb4TfBw8bO5YLhtfxZRIy9Y1nh0vul3WYmS3uZ7JONTIe4iNFeT9
SOVMlXpb9oGyDiPaI7eQW7Q1U1v288Sly0g/4RHKfBizNiZsMmwQ/0JRDFGt
d+3KxHs8w67fexJ+KNlnhhzDQq2nutYxQdPAk6BjdpI2pmyZwSErUnR0UfA6
zioQcEmptBTdrCCQ4uBhrbscjkTDsOWMlsqNpmzFRRnFeFguJE5MjNQhLwRj
2kpeZJbK+0VOdxTh62AYjBBPhBowPWmDCvKRurg+n6lP15ck4+w0+Ty57DkY
C7oLmy8gIbkZSpw8IWjYQy0JnCdM3AAIEDlhn5xLBEL+KulzK58GrjABuAO0
htFhC6Dnem36pXgvjDlQYAfhK1zIQUlwlDsHL+7rTsqk3vrWU1nsWayYZaFL
QiRO5xCISiJy8MI2BfvZyi5XMmtkTC3EtL7Wz8yAQmhYrI8oyXXXtyr0FyN1
dEg/2H6xrvNNlxRNv2ienU98Lz0FxuFNf2F2RcyCfWQRHBa2CikJolLBHpPE
SOK4zRlsg2AVL3pZC+Umjw/0xCMgWTKt7iuUrYtmQOdXVAXRBuve2qA7gR30
4+nNsZqWXKuqM2RXAJeE0pOHKHPSVWkJE4SNBKkgYlPBkNNrIvf8jl/D1egV
2i4c0MI3QbsDQVG7p262R9AB7udDWffDAco6/kgN18fHsULtTqjsCau36N3T
FTlDwYQGOsqYVAJG8GKgvSyLInkBN4JQuXPUhATknE3fK2YBIy4ZaYF7eFyw
m6wFcRYdunH9RbhpHpCtRuEHXpNKXeD62mQ995sbYWI1GXbZ5LrK2z2Zblrq
8nflY18swngD2exChRrAlmQHIgokAkhxU5G7FphhxOWwam6uz5jFQk59BybA
RIcdUNQXdZfS6QnnAE7cJht1krsFAIacTBSyYGdAzBBzoWQToXzOwOV6qSVu
ONUV4JSgQbC3DIaH3aUFS7amzoVjZth4wgjLW0Pixjhq7EXt0mScL0V7tHxg
OB1ZAGFma+FbrJPLLQtJeiYThUptcGyKSq4PiqGae9/fIdXhqu3MD1sXg2Ts
BVWGxfoW5lKxQaemIlKIz55AVDxul65qFyXrnrpoGa0IvXY1izuBr3TN3B53
aeawXEtPJElQw1JUE7UIPIIrbsZ/tSzRDlG1JLrWPqfT03aSmNG32ZW4Mw3g
HleaNxnB2Dbh7AgM5rhf2ZT4jvM9InNP8ByXw+Z2r2g4PkDGkbq6dld7XGA4
hMdEEoSh37o6gDpCTT6gawB8Ssa8vFhFNBSIWVjqWcYoybzCszvqiHTUaMQ+
3DZV+QRKJVzHIm5gDxaYs40ELIohjuZuDtJz+TdCBWFIFirYpQdDecwyRcn5
uEuhDOSO1r4od4vEUyhCBCsMkPqacZ2h4jLqjIm/D3oo497ezENN1wGCPTJL
UGIGiongSD1YK7Zj5qalC4uVW206VBLH25VFzIajHsD9RWn4TMkRCorbVSj1
Zc9Z2/OLO3/GopJvtrxgFNzUbvUCv35FAHbvSgNpkoJBZIHgtLn/SHLJEjal
LBHMzKonDkTMQPQ45odBfUtTGqkt5diGZhas0pQAkxXIJjmaEPLwEnjdkuWj
Hk5puDVPYHUXu5ubyB4kXVLlNo5d5sIRl1lTBVNZymFD7yCKxgWsT02JbTip
IUT0JJHOb5I5hlFHEQ4vDt9HUnO5qqWUTP0SKbVGvKGANhjjyiQzBXs8JLnT
6SbBYCYaUK1Ev9g59uReqeugEpJ5ZTRFAbsqkVau4Fm1DAzQU+g0gUXrtW/y
Vs1rzfbVuQukxFV2aalTLyzdEa+XAzYC0DneYU4jl2R8zCRdWEjVyn0KKp6O
4U1uAFCbNg53JVe26OP6VTgXe1QiOFJXiMOKBOvafu1SsA8l9N3Z1cneHt5F
AZFLaMHv+pDcKfFzzKckCZelW4oIncg6Ck9K7GsPNof6k/mGrfDEAl0fYXp9
931/qGCaD6+MwFsTYFmjriYXT4dJcH940MT7qVPfb7ME/o89chGBxJtnkol9
M/8fxn/XM83Au33Pla464/KgoR8RCJKAYTXJ+pL/Q7EmDTBNt3Lik6HSAXDc
PeUy4J8aEpHjV8IOuU7sTd6VhgHcts4ARn1/xeqIwKCY0AwlxtkZU/IeZSBq
UkMDcPFw4HOvpYJSkIgxZ8uHsT5DRGRl/cY1lWTchN2SkM9xuVLbak9HGlq4
km+dDVrouf1CtcLZ9FepNehyyOMjqX56cnEdnr07oiOHtrQFpICHxnTadt3b
SUPumNnCMpsfkSz/d542oINHx3TM861MJGSwl3IibvfJg24l6OI0pvX5Jh7/
xGV2uQmubeH3KLTdPR1Nt2IkLR+ICwhFREWc2WUBh8xMTudOqVkHCJidTC+C
7r9/w+c9V5MGwC+P3sqRH10MwRO+fULfWemkIyGfQfBnORs3f713qRXI7rGx
iC9RW3TR72mT8imR2NDOV5oazaZwKMg2SXtAFlNNpBaA+dxt8MOAeMTjYe7h
1nDeUWgHc1lCIwjA6Cblw6CYitg7Y8nbreyLRfb7TW658iDUqjLELLhCZBAZ
+ORI0rSEELG4cB1Ijt6ScPkHgQJj0Rf1+WPoHrUTyvJSA9ybbklhuKCBq3vK
Zbna/RkRfE9ef0Hf9+KvVI+T0N3vn+RJGOHv6WIZUM0tav75kr62P7avt78P
X2+7U7vxEx9J8iZKcy/y90C75UbIL2EPir2EPES+kTlsJp/ZTvIRztIeYMgT
cQT5HE4LdwchHy88jKgQH1H/u1yavfY2jBAQjuo0R92TS8NdTBF8AzYvM8LG
P7s+/Zzazb3AFRzXgkHcS5c0XTwPLq+P5Uyjf0aNKjA1GXWdmLkuam4JxHOM
2L0cpnzR3uFYnbgCuSH0jWPLSDbrR+FY+prLUkBnOGzDK+zJDIppbCRVhnq4
KPxbGhoaJtI8kZUJqXW8dNC7QXGsGu5dKVSou6Ho0Uoo5540fp4UdQNaNbwh
FE8ex/C9FP9qYbh3ms9diOEx/yw7Brwn6g53C6jncAnyutV3KB3dz31sb9Zs
Deg3AujHXlV+OegGMIv9xsi/LODpzIGudvxdEc9UlgoKUEUCXCk05fCFK0zu
mUP4sTp80kWAU8SzJKAov00lUCVsxTwQg+fuERfUXCzQKQt5IqSPLhIbyEy0
A1Svm4ruTUjiPOOuJ8VEDjjnV3nfdHGB+w6MHawFMS/nBfqVAY775qKjrkOW
WWIfiMUlCiU6G5xxM3ck96tadaW2SpuCwjOlhMNrB2z5HU5pkAWy36XW5eLY
MDSTEqV31+tkqN2r2HMx5M4pta0G5IdOHQrT3TUDDFLbU+QMbY+uPzE30LLl
k3zSoaE0NrwdBwPg3ZgkuH3GhI1uHEyS98kJAR9lERMPs1rXIS1F1/l1/7f9
//AhAPUeHsIRdTAUy7wOS9hFqLy7DcQE291AaQ0koG29nKwxV4n9k0Gf73dB
hN/bs5fQJpFufWh1xkWDFmODmUF2HWFPUI70KJ1K7KffPGOpwLG9Y6qeGbpv
xpco/XDTcsmOqCAv2o3s7kAO7rqt6OR+WdHJLseka28LsEP1j7Pp/phkjDiE
K4bhFbL27CBQ2ixcbWIIkLejZUOkBQeNpGLL8cTnHx4euIFDvdjYCtvyf7vo
XcXg0P5VTS5P1W9qN6iCzuE6orQXrGk7QNoNDQHE7x+N5mYp9+vonI7uVPcY
WnDEPV5L/UeIk5VTOa5XK2Zb1Cagi4wJt8barjefhDPW8XLXk8ubjwL+KVhB
YXXAn6b0VCovuzR61tR8AWlI1a/FG2e1kVMUuSvdnucMMXsa8np7wDk44+pO
jIQvBrSBFkoDPXtKPvEKQO9mbK9LKKnS9TrqDZ+db5Ud6md3T2clvFBhlys5
HXCO/xylrSs5aElAncOPsw0hh/PdkZctA/r0r8HSed/gHJVKobYACVL5qK1O
KO72cNvjudMwdmE+lYqOxhcpQ2czM95GorDlw5kToygjx11y5hAO13zI42E/
JZgiEfRRKwIfPJahepYWOh2OB6cO/lpykwoSyAFM5BBdM237fmv/GiuDQHuw
1R7Js0TW908S+vxrQXwGm5d71SGBCkpwEzGgCk/RuwPAoREaA9wEpV5D6tYm
3sWl3l0tWbR2azrCDzc5uYvPdV1sXUP/y+4SL99M4xZnPKlbYS22cQwgZoqM
1RP/BXP9m3baHtNOSn8Pbs80+oxP9/tKkoPcnhoX2B7d56QExiI2azpry/ZC
rH5eyaYppJjmpjHK/sVwMXgEGyMYKBvxFYiA6qnOI+jQ8ihBH2JvhRCid+GO
O1JFIOm+bdKWC7tspH1DyMrv5/3LQvE2Od+rYlyam/Z0nmjABLYc0W2fUmjD
cCfxAtiIajOokimuXGDBrL1Dsy1CxSHg40HUVPyAUihfQuc7/Fs929DD7Xq6
kfWyMs/DvZHwG0cFZ6dwS6ujAv1eC/t4BI64eYQ7Qxw2WtU8E0NIGavPpaP7
UOK+EEdWjDs55dPApiwZtyFCHjAs/E3Ov1ok55FcElAndlCJx3tWpK8mHN4C
Pf8VOqPs+nx/qruVTuwBMZ9ywzp3dIa11QSO6trCJuqSnJ10B3lsSGJHHCUx
rCXs7toraZL4422eXjWz6Kg0U5vIsSNkjmMYloJQrnrm+joDRsbHSJ7dFfRL
Lv7TleUyHPDJOcIgIuOd+ScA1/+LAWofEpTQcwKr4UVC+ju6rELdDr+vqXC+
tKnLtbqBG9ll6XI7UhcWyAKWdUP/VpmnYReY7oGmPLfNSE2yEp5yoz3q+AAc
5UZSizj9NV/DCX81oL777iP/mSV27oFI330XrC+QC3OB9tCtDfVHwKvx9gzc
aeAqWHbfznjdwMVuAqTLxOHid3inrLnWigDZ/inVSTgv03VsNQ+NRDmjd4rY
dbIG7wV7TyeXk386I4/Vafd6/Msjwlr59r+OzbndnzwAAA==

-->

</rfc>
