<?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.19 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-liu-nasr-requirements-03" category="info" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.23.2 -->
  <front>
    <title abbrev="nasr-req">NASR Use Case and Requirements</title>
    <seriesInfo name="Internet-Draft" value="draft-liu-nasr-requirements-03"/>
    <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="October" day="21"/>
    <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: The process of collecting the actual packet transit history and compare it against a baseline, in order to decide whether or not the actual forwarding situation satisfies the relying party.</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>
        <li>
          <t>Forwarding Baseline: A deterministic reference value that can be used in the path validation process.</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 packet trace 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 forwarding.</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.) needs to be validated.</t>
        <t>Another example is SRv6 strict mode vs loose mode. Compared to the former, SRv6 loose mode does not specify a fixed forwarding baseline. In which case, we may need to use dial-test-like methods to specify a legitimate forwarding baseline, and verify the actual packet trace against this forwarding baseline. If changes must be made, e.g. path re-calculation due to partial failures, the update of baseline is permitted but must be known to the relying party.</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 with the requested properties. In this case, the forwarding baseline does not contain specific hop-by-hop paths, but the set of security properties only.</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 might 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. This is more of a business use case, but technically same with use case 1.</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 team 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. These attributes constructs a forwarding baseline needed for post-flight path validation.</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-forwarding-baseline">
        <name>Requirement 2: Forwarding Baseline</name>
        <t>After a path attribute request is sent from the client to the operator, the operator will have to choose qualifying devices and calculate a L3 path. This L3 path (or routing baseline) must be translated to a deterministic forwarding baseline using dial-tests or device-controller communications. The actual packet trace should be verified against the forwarding baseline. The forwarding baseline should keep unchanged during the process, unless necessary events happen and the re-calculation result notifies the relying party.</t>
      </section>
      <section anchor="requirement-3-path-attestation-procedures">
        <name>Requirement 3: Path Attestation Procedures</name>
        <t>The path attestation procedure will be the core protocol of NASR. It contains steps to create the forwarding baseline and verifying actual packet trace against it. Details are being designed in the NASR architecture document.</t>
      </section>
      <section anchor="reqpot">
        <name>Requirement 4: 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 (of an important flow, for example), 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 anchor="sec-combined-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="Henk Birkholz" initials="H." surname="Birkholz">
              <organization>Fraunhofer SIT</organization>
            </author>
            <author fullname="Eric Voit" initials="E." surname="Voit">
              <organization>Cisco Systems, Inc.</organization>
            </author>
            <author fullname="Peter Chunchi Liu" initials="P. C." surname="Liu">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Diego Lopez" initials="D." surname="Lopez">
              <organization>Telefonica</organization>
            </author>
            <author fullname="Meiling Chen" initials="M." surname="Chen">
              <organization>China Mobile</organization>
            </author>
            <date day="8" month="July" 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-10"/>
        </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="6" month="September" 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-31"/>
        </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="2" month="September" 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-07"/>
        </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 279?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA8VcXXPbRpZ9d5X/Q5f9sFKKpC3bmcTahwktWYmqbEsjKfFk
