<?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.17 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-liu-nasr-requirements-02" category="info" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.22.0 -->
  <front>
    <title abbrev="nasr-req">NASR Use Case and Requirements</title>
    <seriesInfo name="Internet-Draft" value="draft-liu-nasr-requirements-02"/>
    <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="July" day="08"/>
    <keyword>Network Attestation</keyword>
    <keyword>Routing Security</keyword>
    <abstract>
      <?line 77?>

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

<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>
      <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 side meetings.</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>Clients with high security and privacy requirements are not anymore satisfied with traffic signing and encryption mechanisms only; they now request information of the trustworthiness or security properties of the network paths over which the traffic is carried, preferably to choose the desired properties.</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 technical framework to be proposed that mainly does the following:
          </t>
          <ol spacing="normal" type="1"><li>
              <t>Allow clients to choose desired security attributes of his received network service</t>
            </li>
            <li>
              <t>Achieve dependable forwarding by routing on top of only devices that satisfies his trust requirements</t>
            </li>
            <li>
              <t>Provide proof to the clients that certain packets or flows traversed a network path that has certain trust or security properties.</t>
            </li>
          </ol>
        </li>
        <li>
          <t>Routing Security: Practices and protocols designed to protect the integrity, confidentiality, and availability of network routing information and processes. <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: A verifiable cryptographic tag proving data of specific granularity was processed by a network device. <xref target="I-D.ietf-sfc-proof-of-transit-08"/></t>
        </li>
        <li>
          <t>Trustworthy Path Routing: Path computation and routing according to the trustworthiness of a network device, in order to avoid less trustworthy, unsecure or risky devices. <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 example, therefore 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 and have (preferably real-time) verifiable evidence or proof. Some compliance requirements also prohibit customer data escape a specific geolocation without authorization. To avoid data leakage and compliance risks, some clients are willing to pay a premium for high data routing security guarantees. NASR can prevent and detect accidental 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-sensitive-data-transmission-due-to-remote-ai-training">
        <name>Use Case 4: Sensitive data transmission due to remote AI training</name>
        <t>This use case is similar to Use Case 3 but is more specific. As AI trend rise, operators are investing in "AI training centers" for lease. Due to scalability and cost reduction considerations, training centers tend to be built separately from data centers. In manufacturing industry or other data-heavy industries, DCs or private storage is often built next to the campus. But in order to support training and utilize operator-running training centers, wide-area data transmission between DC and TC is needed. Enterprise clients, when faced with privacy-sensitive data leaving their DCs and go through wide-area transmission, are highly unhappy. Yet, it is also impractical for operators to build dedicated training centers next to the client DC. Without NASR guaranteeing dependable forwarding and non-leakage, the market sales of operator's training center business is hindered.</t>
      </section>
      <section anchor="use-case-5-ingress-filtering">
        <name>Use Case 5: 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"/>. Approches like uRPF 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="reqattributes">
        <name>Requirement 1: Attributes of a network element, interfaces</name>
        <t>According to goal 1 of NASR definition, NASR (to-be) Working Group will define security/trustworthiness attributes of network elements, for clients to request from operators. Attributes should be objective claims, including but not limited to existing remotely-attested claims, element type (physical or virtual network element), security capability it enables, cryptographic algorithms, key strength, deployed geolocation, 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
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>
        <t>Additionally, service request interface between clients and operators should also be defined.</t>
      </section>
      <section anchor="requirement-2-path-attestation-procedures">
        <name>Requirement 2: Path Attestation Procedures</name>
        <t>After a path attribute request is sent from the client to the operator, the operator will have to choose qualifying devices and orchestrate a path. According to the goal 2 of NASR definition, the path attestation procedure will be the core protocol of NASR. The procedure should be able to re-attest to the whole path and provide path-level attribute proofs (attestation results), proving the delivered path complies with client request, which should reuse RATS procedures. Details are being designed in the NASR architecture document.</t>
      </section>
      <section anchor="reqpot">
        <name>Requirement 3: 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 transited certain network elements, and it can include a verification of the order in which those elements where transited (Ordered POT, OPoT) 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 aggregated 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 centers (SOC) wish 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>
    <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="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, but inter-domain scenario will be critical for standardization.</t>
      </section>
      <section anchor="does-tunneling-solve-the-problem">
        <name>Does tunneling solve the problem?</name>
        <t>Tunnels, VPNs do not perceive the underlying network devices. Quality measurements can be done, but other detail information of bearing devices are not visible.</t>
      </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="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">
              <organization>Mediatek USA</organization>
            </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="25" month="June" 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-28"/>
        </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>Linaro</organization>
            </author>
            <author fullname="Vincent Scarlata" initials="V." surname="Scarlata">
              <organization>Intel</organization>
            </author>
            <date day="4" month="March" year="2024"/>
            <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-06"/>
        </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 273?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8VbW3MbN7J+d5X/A0p+OFKKQ1l2sol1Hja0ZCWqsiytpMSb
