<?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.1 (Ruby 3.0.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-liu-path-validation-problem-statement-00" category="std" consensus="true" submissionType="IETF" xml:lang="en" updates="draft-liu-on-network-path-validation-00" version="3">
  <!-- xml2rfc v2v3 conversion 3.18.1 -->
  <front>
    <title abbrev="Path Validation Problems Statement">Path Validation Problem Statement, History, Gap Analysis and Use Cases</title>
    <seriesInfo name="Internet-Draft" value="draft-liu-path-validation-problem-statement-00"/>
    <author initials="C." surname="Liu" fullname="Chunchi Liu">
      <organization>Huawei</organization>
      <address>
        <postal>
          <street>101 Ruanjian Ave</street>
          <city>Nanjing</city>
          <code>210012</code>
          <country>China</country>
        </postal>
        <email>liuchunchi@huawei.com</email>
      </address>
    </author>
    <author initials="Q." surname="Wu" fullname="Qin Wu">
      <organization>Huawei</organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>bill.wu@huawei.com</email>
      </address>
    </author>
    <author initials="L." surname="Xia" fullname="Liang Xia">
      <organization>Huawei</organization>
      <address>
        <postal>
          <country>China</country>
        </postal>
        <email>frank.xialiang@huawei.com</email>
      </address>
    </author>
    <date year="2023" month="October" day="23"/>
    <keyword>Path Validation</keyword>
    <keyword>Routing Security</keyword>
    <keyword>Proof of Transit</keyword>
    <abstract>
      <?line 88?>


<t>This document provides a problem statement, history revisiting, gap analysis and use cases for path validation techniques.</t>
    </abstract>
  </front>
  <middle>
    <?line 103?>

<section anchor="intro">
      <name>Introduction</name>
      <t>Path validation has been interpreted differently in different contexts due to its ambiguous name and long history. This document aims to deliver a clearer understanding of the path validation problem and help navigate exploration towards potential solutions.</t>
    </section>
    <section anchor="problem-statement-of-path-validation">
      <name>Problem Statement of Path Validation</name>
      <section anchor="history">
        <name>History</name>
        <t>The term "path validation" was first used in the BGP context, referring to validating the correctness of AS-level path propagation. The term "path validation" mostly refers to verifying that a BGP route advertisement (an AS-path) is authentic, indeed authorized by all ASes on the path, and correctly representing the inter-AS propagation path, which later becomes BGPSec <xref target="RFC8205"/><xref target="BGPSEC"/>. While some RFCs also discussed data plane consistency with control plane <xref target="RFC5123"/>, mentioning validating also the actual path that a packet has traversed, it remains a minority of understanding to this term.</t>
        <t>Later, as the inconsistency gap between control plane and data plane becomes bigger, the term "path validation" later be interpreted by a lot of research papers <xref target="PATHVALIDATIONPAPER1"/><xref target="PATHVALIDATIONPAPER2"/><xref target="PATHVALIDATIONPAPER3"/><xref target="PATHVALIDATIONPAPER4"/> as "Validating what path a packet has actually traversed". The unambiguous equivalence to this interpretation in the IETF community is the concept of Proof-of-Transit <xref target="I-D.ietf-sfc-proof-of-transit-08"/>.</t>
      </section>
      <section anchor="scope">
        <name>Scope</name>
        <t>Despite the different focus, control plane or the data plane, we think they are two sides of a same coin. The former is to make sure the router receives the correct routing reference (routing table, interface configurations, segment list etc) before the forwarding happens, while the latter is to directly verify the correctness of forwarding outcome, after the forwarding is done. As a result, the scope of path validation should be:</t>
        <ol spacing="normal" type="1"><li>
            <t>Validating the planned path is a trusted, authorized path.</t>
          </li>
          <li>
            <t>Validating what path a packet has actually traversed.</t>
          </li>
        </ol>
        <t>With the former protecting routing integrity and the latter protecting forwarding security.</t>
      </section>
      <section anchor="goal">
        <name>Goal</name>
        <t>Given the above scope, the goal of path validation is to achieve:</t>
        <ul spacing="normal">
          <li>
            <t>Verifiable assurance of hop-by-hop forwarding integrity.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="gap-analysis">
      <name>Gap Analysis</name>
      <t>There are three major gaps in path validation.</t>
      <ol spacing="normal" type="1"><li>
          <t>The gap between path validation and proof of transit</t>
        </li>
        <li>
          <t>The gap between BGP scenarios and more scenarios</t>
        </li>
        <li>
          <t>The gap between routing integrity and forwarding integrity</t>
        </li>
      </ol>
      <t>The first gap is explained in the history section. Now we believe proof of transit is part of path validation.
The second gap requires use case analysis which we will discuss later.
The third gap exists in both explict routing and conventional routing scenarios, and it is the main gap for path validation to fill.</t>
      <section anchor="routing-integrity-vs-forwarding-integrity">
        <name>Routing Integrity vs Forwarding Integrity</name>
        <t>Also known as the inconsistency between control plane and data plane. To achieve secure routing, three basic steps are needed:</t>
        <ol spacing="normal" type="1"><li>
            <t>Secure path propagation</t>
          </li>
          <li>
            <t>Secure router execution</t>
          </li>
          <li>
            <t>Secure proof of transit</t>
          </li>
        </ol>
        <t>Secure path propagation relies on secure control plane techniques such as BGPSec and RPKI, leading to the correctness of routing reference information such as routing table, segment list, etc. Secure router execution relies on remote attestations on the trustworthiness of the router hardware, firmware, software and configurations. Achieving these two leads to routing integrity, and <em>implies</em> forwarding integrity. However, misconfigurations and/or various of new attacks could circumvent the security measures, leading to the deviation of actual forwarding path from the correct routing path <xref target="SECUREROUTINGFAIL"/>, which can only be directly discoverable by data plane validation mechanisms like proof of transit. A secure proof of transit mechanism would significantly help fill the gap between routing integrity and forwarding integrity as it verifies the final results directly.</t>
        <t>Note that a probing mechanism such as IFIT/IOAM or other new path tracing mechanisms <xref target="I-D.filsfils-spring-path-tracing-05"/> also has the same purpose. But they still rely on a secure proof of transit mechanism.</t>
      </section>
      <section anchor="proof-of-transit-security">
        <name>Proof-of-Transit Security</name>
        <t>As discussed earlier, the gap between routing integrity and forwarding integrity can be filled by a secure proof of transit mechanism that directly verifies the final forwarding results. Proof of Transit (POT) is thus the critical part of the path validation problem and we model path validation security around the security of a POT mechanism. We say a Proof-of-Transit mechanism is secure if the transit proof is correct, unforgeable identity-binding and position-binding.</t>
        <ul spacing="normal">
          <li>
            <t><strong>Correctness:</strong>
A transit proof created by the right node n_i at the position i must pass the verification. (probability of a correct proof not passing verification is smaller than a negligible function)</t>
          </li>
          <li>
            <t><strong>Unforgeability:</strong> A transit proof at position i must only be created by the node n_i. (probability of a forged proof passing verification is smaller than a negligible function)</t>
          </li>
          <li>
            <t><strong>Identity-binding:</strong> A transit proof computed by a false node n_z at position i cannot pass a verification check.</t>
          </li>
          <li>
            <t><strong>Position-binding</strong> A transit proof computed by a correct node n_i in the wrong position j, where i != j, cannot pass a verification check.</t>
          </li>
          <li>
            <t><strong>Hiding</strong> * A transit proof may or may not directly reveal the creator's identity and/or his position.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="use-cases">
      <name>Use Cases</name>
      <section anchor="service-function-chaining">
        <name>Service Function Chaining</name>
        <t>Service Function Chaining enables the traffic to traverse virtual network functions in a user-defined order. Compliance or legal requirements may demand the service provider to prove that all packets have followed a specific path, preferably cryptographically verifiable. In today's deployments, this proof is typically delivered in an indirect way. A path validation mechanism can produce a cryptographically verifiable transit proof, proving that the corresponding packet has indeed been processed by a sequence of service functions.</t>
      </section>
      <section anchor="workload-identity">
        <name>Workload Identity</name>
        <t>Enterprises have been migrating their production-level IT systems to the cloud. This means that some of the enterprises' key production workflow security now heavily relies on the ordered calling of different microservices or APIs. Similar to the SFC case, workload identity <xref target="I-D.gilman-wimse-use-cases-00"/> also requires some kind of ordered proof-of-processing, proving to the enterprise management that the production systems are working correctly, or proving to the customers that they indeed received a sequence of services with a designated order.</t>
      </section>
      <section anchor="traffic-path-compliance">
        <name>Traffic Path Compliance</name>
        <t>For legal or business compliance reasons, customers' personal data cannot travel outside of certain geolocations, i.e., customer campus or native country (GeoFencing). Path validation can detect and avoid such exception. Similarly, path validation can make sure certain undesired geolocations will not be travelled too.</t>
      </section>
      <section anchor="high-security-traffic-path">
        <name>High Security traffic path</name>
        <ol spacing="normal" type="1"><li>
            <t>End-to-end Security: Some customers have high-security service path requirement for their sensitive traffic, i.e., VOIP calls or video conferences for VIP clients, or a bank's financial data.  They need to make sure their data does not leak outside of their chosen secure path, especially to some insecure devices or domain.</t>
          </li>
          <li>
            <t>To provide high-security VPN services for VIP customers, the operator needs to prove that the VPN connection indeed passes through a high security level service path.</t>
          </li>
        </ol>
      </section>
      <section anchor="validating-urpf-path">
        <name>Validating uRPF path</name>
        <t>uRPF is a security feature that helps prevent source IP address spoofing and denial-of-service (DoS) attacks <xref target="RFC8704"/><xref target="RFC5635"/><xref target="RFC3704"/>. It works by validating the source IP address of a received packet by performing a reverse path lookup in FIB table, all the way to the source. If the path does not exist, the packet is dropped. Now path validation can do one more step of validation, by sending a request for proof-of-transit all the way back to the source. By sending the request to the source and collecting transit proof of every hop on the path, the router can validate if the currently stored path does not only exist but is also unexpired, potentially reducing the false negative rate.</t>
      </section>
      <section anchor="segment-routing-security">
        <name>Segment Routing Security</name>
        <t>In certain scenarios, user wishes to have explicit control over the path that network traffic takes, in order to meet certain performance, security or regulatory compliance requirements. Segment routing enables source-based packet steering through networks using segment lists. However current segment routing security is also implied by assuming the router will truthfully forward the packet according to the segment list. Path validation is a critical verification technique that checks whether the planned path was strictly followed, and could support segment routing as potential security extensions.</t>
      </section>
    </section>
    <section anchor="out-of-scopes">
      <name>Out-of-scopes</name>
      <ul spacing="normal">
        <li>
          <t>Illegal data copy: This refers to an attack where the router illegally copies and sends out the data he is currently forwarding. We believe this is out-of-scope because data is intangible by nature. Once fully obtained in the plaintext, there is no mechanism to trace it unless using a data watermark technique, which is out-of-scope.</t>
        </li>
        <li>
          <t>Stealth nodes: Stealth nodes are the inferior nodes that not perceivable in the current layer. They could be old or computationally weak nodes, or nodes within transparent tunnels. We believe this is out-of-scope because layered design of the Internet purposely makes tunnels and inferior nodes not perceivable. It does not make sense to violate layered design principle just trying to perceive stealth nodes. To the very least, it is a problem that the control plane (BGPSec) also suffers from <xref target="BGPSECATTACK"/>, and the goal of this work is to fill the gap between the control and data planes thus leaving the problem out-of-scope.</t>
        </li>
      </ul>
    </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="RFC8205">
          <front>
            <title>BGPsec Protocol Specification</title>
            <author fullname="M. Lepinski" initials="M." role="editor" surname="Lepinski"/>
            <author fullname="K. Sriram" initials="K." role="editor" surname="Sriram"/>
            <date month="September" year="2017"/>
            <abstract>
              <t>This document describes BGPsec, an extension to the Border Gateway Protocol (BGP) that provides security for the path of Autonomous Systems (ASes) through which a BGP UPDATE message passes. BGPsec is implemented via an optional non-transitive BGP path attribute that carries digital signatures produced by each AS that propagates the UPDATE message. The digital signatures provide confidence that every AS on the path of ASes listed in the UPDATE message has explicitly authorized the advertisement of the route.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8205"/>
          <seriesInfo name="DOI" value="10.17487/RFC8205"/>
        </reference>
        <reference anchor="RFC3704">
          <front>
            <title>Ingress Filtering for Multihomed Networks</title>
            <author fullname="F. Baker" initials="F." surname="Baker"/>
            <author fullname="P. Savola" initials="P." surname="Savola"/>
            <date month="March" year="2004"/>
            <abstract>
              <t>BCP 38, RFC 2827, is designed to limit the impact of distributed denial of service attacks, by denying traffic with spoofed addresses access to the network, and to help ensure that traffic is traceable to its correct source network. As a side effect of protecting the Internet against such attacks, the network implementing the solution also protects itself from this and other attacks, such as spoofed management access to networking equipment. There are cases when this may create problems, e.g., with multihoming. This document describes the current ingress filtering operational mechanisms, examines generic issues related to ingress filtering, and delves into the effects on multihoming in particular. This memo updates RFC 2827. 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="84"/>
          <seriesInfo name="RFC" value="3704"/>
          <seriesInfo name="DOI" value="10.17487/RFC3704"/>
        </reference>
        <reference anchor="RFC8704">
          <front>
            <title>Enhanced Feasible-Path Unicast Reverse Path Forwarding</title>
            <author fullname="K. Sriram" initials="K." surname="Sriram"/>
            <author fullname="D. Montgomery" initials="D." surname="Montgomery"/>
            <author fullname="J. Haas" initials="J." surname="Haas"/>
            <date month="February" year="2020"/>
            <abstract>
              <t>This document identifies a need for and proposes improvement of the unicast Reverse Path Forwarding (uRPF) techniques (see RFC 3704) for detection and mitigation of source address spoofing (see BCP 38). Strict uRPF is inflexible about directionality, the loose uRPF is oblivious to directionality, and the current feasible-path uRPF attempts to strike a balance between the two (see RFC 3704). However, as shown in this document, the existing feasible-path uRPF still has shortcomings. This document describes enhanced feasible-path uRPF (EFP-uRPF) techniques that are more flexible (in a meaningful way) about directionality than the feasible-path uRPF (RFC 3704). The proposed EFP-uRPF methods aim to significantly reduce false positives regarding invalid detection in source address validation (SAV). Hence, they can potentially alleviate ISPs' concerns about the possibility of disrupting service for their customers and encourage greater deployment of uRPF techniques. This document updates RFC 3704.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="84"/>
          <seriesInfo name="RFC" value="8704"/>
          <seriesInfo name="DOI" value="10.17487/RFC8704"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RFC5123">
          <front>
            <title>Considerations in Validating the Path in BGP</title>
            <author fullname="R. White" initials="R." surname="White"/>
            <author fullname="B. Akyol" initials="B." surname="Akyol"/>
            <date month="February" year="2008"/>
            <abstract>
              <t>This document examines the implications of hop-by-hop forwarding, route aggregation, and route filtering on the concept of validation within a BGP Autonomous System (AS) Path. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5123"/>
          <seriesInfo name="DOI" value="10.17487/RFC5123"/>
        </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.filsfils-spring-path-tracing-05">
          <front>
            <title>Path Tracing in SRv6 networks</title>
            <author fullname="Clarence Filsfils" initials="C." surname="Filsfils">
              <organization>Cisco Systems, Inc.</organization>
            </author>
            <author fullname="Ahmed Abdelsalam" initials="A." surname="Abdelsalam">
              <organization>Cisco Systems, Inc.</organization>
            </author>
            <author fullname="Pablo Camarillo" initials="P." surname="Camarillo">
              <organization>Cisco Systems, Inc.</organization>
            </author>
            <author fullname="Mark Yufit" initials="M." surname="Yufit">
              <organization>Broadcom</organization>
            </author>
            <author fullname="Thomas Graf" initials="T." surname="Graf">
              <organization>Swisscom</organization>
            </author>
            <author fullname="Yuanchao Su" initials="Y." surname="Su">
              <organization>Alibaba, Inc</organization>
            </author>
            <author fullname="Satoru Matsushima" initials="S." surname="Matsushima">
              <organization>SoftBank</organization>
            </author>
            <author fullname="Mike Valentine" initials="M." surname="Valentine">
              <organization>Goldman Sachs</organization>
            </author>
            <author fullname="Amit Dhamija" initials="" surname="Dhamija">
              <organization>Arrcus</organization>
            </author>
            <date day="23" month="October" year="2023"/>
            <abstract>
              <t>   Path Tracing provides a record of the packet path as a sequence of
   interface ids.  In addition, it provides a record of end-to-end
   delay, per-hop delay, and load on each egress interface along the
   packet delivery path.

   Path Tracing allows to trace 14 hops with only a 40-bytes IPv6 Hop-
   by-Hop extension header.

   Path Tracing supports fine grained timestamp.  It has been designed
   for linerate hardware implementation in the base pipeline.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-filsfils-spring-path-tracing-05"/>
        </reference>
        <reference anchor="I-D.gilman-wimse-use-cases-00">
          <front>
            <title>Workload Identity Use Cases</title>
            <author fullname="Evan Gilman" initials="E." surname="Gilman">
              <organization>SPIRL</organization>
            </author>
            <author fullname="Justin Richer" initials="J." surname="Richer">
              <organization>Bespoke Engineering</organization>
            </author>
            <author fullname="Pieter Kasselman" initials="P." surname="Kasselman">
              <organization>Microsoft</organization>
            </author>
            <author fullname="Joseph A. Salowey" initials="J. A." surname="Salowey">
              <organization>Venafi</organization>
            </author>
            <date day="28" month="August" year="2023"/>
            <abstract>
              <t>   Workload identity systems like SPIFFE provide a unique set of
   security challenges, constraints, and possibilities that affect the
   larger systems they are a part of.  This document seeks to collect
   use cases within that space, with a specific look at both the OAuth
   and SPIFFE technologies.

Discussion Venues

   This note is to be removed before publishing as an RFC.

   Source for this draft and an issue tracker can be found at
   https://github.com/bspk/draft-gilman-wimse-use-cases.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-gilman-wimse-use-cases-00"/>
        </reference>
        <reference anchor="BGPSEC" target="https://www.potaroo.net/ispcol/2011-07/bgpsec.html">
          <front>
            <title>Securing BGP with BGPsec</title>
            <author>
              <organization/>
            </author>
            <date year="2011" month="July"/>
          </front>
        </reference>
        <reference anchor="BGPSECATTACK" target="https://yihchun.com/papers/ieee-net-19.pdf">
          <front>
            <title>BGP with BGPsec":" Attacks and Countermeasures</title>
            <author>
              <organization/>
            </author>
            <date year="2019" month="August"/>
          </front>
        </reference>
        <reference anchor="SECUREROUTINGFAIL" target="https://blog.apnic.net/2022/12/16/opinion-is-secured-routing-a-market-failure/">
          <front>
            <title>Opinion":" Is secured routing a market failure?</title>
            <author>
              <organization/>
            </author>
            <date year="2022" month="December"/>
          </front>
        </reference>
        <reference anchor="PATHVALIDATIONPAPER1" target="https://dl.acm.org/doi/10.1109/TIFS.2020.3001669">
          <front>
            <title>Atomos":" Constant-Size Path Validation Proof</title>
            <author>
              <organization/>
            </author>
            <date year="2020" month="January"/>
          </front>
        </reference>
        <reference anchor="PATHVALIDATIONPAPER2" target="https://dl.acm.org/doi/10.1145/3409796">
          <front>
            <title>Unveiling the Mystery of Internet Packet Forwarding":" A Survey of Network Path Validation</title>
            <author>
              <organization/>
            </author>
            <date year="2020" month="September"/>
          </front>
        </reference>
        <reference anchor="PATHVALIDATIONPAPER3" target="https://dl.acm.org/doi/abs/10.1145/2619239.2626323">
          <front>
            <title>Lightweight source authentication and path validation</title>
            <author>
              <organization/>
            </author>
            <date year="2014" month="August"/>
          </front>
        </reference>
        <reference anchor="PATHVALIDATIONPAPER4" target="https://www.usenix.org/conference/usenixsecurity20/presentation/legner">
          <front>
            <title>EPIC":" Every Packet Is Checked in the Data Plane of a Path-Aware Internet</title>
            <author>
              <organization/>
            </author>
            <date year="2020" month="January"/>
          </front>
        </reference>
      </references>
    </references>
    <?line 209?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA61aXXPbRpZ9V5X+Q4/9ENtFkJTkOCNVbe0ysmWzxrE0pmzv
W6oJNMmOQDQGDZBmXP7ve+7tDwAktfFObU0yoUh09/0899zbSJLk9MTWssh+
l7kp1JWoq0adnqSyVktT7a6ErTM80czX2lptivtdiYemb+5vTk90WfHztj4f
jy/H56cnuSyWV0IVpyenJ7Wuczx6J+uV+Cxzncka68VdZea5WotZjSPWqqgH
4p22Nc4aiLeyFJNC5jurrYBM4pNV4lpaZU9P5Hxeqc2j+9l2w9OTzKSFXOPw
rJKLOsl1k5RYlmzisqR0yxIbViXj8emJmVuTq1rZK3F60pR4lj62u2Bhoeqt
qR4ONqTl9DythLSVkvSJHl1Wpind1w/bq9MTIZJ9LdyXH01T62IpZiptKl3v
/KOVMQuBf+4rWVhd8/ZNvTIV7ZXQQ7qAlNdD8V439KfT/XrVFOlKhy9NtZSF
/pOPuxLvGrlVmr5Xa6nzKwHtUrfgv1b82zA1a/rd1pVS9ZU4G5+Jj40s/tCy
EJONot9SCHklPtCXxZK/MBlOPj8bj8/O3d9NUVMUXa90IXvi/nMovnSk/acu
/N+PCXqwVxB9rvN8uG36crcHvR+K/9ayPek9FFiGr/7Phy3ghIfhVw3XYZve
mfS/wlRrbLZR7OePN9d/Px//HD5f/DJ+Gb93n5FExWJ/zc9n5xfx86sLt36a
vB5qVS8Su0gpes0iwT+1i4lk/HeIOp1d397d3oenFzq39G9iywr+cRGLBSn9
AanE3eT+3f3HyfX0w9uwZqnztSySrV5blTT4N6XsQ3BfiS/T32Zv6Llf397N
3lyzUEL4LHchC7viR7HVCG58sCp1D7m8OB+fnSXjX/w6WS0prFZ1Xdqr0Wi7
3Q5Lg2+NGSLFRtqWqclHfs1oviyx23BVr/NWhMn9/eT6H5RZHUn2BHhy9URM
6lqmDw5RrsmxqloraZuKcKUn3yUMeVy+nV5RfpCnR6UsVWVHWilFcJCcXQ7L
bEHrINSnj28+3n66h01vJtP3fSvdlrpAoJFMUyss2UxlovJpL8VaVg+qFgtE
Gn75z75w5+eJS6pD4ea5WQ5lWeiUbUfPjs7wz6uRcScmGlHgjkv8cYlM3HGJ
P25Ee1NIfJ68n76e3E9vP9xN7t58POvrMKnN2lhS4doUVDnqZKb/VMdw2Sz2
NBgn47PjGmT5UKbrIdJxlBk9OhsPz87Gl6P76c1sSAuHF4CUV68uH5HxvC/j
p2KjdE42rVdK/Laz8PiOIHRKvoeJIG1Klr4x1VZWGZ7kOBGzptoofvKDg/lj
QN1X6PLHFXr58+ji5fjyl8tXj6hx0VfjvV6uasAL/l9Y01SpEgT8KFY6dUam
iKa0FptHJDx7+WhE70ko5zZKef7q7PL84nJ4/ur81cX5xSPSvuxL++Zuek1W
fLMhY3sDI8yvVwofM4Axe+O1rKW4A1FQZGbJBk4m8IKK3jkSNeJx1ABKFfor
65GaYqEqVaRq5L61vpKej0clsh2WYxuNcrUsVOUgO0kSAeUJGLm2fru6QpIT
JfhOf167z4RwXCRIkM9nAlxEEx8ShSGO4MRDCaevoWytvtZCpqnh4BK1Eb+p
7CfLy9Q2PH1j0saKP0CgBHaC3fTCe3ZA+zrXKioQqWc2bt1rlbrDse+C98Bn
z2hEZDQcHUtQKhko1TMoVsqK1z4fIKbyhsMIPy1RfwrykcTBK1UJcKgmnElG
GXWNcr/CkvAEnbzRmQLAHgoxECvH7rzFCHoGfalITLhLcKmBPtV+SMOa6arQ
/2qUHbY+W+ssyxX99ZQipzJZwx4S355q+pMFvdvbaSWtmCvWFLGGmKjhrEwv
OGzqfEcWiH+CBRTkSKjaKLK1xke5nutlY2BzohMsPIjzMqg5FH3bSFRSWpqp
HBauYKI0Vwj2SjRFhipC1JsiBLlA2bGvebAnHbNSeYlDN3oJ2wr1tcxN5e1j
CMWsQAElcJB5dK0dCmexp4fEm848gDc8+TQQcudpaI56KZ7sifZEbGHLhYYK
5L2Y31R/vd0G8DksWfkMCGs9LCM3KuRUoawlSSazJFcblTsTQO9SLvkgsuij
MqAUkdf4HLYzJ9HOnSFhfpaHSh5cleHHGunJyj8jGjtjUvScEiAi6wCaZAoK
OZKN2paJ+U7IPMfzilMteGrAfvGKsBgeZYKOHGXJZNbVx6/crnS6Ejl8USEi
kVzYmmiNSsW3b544fv/+7ZujOt+/gy6vdK7gWUQdfofEuUVcaYv8J/tnBKwl
Ayvsj8RCLKQ7x4XIIZXJ/c+8P5HM798HgowBqUjijoN4b9IAoNhI7xRv0dJB
O6USQBM2xekwWg31wZELgoG1BhEG7pJj+3Fe07YwN/nTxeZ7MgEsab3FusIT
TsxRiSlj+zqQ4TsaBwsiN5e0W/14yAST9yCAHIw85pwgF8oKznE8D+Y6xorI
N8eYyCPfXzzy/cvv30n1J59b22/JzCx2z9bOE4iyaPQnLjWaosUk9a9GQ1kq
gdHUUU8Xfj5PqYUXhOlNQY7S1iclVpYOGkKP4ftO2CEJLQaFo8eVp2KWmpJx
+LWypUai0UYtiHKBGuy5DyDPT0UPIiFooS4e6Ad4A3wADExYLizMFCzhbWq0
RwRqm+BIzWm/lg9IjaZyh3O+V3BkqgC6tgs3kW0zZLCdnoWvagmAHDh7LWTK
1ljAsA5loYNVS8aOHPEpVJ0+RxhBDHfoInJJuKssFS3YcsrSr4i6OkqbaQ8Y
Dq2OwWFnN0hHwY0UWdAWe2dxsSnUUEwo8RC7TV67+LfkF9prv6jYlWlyxLyf
VZwNxec+NJNHCuWpJWGjm/JQmndAkX6lMDjvrf/h6HUR9EUzsER3AihrYlrk
Ie8W8seS0YSSvmPMzrMdgwTO5/ZHfL41MqePb5niMKjNzcbbx5lqiUeOWcq5
S6Yrrbg9Pz15IT4zTaNQQeIi5CTFENauTJnMdwn+03NPEH7oqnB3xOXrK+KH
o31VKYVA/gO5AdyjvN2XZ+jdReHfhcZ9sbktCGOjOoyNzg8XUnG0qSrACY0j
YmsK5/jV6cnF4aLjfjmmcyAQjiXQHjAoEReUiZYxBIJoHcMeig9mS2gwB2WC
2Q80oU3AYusjDhu687CT8dy3IkREVkSG2fJOV4Fx0FajtvtC6sqD3wd4VLlt
1FcIyS6ZG+Lk0EF3wMTRAHSdXEsRS+GHaElHFZzwpDRVSt75KN8Fraehlg/g
MBecRoNvbKd1bb+n5ydUuR8Ksy2Ol9QfKafweYx6P6YIGg18nM6l1SlovkKg
UvQWYEwqu/IBOnNr9qkcx+Cs3Q85rL7iT/fbRbvuIHZPTx7ZEg5GlDAr84L2
FWtbB5QHuFtGlkUqf7z7x3QgQMhbbnKAxIcFI47s6FC/6V4N6VaKAZWKR/Xu
KAD+ZIinAtysK9aRbTL+bk1FFdLL1Sl0KwQCddADyrS1+2TNouau2sdmp5Ch
VrBvPdxbV2nJCgx3B/ntYvd3vS5J0t+Pw5t4Z7YIF3CvNTKpdx4tHyHMN5QJ
DQtfqC3pyWO5lKtRqiu0TJRBrnh5FBdhUnfgpgwKOB8QO3A0tSMZB8qiMuuj
1Z9//fbtYF5HjNjhQor+wBQ5JUxbrwkkUDoqRn9wxg4D7aTvGjEnC23R+eX6
4TCcYf8QrAfYFteKLZvF6mXBUwHuTrkFJGhwVevfAmWKVhzkpg2eHC00gxaT
BxvVdRX0g2FK56g/ekjarJUyxP/0Zno/mt5OfiNq5yYI5GPXN7iZc9cu4JKd
6TNxYIKtlUcsZnplU5XGAot+bWrHCW1NmiNfdpQW8q9t2CGpB2y2vWQBZtpO
HwXujzD3PcS/aWIKnrliT4Xm4q8dzjbuU8O+fzpHeVcND26HxDPQ8+euyjSe
+UIkBFAei+ZfDRpQEtcmC614lziGpJSwhedi8Ts3zbu975r/C/mStD8wf6u2
DpNwoRce69wjzlTahuQdoNOBCZaKsw99AYptvUsQkFmowQgYzbdx/suho2wv
Xly3mH714gU8vndKWinp+0DGVZ65FjCCKH7XQCpnM7+70GJNM7sS/I9/6E7u
huIZ2VLOdR6tEtDHneUme9Zyy91ZyZZYgyQzyZcU4YVa5nqpSd9FUzA9eh5U
+hSMwQdBK7GvFBHxPZEDou3pGzQ9JjyfEvjk/4Pc0z3HHZOc5pRN7MsXAIco
4597aiHVgkHxaE+ulCbPMQTu9mLjL48NXoth4PnqtqJ5XxThD6oYROK1+Nt/
0F8/LNE77eU4lGSNrAGQ0n9or4gKFUqszH1aw4Wm+snGVAh1lpr+IF47/+vc
pbu2XVUbDTZz4x0krlfgpORcIluP/QY6C6/akKgLqMYF2Xd1YqMrrsT+mjy6
n7mzJBZeJZlaMP83VQaqLa4NEQvXRlWo8ksuRUzbiUNZtkKm1jIijhPOj50r
Op8+hyqV577xtCgoG+os8xzcJCMQLlVK3vAzuJI5HRQCYle7sjbLSpYrwsoI
wKTtEAwbh2RyB2NnqszNjgUbuPlKxKl6V/q1ftrrehxJMxfnQbGVO6r++8Da
oiFVjpJn2YpC8H+Rqh8xA2eOMPeMnMeWpvB8KPbifr7Jc3CsShXXPV+lQJV9
QxvsHF0Y+pEvcGxuZCZCKp+evHEzJk0TfDY6b77WyypOFXTlFeMkdLPe6b2w
dDvnZuQsdG6azA/RQf0K6/ThqacvXao96yfxAF7Qbiso5hbwdluW0AmBNsmN
5uwJVJv24fCD4mRYP4Jvp1ZrnVbGW8BSXE7upii3M73WuayCtLOba24qB3ww
2yQmIygOX5kHchM7UdblAU6gE4MQ8UbfO4RbrehSs6c4UqKQSzfIjv7umCEY
lfg/SUabxDH1gNTZ2xrcp4ZYlY3b7UKY+Cladjw6rBswS4Q8UVUuKj6vfbTc
e5Tgq4Y2109PbmK248O8sa6zSVs0AMBZnrtF6X4SNJHlDpupt4daRp+cBmU0
LiTpUlXV3GErk5s0zO/0UA3b3bAacM/OLfj9i/DWh3j2VpkbKAoDPR+K/Tsk
StFM0eSJOYfcGJ05Hqy+0vCUUdcHCll7P9lpfTuvDJLSmNxqCoWuzG42QTrO
lVeTGGVtTLTvO3CVyGYjJtOh3Iq/KbKkNomCpOGhKzGjEGx9zhm7wj5JTJsI
siR8B415XuGy2SqCH7KbPzQY+PPt9I6zim1LGG1EezXrrvg+0yPIRoZRQ/di
c1k8/GSZ6sLy3sNDQeOnHY8XDua8kIGjIDPYlGyEDvGhGwXumXSFRI7jAYf8
iiuBG0gal5G68E9QY+mTPjM0pxm62ZkJFWfPVJ/vPrTZEHULxnV9hEHcUrVm
RexexaIHaBPYqHAzsJB7xCG42IJvLynL6OQW2xyIdl0VILozkG0+3t04N56e
8Gce6MY9FmARzp6QhPpLKmiK+3D/zgG0kVlWUXKimphFINsAOliQMCtI8Oy1
mT2Pfb27xvpl/JKuPvyrTP7jBX+LulozPFkqPnvXg4eHMxuNaOTrGRbCtDSP
ca/QkOjEQ1jh3JiHpqQafDP9NYxmpO+eUYoD+rmzIE6nN4pBxaO/gf+Bz6SR
e2XKkmbYNKs8luCZQZlRfpxaq5Kkbx8ZkNwIyiwITQMql1v7r3b15J1DgH2h
f2134tbF79V7yg+BgB1uXN4nm/hH8UsbNLvuXW92ZkyklFcgdmoIIX9tThPc
cGEQLcfNBpsP8M5m40LYFOprSUg3aC+suTijegUtPOVXSwfMyB0VAW/mZ2uH
r0uCpgU47QxeiXMCR+1KceIx2LkBrq7jtJCmOq3zORkChY00F9hDRaRwBY7h
SCEcwpE+Dql0DTptMd1DLZtc8oy7V91aijuMSoUhQ+DZzn/JXNo25hFPyl2q
e1zwktKQ292AtMNHGwdzwVvx5zijDqIGB7lBn2OE1jbrGFouErgk1VVTrxYN
Oc6PJboZ0nvzxXH2VqTDisqIFMcUvY4pzm+dT7iBotG94hHTwWUVvZNg60pz
sxSIf7im53laU5amOjSC7L09ESyivtZU5HrvUdw2NWMe3R5ZauSmuWMxjpGY
EvWV6Wv7UgL1xAyKvlPsGFO7xdSBmJLIKYlK+WypkLWXpDTHt52Ea2dBPGUJ
dyXuwpfXRiHpclzS9Qdv5C6EZeG6c7i4YPwfituCuT6JYuZ174aGL2zcGx21
a3UpwbujK+4AaTReI71zQmsXitIduqVLFXrdsPVnmLPuCUt2fiFmNbpcuJNa
b3vV/9NflvEYHpFCNZW/djlLjbeqqEa4KVHRBSqRyx0xU6YUqb8EFSYnyuqb
f+kucGCELZEJ3poJijuEyC7tSfhZSt6zbhB+uf1xN7AQ9MIGM+bQ1cRXE/3c
ExIQ2bFhf3d/1Fd5T1uupxF9HVVC+PKbABtt6GZr/3B6MzjVJSzFb6GB/Pqk
9dty8WptzyzIT7yIfkiqjO5Sq333q9OAdm9inrl7l+cOY2yz4OzgCX14y8W9
0Esz+NDrh4tZNiijsbuSPToD757Zv9Dy09Cc+sBwx+2l3Q8+SvHIpukVVxox
ODJ++OYbddNIhEVTMRxF3Eh768K208mHyY9uyc/KTt9Nr7xR+afP/wOHvRRI
tjEAAA==

-->

</rfc>