XlIg0SR7DQIMGpDMuPTf95x7uxsARXvmZWurUhYBNLpv374f534g4/H48aPG
NYU9Nh+m11fmV2/NSYZ/sjI3V/bP1tV2bcvGP36UzWa1vT02ZebrcW3/fPxo
njV2WdXbY+PKRfX40eNHeTUvszUmy+ts0YwL147j8DTT+PnLx498O1s7711V
NtsNxp+/vTkz5qnJCl8dmyeuzO3G4p+yeTIyT2zumqp2WcGL8+kb/Klq/Lq6
OXvy+FHZrme2PsbqoAd/5lXpbelbf2yaurWPH4FoLInJa5sdm+nV2ymv7qr6
07Ku2s2x+fiz+YgrVy7Nz7zz+NEnu8XzHLOZsflgGw4206axvskaUC33r6q2
4TvXdt7WrtliJVu2JOGpMWlqudJd7iyC++vMFRz0k/2crTeFncyrtTzI6vnq
2KyaZuOPnz3rPX3GGTG9a1btDKwCj+ertpyv3LNvMP0J3yky0o934rTduxOd
b+Kqb83yrWeTVbMunlAIsrZZVbWwjqu6EgdxMjHvXMtLlY8TXTberOplVrq/
hLXH5pc2u7OO963yp6Pzp5U8Uzb15n83MedZWVal7dZ417ql69/+d6tw/MTp
+K8tdIqNVBv7V7fMqYMSdDeHi9zYwi6q0s2z3kJPcr4yqScFX/qpSWO42pPB
ctOJucw8hL9bb1o2GFz17v8nS2b61mQjb21snRXWf3Pp9xOcki27hd9bV1B6
493hsicrV2bmfTVzhe0vPMfotb7505xj1jLk4Xo4wuuehLxz4fI/W8a3hdsz
P6xDVa/x7i3V0pirs5MXR0ev4+8fj354FX//8PzoKN3/4Xl3//WLY05EG7cz
1avvX79M0/744sf4+/u/vfxefp+PTyfONouxX8zHm7qqFmP819RZ6V0zfv4j
9nN+fXJxeXETR1O3NlmzGt9mhctl03xxVtj1mLZHlO3YXP4WXyB/x54WyI5r
NUjj1tvxHFYctvb5sbl+e3J18Wta4bbC0nUGQwzr6GnZmtVW1wzvQ4Yurwbk
y3CbYeGr6c312+nNw6dZ/co7fX719poMM+b3LKufv4SKXJxPjp5Pjo6ev34G
ai6vzicvnj9/iRuvX798+ZyDx+OxyWYerJk3vL5ZOW/gTlru1+TWz2s3s940
K2uwPSPbEy/VN0J4nDVm2brcyki/sXO3gHiTj6ZamGyfMTc4WDXiNtn0RQ0p
lIEHdIyHk0jk2uU5RY9W+rxs6ipv5zLJl6eOl/cPqceUEP//b+KfPjUfqsbK
ePH1m6xu3NxtMnHvu0TPq0L8hZDptyUo8u4vXOfOz1tx3dwY1Az3QJxMSWUk
AYXzjb7IzaytJVleyDhvDJaZwxU3NjdNZVa22FBYjibmrPKNrU1y4AbKHGdb
W3p5zmHMi4m5qB2phKke9x9zQqFkWQFKCAngTM2h0KJlbf2era6zrZlZ7gQs
/vjzWLycmbWNuXNFYcDorck4mUk2oCqzQkGO8hZWt167siqq5RaSgF2sgyBY
AyxBsJF78+T9r9c3xDD8az5cyO+rt//49fzq7Sl/X/8yffcu/Ygjrn+5+PXd
afere/Pk4v37tx9O9WXcNTu33k9/xx9y4cnF5c35xYfpuyfYBMSrv3/gIvJt
ZvEIlG9qy6PBjqPa5XznzcmlOXplvnwJNvT+fqQXNKL39+YOhkjXqspiGy4h
NeDdZmOzmnNkYOc827gGhzPiCn5V3ZUQgdoGPr7J5oLKSrDry9MZroSPJ4UT
FbkDTDErt1wZH0CXrLip3W023w7VidsqK8rhdl3ht8e5+YXDbmQWmJoFtAsi
uiwps5zHlvN6uxG1Wtv5Cn7Hr73s5791K2V1J4tA+/rCQAWgynYWlfruiVIT
nZA/uN3GqbpwdBm0mbYXN28h+ncrN1+FqZQ8KktWQ9rzEaawC3juGdiL85qv
qsqrqcBBYdt5b42JUX6e2oUrHWkkP3O7EHZ+BDfa9TqrodG6GgQ2qbaeN29T
teRgvhOtOt5rgM4eGCAcLWacrwgsip41UiEjkRUXEXsHk0FxyatgHxewO9Ud
vVAwClNem3kQgG7fcc+dIDQNhLVtlMGU8NrOLdx1njjtbX3r5jbYkCnwgr3l
TIw1wFYxjndZnVMeZhCnYE+xyabacFYR7dxykmCvo1R5WVEEYCCGXOslUFxd
3dIWCgjgLrjXtClONMfBgReQhvkn24jsLLBzzplBNMiwbCAy+toKWhRf1dX3
C104xt2YBVCCLlf2o5pUNRVsvyg/NENtNO/aeSNE00Ys+eqIhnrhGKQhNJMb
nCG7hRPIgMG4PvYaSY7M7KtNWBGLe4qsmBOCqmRbiKru75X0S+75twSLgFJW
Nr7NheixQCTXIJ3YVQvpU3aagLl4SMC/ajVg8Tc0EridLcE/+iwzg2+mtx5R
B2C1oZRgQA5XjNODUcPUNVlMy9Jbpic4WKbV7XWywZG1LbZ8Tr+7Vf38bkdx
jrHrccBradsRNt7oFhABGMgDkIFIrBgseLZsA9NhmmxJltxyHbApI18ijkBI
mpVtkYlg3EFsIudzynonWyrePI1xRKeRlpsOMepxJLrligxtm+5o45Fn83ml
vAmC/8BOLh6sP+R/BtSam4Jje6h1ZNpSoS9PpHb+U1JOIR8wNlJ+1p3Pm3DC
ZGRuG3HckAowSMwrfIA1QN+tDXoJvz8T3JbMomhfB9AjI0XFJpPgyWIqhXYX
LwvmE2IEiqVEy1FnVHcEnCPfft4UwGhNYmWnnxsS3hgbR0AZAT8L9SN9D0Jq
h9wkIOvsja1FIUvyPBmOqpbTLBzvDwzaRAx+yEiMDO1LBpXywiii2+ur279x
lapGbEJE3xBXXavpNWeI44VpJyuszi0dXJ+dHCpPgz1QSwnFzZZ9Ax+st98h
Lt4OhDnVUHGx61E6pq9ZhbmNp9pT4U2RlTZgvqzNnby+tpmnqMHMl9bmoIxQ
OtpwkP4Ml5r8cOqCBYmSLcS4iVMiz+I/5VfZZ1T+kA89Xe9TSKvgI36OVDzr
La+E7+xMZBP85iZEonWP6TTJO7sgWoraaIsdOFU4iJ26hd0z9eoBFM/sGQ8p
wNJ8DAAvxxRdKQ1qWHARJxNc7kqYjk0lQrRAzIAD8OZg1rqiGePckmwAVarP
wc5H0JaqUZglHlHcUg+xdNhuZGwznxzKgfqAT4LE2Fxt9BSbIKmBR+ScSDgO
zMElriuekTeFgBJeTcyJOpY8mjvql61H+l43UEEPeaQmmkZ44T6rYCUYEqzV
BNFmgIc0JSNzZ4VBpJzrUPNy+OExt4mY6BPjLgiDbqtboLBLMGmdNXbfKnqA
InLbr+pLdJYSRewnFd4YHF5ie2sewIy05pjdTpYTFfGaKYpiDn8kR5K3EoNI
TEp3CgzBox5pzLzhefA84xI8BTWAFC2GanGdTyUjisD4PS53aH1fHJvfZLMc
Jfb3MiEmiVbLFLCbIyXmobaClmSFJeiNDjcPpNgMp7ajUBNzjYATJ8FNRiOS
VyIO8Uy5FwOEWtOtwVgX+yKHibnKKKDdLBK1xiiFw9WE9BMJyfjrbrcSEvW8
GzxBC5ozv+uqey6iAGXFyCwtol6dG9YWQJpGcZURVWJZ+lWeYoBfwajVqncI
Daq1MjXYxgmOhkdByzkaPBE72ncpIn3C/xldQ4R+D+yWBnsrGzmyEyadh2hY
lWrHDyRxS5pKL0vGpTNeVZvxbDvGH7V7I5FGyd9AYQi/9gWACCNChNYTxpfH
sKhkE2IWc0r0FuBVPwIWlqXVXZm3NESYMx4Y4j1xi2DZkligVDasEEQYESWG
U01VgK0cRnDLpQqb0d1OiKp9F5oEz4+J4fv0BYIi7M/VAWEyJJIYpfC9SElH
6LlYQreM7kaYSR0Rcg56AW1tabugDod9j2cpLWE34vJUbb6GTaR+xIErNyMk
Am8wOhBqPZwEoUgHiDvRFTEBt6MD13wzuBGxZ59JKXqIJAB5UjOEsogHwDQq
YkC9G+aQGMCvXbsW4CBZDJk1YrskKcsW6oMwa4Ah8O6tZGuwNmErfA9wtYRf
MJi3rlJLqmHcOvtEJtW1Db4UPFlvmmLbd/G+3cCzajj4bup7vjagJchBjxSR
wl3P5uqY6bNQjTxZy5FqVTKea+w2BcZeWRV2RGkP2MrDggtpmbmrq3K5aAeR
1YqZJO6w6S0OrDa3k11detXXJeGymKBQdIzuBsfBlOj0nE8FjabsYKIcvz0g
DOImvtEpq+g5HmpuKYjUxICPMp1l/OP8ACFLsFnewghpIGye9FaGTWb2zT8R
6RB9mZhTpROSm0JqlT3JMsTUMxOmtKpZAGG7U5qG1Ci6EeiE08IxwopC8cSg
CIfCaLGJiAfaBZ1/raSKmZGwQNEQXxivbHa77dmgkTk98aqq7pY2mrE29cUR
jIGIsHppPzcpBwJU1WLNN+RmL0YJwtnthfuGnhRMWUWWjuu2lIe7OwY8AkPG
rPjuOf0ZfIQFNacnMuvNSYfpJ+at5kBdZwRHkswEJpnH3GHIN479UMRwaLdB
dWD7yAtOv+RGoeNQ946oPj0jEQzaAxxHW1LK4R1+t82IqQkXrJpbbzRTo9mG
nljxYMFXmoWcXp7quSsBA5bLtkDfxHwMVk9z5lHXJXuwNynG/UjOXQ2hOsx1
VhMcepYUJUkWKPsvv0sH6PQa8Tvmy0qcNVkuChdVSfBJGtfZE3GrMakIRvls
bfU0OoT20Kd+fwxplry/OYPo2Tro+IObYW5CBA2por31VVvDxp9fmizP5R2/
gSOK3ID9JequFuMQh5qD0+r6kPEGMLMPKfIfnr+6v5efrA3e38NObJg1gI01
gtXbq8szaUnwhDM7QetDEoRJKb0Z0DleDMG8EGe4gdqHdAXCjk/thip2dv7G
NDzYkeTjucBdto3CoWsJhE+pjoR+7GcAulF4IGuyjgBcs+ExJlcV0yViYZdM
ORVpT7abltahS6r0yaK1sqDNLUzIbLiSB0MsTRIQ6rc17RAlJqincNApnSEH
WainDuyLvJuzwi+xgmBbJtYT5dUCeITeRxmyEOmAgBPcV61POZWZoJmqlw6K
G2ayfsvKWABkZZAECIKWQ3n4zFyqHW19sI+S2LYY53i0gbua+YcBUO6JOmkQ
0OHpauHltHAVk+jlzgkpoIoBLZNT/dYe8+VpH0NJjupNf39M0ZtUUx5WhWQh
CJpwxyvaGObxHxZlNGUsBAV17ZHDhNh0kMnPdjH9SOtUtMeB+C71L9RP+/lG
VgLNUSpR5qkgEo69sdlaQyZ5ZBMMe7abpRwWGHYDjdEgHSSirxGYONhkrSf9
3XkYX9htiGI1+x8y75bWOXNMTACNFa1GIW2zm0kRLVDmEsEU27HmN/A0vh/o
ktYjIO3V1ovrAI23rpagfmcHh6M96ZQt5cqW1CXGqYNkc1YsmWtacTUWOT1R
z5LBI5xHUW1BzCA4lJBPw4seKwlewOk5hWNv7NVLtm2Ae8aLQrDkThJWZfta
dC5N/kyZ8ayf/IENaItG05W1pe9IzBxU3MOBxrTPly/j0PugxYlx6HS4v6ca
8MJ8/DlEJ2lCXV5DpjvbLXms/RFjs7pjIqgwB79g13dUjve8PoxPacBJdPf8
N70TRvg7dsuYg2vAK3n8gZfpYXo9PR++nqKfg/jrULjITZT2TunHdhriHIYR
wbozmRP2YER8KGR6Raf+WX9CmlIyT+9oekB/h0T5gW9F9CUQTa0FI1rrUUgi
CU1qokVdRGjnReUJXwUBCPuD4cE5A7dAhv7q8h0zBMJ9mZMQycKE8mmslzBf
LCRN89xpiZ/xUnTrXdk32J4EI3sp4B4qC7ot2G1mg3HJE0Lpm7wXx/vqE0LK
ohF/pFnhuIGOFtrcsunyKAHaBV8eidnJpIixkwC8q6b+CYMQ0mAxJyuBRkjR
MSJ79zLkmwSuhStzwMpLCGCjyh6mbJz4qSJL+d9hvWWftreS/0mZTAknlKJx
qHAU0iKyXrdl1FR1qPtSlZ2BjT6wl73cm+rRufZRFub6ZO3GsBmRogn8pxFS
09UiWZWSSlVpeZkBDgiS9CF+VXgjCalBClQNEy29+1bNcEd2XobaW78if0lC
csbTsQclyk8asolDVBpmCsvmBOCxxBRdJtBFyntB3hq7UbQiLTxfzZh1eWSt
AH49jewA504lvanwYBbij1B+DiBD9J9dsY6pDxIe+1f2suXV8YPCqTm4vLg5
NO+7xg7BDpuqCWW5KRjRtWf10oXtDPgvpaVSZXt/aXnytYUZyMX6Px1CtjMB
fXdIyz7EFmSn02KkAgNq5G5eV9PTDKBdmVpJqN1dMpTJn96CBxe1xGAGFI7M
xWUFOrW4DZxiQm0Vz7qSSVSDlKRj6m5RpO4AwXbKn1CEDEs9LCipGiBShpTb
24y5rWSiR4KDN8yqE3uosxlLhQ8ihtMQgiWXpaDfLDQi6FlJcLn8N0RFkARa
mKjprL6T3Gch7Z6EHeIQnilzd3LlXfzKOwI3wzpDxgUPwLMZlNYnvb2Jq83j
eeRuIQXpZoCX1AXHnA+REa1/pm1yWDlxswJqPX5Qaw+ptlEvSPpKFW1PZj+B
uJAw8aH9KGLquPM9J/oVKK9i6naaj758GaL6h7A+Bf0v1Lv1mxuwkrCeOVe6
X+XjRG4G9i1tabWEo22YnFkjnoxBtOTzKWhePjUIL2XLJeJZeQsooCKDU9fJ
bWyp2sb0pIbdLJJMohleM2+XMfLf1I7WcyghgjdZK/JzQO7aVVoDVfLHY4Ue
47ySgKyilkOSw/VIkVBVd5lsBmYhLhjJpoK9YfKoHOd2LVIfc1kYLFCH/U5i
AfSsY83sqbkMbCHNK5vltu4hQw4S9kZ/G+rwtoRM+bZIrN5kcsZZUQWviRBi
6UpxDgwdpHtJm2ZpQmd4RxyQ5qN8RHmdaiiskbIuoDME/m5VDYzUNuniQajk
RgtU9Qte/MU0KQxmI2RwczUJ65oi0lIhnXVwfXFyiLiJdYsitbL0zXLHxI8x
LiclUrraYUTo02h6oGXAPZx5r9j04AS6kt355e3f+kPVrvnwysicl2P2KJmL
6fuHw1TB336GxzZs+B1UNEOFAXuUfCdgSpGr0x6g+Hg0A+n2PVG66A5XBg3l
iIYwNVHFEpQGu6FGpP0CGb9AiXeGTCe4l4hOw7F/d5BeTxKq41fSU0Fw3Jvb
ede5/d1eEUXBC+kPXjNnTbvH1r1BAAkp6Yl0qs1Ll4QGuAzru/NW96hZYuFk
V6q8y7SMY0CzmKYdMQctYkViAqjf+cO6kHSx7OyCFVAtF+3098SM17oq5SOs
QQ+SpC7PL8/O/6l5Tn5DgYAY75+fvL8M916/YMScim6wOtkyed3UtpQmDS7m
Wmsu9MX2/04YmQv7AGO4kw8rK37bdJ/a5ncGHPXAJR/2cN6HAcIUq/iNkV+F
hLnL2eWdsOXXgKGYRjop9vFJH2Yo8UHEBbVIjAfiJ+boAS6dmJPYBlA1+jbd
aq3ibz/TI2ifLkGaOB8GnQwwQL2mu7oi6KDttK3Z4qtcPpMyHRWkKEb6quyb
dQTBsj4EJNVCca7YMT6VPIqUf5VHXeY2dxRVYM8lHG+JZa6l/MjQi5Ie2TV3
NWIEZgTmBDSydvDlf7gSggH49IfiJwFcVmRLyguSU+6hY0DliOItO1jnjOUH
msIS+dp24TNDKVsvlM4ApTvMO7PgspO+OfLQSi0usrPRHB+IaVJNj/SIdrO/
bzp+Mz5hrkXqPb6f76XoSHNqEJ1/Pvv92b+kkE08+zm0JsSeadK8CUu4RUBz
3QZietGk9GI6IM0NOSkt32oPacTkg/zzH+rO/kiNAgF6a305pODjooGLMaKW
vE4Xqkq6g3zUIB376YdjQhWMtq9KDSAZocqHNn64acFkYjdk0W7kJCWaBh+y
sMU6A/KzQSer1JsnAtXvJmOqViFQHCIeaPjdSCp2B/uXh/58bTeVt+PJBk0L
AhpzlzuCpzL/+fPnkEuF5Ifwakf+3aLXFCqq/U8z/XBqfjcHgRVsGulQ/2E4
TdcZpIMAMKG/f7aZpPElBmRTCb9T62WNgyAeylrmX9p66LSFRPBPLQkswk7G
9WMJt1I1RtISYutkucvph6uftZFvDhSzdlmwP+wALmJno5jrs1bSAzsJtkuV
xuvGarlPoEfXgDC02echlTgs78Y0V1eT1PJssDbFtpfxid1bO+10qW5D0FD1
Kj2a9trxUeaX6o41PFlIOyiYqKkq+ZQ3ARVRWhKYFZDjfEvLUfmuScPFJul+
Zo89K4Omn7qfLQtU+cit/tcwsQVgX/uGfpLA8mn6vKaRLs7hZyoSNQ9kOK/0
UIzVuqzWwkI3CM6h3z0utWwg1lEiQZpnygDHNKei2UYR6iCvpQQ9oEALgzG4
7IKzb328JkYgFVxDbsgrRc73a1x9CL9ggRWbF4mODlSthASmwarIFNLMqd5N
VCMgTQmsiV3nAK0xJcdYUDsD2G7Fvv/w+ZZkhiRUiOkQ8H/ZfaEnfeASNscK
8gpryRlHBWL36lps9dR/wlz/4E5TY9G09HfAy5K5P5NWtD6TtPWox8YFtseP
uOjAhERt5cwPg66e6+7oGLJ6qZMsdiLbEOl2kW+Mjv/OSd6Folh4JmctNje0
/nYOrg83vX7UoeoQM6AQYlFcsKxuZCY9qr2Lp7fmbLeOTRk7xYdY3zyVwmxb
lmKqQF8R1DZ82is7uZHn4NRvlx9SKygQhMic9sHS0GtCePixBEzFP1r5Bieq
ogLVgHXyqgwNFKF5R5tJdz5gm8EMD/L/oYFbop/CpjSrbIaCXTLeHhTBY+Oq
fghiY0Ty9xD/yuLSkNp9O0Gfrp3U7HoKX3YNQv3I8R2LgbNgN3lK2EpHNGkW
2Y3KpsrQJaLVHacwrUsFLDqA230X03SfUUyicpRqN6p6z5ekosa5JAyFZwRF
+q0tv3krQypXs0UDPYmfrz4wO/2PdBkBfr0mzP8zQF7bOzMtfCPVbYdwKjNX
UAO3LKvCjcx7B30H9rni3zr3HPYe033mlO9cOzLTvITMXGV+5fKgzuVWxUbh
0aV0psXs/3ff/Sz/4wjs3MNOfPddOH01hCwNZWykIlhQKzLZnUHKjHjBBciS
ZrxsIWJXwdDqxOHLwfBO2UgEFM1W/KKNR9Trhnt4SLTkvXxxl/wcvBfO+3z6
Yfqfzihjs3n3evxmnBZQr/4XS2J39HFFAAA=

-->

</rfc>