fUmBMyCJ4+GAGcxIZlz676e/bgCDoeTsvpw6VS6LnMGl0ejL1xcWRfH8WWe7
2hyrD7Oba/WLN+pE03+6qdS1+aO3rVmbpvPPn+n5vDV3x6rRvi1a88fzZ6Xu
zNK122Nlm4V7/uz5s8qVjV7TYlWrF11R276Iw9NKxctXz5/5fr623lvXdNsN
jT9/d3um1Aula++O1Z5tKrMx9F/T7U3Unqls51qra3w5n72lP66lT9e3Z3vP
nzX9em7aY9qd6KE/pWu8aXzvj1XX9ub5MyL69fNntHhr9LGaXb+b4du9az8t
W9dvjtXHn9RH+mabpfoJT54/+2S29L6i1VShPpgOg9Ws64zvdEdU8/Nr13eY
c2PKvrXdlnYyTQ8SXiiVluZvcsqdTej5Wtsag340n/V6U5tp6db8Qrfl6lit
um7jjw8Ps7eHWJGWt92qnxOriMflqm/KlT38C6bvYU6tQT/NicsOc6ey3tS6
v1rlr95NV9263oMQ6L5buZZZh11tQxdxMlXvbY+vIh8nsm186NqlbuyfzNpj
9XOv743FcyP8Gej8ccXvhE3Z+u+n6lw3jWvMsMf73i5t/vjf7YLxUyvjv7bR
KR3EbcyfwzanlpRgeDje5NbUZuEaW+pso70KU6bttMakH7s0BrvtjbabTdWV
9iT8w36zpqPBLnv+n2ypZdZ0w7M2ptW18X+59cWUbsk0w8YXxtaQ3vh0vO3J
yjZaXbi5rU2+cUmj1zLzxxJj1jzk8X50hTeZhLy34et/to3va/vE+mQdXLum
uXdQS6Wuz05eHR29iZ9/OPr+2/j5+5dHR+n59y+H529eHWMh2Lidpb797s3r
tOwPr36In7/72+vv+PN5cTq1plsUflEWm9a5RUH/ulY33nbFyx/oPOc3J5dX
l7dxNHRro7tVcadrW/GhMXFem3UB28PKdqyufo0TwN/CwwKZohWDVPTeFCVZ
cbK1L4/VzbuT68tf0g53jrZuNRliso4elq1bbWXPMJ9k6Op6RD4PN5o2vp7d
3ryb3T5+q9tvvZX31+9uwDClftO6ffmaVOTyfHr0cnp09PLNIVFzdX0+ffXy
5Wt68ObN69cvMbgoCqXnnlhTdvh+u7JekTvpcV5VGV+2dm686lZG0fEUH4+9
VG6E6LXu1LK3leGRfmNKuyDxBh+VWyj9lDFXdLFixE2y6YuWpJAH7sMxHkwj
kWtbVRA9WOnzpmtd1Ze8yJcXFl8fHlNPS5L4/38T/+KF+uA6w+PZ129029nS
bjS7912iS1ezv2Ay/bYhirz9k75X1pc9u24cjNSMnhFxvCSUEQTU1ncyEYdZ
GwOyPJNx3inapiRX3JlKdU6tTL2BsBxN1ZnznWlVcuCKlDmutjbw8lhDqVdT
ddlaUEmmushfY0GmZOkISjAJxJkWQ0mLlq3xTxx1rbdqbnASYvHHnwr2cmre
d+re1rUiRm+VxmIq2QDX6FpAjvCWrG67to2r3XJLkkCnWAdBMIqwBMBG5dXe
xS83t8Aw+Ks+XPLn63f/+OX8+t0pPt/8PHv/Pn2II25+vvzl/enwaZh5cnlx
8e7DqUymp2rn0cXsN/oDLuxdXt2eX36Yvd+jQ5B45ecnXAS+zQ29Iso3rcHV
0Imj2lWY8/bkSh19q758CTb04WEiX2BEHx7UPRki2cs19TZ8Jakh3m02RrdY
QxM7S72xHV3OBDv4lbtvSARaE/j4VpeMyhpi15cXc/rGfDypLavIPcEUtbLL
lfIBdPGOm9be6XI7Viccq3GQw+3a0WdP9+YXlk7Dq5CpWZB2kYguG8gs1jFN
2W43rFZrU67I7/i15/P8txylcfe8CWlfLgxQAKjsYFGh7x4oNdFJ8kdut7Oi
LhjdBG2G7aWHdyT69ytbrsJSQh6URbck7dWEljAL8txzYi/dV7lyzoupoIui
Y1fZHlMl/Dw1C9tY0Ah+VmbB7PxI3OjXa92SRstuJLBJteW+8RiqxRfzDWvV
8ZMG6OyRAaKrpRXLFYBFnVkjETIQ6bAJ2zsyGRCXygX7uCC74+7hhYJRmOG7
KoMADOeOZx4EoetIWPtOGAwJb01pyF1XidPetHe2NMGGzAgvmDushFiD2MrG
8V63FeRhTuIU7CkdsnMbrMqiXRksEux1lCrPO7IAjMQQe70mFNe6O9hCBgE4
Bc6aDoWFSro44gVJQ/nJdCw7Czo51tQkGmCYHomMTFuRFsWpsvvTQheucTdm
ISgBl8vnEU1ynSPbz8pPmiE2Gk9N2THRsBFLTJ3AUC8sgjQKzfgBVtB35AQ0
YTDsT2eNJEdm5moTdqTNPUSWzQlAVbItQFUPD0L6Fc78a4JFxzSiuPo1vh1L
IL8MwCfNj/jrVvAXQWlFjCUXy1fPmk8uQm9IB1Wnl6DsDhTTfhoniQ6ZYjvd
9LVmDt8T/+MRKgjNcEkiJzhWEWFepOV2gF5yrkQ3fyNftOm7gUeRd7osnUhn
kKBHBmfxaP8JlJlmkXWhSZrgX6VqjM3g30T1jWBISE9r/ack5Uw+4UGhfDoN
djomCmBVCNIwouERDDRSGuFoMBk714eR7z5vakIgXTrfIH0b+NNOmTiCRI3A
VS1WMreP0ITxEQE3Bm0yLYtbA0YktXAts7i2eD5S1ymbsxBvTxS0R1PABCPc
MHa7ub77G3ZxFKAb4NUOqOFGDIs6oyiVb+1kRbvjSPs3ZycHoq9B2sUOkJbr
ZW6+gm3yO8TFx4Ew8lx0SnEg64mKUQIkgphCmtyTxc15E015Ztk2tW5MQDS6
ryxPXxvtcf9kxBpjKqIMQDFaKCL9kL5KaG/FwTDOAluA4BKnWMjYO/CnJmdU
9ZgPmQLmFEJVfUSHkYrDbHshXHCycIgFk5iNE/ReAAxtn64SjKNgtx38LgW/
Y6RQW5I5sXi7F+rFuImrfmI8iQBtjdeETfmOopcglsQNF3Exhpy2IWXeOJag
BcFh4r5X+/Pe1l1Bl5YEgwCTmFM69oRUxXWCINjYs8XNnPEAWybKdOX0gBw9
wS3wl6j0/YY27OQahghzuqu2r47Vr7iYLS6DFfcqORIG8U2KY9QRs/aJa6Z7
SOrLsUA0nxUwH1FjNGGdncuYqhvC4Z1d46xR+irH7IZcYt4noDBy3C2MFGl5
/RSgmqprjXsYVmEwH8Ebhovs5fFVshpy2i0jxaBAYmh8TzRrv2t4M9tSE2X1
RC0NBQOyNqkp4Qto00rD2dK2njwuTQqZgKgNrdwZISa3FqYGpZrS1eAqoHKT
0RtWwNwWMbRn/s9hU2py25j5WObpRihW+xQwNdYMvBnhyEmmzAMXMDlpLqOM
O5avAdDIyBz0Yg4jltx6V7YKiG8gfBokbO6YLhunAjyRTrnes+BFsauSPRwO
l10ZqxqkB+HNGtJP8S7HHtmRfYgBxxrtyY9ALAZcCZOYFm5cBf6ER8ue7pag
kQmHDAfMwVuUrn1Z+IBX2PcHj9Tv9THZHwgGgVd1CvQR4EEeCrGQJJ2yTUUC
2YLRUUQJ+LMHIQKXcJuN8GZFBClWHua6q0mQMIyOzECnNhqeaaoodvUDRg1O
khYmNyETwmXaNiAkYGM+b+0zyCwjRBINoIcGN5AQ4XtlcvazyKY1ui5gAA5y
52CgH+E07B3EUHzNjXMhAQNXdg70QLyh0YFQimr1Bl57AHSDsrI6ELejr5PE
I3EjYqecSZJgyEgg5ARbwJRF10lMg+kJqG2DZAIkeW37NQsUh7O8aoRByZYk
ocrdLbSAw3bam+wfcDnhQsbh5PtJQWotTgYD1voTmNS2Jnge4sl609Xb3CEG
t8BxwfuZzzxTABbe5KSwFNIquhVNYXhh25jyMYTVquQfJqLCyV3wxYSr8sKp
cCAIe0AhnnSRKdPqvnXNctHXOTxYIaOAA3bZ3oRqAgjIVenbXJWYyWxzQ/FJ
VT0LPt0GUmOzc7xl3JayRIlw+uzJOhDsx4xBVzlRRC8lxxAkioJLL8sZwHfr
R1gSImGbOzI8EhCpvWxnMhPIwvg9Fg5Wl6k6FTpJcFNoJaLH0WZMQSJxBjei
A2LZXZKC8qYKUTjjDLosukVyG6R3bE+YQ2H0VJERJuTcLwArWyGVrQwDaCco
hyYUK6PvtpkJmqjTEy+aau/glFBzgLpYIBciIuzemM/JsZQE03ra8y24maH5
CFnSWXBuUpMaqYvI0qLtG365e+IJqV5lClT+nrj9OTlFQ9ScnvCqtycD+p2q
d5ILs4MNnHBSSxE7Yg4p5J0KPxYxurS7oDlk+sALLL/EQUnFSdsHonJ6JiwY
MAd0HX0DKd9O1W+G3JVlEWPdIScmEbtmncjEChdLfIVVqABroJ27EjBiOR+L
6Juqj8HoSe40qjoHv08mR3Aezr2KHRRfvNbtJ4OMSC0pmEjZf/ldOohOLwGr
Rd6kobsmlu/q7nfHJIGcs1VnJC6mDXr56GFINsGVS8AQTaR3fUtm+fxK6ari
OX5DviOegEymJWfjFkWIIdT+qbs5gMen8MyH9Ob3L799eOCPqOs8PJBubxDx
k1kkN0bmtb++OuNysgfm2gnJHpPASDOlpiTdg4khVGXiFA5AsEGQRu3cp34D
tTg7f6sYzU84l4oN7vU2XqjsRXq7GFAKJ9aAf8xnQp2T8IL3RA6Y8NkG0p68
y9xI9MRWcYksR53OZIZlodFDnjAnCxbGEG12oULcbhtcDAA/SKBAtm9hO2Aw
g0oxB63QGfJHtTjXwL7IuxLVWcZyDMCRFE2UuwVBCHgMYciCpYOEEhEIQGOE
ZHMGIC6DiPHASLRuUdUIGKoJkkCCIKUsXD5S+mL7eh9sGiclDY2zuNrAXcna
ktIK91gFJFIZQD8FuXxb9C0mQJudGxIMhCsK2ZVRW4b68iKHPZyBeZufD+lV
leqB44z+CFJ7AQjjHOzjhLqk+5igoK4ZOUj3zEZZWL0beEykxgAbGogf4DVT
P8tTXKjiqKNUXqpSMjtc+37nijkBxVFjhQR6PNYkKHW4mykbZ4t3w6PJKPvR
uRQ3spdMJneaH9eTBSXjS7Lp5v8Dbt7BxGqLUJwQVd1LWrnvdnMHrBbCbcCQ
eltIzEVv4/xAF/eREFpebT3bf6Lxzrac89k5wcHkiQTCFoJmGigXoutRwlPX
S6RWVtgNFSsP6LJEsEceoHZbImYU0iJQ5YwLa0riwqFQfJjnJEhz+7qTFFpr
AKjSiUc1zsD1kLFB3jFUmyUdXITa8sMDhBdf1MefQhiQFpTtJTa5N8OWx1KR
LtTqfk1RV632fyZXdg+RvsD3g/gWZhdED+9/lSdhhL9Hf4LavyEgw68/4Gt6
maan9+PpKczYj58OmIs4RGPuhX46TgdEAbwebPJaV/EMiu8YkiDf4D4/y0e6
8pRjkieSeZDPIXm773uWT474UjF3Ahs7QYqiWRqmSQwryzRLVlk7D6DIyIfZ
H8wF3TMhBFLaP4dUyhwZgUzHOBYxZPjwNibWkcNkkmZVZaWoisAkOuOh0BYs
RgJsWVoywz9BARklzU2wAMFw7hiqVyHRntexrpDFrxB9MEmLjr2JZCzjQQaa
YDGbbkjVBDAVPHEkaidZw5aJI96hjvUHaW/ItMWUIR9rlF+WjNZsN/3P9vHV
k/YxObdcEzfxiELJXBx6icglpt7jYuLohgmDdYvJxNYU49zQ/crV5qlUd7cq
OCuW8TFkePefsBMHk1xA6FA1WdI2ZhUl2jYhbRW4Hm5lEuqngVaxNSyp6Rxk
sk85ZyjubB4wbih1BafIzEQHnkV0jdPHWnnywmNxen38qLqk9q8ubw/UxVBG
Zm+3cV0ok8zoAoZmkCz31s8JsaTcR6qjBUgQ0QPFpiRR2+nXNka4EKuNMIZ6
ZwE4l5CPeuz8cH0Ab9zyAM8FGdxNlw7pN1ojFq4h0SkNd48MQ7bh/mXLSF8R
hRN1eeWITqTHHfF1pkIBit4NWex4lVmysTWLOtUiGY0If0JaMWz1ZL5T4rGW
nt1pJFCSeZowctsgWQ3pFkNbcMWF0CLdBhPMCROBqWohGDaTaOJy82+Iil6c
aEE6YLB4lhNsNTeXqY3zrMOHwtydFDT00nLclAxA2GfMuGD9cDej+uM0Oxu7
mSreR2UBoM2IMdH9xMwCykKweFqacmjnxE1HsOr4UUEyJHQmGaz/SmHjiYR5
SIfzgRGW+2AQopWLJ3/iRr8CPkVM7U6rw5cvYxz6GIimLNArsax5BZh2YtYj
sQfXI3yc8sPAvqVpjFRGpOkLKwtG1wj7ipXbsKBJOjlM0ksKc5c8izygA4O5
KytAS2ng2MYkmASKsLLT2Hi0RnZII1bdtBZ+ZCwhjLVQgvEUlNNRnGTBhfyi
ELdbVI5DCActJ0kO3ydifl07pEsRSgSHMOFDBXuDFEVTVGbNUh8zJjSY3Ty6
K9gCDIgS1vWFugpsAc0ro6EJAyrCIGZv9EmhLmoakilyIonVG813rGsXvAlh
3KVF85YUMrhXQlr0YELnNIcCsi5kPXxEOINqiCvnShvS/8dweiMjtU26uC9R
YrJALq8jcbkC6W8HdgVdbEHYUKROW4Wkyf7N5ckBeUckx+tU78/N8sDEjzGS
BCVcWNlhRKibd5ljH3GP7pzYX8y3fAuPbmCohJ1f3f0tHyp2zYcpE3XeFGTP
enU5u3g8TBT83WdNBh3thaNCYUhj0xk5q0ZBZ12J2x4h2Hg1I+n2mShdDpfL
g8ZyBEMIAsNuEvFKNBYKEVLC1eh3j0/GTAew5WhGQpF/d5FebpJUx6+4xg1A
mK1tvR3c/m7tXsQ2O9HakAIGvoTKPWLK4S7F9UmekbnEiV3Oyt9rqQMooofN
zo4I0/5sIWI6Iu+yQGGBOwZ2KETDmtQbdnopYv5l7Rr+Oceo34MTaedXZ+f/
lKwburEp0KP55ycXV+HZm1eIBFPVhiyKXiaPmlpE0qLBfdxI1h5+1vzfCRoy
Mx/I0O1kZxqHX0k8pAbcnQFHGXDEywzDfRihR7Z4fzHyq3APFVZ0hkbc+DXQ
x2YPDgiNTNzRFWpEJL6MSBjzE/FTdfQIc07VSaycu05mw2W2ItrmM6y9dPwB
gLFjQdyAoIuol1zLUEUbNbD1LZoFhctnXOiBZ6/riUzlcyMTzTjVhyDHLQTD
so3CW84PcP1QeDTkESsLUSVcuSSnik6IG65foSMKkh7ZVdqWIgBEuiXACu8d
/PTvtiHBIGj0u2AjBlOGZQtMlAxnhnwJBkeEbtALVyJGHWkKaqxrM4SDCM8o
AhY6A0we8OzcEJct9yiBh4arOZGdnSSYiJguVYVAD2s3eqlmxdviBDkErhjE
0n0SHXApis4/D387/BdXQoFVP4fmm9h9CZo3YQu7CEhtOEDMbamU20oXJDkP
66WPgJvoIt4eZUN/F1f1e6o0B1gtBcqQEI6bBi7GKHIcBUr4Dj5KmEvnyUMt
pooMsneNhIdoV+eWfT8+tES1sBu86TBymhIoo5Z4NGtqQnUm6KRLQTILVN68
gzyhwJs4hL3LuAM9lUuD/atCp680lPLseLNB04KAxlh7R/BE5j9//syAn4s2
IXTakX+7yJrMWLX/qWYfTtVvaj+wAl0HA6I/CLdpB4O0H8Aj6e8fveakMsd3
6ErAL16ylGUQxAPeS/1L8o5WehAY27SckAGkRNRecCiVagOc6mBbx9tdzT5c
/yR9UyUhlLXVwf6gBRJXlZCDOus5+H+UOGJpvOmMFJ8YVgwl7LHNPg8psnGB
MBb6hyK5FPiCtSEuNAYdpcD3seEp9dxs86hScL/L6g49dwrt+Cj1s7tHRYk3
WtvlSmoozvGPAhMIYaUFgbomOa62sBzOD1V+G7tE80wVmh5GXSOjbFGgykdu
5X31sYj8VAOANDejmJca9Ttumhs3vHNEPJLhysmlKCNVQqnMhH4Cuoc8f8bV
UEKjk0QCd180AWpJvgStQEGog7w2HNAQBVKmioHjEHj91c9g2Aik8l9qQGKK
rM8rLjk8X6DcR4dniY4OVKwEB53BqvASWccTq0ZAkRw0A5eWBEhjmg9xntSW
0a+DhqXwQxDO+nAYEFMdxP/l8Fsf7rnlkDjWM1e0F99xVCB14tZrttUz/4nW
+gdOmjpTZo2/JyzMGekz7mXKmSS9KxkbF3Q8/BwEDoxJ7DeoSFYHQVfP5XRw
DLpdyiKLnag1RLFDVBsj379jkfehIhPe8V2zzQ2dloODy+Em31xUh5hVJSFm
xSWWtR2vJFf15OZpVonW1ljW30mqx2rbKZcJ+6ZhU0X01UFtw48E+SS3/J44
9evVh9Q9SQiCZY5Hs6Gvt3lnYOr3/kfP3fxRFQWoBqxTucbIUUL7h/Rf7vwU
Zk5meJTPDv2yHNnUJmXk+TAQbG6lG5VkY6+ndMKbGJH8PcS2vDn3cKYmVvbp
pIklpxzq8BuRURgfOb5jMegu0LybkrETVI5AM8tuVDZRhrvUFivuOHYUZmH+
YgC4ww8DsqbHaVSORuyGa5/4TRqrccXJQOYZQJH8ag+/nmlCmlYyQSM9iT+E
e2R28p/7IQL8ekESvzGuWnOvZrXvuNZqKZzS6prUwC4bV9uJurCk74R9rvG3
rTyGXdByn7Hke9tP1KxqSGautV/ZKqhzsxWxEXh0xb1N4aeA6ptvfuKfoNPJ
PdmJb74Jty+GEL9K0GjFAVgQKzLdXYHLZzTBBsiSVrzqScSug6GVhcNvkMKc
puMIKJqt+NsYXFHWT/X4kmDJs1zwkNgczQv3fT77MPtPV+Sxuhymx1+fwgLK
t/8FdLOZX7tBAAA=

-->

</rfc>
