<?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.6.39 (Ruby 3.2.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-iab-privacy-partitioning-02" category="info" submissionType="IAB" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.18.0 -->
  <front>
    <title abbrev="Partitioning for Privacy">Partitioning as an Architecture for Privacy</title>
    <seriesInfo name="Internet-Draft" value="draft-iab-privacy-partitioning-02"/>
    <author fullname="Mirja Kühlewind">
      <organization>Ericsson Research</organization>
      <address>
        <email>mirja.kuehlewind@ericsson.com</email>
      </address>
    </author>
    <author fullname="Tommy Pauly">
      <organization>Apple</organization>
      <address>
        <email>tpauly@apple.com</email>
      </address>
    </author>
    <author fullname="Christopher A. Wood">
      <organization>Cloudflare</organization>
      <address>
        <email>caw@heapingbits.net</email>
      </address>
    </author>
    <date year="2023" month="September" day="13"/>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 33?>

<t>This document describes the principle of privacy partitioning, which selectively spreads data and communication across
multiple parties as a means to improve the privacy by separating user identity from user data.
This document describes emerging patterns in protocols to partition what data and metadata is
revealed through protocol interactions, provides common terminology, and discusses how
to analyze such models.</t>
    </abstract>
    <note removeInRFC="true">
      <name>Discussion Venues</name>
      <t>Discussion of this document takes place on the
    Internet Architecture Board Internet Engineering Task Force mailing list (iab@iab.org),
    which is archived at <eref target=""/>.</t>
      <t>Source for this draft and an issue tracker can be found at
    <eref target="https://github.com/intarchboard/draft-obliviousness"/>.</t>
    </note>
  </front>
  <middle>
    <?line 41?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>Protocols such as TLS and IPsec provide a secure (authenticated and encrypted) channel
between two endpoints over which endpoints transfer information. Encryption and authentication
of data in transit is necessary to protect information from being seen or modified by parties
other than the intended protocol participants. As such, this kind of security is necessary for ensuring that
information transferred over these channels remain private.</t>
      <t>However, a secure channel between two endpoints is insufficient for privacy of the endpoints
themselves. In recent years, privacy requirements have expanded beyond the need to protect data in transit
between two endpoints. Some examples of this expansion include:</t>
      <ul spacing="normal">
        <li>A user accessing a service on a website might not consent to reveal their location,
but if that service is able to observe the client's IP address, it can learn something
about the user's location. This is problematic for privacy since the service can link
user data to the user's location.</li>
        <li>A user might want to be able to access content for which they are authorized,
such as a news article, without needing to have which specific articles they
read on their account being recorded. This is problematic for privacy since the service
can link user activity to the user's account.</li>
        <li>A client device that needs to upload metrics to an aggregation service might want to be
able to contribute data to the system without having their specific contributions being
attribued to them. This is problematic for privacy since the service can link client
contributions to the specific client.</li>
      </ul>
      <t>The commonality in these examples is that clients want to interact with or use a service
without exposing too much user-specific or identifying information to that service. In particular,
separating the user-specific identity information from user-specific data is necessary for
privacy. Thus, order to protect user privacy, it is important to keep identity (who) and data
(what) separate.</t>
      <t>This document defines "privacy partitioning," sometimes also referred to as the "decoupling principle"
<xref target="DECOUPLING"/>, as the general technique used to separate the data
and metadata visible to various parties in network communication, with the aim of improving
user privacy. Partitioning is a spectrum and not a panacea. It is difficult to guarantee there
is no link between user-specific identity and user-specific data. However, applied properly,
privacy partitioning helps ensure that user privacy violations becomes more technically difficult
to achieve over time.</t>
      <t>Several IETF working groups are working on protocols or systems that adhere to the principle
of privacy partitioning, including OHAI, MASQUE, Privacy Pass, and PPM. This document summarizes
work in those groups and describes a framework for reasoning about the resulting privacy posture of different
endpoints in practice.</t>
      <t>Privacy partitioning is particularly relevant as a tool for data minimization, which is described
in <xref section="6.1" sectionFormat="of" target="RFC6973"/>. <xref target="RFC6973"/> provides guidance for privacy considerations in
Internet protocols, along with a set of questions on how to evaluate the data minimization
of a protocol in <xref section="7.1" sectionFormat="of" target="RFC6973"/>. Protocols that employ privacy partitioning
ought to consider the questions in that section when evaluating their design, particularly
with regards to how identifiers and data can be correlated by protocol participants and
observers in each context that has been partitioned. Privacy partitioning can also be
used as a way to separate identity providers from relying parties
(see <xref section="6.1.4" sectionFormat="of" target="RFC6973"/>), as in the case of Privacy Pass
(see Section <xref target="privacypass"/>).</t>
    </section>
    <section anchor="privacy-partitioning">
      <name>Privacy Partitioning</name>
      <t>For the purposes of user privacy, this document focuses on user-specific information. This
might include any identifying information that is specific to a user, such as their email
address or IP address, or data about the user, such as their date of birth. Informally,
the goal of privacy partitioning is to ensure that each party in a system beyond the user
themselves only has access to one type of user-specific information.</t>
      <t>This is a simple application of the principle of least privilege, wherein every party in
a system only has access to the minimum amount of information needed to fulfill their
function. Privacy partitioning advocates for this minimization by ensuring that protocols,
applications, and systems only reveal user-specific information to parties that need access
to the information for their intended purpose.</t>
      <t>Put simply, privacy partitioning aims to separate <em>who</em> someone is from <em>what</em> they do. In the
rest of this section, we describe how privacy partitioning can be used to achieve this goal.</t>
      <section anchor="privacy-contexts">
        <name>Privacy Contexts</name>
        <t>Each piece of user-specific information exists within some context, where a context
is abstractly defined as a set of data and metadata and the entities that share access
to that information. In order to prevent correlation of user-specific information across
contexts, partitions need to ensure that any single entity (other than the client itself)
does not participate in more than one context where the information is visible.</t>
        <t><xref target="RFC6973"/> discusses the importance of identifiers in reducing correlation as a way
of improving privacy:</t>
        <blockquote>
          <t>Correlation is the combination of various pieces of information related to an individual
or that obtain that characteristic when combined... Correlation is closely related to
identification.  Internet protocols can facilitate correlation by allowing individuals'
activities to be tracked and combined over time.</t>
          <t>Pseudonymity is strengthened when less personal data can be linked to the pseudonym; when
the same pseudonym is used less often and across fewer contexts; and when independently
chosen pseudonyms are more frequently used for new actions (making them, from an observer's or
attacker's perspective, unlinkable).</t>
        </blockquote>
        <t>Context separation is foundational to privacy partitioning and reducing correlation.
As an example, consider an unencrypted HTTP session over TCP, wherein the context includes both the
content of the transaction as well as any metadata from the transport and IP headers; and the
participants include the client, routers, other network middleboxes, intermediaries, and server.</t>
        <figure anchor="diagram-middlebox">
          <name>Diagram of a basic unencrypted client-to-server connection with middleboxes</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="176" width="560" viewBox="0 0 560 176" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,160" fill="none" stroke="black"/>
                <path d="M 32,64 L 32,128" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,128" fill="none" stroke="black"/>
                <path d="M 240,64 L 240,128" fill="none" stroke="black"/>
                <path d="M 336,64 L 336,128" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,160" fill="none" stroke="black"/>
                <path d="M 8,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 32,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 240,64 L 336,64" fill="none" stroke="black"/>
                <path d="M 456,64 L 528,64" fill="none" stroke="black"/>
                <path d="M 104,80 L 152,80" fill="none" stroke="black"/>
                <path d="M 192,80 L 240,80" fill="none" stroke="black"/>
                <path d="M 336,80 L 456,80" fill="none" stroke="black"/>
                <path d="M 104,112 L 152,112" fill="none" stroke="black"/>
                <path d="M 184,112 L 240,112" fill="none" stroke="black"/>
                <path d="M 336,112 L 456,112" fill="none" stroke="black"/>
                <path d="M 32,128 L 104,128" fill="none" stroke="black"/>
                <path d="M 240,128 L 336,128" fill="none" stroke="black"/>
                <path d="M 456,128 L 528,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 552,160" fill="none" stroke="black"/>
                <g class="text">
                  <text x="48" y="52">Context</text>
                  <text x="88" y="52">A</text>
                  <text x="172" y="84">HTTP</text>
                  <text x="68" y="100">Client</text>
                  <text x="288" y="100">Middlebox</text>
                  <text x="492" y="100">Server</text>
                  <text x="168" y="116">TCP</text>
                  <text x="172" y="132">flow</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Context A                                                         |
|  +--------+                +-----------+              +--------+  |
|  |        +------HTTP------+           +--------------+        |  |
|  | Client |                | Middlebox |              | Server |  |
|  |        +------TCP-------+           +--------------+        |  |
|  +--------+      flow      +-----------+              +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Adding TLS encryption to the HTTP session is a simple partitioning technique that splits the
previous context into two separate contexts: the content of the transaction is now only visible
to the client, TLS-terminating intermediaries, and server; while the metadata in transport and
IP headers remain in the original context. In this scenario, without any further partitioning,
the entities that participate in both contexts can allow the data in both contexts to be correlated.</t>
        <figure anchor="diagram-https">
          <name>Diagram of how adding encryption splits the context into two</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="304" width="560" viewBox="0 0 560 304" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,288" fill="none" stroke="black"/>
                <path d="M 32,64 L 32,128" fill="none" stroke="black"/>
                <path d="M 32,192 L 32,256" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,128" fill="none" stroke="black"/>
                <path d="M 104,192 L 104,256" fill="none" stroke="black"/>
                <path d="M 240,192 L 240,256" fill="none" stroke="black"/>
                <path d="M 336,192 L 336,256" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 456,192 L 456,256" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 528,192 L 528,256" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,288" fill="none" stroke="black"/>
                <path d="M 8,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 32,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 456,64 L 528,64" fill="none" stroke="black"/>
                <path d="M 104,96 L 256,96" fill="none" stroke="black"/>
                <path d="M 304,96 L 456,96" fill="none" stroke="black"/>
                <path d="M 32,128 L 104,128" fill="none" stroke="black"/>
                <path d="M 456,128 L 528,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 32,192 L 104,192" fill="none" stroke="black"/>
                <path d="M 240,192 L 336,192" fill="none" stroke="black"/>
                <path d="M 456,192 L 528,192" fill="none" stroke="black"/>
                <path d="M 104,224 L 160,224" fill="none" stroke="black"/>
                <path d="M 192,224 L 240,224" fill="none" stroke="black"/>
                <path d="M 336,224 L 456,224" fill="none" stroke="black"/>
                <path d="M 32,256 L 104,256" fill="none" stroke="black"/>
                <path d="M 240,256 L 336,256" fill="none" stroke="black"/>
                <path d="M 456,256 L 528,256" fill="none" stroke="black"/>
                <path d="M 8,288 L 552,288" fill="none" stroke="black"/>
                <g class="text">
                  <text x="48" y="52">Context</text>
                  <text x="88" y="52">A</text>
                  <text x="68" y="100">Client</text>
                  <text x="280" y="100">HTTPS</text>
                  <text x="492" y="100">Server</text>
                  <text x="48" y="180">Context</text>
                  <text x="88" y="180">B</text>
                  <text x="68" y="228">Client</text>
                  <text x="176" y="228">TCP</text>
                  <text x="288" y="228">Middlebox</text>
                  <text x="492" y="228">Server</text>
                  <text x="180" y="244">flow</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Context A                                                         |
|  +--------+                                           +--------+  |
|  |        |                                           |        |  |
|  | Client +-------------------HTTPS-------------------+ Server |  |
|  |        |                                           |        |  |
|  +--------+                                           +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
| Context B                                                         |
|  +--------+                +-----------+              +--------+  |
|  |        |                |           |              |        |  |
|  | Client +-------TCP------+ Middlebox +--------------+ Server |  |
|  |        |       flow     |           |              |        |  |
|  +--------+                +-----------+              +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Another way to create a partition is to simply use separate connections. For example, to
split two separate HTTP requests from one another, a client could issue the requests on
separate TCP connections, each on a different network, and at different times; and avoid
including obvious identifiers like HTTP cookies across the requests.</t>
        <figure anchor="diagram-dualconnect">
          <name>Diagram of making separate connections to generate separate contexts</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="304" width="560" viewBox="0 0 560 304" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,288" fill="none" stroke="black"/>
                <path d="M 32,64 L 32,128" fill="none" stroke="black"/>
                <path d="M 32,192 L 32,256" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,128" fill="none" stroke="black"/>
                <path d="M 104,192 L 104,256" fill="none" stroke="black"/>
                <path d="M 240,64 L 240,128" fill="none" stroke="black"/>
                <path d="M 240,192 L 240,256" fill="none" stroke="black"/>
                <path d="M 336,64 L 336,128" fill="none" stroke="black"/>
                <path d="M 336,192 L 336,256" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 456,192 L 456,256" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 528,192 L 528,256" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,288" fill="none" stroke="black"/>
                <path d="M 8,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 32,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 240,64 L 336,64" fill="none" stroke="black"/>
                <path d="M 456,64 L 528,64" fill="none" stroke="black"/>
                <path d="M 104,96 L 160,96" fill="none" stroke="black"/>
                <path d="M 192,96 L 240,96" fill="none" stroke="black"/>
                <path d="M 336,96 L 456,96" fill="none" stroke="black"/>
                <path d="M 32,128 L 104,128" fill="none" stroke="black"/>
                <path d="M 240,128 L 336,128" fill="none" stroke="black"/>
                <path d="M 456,128 L 528,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 32,192 L 104,192" fill="none" stroke="black"/>
                <path d="M 240,192 L 336,192" fill="none" stroke="black"/>
                <path d="M 456,192 L 528,192" fill="none" stroke="black"/>
                <path d="M 104,224 L 160,224" fill="none" stroke="black"/>
                <path d="M 192,224 L 240,224" fill="none" stroke="black"/>
                <path d="M 336,224 L 456,224" fill="none" stroke="black"/>
                <path d="M 32,256 L 104,256" fill="none" stroke="black"/>
                <path d="M 240,256 L 336,256" fill="none" stroke="black"/>
                <path d="M 456,256 L 528,256" fill="none" stroke="black"/>
                <path d="M 8,288 L 552,288" fill="none" stroke="black"/>
                <g class="text">
                  <text x="48" y="52">Context</text>
                  <text x="88" y="52">A</text>
                  <text x="124" y="84">IP</text>
                  <text x="144" y="84">A</text>
                  <text x="68" y="100">Client</text>
                  <text x="176" y="100">TCP</text>
                  <text x="288" y="100">Middlebox</text>
                  <text x="492" y="100">Server</text>
                  <text x="172" y="116">flow</text>
                  <text x="200" y="116">A</text>
                  <text x="288" y="116">A</text>
                  <text x="48" y="180">Context</text>
                  <text x="88" y="180">B</text>
                  <text x="124" y="212">IP</text>
                  <text x="144" y="212">B</text>
                  <text x="68" y="228">Client</text>
                  <text x="176" y="228">TCP</text>
                  <text x="288" y="228">Middlebox</text>
                  <text x="492" y="228">Server</text>
                  <text x="172" y="244">flow</text>
                  <text x="200" y="244">B</text>
                  <text x="288" y="244">B</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Context A                                                         |
|  +--------+                +-----------+              +--------+  |
|  |        | IP A           |           |              |        |  |
|  | Client +-------TCP------+ Middlebox +--------------+ Server |  |
|  |        |      flow A    |     A     |              |        |  |
|  +--------+                +-----------+              +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
| Context B                                                         |
|  +--------+                +-----------+              +--------+  |
|  |        | IP B           |           |              |        |  |
|  | Client +-------TCP------+ Middlebox +--------------+ Server |  |
|  |        |      flow B    |     B     |              |        |  |
|  +--------+                +-----------+              +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Using separate connections to create separate contexts can reduce or eliminate
the ability of specific parties to correlate activity across contexts. However,
any identifier at any layer that is common across different contexts can be
used as a way to correlate activity. Beyond IP addresses, many other factors
can be used together to create a fingerprint of a specific device (such as
MAC addresses, device properties, software properties and behavior, application state, etc).</t>
      </section>
      <section anchor="context-separation">
        <name>Context Separation</name>
        <t>In order to define and analyze how various partitioning techniques work, the boundaries of what is
being partitioned need to be established. This is the role of context separation. In particular,
in order to prevent correlation of user-specific information across contexts, partitions need
to ensure that any single entity (other than the client itself) does not participate in contexts
where both identities are visible.</t>
        <t>Context separation can be achieved in different ways, for example, over time, across network paths, based
on (en)coding, etc. The privacy-oriented protocols described in this document generally involve
more complex partitioning, but the techniques to partition communication contexts still employ the
same techniques:</t>
        <ol spacing="normal" type="1"><li>Encryption allows partitioning of contexts within a given network path.</li>
          <li>Using separate connections across time or space allow partitioning of contexts for different
application transactions.</li>
        </ol>
        <t>These techniques are frequently used in conjunction for context separation. For example,
encrypting an HTTP exchange might prevent a network middlebox that sees a client IP address
from seeing the user account identity, but it doesn't prevent the TLS-terminating server
from observing both identities and correlating them. As such, preventing correlation
requires separating contexts, such as by using proxying to conceal a client IP address
that would otherwise be used as an identifier.</t>
      </section>
      <section anchor="approaches-to-partitioning">
        <name>Approaches to Partitioning</name>
        <t>While all of the partitioning protocols described in this document create
separate contexts using encryption and/or connection separation, each one has a
unique approach that results in different sets of contexts. Since many of
these protocols are new, it is yet to be seen how each approach will be
used at scale across the Internet, and what new models will emerge in the
future.</t>
        <t>There are multiple factors that lead to a diversity in approaches to
partitioning, including:</t>
        <ul spacing="normal">
          <li>Adding privacy partitioning to existing protocol ecosystems places
requirements and constraints on how contexts are constructed. CONNECT-style
proxying is intended to work with servers that are unaware of privacy contexts,
requiring more intermediaries to provide strong separation guarantees.
Oblivious HTTP, on the other hand, assumes servers that cooperate with context
separation, and thus reduces the overall number of elements in the solution.</li>
          <li>Whether or not information exchange needs to happen bidirectionally in an
interactive fashion determines how contexts can be separated. Some use cases,
like metrics collection for PPM, can occur with information flowing only from
clients to servers, and can function even when clients are no longer connected.
Privacy Pass is an example of a case that can be either interactive or not,
depending on if tokens can be cached and reused. CONNECT-style proxying and
Oblivious HTTP often require bidirectional and interactive communication.</li>
          <li>The degree to which contexts need to be partitioned depends in part
on the client's threat models and level of trust in various protocol participants. For example,
in Oblivious HTTP, clients allow relays to learn that clients are accessing a particular
application-specific gateway. If clients do not trust relays with this information, they can
instead use a multi-hop CONNECT-style proxy approach wherein no single party learns
whether specific clients are accessing a specific application. This is the default trust model
for systems like Tor, where multiple hops are used to drive down the probability of privacy
violations due to collusion or related attacks.</li>
        </ul>
      </section>
    </section>
    <section anchor="a-survey-of-protocols-using-partitioning">
      <name>A Survey of Protocols using Partitioning</name>
      <t>The following section discusses currently on-going work in the IETF
that is applying privacy partitioning.</t>
      <section anchor="masque">
        <name>CONNECT Proxying and MASQUE</name>
        <t>HTTP forward proxies, when using encryption on the connection between the client and the
proxy, provide privacy partitioning by separating a connection into multiple segments.
When connections to targets via the proxy themselves are encrypted,
the proxy cannot see the end-to-end content. HTTP has historically supported forward proxying
for TCP-like streams via the CONNECT method. More recently, the Multiplexed Application
Substrate over QUIC Encryption (MASQUE) working group has developed
protocols to similarly proxy UDP <xref target="CONNECT-UDP"/> and IP packets
<xref target="CONNECT-IP"/> based on tunneling.</t>
        <t>In a single-proxy setup there is a tunnel connection between the client and proxy and
an end-to-end connection that is tunnelled between the client and target. This setup,
as shown in the figure below, partitions communication into:</t>
        <ul spacing="normal">
          <li>a Client-to-Proxy context, which contains the transport metadata between the client
and the target, and the request to the proxy to open a connection to the target;</li>
          <li>a Client-to-Target proxied context, which is the end-to-end data to the target that is
also visible to the proxy, such as a TLS session;</li>
          <li>a Client-to-Target encrypted context, which contains the end-to-end content
with the TLS session to the target, such as HTTP content;</li>
          <li>and a Proxy-to-Target context, which for TCP and UDP proxying
contains any packet header information that is added or modified by the proxy,
e.g., the IP and TCP/UDP headers.</li>
        </ul>
        <figure anchor="diagram-1hop">
          <name>Diagram of one-hop proxy contexts</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="560" width="560" viewBox="0 0 560 560" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,544" fill="none" stroke="black"/>
                <path d="M 32,64 L 32,128" fill="none" stroke="black"/>
                <path d="M 32,192 L 32,256" fill="none" stroke="black"/>
                <path d="M 32,320 L 32,384" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,128" fill="none" stroke="black"/>
                <path d="M 104,192 L 104,256" fill="none" stroke="black"/>
                <path d="M 104,320 L 104,384" fill="none" stroke="black"/>
                <path d="M 240,192 L 240,256" fill="none" stroke="black"/>
                <path d="M 240,320 L 240,384" fill="none" stroke="black"/>
                <path d="M 240,448 L 240,512" fill="none" stroke="black"/>
                <path d="M 336,192 L 336,256" fill="none" stroke="black"/>
                <path d="M 336,320 L 336,384" fill="none" stroke="black"/>
                <path d="M 336,448 L 336,512" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 456,192 L 456,256" fill="none" stroke="black"/>
                <path d="M 456,448 L 456,512" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 528,192 L 528,256" fill="none" stroke="black"/>
                <path d="M 528,448 L 528,512" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,544" fill="none" stroke="black"/>
                <path d="M 8,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 32,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 456,64 L 528,64" fill="none" stroke="black"/>
                <path d="M 104,96 L 248,96" fill="none" stroke="black"/>
                <path d="M 296,96 L 456,96" fill="none" stroke="black"/>
                <path d="M 32,128 L 104,128" fill="none" stroke="black"/>
                <path d="M 456,128 L 528,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 32,192 L 104,192" fill="none" stroke="black"/>
                <path d="M 240,192 L 336,192" fill="none" stroke="black"/>
                <path d="M 456,192 L 528,192" fill="none" stroke="black"/>
                <path d="M 104,224 L 136,224" fill="none" stroke="black"/>
                <path d="M 200,224 L 240,224" fill="none" stroke="black"/>
                <path d="M 336,224 L 456,224" fill="none" stroke="black"/>
                <path d="M 32,256 L 104,256" fill="none" stroke="black"/>
                <path d="M 240,256 L 336,256" fill="none" stroke="black"/>
                <path d="M 456,256 L 528,256" fill="none" stroke="black"/>
                <path d="M 8,288 L 552,288" fill="none" stroke="black"/>
                <path d="M 32,320 L 104,320" fill="none" stroke="black"/>
                <path d="M 240,320 L 336,320" fill="none" stroke="black"/>
                <path d="M 104,352 L 128,352" fill="none" stroke="black"/>
                <path d="M 208,352 L 240,352" fill="none" stroke="black"/>
                <path d="M 32,384 L 104,384" fill="none" stroke="black"/>
                <path d="M 240,384 L 336,384" fill="none" stroke="black"/>
                <path d="M 8,416 L 552,416" fill="none" stroke="black"/>
                <path d="M 240,448 L 336,448" fill="none" stroke="black"/>
                <path d="M 456,448 L 528,448" fill="none" stroke="black"/>
                <path d="M 336,480 L 352,480" fill="none" stroke="black"/>
                <path d="M 432,480 L 456,480" fill="none" stroke="black"/>
                <path d="M 240,512 L 336,512" fill="none" stroke="black"/>
                <path d="M 456,512 L 528,512" fill="none" stroke="black"/>
                <path d="M 8,544 L 552,544" fill="none" stroke="black"/>
                <g class="text">
                  <text x="84" y="52">Client-to-Target</text>
                  <text x="192" y="52">Encrypted</text>
                  <text x="264" y="52">Context</text>
                  <text x="68" y="100">Client</text>
                  <text x="272" y="100">HTTPS</text>
                  <text x="492" y="100">Target</text>
                  <text x="272" y="116">content</text>
                  <text x="84" y="180">Client-to-Target</text>
                  <text x="184" y="180">Proxied</text>
                  <text x="248" y="180">Context</text>
                  <text x="68" y="228">Client</text>
                  <text x="168" y="228">Proxied</text>
                  <text x="288" y="228">Proxy</text>
                  <text x="492" y="228">Target</text>
                  <text x="152" y="244">TLS</text>
                  <text x="188" y="244">flow</text>
                  <text x="80" y="308">Client-to-Proxy</text>
                  <text x="176" y="308">Context</text>
                  <text x="68" y="356">Client</text>
                  <text x="168" y="356">Transport</text>
                  <text x="288" y="356">Proxy</text>
                  <text x="164" y="372">flow</text>
                  <text x="80" y="436">Proxy-to-Target</text>
                  <text x="176" y="436">Context</text>
                  <text x="288" y="484">Proxy</text>
                  <text x="392" y="484">Transport</text>
                  <text x="492" y="484">Target</text>
                  <text x="388" y="500">flow</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Client-to-Target Encrypted Context                                |
|  +--------+                                           +--------+  |
|  |        |                                           |        |  |
|  | Client +------------------HTTPS--------------------+ Target |  |
|  |        |                 content                   |        |  |
|  +--------+                                           +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
| Client-to-Target Proxied Context                                  |
|  +--------+                +-----------+              +--------+  |
|  |        |                |           |              |        |  |
|  | Client +----Proxied-----+   Proxy   +--------------+ Target |  |
|  |        |    TLS flow    |           |              |        |  |
|  +--------+                +-----------+              +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
| Client-to-Proxy Context                                           |
|  +--------+                +-----------+                          |
|  |        |                |           |                          |
|  | Client +---Transport----+   Proxy   |                          |
|  |        |     flow       |           |                          |
|  +--------+                +-----------+                          |
|                                                                   |
+-------------------------------------------------------------------+
| Proxy-to-Target Context                                           |
|                            +-----------+              +--------+  |
|                            |           |              |        |  |
|                            |   Proxy   +--Transport---+ Target |  |
|                            |           |    flow      |        |  |
|                            +-----------+              +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Using two (or more) proxies provides better privacy partitioning. In particular, with two proxies,
each proxy sees the Client metadata, but not the Target; the Target, but not the Client
metadata; or neither.</t>
        <figure anchor="diagram-2hop">
          <name>Diagram of two-hop proxy contexts</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="816" width="560" viewBox="0 0 560 816" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,800" fill="none" stroke="black"/>
                <path d="M 32,64 L 32,128" fill="none" stroke="black"/>
                <path d="M 32,192 L 32,256" fill="none" stroke="black"/>
                <path d="M 32,320 L 32,384" fill="none" stroke="black"/>
                <path d="M 32,448 L 32,512" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,128" fill="none" stroke="black"/>
                <path d="M 104,192 L 104,256" fill="none" stroke="black"/>
                <path d="M 104,320 L 104,384" fill="none" stroke="black"/>
                <path d="M 104,448 L 104,512" fill="none" stroke="black"/>
                <path d="M 184,320 L 184,384" fill="none" stroke="black"/>
                <path d="M 184,448 L 184,512" fill="none" stroke="black"/>
                <path d="M 184,576 L 184,640" fill="none" stroke="black"/>
                <path d="M 248,320 L 248,384" fill="none" stroke="black"/>
                <path d="M 248,448 L 248,512" fill="none" stroke="black"/>
                <path d="M 248,576 L 248,640" fill="none" stroke="black"/>
                <path d="M 328,192 L 328,256" fill="none" stroke="black"/>
                <path d="M 328,320 L 328,384" fill="none" stroke="black"/>
                <path d="M 328,576 L 328,640" fill="none" stroke="black"/>
                <path d="M 328,704 L 328,768" fill="none" stroke="black"/>
                <path d="M 392,192 L 392,256" fill="none" stroke="black"/>
                <path d="M 392,320 L 392,384" fill="none" stroke="black"/>
                <path d="M 392,576 L 392,640" fill="none" stroke="black"/>
                <path d="M 392,704 L 392,768" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 456,192 L 456,256" fill="none" stroke="black"/>
                <path d="M 456,704 L 456,768" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 528,192 L 528,256" fill="none" stroke="black"/>
                <path d="M 528,704 L 528,768" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,800" fill="none" stroke="black"/>
                <path d="M 8,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 32,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 456,64 L 528,64" fill="none" stroke="black"/>
                <path d="M 104,96 L 248,96" fill="none" stroke="black"/>
                <path d="M 296,96 L 456,96" fill="none" stroke="black"/>
                <path d="M 32,128 L 104,128" fill="none" stroke="black"/>
                <path d="M 456,128 L 528,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 32,192 L 104,192" fill="none" stroke="black"/>
                <path d="M 328,192 L 392,192" fill="none" stroke="black"/>
                <path d="M 456,192 L 528,192" fill="none" stroke="black"/>
                <path d="M 104,224 L 184,224" fill="none" stroke="black"/>
                <path d="M 248,224 L 328,224" fill="none" stroke="black"/>
                <path d="M 392,224 L 456,224" fill="none" stroke="black"/>
                <path d="M 32,256 L 104,256" fill="none" stroke="black"/>
                <path d="M 328,256 L 392,256" fill="none" stroke="black"/>
                <path d="M 456,256 L 528,256" fill="none" stroke="black"/>
                <path d="M 8,288 L 552,288" fill="none" stroke="black"/>
                <path d="M 32,320 L 104,320" fill="none" stroke="black"/>
                <path d="M 184,320 L 248,320" fill="none" stroke="black"/>
                <path d="M 328,320 L 392,320" fill="none" stroke="black"/>
                <path d="M 104,352 L 184,352" fill="none" stroke="black"/>
                <path d="M 248,352 L 328,352" fill="none" stroke="black"/>
                <path d="M 32,384 L 104,384" fill="none" stroke="black"/>
                <path d="M 184,384 L 248,384" fill="none" stroke="black"/>
                <path d="M 328,384 L 392,384" fill="none" stroke="black"/>
                <path d="M 8,416 L 552,416" fill="none" stroke="black"/>
                <path d="M 32,448 L 104,448" fill="none" stroke="black"/>
                <path d="M 184,448 L 248,448" fill="none" stroke="black"/>
                <path d="M 104,480 L 184,480" fill="none" stroke="black"/>
                <path d="M 32,512 L 104,512" fill="none" stroke="black"/>
                <path d="M 184,512 L 248,512" fill="none" stroke="black"/>
                <path d="M 8,544 L 552,544" fill="none" stroke="black"/>
                <path d="M 184,576 L 248,576" fill="none" stroke="black"/>
                <path d="M 328,576 L 392,576" fill="none" stroke="black"/>
                <path d="M 248,608 L 328,608" fill="none" stroke="black"/>
                <path d="M 184,640 L 248,640" fill="none" stroke="black"/>
                <path d="M 328,640 L 392,640" fill="none" stroke="black"/>
                <path d="M 8,672 L 552,672" fill="none" stroke="black"/>
                <path d="M 328,704 L 392,704" fill="none" stroke="black"/>
                <path d="M 456,704 L 528,704" fill="none" stroke="black"/>
                <path d="M 392,736 L 456,736" fill="none" stroke="black"/>
                <path d="M 328,768 L 392,768" fill="none" stroke="black"/>
                <path d="M 456,768 L 528,768" fill="none" stroke="black"/>
                <path d="M 8,800 L 552,800" fill="none" stroke="black"/>
                <g class="text">
                  <text x="84" y="52">Client-to-Target</text>
                  <text x="192" y="52">Encrypted</text>
                  <text x="264" y="52">Context</text>
                  <text x="68" y="100">Client</text>
                  <text x="272" y="100">HTTPS</text>
                  <text x="492" y="100">Target</text>
                  <text x="272" y="116">content</text>
                  <text x="84" y="180">Client-to-Target</text>
                  <text x="184" y="180">Proxied</text>
                  <text x="248" y="180">Context</text>
                  <text x="68" y="228">Client</text>
                  <text x="216" y="228">Proxied</text>
                  <text x="360" y="228">Proxy</text>
                  <text x="492" y="228">Target</text>
                  <text x="200" y="244">TLS</text>
                  <text x="236" y="244">flow</text>
                  <text x="360" y="244">B</text>
                  <text x="80" y="308">Client-to-Proxy</text>
                  <text x="152" y="308">B</text>
                  <text x="192" y="308">Context</text>
                  <text x="68" y="356">Client</text>
                  <text x="216" y="356">Proxy</text>
                  <text x="360" y="356">Proxy</text>
                  <text x="216" y="372">A</text>
                  <text x="360" y="372">B</text>
                  <text x="80" y="436">Client-to-Proxy</text>
                  <text x="152" y="436">A</text>
                  <text x="192" y="436">Context</text>
                  <text x="68" y="484">Client</text>
                  <text x="216" y="484">Proxy</text>
                  <text x="216" y="500">A</text>
                  <text x="40" y="564">Proxy</text>
                  <text x="108" y="564">A-to-Proxy</text>
                  <text x="160" y="564">B</text>
                  <text x="200" y="564">Context</text>
                  <text x="216" y="612">Proxy</text>
                  <text x="360" y="612">Proxy</text>
                  <text x="216" y="628">A</text>
                  <text x="360" y="628">B</text>
                  <text x="40" y="692">Proxy</text>
                  <text x="112" y="692">B-to-Target</text>
                  <text x="192" y="692">Context</text>
                  <text x="360" y="740">Proxy</text>
                  <text x="492" y="740">Target</text>
                  <text x="360" y="756">B</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Client-to-Target Encrypted Context                                |
|  +--------+                                           +--------+  |
|  |        |                                           |        |  |
|  | Client +------------------HTTPS--------------------+ Target |  |
|  |        |                 content                   |        |  |
|  +--------+                                           +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
| Client-to-Target Proxied Context                                  |
|  +--------+                           +-------+       +--------+  |
|  |        |                           |       |       |        |  |
|  | Client +----------Proxied----------+ Proxy +-------+ Target |  |
|  |        |          TLS flow         |   B   |       |        |  |
|  +--------+                           +-------+       +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
| Client-to-Proxy B Context                                         |
|  +--------+         +-------+         +-------+                   |
|  |        |         |       |         |       |                   |
|  | Client +---------+ Proxy +---------+ Proxy |                   |
|  |        |         |   A   |         |   B   |                   |
|  +--------+         +-------+         +-------+                   |
|                                                                   |
+-------------------------------------------------------------------+
| Client-to-Proxy A Context                                         |
|  +--------+         +-------+                                     |
|  |        |         |       |                                     |
|  | Client +---------+ Proxy |                                     |
|  |        |         |   A   |                                     |
|  +--------+         +-------+                                     |
|                                                                   |
+-------------------------------------------------------------------+
| Proxy A-to-Proxy B Context                                        |
|                     +-------+         +-------+                   |
|                     |       |         |       |                   |
|                     | Proxy +---------+ Proxy |                   |
|                     |   A   |         |   B   |                   |
|                     +-------+         +-------+                   |
|                                                                   |
+-------------------------------------------------------------------+
| Proxy B-to-Target Context                                         |
|                                       +-------+       +--------+  |
|                                       |       |       |        |  |
|                                       | Proxy +-------+ Target |  |
|                                       |   B   |       |        |  |
|                                       +-------+       +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Forward proxying, such as the protocols developed in MASQUE, uses both encryption (via TLS) and
separation of connections (via proxy hops that see only the next hop) to achieve privacy partitioning.</t>
      </section>
      <section anchor="oblivious-http-and-dns">
        <name>Oblivious HTTP and DNS</name>
        <t>Oblivious HTTP <xref target="OHTTP"/>, developed in the Oblivious HTTP Application
Intermediation (OHAI) working group, adds per-message
encryption to HTTP exchanges through a relay system. Clients send requests through an Oblivious Relay,
which cannot read message contents, to an Oblivious Gateway, which can decrypt the messages but
cannot communicate directly with the client or observe client metadata like IP address.
Oblivious HTTP relies on Hybrid Public Key Encryption <xref target="HPKE"/> to perform encryption.</t>
        <t>Oblivious HTTP uses both encryption and separation of connections to achieve privacy partitioning.
The end-to-end messages are encrypted between the Client and Gateway (forming a Client-to-Gateway context),
and the connections are separated into a Client-to-Relay context and a Relay-to-Gateway context. It is also important
to note that the Relay-to-Gateway connection can be a single connection, even if the Relay has many
separate Clients. This provides better anonymity by making the pseudonym presented by the Relay to
be shared across many Clients.</t>
        <figure anchor="diagram-ohttp">
          <name>Diagram of Oblivious HTTP contexts</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="432" width="560" viewBox="0 0 560 432" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,416" fill="none" stroke="black"/>
                <path d="M 32,64 L 32,128" fill="none" stroke="black"/>
                <path d="M 32,192 L 32,256" fill="none" stroke="black"/>
                <path d="M 32,320 L 32,384" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,128" fill="none" stroke="black"/>
                <path d="M 104,192 L 104,256" fill="none" stroke="black"/>
                <path d="M 104,320 L 104,384" fill="none" stroke="black"/>
                <path d="M 184,192 L 184,256" fill="none" stroke="black"/>
                <path d="M 184,320 L 184,384" fill="none" stroke="black"/>
                <path d="M 248,192 L 248,256" fill="none" stroke="black"/>
                <path d="M 248,320 L 248,384" fill="none" stroke="black"/>
                <path d="M 328,64 L 328,128" fill="none" stroke="black"/>
                <path d="M 328,192 L 328,256" fill="none" stroke="black"/>
                <path d="M 408,64 L 408,128" fill="none" stroke="black"/>
                <path d="M 408,192 L 408,256" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,416" fill="none" stroke="black"/>
                <path d="M 8,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 32,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 328,64 L 408,64" fill="none" stroke="black"/>
                <path d="M 456,64 L 528,64" fill="none" stroke="black"/>
                <path d="M 104,96 L 328,96" fill="none" stroke="black"/>
                <path d="M 408,96 L 456,96" fill="none" stroke="black"/>
                <path d="M 32,128 L 104,128" fill="none" stroke="black"/>
                <path d="M 328,128 L 408,128" fill="none" stroke="black"/>
                <path d="M 456,128 L 528,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 32,192 L 104,192" fill="none" stroke="black"/>
                <path d="M 184,192 L 248,192" fill="none" stroke="black"/>
                <path d="M 328,192 L 408,192" fill="none" stroke="black"/>
                <path d="M 104,224 L 184,224" fill="none" stroke="black"/>
                <path d="M 248,224 L 328,224" fill="none" stroke="black"/>
                <path d="M 32,256 L 104,256" fill="none" stroke="black"/>
                <path d="M 184,256 L 248,256" fill="none" stroke="black"/>
                <path d="M 328,256 L 408,256" fill="none" stroke="black"/>
                <path d="M 8,288 L 552,288" fill="none" stroke="black"/>
                <path d="M 32,320 L 104,320" fill="none" stroke="black"/>
                <path d="M 184,320 L 248,320" fill="none" stroke="black"/>
                <path d="M 104,352 L 184,352" fill="none" stroke="black"/>
                <path d="M 32,384 L 104,384" fill="none" stroke="black"/>
                <path d="M 184,384 L 248,384" fill="none" stroke="black"/>
                <path d="M 8,416 L 552,416" fill="none" stroke="black"/>
                <g class="text">
                  <text x="84" y="52">Client-to-Target</text>
                  <text x="184" y="52">Context</text>
                  <text x="68" y="100">Client</text>
                  <text x="368" y="100">Gateway</text>
                  <text x="492" y="100">Target</text>
                  <text x="88" y="180">Client-to-Gateway</text>
                  <text x="192" y="180">Context</text>
                  <text x="68" y="228">Client</text>
                  <text x="216" y="228">Relay</text>
                  <text x="368" y="228">Gateway</text>
                  <text x="80" y="308">Client-to-Relay</text>
                  <text x="176" y="308">Context</text>
                  <text x="68" y="356">Client</text>
                  <text x="216" y="356">Relay</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Client-to-Target Context                                          |
|  +--------+                           +---------+     +--------+  |
|  |        |                           |         |     |        |  |
|  | Client +---------------------------+ Gateway +-----+ Target |  |
|  |        |                           |         |     |        |  |
|  +--------+                           +---------+     +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
| Client-to-Gateway Context                                         |
|  +--------+         +-------+         +---------+                 |
|  |        |         |       |         |         |                 |
|  | Client +---------+ Relay +---------+ Gateway |                 |
|  |        |         |       |         |         |                 |
|  +--------+         +-------+         +---------+                 |
|                                                                   |
+-------------------------------------------------------------------+
| Client-to-Relay Context                                           |
|  +--------+         +-------+                                     |
|  |        |         |       |                                     |
|  | Client +---------+ Relay |                                     |
|  |        |         |       |                                     |
|  +--------+         +-------+                                     |
|                                                                   |
+-------------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Oblivious DNS over HTTPS <xref target="ODOH"/> applies the same principle as Oblivious HTTP, but operates on
DNS messages only. As a precursor to the more generalized Oblivious HTTP, it relies on the same
HPKE cryptographic primitives, and can be analyzed in the same way.</t>
      </section>
      <section anchor="privacypass">
        <name>Privacy Pass</name>
        <t>Privacy Pass is an architecture <xref target="PRIVACYPASS"/> and set of protocols
being developed in the Privacy Pass working group that allow clients to present proof of verification in
an anonymous and unlinkable fashion, via tokens. These tokens originally were designed as a way to prove
that a client had solved a CAPTCHA, but can be applied to other types of user or device attestation checks
as well. In Privacy Pass, clients interact with an attester and issuer for the purposes of issuing a token,
and clients then interact with an origin server to redeeem said token.</t>
        <t>In Privacy Pass, privacy partitioning is achieved with cryptographic protection (in the form of blind
signature protocols or similar) and separation of connections across two contexts:
a "redemption context" between clients an origins (servers that request and receive tokens), and an
"issuance context" between clients, attestation servers, and token issuance servers. The cryptographic
protection ensures that information revealed during the issuance context is separated from information
revealed during the redemption context.</t>
        <figure anchor="diagram-privacypass">
          <name>Diagram of contexts in Privacy Pass</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="304" width="560" viewBox="0 0 560 304" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,288" fill="none" stroke="black"/>
                <path d="M 32,64 L 32,128" fill="none" stroke="black"/>
                <path d="M 104,64 L 104,128" fill="none" stroke="black"/>
                <path d="M 184,64 L 184,128" fill="none" stroke="black"/>
                <path d="M 184,192 L 184,256" fill="none" stroke="black"/>
                <path d="M 256,64 L 256,128" fill="none" stroke="black"/>
                <path d="M 256,192 L 256,256" fill="none" stroke="black"/>
                <path d="M 312,192 L 312,256" fill="none" stroke="black"/>
                <path d="M 400,192 L 400,256" fill="none" stroke="black"/>
                <path d="M 456,192 L 456,256" fill="none" stroke="black"/>
                <path d="M 528,192 L 528,256" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,288" fill="none" stroke="black"/>
                <path d="M 8,32 L 552,32" fill="none" stroke="black"/>
                <path d="M 32,64 L 104,64" fill="none" stroke="black"/>
                <path d="M 184,64 L 256,64" fill="none" stroke="black"/>
                <path d="M 104,96 L 184,96" fill="none" stroke="black"/>
                <path d="M 32,128 L 104,128" fill="none" stroke="black"/>
                <path d="M 184,128 L 256,128" fill="none" stroke="black"/>
                <path d="M 8,160 L 552,160" fill="none" stroke="black"/>
                <path d="M 184,192 L 256,192" fill="none" stroke="black"/>
                <path d="M 312,192 L 400,192" fill="none" stroke="black"/>
                <path d="M 456,192 L 528,192" fill="none" stroke="black"/>
                <path d="M 256,224 L 312,224" fill="none" stroke="black"/>
                <path d="M 400,224 L 456,224" fill="none" stroke="black"/>
                <path d="M 184,256 L 256,256" fill="none" stroke="black"/>
                <path d="M 312,256 L 400,256" fill="none" stroke="black"/>
                <path d="M 456,256 L 528,256" fill="none" stroke="black"/>
                <path d="M 8,288 L 552,288" fill="none" stroke="black"/>
                <g class="text">
                  <text x="60" y="52">Redemption</text>
                  <text x="136" y="52">Context</text>
                  <text x="68" y="100">Origin</text>
                  <text x="220" y="100">Client</text>
                  <text x="52" y="180">Issuance</text>
                  <text x="120" y="180">Context</text>
                  <text x="220" y="228">Client</text>
                  <text x="356" y="228">Attester</text>
                  <text x="492" y="228">Issuer</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Redemption Context                                                |
|  +--------+         +--------+                                    |
|  |        |         |        |                                    |
|  | Origin +---------+ Client |                                    |
|  |        |         |        |                                    |
|  +--------+         +--------+                                    |
|                                                                   |
+-------------------------------------------------------------------+
| Issuance Context                                                  |
|                     +--------+      +----------+      +--------+  |
|                     |        |      |          |      |        |  |
|                     | Client +------+ Attester +------+ Issuer |  |
|                     |        |      |          |      |        |  |
|                     +--------+      +----------+      +--------+  |
|                                                                   |
+-------------------------------------------------------------------+
]]></artwork>
          </artset>
        </figure>
        <t>Since the redemption context and issuance context are separate connections
that involve separate entities, they can also be further decoupled by
running those parts of the protocols at different times. Clients can
fetch tokens through the issuance context early, and cache the tokens
to later use in redemption contexts. This can aid in partitioning identifiers
and data.</t>
        <t><xref target="PRIVACYPASS"/> describes different deployment models for which entities operate
origins, attesters, and issuers; in some models, they are all separate
entities, but in others, they can be operated by the same entity. The
model impacts the effectiveness of partitioning, and some models
(such as when all three are operated by the same entity) only provide
effective partitioning when the timing of connections on the two
contexts are not correlated, and when the client uses different
identifiers (such as different IP addresses) on each context.</t>
      </section>
      <section anchor="privacy-preserving-measurement">
        <name>Privacy Preserving Measurement</name>
        <t>The Privacy Preserving Measurement (PPM) working group is chartered to develop protocols and systems
that help a data aggregation or collection server (or multiple, non-colluding servers) compute aggregate
values without learning the value of any one client's individual measurement. Distributed Aggregation
Protocol (DAP) is the primary working item of the group.</t>
        <t>At a high level, DAP uses a combination of cryptographic protection (in the form of secret sharing amongst
non-colluding servers) to establish two contexts: an "upload context" between clients and non-colluding
aggregation servers wherein aggregation servers possibly learn client identity but nothing about their individual
measurement reports, and a "collect context" wherein a collector learns aggregate measurement results and nothing
about individual client data.</t>
        <figure anchor="pa-topology">
          <name>Diagram of contexts in DAP</name>
          <artset>
            <artwork type="svg"><svg xmlns="http://www.w3.org/2000/svg" version="1.1" height="224" width="488" viewBox="0 0 488 224" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px" stroke-linecap="round">
                <path d="M 8,32 L 8,208" fill="none" stroke="black"/>
                <path d="M 24,96 L 24,160" fill="none" stroke="black"/>
                <path d="M 96,96 L 96,160" fill="none" stroke="black"/>
                <path d="M 128,80 L 128,112" fill="none" stroke="black"/>
                <path d="M 128,144 L 128,176" fill="none" stroke="black"/>
                <path d="M 184,64 L 184,96" fill="none" stroke="black"/>
                <path d="M 184,160 L 184,192" fill="none" stroke="black"/>
                <path d="M 240,104 L 240,152" fill="none" stroke="black"/>
                <path d="M 288,64 L 288,96" fill="none" stroke="black"/>
                <path d="M 288,160 L 288,192" fill="none" stroke="black"/>
                <path d="M 312,32 L 312,168" fill="none" stroke="black"/>
                <path d="M 312,184 L 312,208" fill="none" stroke="black"/>
                <path d="M 344,112 L 344,144" fill="none" stroke="black"/>
                <path d="M 392,144 L 392,176" fill="none" stroke="black"/>
                <path d="M 440,112 L 440,144" fill="none" stroke="black"/>
                <path d="M 480,32 L 480,208" fill="none" stroke="black"/>
                <path d="M 8,32 L 480,32" fill="none" stroke="black"/>
                <path d="M 184,64 L 288,64" fill="none" stroke="black"/>
                <path d="M 128,80 L 176,80" fill="none" stroke="black"/>
                <path d="M 24,96 L 96,96" fill="none" stroke="black"/>
                <path d="M 184,96 L 288,96" fill="none" stroke="black"/>
                <path d="M 96,112 L 128,112" fill="none" stroke="black"/>
                <path d="M 344,112 L 440,112" fill="none" stroke="black"/>
                <path d="M 96,144 L 128,144" fill="none" stroke="black"/>
                <path d="M 344,144 L 440,144" fill="none" stroke="black"/>
                <path d="M 24,160 L 96,160" fill="none" stroke="black"/>
                <path d="M 184,160 L 288,160" fill="none" stroke="black"/>
                <path d="M 128,176 L 176,176" fill="none" stroke="black"/>
                <path d="M 296,176 L 392,176" fill="none" stroke="black"/>
                <path d="M 184,192 L 288,192" fill="none" stroke="black"/>
                <path d="M 8,208 L 480,208" fill="none" stroke="black"/>
                <polygon class="arrowhead" points="304,176 292,170.4 292,181.6" fill="black" transform="rotate(180,296,176)"/>
                <polygon class="arrowhead" points="248,152 236,146.4 236,157.6" fill="black" transform="rotate(90,240,152)"/>
                <polygon class="arrowhead" points="248,104 236,98.4 236,109.6" fill="black" transform="rotate(270,240,104)"/>
                <polygon class="arrowhead" points="184,176 172,170.4 172,181.6" fill="black" transform="rotate(0,176,176)"/>
                <polygon class="arrowhead" points="184,80 172,74.4 172,85.6" fill="black" transform="rotate(0,176,80)"/>
                <g class="text">
                  <text x="44" y="52">Upload</text>
                  <text x="104" y="52">Context</text>
                  <text x="352" y="52">Collect</text>
                  <text x="416" y="52">Context</text>
                  <text x="236" y="84">Helper</text>
                  <text x="60" y="132">Client</text>
                  <text x="392" y="132">Collector</text>
                  <text x="236" y="180">Leader</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------+--------------------+
| Upload Context                      | Collect Context    |
|                     +------------+  |                    |
|              +----->|   Helper   |  |                    |
| +--------+   |      +------------+  |                    |
| |        +---+             ^        |   +-----------+    |
| | Client |                 |        |   | Collector |    |
| |        +---+             v        |   +-----+-----+    |
| +--------+   |      +------------+  |         |          |
|              +----->|   Leader   |<-----------+          |
|                     +------------+  |                    |
+-------------------------------------+--------------------+
]]></artwork>
          </artset>
        </figure>
      </section>
    </section>
    <section anchor="applying-privacy-partioning">
      <name>Applying Privacy Partioning</name>
      <t>Applying privacy partitioning to an existing or new system or protocol requires the following steps:</t>
      <ol spacing="normal" type="1"><li>Identify the types of information used or exposed in a system or protocol, some
of which can be used to identify a user or correlate to other contexts.</li>
        <li>Partition data to minimize the amount of user-identifying or correlatable
information in any given context to only include what is necessary for that
context, and prevent sharing of data across contexts wherever possible.</li>
      </ol>
      <t>The most impactful types of information to partition are (a) user-identifying information,
such as user identity or identities (including account names or IP addresses) that can be
linked and (b) non-user-identifying information (including content a user
generates or accesses), which can be often sensitive when combined with user identity.</t>
      <t>In this section, we discuss considerations for partitioning these types of information.</t>
      <section anchor="user-identifying-information">
        <name>User-Identifying Information</name>
        <t>User data can itself be user-identifying, in which case it should be treated as an identifier.
For example, Oblivious DoH and Oblivious HTTP partition the client IP address and client request data into
separate contexts, thereby ensuring that no entity beyond the client can observe both. Collusion across contexts
could reverse this partitioning, but can also promote non-user-identifying information to user-identifying.
For example, in CONNECT proxy systems that use QUIC, the QUIC connection ID is inherently non-user-identifying
since it is generated randomly (<xref section="5.1" sectionFormat="comma" target="QUIC"/>). However, if combined with another context that has user-identifying
information such as the client IP address, the QUIC connection ID can become user-identifying information.</t>
        <t>Some information is innate to client user-agents, including details of implementation of
protocols in hardware and software, and network location. This information can be used to construct
user-identifying information, which is a process sometimes referred to as fingerprinting.
Depending on the application and system constraints, users may not be able to prevent fingerprinting
in privacy contexts. As a result, fingerprinting information, when combined with non-user-identifying
user data, could promote user data to user-identifying information.</t>
      </section>
      <section anchor="incorrect-or-incomplete-partitioning">
        <name>Incorrect or Incomplete Partitioning</name>
        <t>Privacy partitioning can be applied incorrectly or incompletely. Contexts may contain
more user-identifying information than desired, or some information in a context may be more user-identifying
than intended. Moreover, splitting user-identifying information over multiple contexts has to be done
with care, as creating more contexts can increase the number of entities that need to be trusted to not collude.
Nevertheless, partitions can help improve the client's privacy posture when applied carefully.</t>
        <t>Evaluating and qualifying the resulting privacy of a system or protocol that applies privacy partitioning depends
on the contexts that exist and types of user-identifying information in each context. Such evaluation is
helpful for identifying ways in which systems or protocols can improve their privacy posture. For example,
consider DNS-over-HTTPS <xref target="DOH"/>, which produces a single context which contains both the client IP
address and client query. One application of privacy partitioning results in ODoH, which produces two contexts,
one with the client IP address and the other with the client query.</t>
      </section>
      <section anchor="identifying-information-for-partitioning">
        <name>Identifying Information for Partitioning</name>
        <t>Recognizing potential appliations of privacy partitoning requires identifying the contexts in use, the information
exposed in a context, and the intent of information exposed in a context. Unfortunately, determing what
information to include in a given context is a nontrivial task. In principle, the information contained
in a context should be fit for purpose. As such, new systems or protocols developed should aim to
ensure that all information exposed in a context serves as few purposes as possible. Designing with this
principle from the start helps mitigate issues that arise if users of the system or protocol inadvertently
ossify on the information available in contexts. Legacy systems that have ossified on information available
in contexts may be difficult to change in practice. As an example, many existing anti-abuse systems
depend on some notion of client identity such as client IP address, coupled with client data, to provide
value. Partitioning contexts in these systems such that they no longer see the client identity requires new
solutions to the anti-abuse problem.</t>
      </section>
    </section>
    <section anchor="limits">
      <name>Limits of Privacy Partitioning</name>
      <t>Privacy Partitioning aims to increase user privacy, though as stated is not a panacea.
The privacy properties depend on numerous factors, including, though not limited to:</t>
      <ul spacing="normal">
        <li>Non-collusion across contexts; and</li>
        <li>The type of information exposed in each context.</li>
      </ul>
      <t>We elaborate on each below.</t>
      <section anchor="violations-by-collusion">
        <name>Violations by Collusion</name>
        <t>Privacy partitions ensure that only the client, i.e., the entity which is responsible for partitioning,
can link all user-specific information together up to collusion. No other entity individually
knows how to link all the user-specific information as long as they do not collude with each other
across contexts. This is why non-collusion is a fundamental requirement for privacy partitioning
to offer meaningful privacy for end-users. In particular, the trust relationships that users have
with different parties affects the resulting impact on the user's privacy.</t>
        <t>As an example, consider OHTTP, wherein the Oblivious Relay knows the Client identity but not
the Client data, and the Oblivious Gateway knows the Client data but not the Client identity.
If the Oblivious Relay and Gateway collude, they can link Client identity and data together
for each request and response transaction by simply observing requests in transit.</t>
        <t>It is not currently possible to guarantee with technical protocol measures that two
entities are not colluding. Even if two entities do not collude directly, if both entities reveal
information to other parties, it will not be possible to guarantee that the information won't
be combined. However, there are some mitigations that can be applied
to reduce the risk of collusion happening in practice:</t>
        <ul spacing="normal">
          <li>Policy and contractual agreements between entities involved in partitioning to disallow
logging or sharing of data, along with auditing to validate that the policies are being followed.
For cases where logging is required (such as for service operation), such logged data should
be minimized and anonymized to prevent it from being useful for collusion.</li>
          <li>Protocol requirements to make collusion or data sharing more difficult.</li>
          <li>Adding more partitions and contexts, to make it increasingly difficult to collude with
enough parties to recover identities.</li>
        </ul>
      </section>
      <section anchor="violations-by-insufficient-partitioning">
        <name>Violations by Insufficient Partitioning</name>
        <t>It is possible to define contexts that contain more than one type of user-specific information,
despite effort to do otherwise. As an example, consider OHTTP used for the purposes of hiding
client-identifying information for a browser telemetry system. It is entirely possible for reports
in such a telemetry system to contain both client-specific telemetry data, such as information
about their specific browser instance, as well as client-identifying inforamtion, such as the client's
location or IP address. Even though OHTTP separates the client IP address from the server via
a relay, the server still learns this directly from the client.</t>
        <t>Other relevant examples of insufficient partitioning include TLS and Encrypted Client Hello (ECH) <xref target="I-D.ietf-tls-esni"/>
and VPNs. TLS and ECH use cryptographic protection (encryption) to hide information from unauthorized parties,
but both clients and servers (two entities) can link user-specific data to user-specific identity (IP address).
Similarly, while VPNs hide identity from end servers, the VPN server has still can see the identity of both the
client and server. Applying privacy partitioning would advocate for at least two additional entities to avoid
revealing both (identity (who) and user actions (what)) from each involved party.</t>
        <t>While straightforward violations of user privacy like this may seem straightforward to mitigate, it
remains an open problem to determine whether a certain set of information reveals "too much" about a
specific user. There is ample evidence of data being assumed "private" or "anonymous" but, in hindsight,
winds up revealing too much information such that it allows one to link back to individual
clients; see <xref target="DataSetReconstruction"/> and <xref target="CensusReconstruction"/>
for more examples of this in the real world.</t>
        <t>Beyond information that is intentionally revealed by applying privacy partitioning, it is also possible
for information to be unintentionally revealed through side channels. For example, in the two-hop
proxy arrangement described in <xref target="masque"/>, Proxy A sees and proxies TLS data between the client and
Proxy B. While it does not directly learn information that Proxy B sees, it does learn information through
metadata, such as the timing and size of encrypted data being proxied. Traffic analysis could be exploited
to learn more information from such metadata, including, in some cases, application data that Proxy A was
never meant to see. Although privacy partitioning does not obviate such attacks, it does increase the cost
necessary to carry them out in practice. See <xref target="security-considerations"/> for more discussion on this topic.</t>
      </section>
    </section>
    <section anchor="partitioning-impacts">
      <name>Partitioning Impacts</name>
      <t>Applying privacy partitioning to communication protocols lead to a substantial change in communication patterns.
For example, instead of sending traffic directly to a service, essentially all user traffic is routed through
a set of intermediaries, possibly adding more end-to-end round trips in the process (depending on the system
and protocol). This has a number of practical implications, described below.</t>
      <ol spacing="normal" type="1"><li>
          <t>Service operational or management challenges. Information that is traditionally passively observed in the
network or metadata that has been unintentionally revealed to the service provider cannot be used anymore
for e.g., existing security procedures such as application rate limiting or DDoS mitigation.
However, network management techniques deployed at present often rely on information that is exposed by
most traffic but without any guarantees that the information is accurate.  </t>
          <t>
Privacy partitioning provides an opportunity for improvements in these management techniques with
opportunities to actively exchange information with each entity in a privacy-preserving way and requesting
exactly the information needed for a specific task or function rather then relying on assumption that
are derived on a limited set of unintentionally revealed information which cannot be guaranteed to be
present and may disappear any time in future.</t>
        </li>
        <li>
          <t>Varying performance effects and costs. Depending on how context separation is done, privacy partitioning may
affect application performance. As an example, Privacy Pass introduces an entire end-to-end round
trip to issue a token before it can be redeemed, thereby decreasing performance. In contrast, while
systems like CONNECT proxying may seem like they would regress performance, often times the highly
optimized nature of proxy-to-proxy paths leads to improved perforamnce.  </t>
          <t>
Performance may also push back against the desire to apply privacy partitioning. For example, HTTPS
connection reuse <xref section="9.1.1" sectionFormat="comma" target="HTTP2"/> allows clients to use an existing HTTPS session created
for one origin to interact with different origins (provided the original origin is authoritative for
these alternative origins). Reusing connections saves the cost of connection establishment, but means that
the server can now link the client's activity with these two or more origins together. Applying privacy
partitioning would prevent this, while typically at the cost of less performance.  </t>
          <t>
In general, while performance and privacy tradeoffs are often cast as a zero sum game, in practice this
is often not the case. The relationship between privacy and performance varies depending on a number
of related factors, such as application characteristics, network path properties, and so on.</t>
        </li>
        <li>Increased attack surface. Even in the event that information is adequately partitioning across
non-colluding parties, the resulting effects on the end-user may not always be positive. For example,
using OHTTP as a basis for illustration, consider a hypothetical scenario where the Oblivious
Gateway has an implementation flaw that causes all of its decrypt requests to be
inappropriately logged to a public or otherwise compromised location. Moreover, assume
that the Target Resource for which these requests are destined does not have such an
implementation flaw. Applications which use OHTTP with this flawed Oblivious Gateway to
interact with the Target Resource risk their user request information being made public,
albeit in a way that is decoupled from user identifying information, whereas applications
that do not use OHTTP to interact with the Target Resource do not risk this type of disclosure.</li>
        <li>Centralization. Depending on the protocol and system, as well as the desired privacy properties, the
use of partitioning may inherently force centralization to a select set of trusted participants.
As an example, the impact of OHTTP on end user privacy generally increases proportionally to the
number of users that exist behind a given Oblivious Relay. That is, the probability of an Oblivious
Gateway determining the client associated with a request forwarded through an Oblivious Relay decreases
as the number of possible clients behind the Oblivious Relay increases. This tradeoff encourages
centralization of the Oblivious Relays.</li>
      </ol>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t><xref target="limits"/> discusses some of the limitations of privacy partitioning in practice. In general,
privacy is best viewed as a spectrum and not a binary state (private or not). Applied correctly,
partitioning helps improve an end-users privacy posture, thereby making violations harder to
do via technical, social, or policy means. For example, side channels such as traffic analysis
<xref target="I-D.irtf-pearg-website-fingerprinting"/> or timing analysis are still possible and can allow
an unauthorized entity to learn information about a context they are not a participant of.
Proposed mitigations for these types of attacks, e.g., padding application traffic or generating
fake traffic, can be very expensive and are therefore not typically applied in practice.
Nevertheless, privacy partitioning moves the threat vector from one that has direct access to
user-specific information to one which requires more effort, e.g., computational resources,
to violate end-user privacy.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>Informative References</name>
      <reference anchor="CensusReconstruction" target="https://www.census.gov/data/academy/webinars/2021/disclosure-avoidance-series/simulated-reconstruction-abetted-re-identification-attack-on-the-2010-census.html">
        <front>
          <title>The Census Bureau's Simulated Reconstruction-Abetted Re-identification Attack on the 2010 Census</title>
          <author>
            <organization/>
          </author>
          <date>n.d.</date>
        </front>
      </reference>
      <reference anchor="DECOUPLING">
        <front>
          <title>The decoupling principle: a practical privacy framework</title>
          <author fullname="Paul Schmitt" initials="P." surname="Schmitt">
            <organization>University of Hawai'i</organization>
          </author>
          <author fullname="Jana Iyengar" initials="J." surname="Iyengar">
            <organization>Fastly</organization>
          </author>
          <author fullname="Christopher Wood" initials="C." surname="Wood">
            <organization>Cloudflare</organization>
          </author>
          <author fullname="Barath Raghavan" initials="B." surname="Raghavan">
            <organization>USC</organization>
          </author>
          <date month="November" year="2022"/>
        </front>
        <seriesInfo name="Proceedings of the 21st ACM Workshop on Hot Topics in" value="Networks"/>
        <seriesInfo name="DOI" value="10.1145/3563766.3564112"/>
        <refcontent>ACM</refcontent>
      </reference>
      <reference anchor="RFC6973">
        <front>
          <title>Privacy Considerations for Internet Protocols</title>
          <author fullname="A. Cooper" initials="A." surname="Cooper"/>
          <author fullname="H. Tschofenig" initials="H." surname="Tschofenig"/>
          <author fullname="B. Aboba" initials="B." surname="Aboba"/>
          <author fullname="J. Peterson" initials="J." surname="Peterson"/>
          <author fullname="J. Morris" initials="J." surname="Morris"/>
          <author fullname="M. Hansen" initials="M." surname="Hansen"/>
          <author fullname="R. Smith" initials="R." surname="Smith"/>
          <date month="July" year="2013"/>
          <abstract>
            <t>This document offers guidance for developing privacy considerations for inclusion in protocol specifications. It aims to make designers, implementers, and users of Internet protocols aware of privacy-related design choices. It suggests that whether any individual RFC warrants a specific privacy considerations section will depend on the document's content.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="6973"/>
        <seriesInfo name="DOI" value="10.17487/RFC6973"/>
      </reference>
      <reference anchor="CONNECT-UDP">
        <front>
          <title>HTTP Datagrams and the Capsule Protocol</title>
          <author fullname="D. Schinazi" initials="D." surname="Schinazi"/>
          <author fullname="L. Pardue" initials="L." surname="Pardue"/>
          <date month="August" year="2022"/>
          <abstract>
            <t>This document describes HTTP Datagrams, a convention for conveying multiplexed, potentially unreliable datagrams inside an HTTP connection.</t>
            <t>In HTTP/3, HTTP Datagrams can be sent unreliably using the QUIC DATAGRAM extension. When the QUIC DATAGRAM frame is unavailable or undesirable, HTTP Datagrams can be sent using the Capsule Protocol, which is a more general convention for conveying data in HTTP connections.</t>
            <t>HTTP Datagrams and the Capsule Protocol are intended for use by HTTP extensions, not applications.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9297"/>
        <seriesInfo name="DOI" value="10.17487/RFC9297"/>
      </reference>
      <reference anchor="CONNECT-IP">
        <front>
          <title>Proxying IP in HTTP</title>
          <author fullname="Tommy Pauly" initials="T." surname="Pauly">
            <organization>Apple Inc.</organization>
          </author>
          <author fullname="David Schinazi" initials="D." surname="Schinazi">
            <organization>Google LLC</organization>
          </author>
          <author fullname="Alex Chernyakhovsky" initials="A." surname="Chernyakhovsky">
            <organization>Google LLC</organization>
          </author>
          <author fullname="Mirja Kühlewind" initials="M." surname="Kühlewind">
            <organization>Ericsson</organization>
          </author>
          <author fullname="Magnus Westerlund" initials="M." surname="Westerlund">
            <organization>Ericsson</organization>
          </author>
          <date day="28" month="April" year="2023"/>
          <abstract>
            <t>   This document describes how to proxy IP packets in HTTP.  This
   protocol is similar to UDP proxying in HTTP, but allows transmitting
   arbitrary IP packets.  More specifically, this document defines a
   protocol that allows an HTTP client to create an IP tunnel through an
   HTTP server that acts as an IP proxy.  This document updates RFC
   9298.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-masque-connect-ip-13"/>
      </reference>
      <reference anchor="OHTTP">
        <front>
          <title>Oblivious HTTP</title>
          <author fullname="Martin Thomson" initials="M." surname="Thomson">
            <organization>Mozilla</organization>
          </author>
          <author fullname="Christopher A. Wood" initials="C. A." surname="Wood">
            <organization>Cloudflare</organization>
          </author>
          <date day="25" month="August" year="2023"/>
          <abstract>
            <t>   This document describes Oblivious HTTP, a protocol for forwarding
   encrypted HTTP messages.  Oblivious HTTP allows a client to make
   multiple requests to an origin server without that server being able
   to link those requests to the client or to identify the requests as
   having come from the same client, while placing only limited trust in
   the nodes used to forward the messages.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-ohai-ohttp-10"/>
      </reference>
      <reference anchor="HPKE">
        <front>
          <title>Hybrid Public Key Encryption</title>
          <author fullname="R. Barnes" initials="R." surname="Barnes"/>
          <author fullname="K. Bhargavan" initials="K." surname="Bhargavan"/>
          <author fullname="B. Lipp" initials="B." surname="Lipp"/>
          <author fullname="C. Wood" initials="C." surname="Wood"/>
          <date month="February" year="2022"/>
          <abstract>
            <t>This document describes a scheme for hybrid public key encryption (HPKE). This scheme provides a variant of public key encryption of arbitrary-sized plaintexts for a recipient public key. It also includes three authenticated variants, including one that authenticates possession of a pre-shared key and two optional ones that authenticate possession of a key encapsulation mechanism (KEM) private key. HPKE works for any combination of an asymmetric KEM, key derivation function (KDF), and authenticated encryption with additional data (AEAD) encryption function. Some authenticated variants may not be supported by all KEMs. We provide instantiations of the scheme using widely used and efficient primitives, such as Elliptic Curve Diffie-Hellman (ECDH) key agreement, HMAC-based key derivation function (HKDF), and SHA2.</t>
            <t>This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9180"/>
        <seriesInfo name="DOI" value="10.17487/RFC9180"/>
      </reference>
      <reference anchor="ODOH">
        <front>
          <title>Oblivious DNS over HTTPS</title>
          <author fullname="E. Kinnear" initials="E." surname="Kinnear"/>
          <author fullname="P. McManus" initials="P." surname="McManus"/>
          <author fullname="T. Pauly" initials="T." surname="Pauly"/>
          <author fullname="T. Verma" initials="T." surname="Verma"/>
          <author fullname="C.A. Wood" initials="C.A." surname="Wood"/>
          <date month="June" year="2022"/>
          <abstract>
            <t>This document describes a protocol that allows clients to hide their IP addresses from DNS resolvers via proxying encrypted DNS over HTTPS (DoH) messages. This improves privacy of DNS operations by not allowing any one server entity to be aware of both the client IP address and the content of DNS queries and answers.</t>
            <t>This experimental protocol has been developed outside the IETF and is published here to guide implementation, ensure interoperability among implementations, and enable wide-scale experimentation.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9230"/>
        <seriesInfo name="DOI" value="10.17487/RFC9230"/>
      </reference>
      <reference anchor="PRIVACYPASS">
        <front>
          <title>The Privacy Pass Architecture</title>
          <author fullname="Alex Davidson" initials="A." surname="Davidson">
            <organization>LIP</organization>
          </author>
          <author fullname="Jana Iyengar" initials="J." surname="Iyengar">
            <organization>Fastly</organization>
          </author>
          <author fullname="Christopher A. Wood" initials="C. A." surname="Wood">
            <organization>Cloudflare</organization>
          </author>
          <date day="12" month="September" year="2023"/>
          <abstract>
            <t>   This document specifies the Privacy Pass architecture and
   requirements for its constituent protocols used for authorization
   based on privacy-preserving authentication mechanisms.  It describes
   the conceptual model of Privacy Pass and its protocols, its security
   and privacy goals, practical deployment models, and recommendations
   for each deployment model that helps ensure the desired security and
   privacy goals are fulfilled.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-privacypass-architecture-15"/>
      </reference>
      <reference anchor="QUIC">
        <front>
          <title>QUIC: A UDP-Based Multiplexed and Secure Transport</title>
          <author fullname="J. Iyengar" initials="J." role="editor" surname="Iyengar"/>
          <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
          <date month="May" year="2021"/>
          <abstract>
            <t>This document defines the core of the QUIC transport protocol. QUIC provides applications with flow-controlled streams for structured communication, low-latency connection establishment, and network path migration. QUIC includes security measures that ensure confidentiality, integrity, and availability in a range of deployment circumstances. Accompanying documents describe the integration of TLS for key negotiation, loss detection, and an exemplary congestion control algorithm.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9000"/>
        <seriesInfo name="DOI" value="10.17487/RFC9000"/>
      </reference>
      <reference anchor="DOH">
        <front>
          <title>DNS Queries over HTTPS (DoH)</title>
          <author fullname="P. Hoffman" initials="P." surname="Hoffman"/>
          <author fullname="P. McManus" initials="P." surname="McManus"/>
          <date month="October" year="2018"/>
          <abstract>
            <t>This document defines a protocol for sending DNS queries and getting DNS responses over HTTPS. Each DNS query-response pair is mapped into an HTTP exchange.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="8484"/>
        <seriesInfo name="DOI" value="10.17487/RFC8484"/>
      </reference>
      <reference anchor="I-D.ietf-tls-esni">
        <front>
          <title>TLS Encrypted Client Hello</title>
          <author fullname="Eric Rescorla" initials="E." surname="Rescorla">
            <organization>RTFM, Inc.</organization>
          </author>
          <author fullname="Kazuho Oku" initials="K." surname="Oku">
            <organization>Fastly</organization>
          </author>
          <author fullname="Nick Sullivan" initials="N." surname="Sullivan">
            <organization>Cloudflare</organization>
          </author>
          <author fullname="Christopher A. Wood" initials="C. A." surname="Wood">
            <organization>Cloudflare</organization>
          </author>
          <date day="6" month="April" year="2023"/>
          <abstract>
            <t>   This document describes a mechanism in Transport Layer Security (TLS)
   for encrypting a ClientHello message under a server public key.

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/tlswg/draft-ietf-tls-esni
   (https://github.com/tlswg/draft-ietf-tls-esni).

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-tls-esni-16"/>
      </reference>
      <reference anchor="DataSetReconstruction">
        <front>
          <title>Robust De-anonymization of Large Sparse Datasets</title>
          <author fullname="Arvind Narayanan" initials="A." surname="Narayanan">
            <organization/>
          </author>
          <author fullname="Vitaly Shmatikov" initials="V." surname="Shmatikov">
            <organization/>
          </author>
          <date month="May" year="2008"/>
        </front>
        <seriesInfo name="2008 IEEE Symposium on Security and Privacy (sp" value="2008)"/>
        <seriesInfo name="DOI" value="10.1109/sp.2008.33"/>
        <refcontent>IEEE</refcontent>
      </reference>
      <reference anchor="HTTP2">
        <front>
          <title>HTTP/2</title>
          <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson"/>
          <author fullname="C. Benfield" initials="C." role="editor" surname="Benfield"/>
          <date month="June" year="2022"/>
          <abstract>
            <t>This specification describes an optimized expression of the semantics of the Hypertext Transfer Protocol (HTTP), referred to as HTTP version 2 (HTTP/2). HTTP/2 enables a more efficient use of network resources and a reduced latency by introducing field compression and allowing multiple concurrent exchanges on the same connection.</t>
            <t>This document obsoletes RFCs 7540 and 8740.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="9113"/>
        <seriesInfo name="DOI" value="10.17487/RFC9113"/>
      </reference>
      <reference anchor="I-D.irtf-pearg-website-fingerprinting">
        <front>
          <title>Network-Based Website Fingerprinting</title>
          <author fullname="Ian Goldberg" initials="I." surname="Goldberg">
            <organization>University of Waterloo</organization>
          </author>
          <author fullname="Tao Wang" initials="T." surname="Wang">
            <organization>HK University of Science and Technology</organization>
          </author>
          <author fullname="Christopher A. Wood" initials="C. A." surname="Wood">
            <organization>Cloudflare</organization>
          </author>
          <date day="8" month="September" year="2020"/>
          <abstract>
            <t>   The IETF is well on its way to protecting connection metadata with
   protocols such as DNS-over-TLS and DNS-over-HTTPS, and work-in-
   progress towards encrypting the TLS SNI.  However, more work is
   needed to protect traffic metadata, especially in the context of web
   traffic.  In this document, we survey Website Fingerprinting attacks,
   which are a class of attacks that use machine learning techniques to
   attack web privacy, and highlight metadata leaks used by said
   attacks.  We also survey proposed mitigations for such leakage and
   discuss their applicability to IETF protocols such as TLS, QUIC, and
   HTTP.  We endeavor to show that Website Fingerprinting attacks are a
   serious problem that affect all Internet users, and we pose open
   problems and directions for future research in this area.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-irtf-pearg-website-fingerprinting-01"/>
      </reference>
    </references>
    <?line 748?>

<section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>TODO acknowledge.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+1925Lb1pXo+/4KlPzg7oikJDtxEnmcpN1SRl2xrR63nNS8
nCoQ2CQxAgEGG2yalpQvm7fzY2dd9wUEW91W65w4Z1ipWE0C+7L22ut+mU6n
pq/62j7NHlzmHfyzapuqWWa5y/ImO+uKVdXbot92Nlu0XXbZVdd5sX9g8vm8
s9fDt5JHiry3y7bbP82qZtEa13c2Xz/NLs6+NqZsiyZfw6xlly/6aZXPpxt+
b7qJBpw+/szAJJ+b13a/a7sS3m562zW2nz7DF43Jt/2q7Z6abGoy+Cy2dc0D
f1t1/5Vnf/nf/72q7a5qSvq57ZZ5U/2U4/BPs+ddVTjXNtn31tkctkrP2HVe
1U+zNb4/e7218v6frDw9K9r14XSv2vV6n13m23o/MtPZZlPbePR+g0/+Kcfv
xwc8X3WV69vNynbZ2Sz7W9uObeG8brflos67ZPQi3/1pZfMNQHBe9W4G8DKm
abs1vHVtnxqDB+L/yrJz27it+94WbQOntC1obBpQcOPVyspD2deACvn2U5dd
VettDUdcZumL07O57fnraVXapq8WVUHLzc76Pi9eZ/CvHgb87PGTxzIqz5V3
S9s/zVZ9v3FPHz3a7Xazgn6eLdvrR2Xe54/yIi/tev9oZ+dVk3fu0WePP3vy
qKxcUbcOVjbNr9uqzJvCTh0cmHWPnC5z2qXLzHmZ8PVgmdOcljmFf8Eyp7jM
qaxj1a9rY8x0Os3yOQyVFwDYV6vKZYDQ2zWMkpXWFV01t472CEjdFBUcctYu
MsHwLMbwSbZbVcUqc7aGawbnUe8ztwEQlzAm7BhuYZkBgqy3jUIxL7rWOQPb
6mlkGg7mwyubrW3ewNRtVq03XXttdRU08RzGtvA4jAOXdQsQynjr/T5bdO2a
v8JpZ0d3Zde2W+LrGwATXEUHtxsmaPu2aGua2W8Ptpb3YRdr2+f0R+UM0A6b
14Ak/aprt8uVHwFGg1FzOiI3wa+vYYmOQIB4Y7t11bR1u9xPaFA8+q1z8MSq
3RmYPW/yev+TzdwWoLpuS1u7GZ/YuipLuIXmEyQiXVsyHhhz6RdP7wAYX31z
RYNfXDpb6BoAuPAXEsITJDoItoLQH5+0TdHtN/DXaVas8qaxtQH02lkLS961
8HO5aWFnLoMj6eTIw5eASI1b4GnovQQykz3nMenIYYpoUlw24BMDs+HXqx7g
mjW2sM7l3Z4OAjYGSBWPysc8t3iADlcHBBuABLgPG5nvFZdM2yPd6WErhEB4
KE0Jj/hjogcBs3NY/yw7Y9hN4GFYxGsgl4jvBC7ErWRhyCPwNnW4BpihN/H6
FBQdTEawgumdVaC6rEMS1zBG9xZO9kW7A1zqJuF45Nls/AAqRFi3XcBtrxCz
cTl6P2DNuFv/sIG/1nAzry3s8aKByQt8ZQ/MgnCT3+rs37cVrMvi8Ksc7pz9
EeCC4JrbfduUNGhjEdvDoQwObxxdZtlVu8bx8jXcdMcLhB3QBA7hBeSl3pZI
06fZGd/fvEBQExMHkHTXVWGR5OYZEE2YycJFWK76rGn7DAki7gjWxTcSl1p1
Wd0ylk3MfAv4s6Bz8oPBAvI5EB54q53jl0xlihoBCpzh4jLLy7KDRUwyQMsC
kKgGkDWZg83A+psliA8tDIxv4ZLhHZ1xlhHhgf8BoGASRIsiOSTYWcET6npo
gqp5bTz5wqWNDR5BiYGwy3n3c+u3xOBD0PSKH3xfYcB9Bpw2Y5mj+smWE6Mk
I4cD3sF/8FbUFqh6Bc/AFvHYCdFbRg2h9htbIL/R54lZ7A2SfeGOFZ1ju4UV
8G1F7tUBTv0MABkFkOIH8Bm8limQZDqBER8m0H2CMB0/boUI/HZTtznRcxSJ
CGaAXstlZ5d8ifVghjA2CmMELrCTLSBjfFxu73q79rADgDGNQGh4kPl3kUMw
cAywIvyKbxhe2g9BI9m7SSfSJfpl0EMzZP9WuFNeE7FrhGb5W1s5BiC/4jxA
lNXRhpESw0mEO2sUDHDZW8c41GZrxDc8salfSatcfLHHpxJq2iY3l4gYU26Q
iTrA3iANKCaEcb1ocMA/0ueEp6ck3gic8SC2QAcQd7uY/hEqykNEJvC41pu2
6wU6r63dhDWc7FbtKXN8mM6coGhxqtKMnR1KYYuqAdA/GJW5HjAlqtYoNdUO
iZ+wHMRlltwelHDhANNJ1FEp7oF58+aPz56fv/zh8puL7/79q2cvL2ZPHs+e
PPn1bx59/psvPv/tF1/M4L+/fvLks3fvJjrU0jZwzkBbbbFqqr9vCdA0l66f
HqONJYLSdeUquTHXeVe1IH6rsAdYBlI96ESvU+mQKQ+Nl1drZBgsCOItiUE+
yxLFDUk64TaIx2sCM7KHHKZr8sLmgDh0QCAoLBB36ICWW1g7oDCtHhQQRIGW
b5AysyMIheMf4tAsC7wc9KKKxY2N7er9xIydY7ay9caxMCE0Kt4igK+tcyUT
ACUA27rFJ+kcirwGWdvviGRH0HZhASJ4AHoAXl3hiuDwLp6/+nOG8MaJlyC0
bhwxA/2qjaVguJJMy+Tm5yVCSGmIRydzVClgto7jvnxxdjHJvj27+o8fnk9U
uYbDQ+aKcLy8/FaInUd+t12vc+RPzhCCEEVqgbbosvEWeYE+hzsNGic9iQQS
mJATG4Bn0sDLUdvgq8DLbR0ZBVAMBRDC7oBiRlIWQgMZTYEwvBw7vMpFpKhG
Maq213j3iZsCratpOXQRQOav1qL0qsaEO5ZNlCBCZm/eXFmS6LMvZk9wXX/8
/s/nX/z+t5+/ezeDH/0fQadYbllVTPgCikTwayeIUzVGTQ7hfAHydQtboKuG
BLvH+eBiO34J1gDaCB437Kjexhc82Qqefx6rPtEmfnu4iaCoEFJZ4C7tfhSB
DOpUvXBa2g4tIKyQUIIYQyGaGtxWWWzguQCkagkAj8+J2FKGrL5jaQB3qgq0
7Zyn0cRP58gbgbKyoQAVjDEFAt8xIkp2tDgLV5FFsB97Xukqx1tsm7BPlIVG
MQsnJrIOEgdRWsKoXb5PSK6nRoIPMDExN1jsnvVbVoVOQE9KkWv2azwZfzCn
ROiZ7cPcji5FfFF5CB3gzRs5sQ38BG/PUCMNj0eHaP7c8rltth3cN5b/U77Z
Jxd/Af+gxw4ob6xXIrEwLJqJ9gDw3x+XIRD6MIsfDAkljT/xCjOjC1mfjIj+
SANjRUCvcir5D4co8WRgl/Oq61cortA6auQAxElboMRHiCaJWW3CDQiL8BmS
ynKVLyOtDNcQaXkAOaBEiGqiBaCK08Bo+41V4I9DVQQQ5qMVyn3MxMRmI5pl
Yg4Cncj1tJWqtkvUGZBJIPLDLdj7dRu/7pHF4aBEUZBrr0ldQJYfHR9K7Sxs
LLb1oqpFxTOLbVMwPozeoby8RqUJQLIgJISNxZQLr3KixEfE0UQbFyalzJB2
IJrmUVh6G5J1QfGQPRvZcyKS8i2pushMwRcGWQ8gG53HfjKONSAluYQu/Aok
zV+RgIgnXwlV+BUKnL9iHbBsSZCGf4PG5nqvlQsxhYO0njUReRydWMijioIq
e9BIiOdIFwJhOGda6Ix5Tkhd2eJmjAS1oXKobFSocdN+lKAKpgGmyheGNHq2
Z6JMRMKzkE1hbodWvFyuEFFRf1ZuRRpydFh5n5KfiyZWBmDLTe95hFyV45sS
26es200CSJ23sMQUAAkb6k61rBMUiYFpSxTdqgcKsDg1ZWsdyb6ePyGraERw
xJcQK5QzMRyHCAnQFMkdzhAUhiB6BGslvSPqDp9kzEMrtDWV24LwJIKNMjIT
y/WKXk9hsqd/34J69c78ARAmvFbxfCACo9VcoexVCsQlN6QbyrNZu6+aEshU
uc1rGJruGwC3nfe5ChIFnDtgj0WnBZwZyRM8H7Dp2Wy4HDTXWxb6ZBYYNzXD
z7LsUPKiW7PIiwpUbTyZGDhAkoBTtDtmYLpe9ymMLCYPwlIy9iCqvxbbrS4z
Fvv/AC9dOrst22a/FhMmOrCaJRph4VnaYI1UGBQUh7p/IvSgFuStEdlGR/qS
3oOxyZQAUnf4CWcgWkCDtgugZGz2JYzPFnYHi1O8/5J+ojXATu0GqV4DVxdG
LlDSb8K4rKUQ+i7QUknP8UxIOBu7y8Tanp2s89ci/K0nTPYQ30Uu+xRZOsKS
vCP0N259w26LSbZtcNNo4UGRRuiV9zfwsS+AQ5X0F6rD7RGKDFsbw/6ZOSOn
pNhVJkG2hS+3jTfBZy9evbqEiR0ZSOlQX51fBvbKV4GXJwIQiJYta81G7X7C
sck8ywDC27ezwEDJN7oPlJAg5R/GOy3eA1BQcxQsv1RiaRKpV6WvQIYmGWho
gPMoLxGZUh2ffRfz9keLNlW8FmtbVjl6uITD0hkB4P/xj39kee6ul+bh9MM/
D81bZT3ZWfZzP29hlMwv5+Hw53ihD4/89FBGeTv4Bc/68M3B1v1Pb/0o50z2
32aDz9vsWwX18Me3IMIjkKNR0ukAy0Z28b61DOGyABJ2d7h88OftPeEL4B+w
oewTwM5ll6+nHnPZl/zVg2f8Q0a67zx3wC3iy8sXYdq3U0ZpvKqNaqmoekZX
4cE7Y85KMpOgy84Gh5kQ3oQSxLJ5QnCCXY5FGJBee8fXFeQT4pGBXuDIu0hc
VJL8NNCVcepB5rEdi8AiHqg0q5cfNjFlDydr4ccvOjKSqmbSEfyqTUqBTKBA
6jcT8td21bJCGiyrF3kWmVxhG5QLggcDSd1i2xE5SoxU5lD6GwhNRFQVQKKW
I3Z7Y8jBM8ydg8ngl0nQbvgcJ2h3ucTxSylBG4MR3oKrMVgcJWgftJb7gcsH
f+6LoAV8+foD1nL/DHCEdY3/O7sNvnje9TBigAes63344nnXXdZyP3D54M/H
YoAUzjTC/NAwkDPzihhXYD4HPIe4XcNyoRgzi84iqc2jmBu2grHJgxyKMacS
RupmGZoWvSAN2hfNm3I2Yp6kMqAdgYRc1H1zXgIGXIjuXLTbuoSJ3daKt0De
aRvjRwMEi1cwYeMcxSV4B4KKu8zpMHbI/0LOOpajKcTLBA9JO2ceHSvQdfVa
NlC07WuKjmI9Kl7fL5O5/ExiAbJAvKT/98SCaMVZ+OLsVmv5FyMW/7zMBfAl
XtI/Cb58Hb74+lZr+RfDlyFzQQuXUNURFiP2nDEOQA58ikvo7aEyg6zmB3fT
u8J5Dt4kKZ+sN6hlZLauSJuxpCzk84pCZDA2UK273tLfBrE/hCgJ1dbRQ4iA
iVxWFZqAWFGp873tvMtKgkZlkMBMksWOOQkPVzLLvmavUfBpoUa2xkmZJS/g
0bZzJrXrLy2bmyNevQC42g5dQT0rwSEKgqOtTsQnZr49O48nk585KKInjdC1
i36HBr7wJfHIucXgqVZDKcQL5dBmCpy3L07Zu6DE58pb6YyJ7fPsCWCuK3G1
KLYkwSgHWrTLmIfjic/J4IfaK251x+diOKItcuR62z0ADjhzPq8rt4pj3Yht
t+w3Kw5MiwdxTdWH+xiyoz4G84E+huyYj0FnNOxWIM1YvNR0rvBd8CuMGFgF
88STVOKQAecBs2Eri1js8/buie5ZzY2wohU8Pc8BiQ2MfGKb06ItKTQFsGdG
CQGasNF2uLsoODgKzGCDQ+yjlmCoGl2b1219bQ3ZpuGqwpp+HITBzMVVHOFW
EmCeBsb7a+169HNKfATaccjUHgZ5asyTNL4azRIDfA6Y5p1oebasAJcSMM1w
qBtopcqdAGYKC9rkcIXZDHJ0Oop78VE18Q2ODEqOYw9dAp18xMzPmPVf4u+l
wceuUKwRGNVIyBzPgrT9EQOrlxrVqdcqP7RRa2gJBRcJ7geyaUiTgF/jqEMf
7KpRGXz2oJLgZWk+DfPhG0M7GdvEeGB2V+C3B/eHfD1CBMTNEYWuywQDp4OR
6G4XZ04E0qDRC3OENfvi2h/3EvALjxXo6R4DAoFoR4oTEYtdBQepbIOTrwJ3
Y2J9toHB4XLzJUgjRf5G1kBAKx9pEOPWrS4m8ydzyNF5YzbJRnjUJobZgEde
r7McqWC2bFnNZfGMGxxP5lIK5Wzv4mswy64oRpd57MJwVG3YC+J6Y3caPLq3
GslNiQ3Ip2gpfuYdEgXP7WG+IkeYBb1Q3Y0T8a5R6MFOkkj4dcp+sWJGNYst
xsDxPUSvNzraNCtHxAHeb42B3RQ3U1YY4iRxwnl8ouZIBCCH9rOhYNRfhuwI
ff3xSWe2aDXoYlMDyXEmSVPgu4DZUDmnpTDA/JnnRJIlWwoZ8fnL7757fv5q
6vp9jXZxwXLKppCgC1gH0QGy0mssF3NIGG3b5CSoRNE7/hrJ2nBAYgap3Vui
hikHBxbUBkqLqOejUIEevgS5gW0BSLEmmmjG3BiIV4mRWm67ptscra9oUXhC
pKe1a1REjNXswNs6kW0ZYVoKDa2zZruewwywNVsLgMXQ7tp66zMP/rZiYRDd
rm2aluOJqw+yXwFyABrPqxIOrWCXac1Y0xifJHWNiOZWOERpmSRyKtRQxvXM
qZScEjQNYbAaQJ+MJRrND8hT28ApLi+/ndAQbVFsO4ZPEnwjDndyayABNhrl
TjE1BGSGHnnulQkhqZUgAXmcbnObYVxlcPqgAyCOpCMfjvcAs/RMEXd8jLxT
WxGUYxgxxCeGXeUSrotpLe1rkOR8pCJexVL8z0glBmgfiDs6V1JkE4+9XLL0
2GjEeDmJ2EKogfJUaZedpSBhDnD1JxgJx7HMzJvhWFv42rSxsPkpYihSdCVf
uIYawM4cots6RMAgyY/ndSUyATw+vGD+8EieQZ65p4PndJ8k6SGEBXFmUhDX
YwEnSORLwFWQWUG0X/gxypYuDq9eZpNwdyJEHi0nHKhV0FUBKpiXkltB5Hm6
ajdjJxuxCgkVaFqV7Dkaj/ZF8jmh2CAZ5HCTIc8nbDFVakDDyimenvZEZ2UW
Ufg43c1XqMixUuD5C+yB59MAsrJD1CrbXSOhhu080reF5pooJr7cSi5OXW85
VKLz8Tgc5OEoNvUsu9rCPd5zWKtyX5YKUikEsXjRagyOxhaHoCegIB0LpnDS
yxYfCgHqlkLsjeruCLH9MZ4n2isfIS7KX0uJlM/efLLOHQge74yh6wkwBfZD
OsqPpDkT8TkQbVofHqKijc/LC3qcD+bAeX2O6jhzTlNu83hksuv783R2SZxj
BrIcxU4l5hbOjca4slxP90dSbTRwFTHBO9HZNcvPwB3AO+M4TQNTC9G3bpn/
o696xvQLpbUVZpx3khnhtht0JHOckIcdwpkQFG16hJyc1x+WpqeCqX4tkNBv
kaNz5mS9Z6vAt7LpH2Hws3AzzNWWghB7ycD4jx8uzmMt7YTP9jRNw6CVl0jZ
gImXJklFdtW64uwCBsYPzy6zN2/+qHcf/vzq+z+f//6z3//23TuN2dlgdBMo
4dFzF5dfXUyfzSrbL6aMVlM5n2m1gTdJTybc2WLmKSPoBUUcE/WY8uwg4MJy
KVmGgxH48Vtgm5An4DrI/ZIj1Df13vCYNSWfjmMuoZJQIVrSxAAE3Qoph9zE
RbVE88YcYLpL7B+pwo0YTOJpLhZfXNclo10INVVeBpKmG4RJ+dCFw7UajS/l
9aoE5r03IZmGbkKbtSguJRdMnuABvhyu8xV9LQShHC5YyHME6zhRkYdUmBtK
NoiStfy6goKYU4SKhKIcW0sUBXMD+A6vsPE5X9Ek6VrDSsQrRi/yQtC6x0Q0
WstgBXLl6WG8RZ4W+KWhlsZ3R4JORrMIQP/Fq5JmnQd4GTtbzphIXPBkMOkj
nFACWT6Oz254EM/9QaiZ7b32/V9QQMixeBBYguz/FgEhGul0i7X86wWEDPHl
UojILbHlnz4gRPbj52eaPhLLeCO+IDHSiJD/jwNC3h4wx1ujSbSWnwuXg1F+
Fr6MjBLhyytl6EN8ef8oyXQh9PVOa7kfuHzw5/7wZciLfya+HP/czz26y52+
eZSIvsS4dEBf7rCWgEt3WMsvkr4MYwKeoHnjMBigbSwZPjaxfE6efnH1Y/DX
CUlmnT1VRTlkS1O5rG5cHR/4X8Uos2u9um04FVPUIDGfCgVRJYBdPmTgQUmW
pfbo3+nv/LLRl78kGx+b/v5HRhyfP/rH/8iI459fkIw4AoeHg7/vhi9vj/z3
RnyJJUWZkol5WNMt8CWWFP1vX9+0lvuBywd/Pp6M+PWduf4xuAyhMPbNYJSR
Mzo4iZFvDkY5wJchdoRvbhhldOazg2++zm5Yy/3A5YM/Hw9fzj4ivrx3lFvh
yy1GOYovdxpldC0pvrx3lPuBywd/7lmnyM4+gMAc29H93KOfQV9GR7kzfTmy
ljvSl5HPL5u+CJJ8gBZ6+x3dD59+r/xyy1HeI7/cei03yi+3+vxy5JehDvrZ
uA4KKuERHfTPAx9jUhgoCWATRx+6qrQqGhU9onC/yJV7gg5JECypamAUyyMh
Zt67Ss/xgsinrsGLHNLSU+lWwHr47TSu03LcLT0IDEEnxrPvrswwYOTNmz++
xH8E12K7yiv4v77fYPHAZKe4jMH7seP0wgdM8daxaNzATTpB1wuVbJiusUzj
0po0XzoJ8qToESrMnHOghQQkzIRFo+eQwmQk08s/HceIfI8vToy4sNgPTSVO
ZQGqH7qJVBkJr/47R394/1eO8U20Wkl5pgEcWgSMjBxckzbj4Bs4Pu8YEwdo
2/mStUVqfeBIixChOYwmQzBUXFvrxX7eVWV2uYUHiuwvdh87qeFYX1z+5Tn5
lZ/87vG7dxS+Zjt0hUXoOTvAh1Ek5ozvY6j7XnR8lboLPdiSaIHE+XoeHMVy
BtkJLp2jF4LQqT/KHT6deH9tEvzcRYFnHPAQD0II4oOR2Q9J343MoCUoydfq
C4ViLD4cvgSA4fRj76tDWAPkNagn/DThiLRqEcaguAKMPQ0hsYL74jsfWsby
RovFzPdZKKUSlXjZAGJxqLw4PXmivjUYoIeVk3y9Fwp61fn+r9iz7mxkvrse
rk99mH1C/3Une1a0AkWMh/L37e1Zd1jL/cDlgz8fQ99U+H18+8QY9O5unxg7
yeP6Jl/J+Bvd79FR7mMt9wOXD/58DHxhiN6fz/Ofyz7Bu/tw+8Qd1/IvZp8Y
6g8kBY8oEAOZKdYgwk8gbXMAITkxSNB+9vIFR/p9jhIZl5d2URU2X5cTeP4w
yBm9TpIfQCUNcHgvSaGSQElEqENg/wnXdr4wJ0Y+Sr4bdgs4GLnqI6lSF2NQ
fMxINmth25sVJsl2FQgW1bWNYulRkOGcTK8h0F4waDopHUmB828+iavOmrGo
+jxu9gRAu/z+4q9n5/95eXZ1FXSUaJRp/ILET0q1SK+vSarngS6TTJ+Gc3LG
CAWUR6kEIjrhyOjLXGRwvqGxEFZJbUQAQ/BSgXFfj05TJCYco0ox/5TCiIkD
nAGgBZFQZcDwTK58PMgKpoY6HKDsU7pWoM44TGNE2fX87PLV+YszRhk9Iyll
jhGKnBW630SVfDHTj9N6sZ0OJuiSoLqyxWtnpOAcuVfTyt8KmbSFAMKARiFp
VEpydFogNSkjjD+xTE8QYPHdw5sLCw6GZhhJUge3DCmttWtAu6rkYTjsNV3q
sVq9Pk2Vc24G+E5NAkiX1ZBU1J+wMnCNzbzwdHJC1LToOsf7nr5Hb9Kcr10b
yneZPHuAG1pv4lzSB1458iH+CgiXnSRJRBqXyukjhcVofMauU6ln0pgHCHYq
+Hls/EmCB0kCDQ2W+RHkN87FTcBnIvBxorI7qMOa+Q5MpRbxtdlwdVT10qtv
lF4ZDWHGhjgE4UfRXr4P09xdsAj87wYuejs2+j6OfjuWLqO85AsWSxfHyhR+
5LXcD1w++HN/0uiFYvbPxJb3W/kVLtGKh9/coNUNz+jtwU+3sSAPBdSH2HGP
2YH/5oJ5wo2j3Mda7gcud/t8LGk0EnpGZFKfp1elrA+F0ivfZeiQMHoWnZDc
2GQWMy1JjOKaCeEJzW4PGW/a+sAXbZRGNmR1Mt224aRhagiCPNmF4vQ+s/qg
8law+2JO3cL2mMnNopOafkcZiMXkG5VZixWDgl9E0x0mm3HbI654PYCQWtpo
V1WpmY5BiggVv4y2naCS25HoilW3fa+TsKvSYnEISnyXBMnQ6MtXDBCp3wjD
n3jpSjgyy1fuy0wLrPNQchaUDFjX/qxMOCuqbdCwQBgfHZyazOlNhCTTc00E
YvWG5kALKMhmkhACm6LE0oZLRw+KaJAsFFZntLwMp8Dl1BEAE08pO/v47Kfs
EBGrp/GTpkdCY9IhV+tQ1sJLXqLngOTla7hL5m8o0GJLTcBPk5fIQB7KYsTl
3vyWwgHHdXpw6UlLkYGChLoF14z41uYoLyFecDrjzc9kJ5eX3w7z0RBhVwAT
Kw2lRPmJ71doicDXGhsZYXEAqqsfNVKjKgs+H1skb4rRlAy6CUCumVIKZxkq
YcCGsZ4KtlfT0azB5i7W+bKulMqqUhv9RunUWGqhiZKIQyF1bC2q+55lzyon
HdzK7Cys2DfTzE6enV2eahoV6q/YGEwBVVE7CyY7BDQ4kDPUqlYVUBJKU55k
MACfeT6sXH9rZcHZorPclICUnXXbLF1vjsAMCylo8aFUOUCp/4G0vbtBMyjT
0zDDnniIqppaPPYbaGeYQyZ5xr5skDaqkfDXVdKbidpe+OL80RkBPUUniZAq
0G4Ek8IG/FIUyQCxOMM5oE2WjshlO6Q/WNTJMUIT7RzItPiuov/oUyjB/cDQ
v1F+w2p6vMfosfcKKCqCjEsUb8fe+gN++wIuLVxHloKOvZyIQW/vOLP/4eF0
KHf/r7DnkbB1fvmo8pBIeB5obcc/vGfm68OZH6Yz323PsXh5A7S/4ZxCeOjf
hrs98nIyxnuh/UHoqQLjJp/27YbaE79HUATihvIhVfXhPPekBZQk1J/dlAQv
TnNf+0W6OWizoC4UdfA1jPo0Qb+3G6mFdSHNn5g7q4UqthdQmQEqB4E2pDJp
qBTNNSFRw1CxN/XcR11utMmUdJBiBqe19ryJzIt/uLRQY8Cn4EonIpYmQ9sj
KukWt7GKRkc7YNJomAqp7KWgl+801rKQo50ZpGDdoHsxNS32+bGcn83FqZTR
+IY5aSk5prjIw4XSS+0gkMywHAeJdIttPX4ASeGznNpQnx5uOS6C4ZvTpp2+
fb9QknFPQiFdrcGFDegH/btQhopqrBjpb4J7P5mfEtu7aSnxLJoUwBhgtAgl
Tci1MyxazBL04eIqzmKn5Iq66EbtZdiAmOyR7ZCHTZm4EoVvHCKFMKj9X3Kx
2DQ8cgosOP6AW72ItnoRWcXMD74LMa6ei/7JHUgAhDWe/DZRBUL8oYpg1KDG
ciGOg1JgSeXmyOnRvqDjGHhIAspEknQ41yyYfb0BUyrzY1HoYS2wCVcvOGj+
1bRa+jDqrabVoUMPGQpvmRG/4Yojg/thuJI0XREnrbAOCwJ6HRdozhpjP96L
fdizePD7AI5wElq3QpKU4vadqKBiMQpOTKeyFFFUycUzLoO1slLcZGw9hvsN
c6kyxXnYKsC/XcM7J2/e/BEHJi/V48ePJ75f4G9mT7BLYGiOWi0GqC8VuQMV
036JB4uIgRLH1x3gxdGd8oUspILUUZBj41R8ZtAWq2oaIfRBp+um+ZIt34FG
lLbPq9pJ+1quqaXSf1ThA04NCG5JdcVYy+VqqEyUtS7hsLV4tKQBd/IVz8yN
dDWUiKDAQerFFxoKD3oJR9VeCe2exSWoiH9F5R2DYhhXZ6MAxw5jgvakKEfN
ypXxpLMYar+aFlkTJyWL8JPBC8PtHVDXUZT27dYnUgJeL2TSh/09aALk9KIh
Ll1QeB7+gUcOw6TFhY62+oycbJWOVDOb82Ohk/ZcufBaosoAuFx89GbisaLg
QwcCVEltLN0BYjehlR4NPhff7wHEaCwtmMelcVq601R+n07ixrWQV9uXDPJi
Bd51rg9WgvLO1UAKvgeO6zr60npJWTiAD3b7ZTkqKmKX9HSJqo9RkSr+iw02
qOiCDPMdEiYYoybKEZeLgUnItsHN6uJWV9g+bNBLmO1RcpS4fpCFauTl5nno
TItX5O+gZwp02LQ67E7MZZUPBWH23Yr3f1SmlqJqvpiab0xD/URR1GZfXOzE
PXpcg0a2s+wKaa622SWSaBA8KPMtBm3csV5vEBB8A80uMiPREQbAVt0QooMC
bir2YIDEFFFp6gMkJD7id7/+3a8x9pgnhZG51mEcMCl9D5OqNNo8LfARMyJf
gHTRwTV82Ry0Rh09iahG6EsQbg4WFRtoJgaNVsNg34GYE0pBDh/klTEtGpfq
uBZiQo++By64bKqfCO9aFGkrLPWHOxO58mBnujHRxuLjTpCtInWLeXDscE10
r0QB4Se19VRaWfLwnVn2Az7Rb5Ebo31ea0cuSeMxA9lJtaGoAnLkIM6ROfTY
xRZ7+uXuNWeDa0TNwS4UbbhrdyCcQfZdVD3L5NLFNdToDfrt4CqEABMZJq/W
GFeb1Omu6/dChk1xjhg3zOUjJnIXVLbsGQWHVNoAHMVUEyKIfDdA18OhS496
jN4hcxq5DHxZVCz6Wy2EvYs9dIRsVU1eIoUl8dLgOhZ7FR+SyuXXIDWRaFDF
PpRv7BJxMBFpVzmWxcSRKi5dNjqOicZRzoYmdszz5/biXLU0bveeDbo0UiSz
N1LkgPHTfE6NacQCziQX10CcFTiLmnkH9k+VWEekVfVwMesLFshJVDyWLeCz
5Bond47VPgUTzaZh5fuoNqmW0hsuz99rwFKjhV99l+Zo41iaEWRaKq74DQZ2
ubRjeLS8N5/U9EASsTXSvdhz8mF7cM7KcFz6v+QmdD2V32zywuacIuCpVGgi
EA4F5ALboT4pFY0jOd1PgGPSQkk4oJJw36klfEzRo0Y+UvZUe2sfuZoDt83f
bGYBNVuuEig/U506pt9/DfUt5/ugaY6Ijy4p4u+TfbQXXzWzUohMjtcL/XDE
G+SkFFnWDpviIVNG6wiRm5t6XEtnCIx4i4pwzgBwwqVk3mBah7v/usE69Vjf
F72nOk0vVdSP9DNwhLmi6+21iqpIb3xluGg3TmsOWm5oudLdah/8G6Gj4gI7
PJCC5g2N0ox+vFgI+n1b9NKhawG/QOlHH6T+BE1JuoY7KCvCxQO1+Csd4qra
BCW9c0TXWAAOrkBtMZKTy1J7QKnMyGY3Jac4ShBN0S11pOfsSw7hjJvKDjKf
Mj6sKKtm6Mkx0W9MrZSXH2RCHQ7GdRMPKqJENrCLxeiy4tweQYLIBU1INVyv
Otc92lIJUEKaNOyNbkba9xIroHI3slCa3+eNacvKCu82J/gQbvpCscp1qV+N
lvoWvkttD4q8DoxSnFWCEehl9rpM8DKLd26WPdeUn10bdJ7B7dBMMjK7SHaW
PMnhb0Nhie+uoByF+FLheNHbx7fjk5fisXZt82lv5tZr4pEJqPf15tmxz9IF
s5uoErboUoZjNbcaiVK51+yO0HvMtcZZe/GMnKj4ZQty+l7LxVODePTx5Vip
mgudqxfUg0VCVA6jNdAVXjmK7DV1u1yKhX5gM4c7QNSKLVtwUr28C9y7KvM4
1WuDi9Oz5UBjdm5g2XDUfKi+uRRO1hmJgBOVKkPYAFVcRtwsNAQC1nwqOaj4
phX8Z+kST0V9EKXEdlLu10+sHKtVBuVYlAZ5bUBaVNEL5B5hPHDTrDXmeZ2/
tml5ZllDHkrle2lsFroE0A8Rn9PTEwuuDFz1KjWgbrcfyHURc4A7REw+6tQE
d4JMEcGPMMZ9L4C/4phES1Llia96fBuk1VCqcIuqwDsi4wnqeSoxHGV5WOjd
baqeQmOwziyO34ZGGwcyakrVQ3f0YdT0qiK/vvQoPqb245tAmjsg2BgoTT0B
+i6k0PLm8V1gYxGJW1ABbnLao+DNyHnwvhgqCS7cPJdX4wERXuD7pEgea5Jx
+IB/UVeMJdMximsSdzw/tud8zUbDQ3Pyp86o6TV1JgnlFdnxpTRpZlfDEXt0
pFVxEAxom0ZSkyfx99z6R6IYuMGJ5gL7IXh0zMAlWg2D2GsgxIoO4vOJcDcN
OhNtGGsW4c2K6oDxql8AxNrs5Pn5i1M0rfjUib52U+ua6t07Clb76+V3KFzp
KOcvuCXD0dCWkBVMkSqrqkz5BW0PNPotwLUjSqRMyKCUEKGKixpJu+wkZn+n
QQZIb1dizQ13TgWEk3BUpzNzpWW3J9KmGvcqK9Y3aLk2rINPER7Uk1zl2sgJ
l6RKV/BiLrzZyUTVrfnlWXaz55wb74BS3VK6OF1YColy3AMV+7Lis8DqgjG0
lc6jzPcr7TB0EoCwW7WceiAtjaTAANpUTk9lxygzeRZJXQVm2r6H7P3LVa/1
1qNa/ZouoruhZHVCb9TKHWVhDN4mPzlbHVAMMdwBnBMYsFS2aKFMe6V1SKad
DfKsAEUwp3SPA5MSA8BlD/oWC9gXqwcSjpQbjxm4WopXlFrn1K/DohqObjD1
jzNj5J4sZfaAdtfbB0guHvhsngco5ZKLbgW6kMM9TkDEx9YXoDyF09DVZAde
Lg6d7bXNF/EQUZ/mefGaFWgfQyWX5EvCObSNwkqvbI/2PnEPwcBfPXt5MXvy
ePbkyePfP7q6nH32+PHvZp9/LmlQb96co3Lp0nfg4i+kvmJCa6R7heglgHO7
tqux9bm0HByro83Gvkq6wvhMjPn+5sYJ2iyJ/afCeGhVAzEWvWLNkUk04hdZ
JlmAGlsPWwpXPtATC34YKWDfdWguWnMAbtSJ6s0b6dbwbqKFiqR/WONbNhCp
PFIsnswJUrFmlvFtkt5hJHl7HsCBdQcA1YpIOOfEvzn2MO3chJKVMduTkFci
QxidQq4UZQ4RvkvJebgeXb6g7iCYx+eoYaWYQO2Pm7pFc4rx3VSkM9KA4NP8
YTmRaUZjkrnJT2JyZ2IeNn6W7XJnGopMQaW85+Y9KCfVwqXHnSUKX2zBTO1A
CRrcOyTAMXEzFS0GYPp4GhRmAC24l0XGoYSRLfGKrqDDxEqgsNM0cAMum79P
EtpRaQ8PaoO9qQoysiUmswuOnL5FcFXa7CAYm0M3L4cNK3K2/AdT6OA9DBrv
sF3f4IJwXxqKUmWHcC/o4LGV52C9ZJJhZAxNBb+occm/g2pNS9G4iqN5IN1x
N61JiDLNI3UhqhLSYc9OGBgtK5VvJkNe7pNy6L1mmdTIPSUAnYrJiPq/RW5F
OdWcgtcVF6mtqVICteM9mVEz4EQbg9fwrOGqCAEBeNe1xVo1s8RT4xthdLky
cRSygclU19ZbIXwqqskyHymAE2g5GB9EMUdSc5wWtl76lN6s16RISFEa39EP
WVlHk5HlhLoceKO44jfDuSQLhm8cEd1bMnqSnVV052fP2qtI+5/h+N5I4Psy
BphFnSI5AYI74WlyrfawogY9o2xHDbPzPU5FYWuKgShkanA5Rdb5xmzj9g1K
AYV9w57gyLMsG3Xw+yIrJLZsyGlF4iOyLPZ9xg3XnD2yXVJkYZIwhsp0lMRQ
70MLtsQI442j3hpLQR/c+XQTkgJ2YlgTyxZqiTAb3Ha+yIO9o09dVMyoSRQ6
z/BUfZc0gA33kZVTkXtH8tLGnwtOlFPOMnaAIpt97q3xQgOO4m+y2bhQE2Cu
P0Hx/+NEiiq4VxQ90aKz2QCDojOnLqcV9nmTxohwk/8KZJ5OkmsgUXqQFUss
WyYcWpmTuJiogV2cxkvtKht7JKcYlkOgoLGTexNNfaD6p4nwTe993o1o6Aek
ESdB6khiI7rzNIkaQLQgJu0NcJQhvca4EY2bwypWbHJJV3XRiIHN9aI04TRJ
F7AkQE02zKK/aAN2L4pNh53knItnmMjl5hglxEdMtaj3fCd6MWVJTjVn8HMJ
epbcqCEwMT52N/HNK2WGfI174EscnTKujwXNrVuxpJ0vUQdhYsAxNXQHkRMf
qSyeME2KV8BpoqA0atVHZbfgx8+47taTz0P83O9nTzCCToX/qKYAtYSLAqg5
GkLb53A/1FJJNioNkgFP6kKcHB9cDT41XOiWRB1IdQEdAEkfq+kY1XZNCihh
FRGwvEZ5IZfGhTQesNTvLTcri7OpXH6tBhOkxEmuVUhlWZM/C8kzynbO04zI
aoLo2sCdI5UoidHxndg1ZsKRUJ+p3KUbVsfAoeZNVONQ+Q79fCunZoJ+v5Hm
Y8IvdFv1AJsZ1+DOSHUNHSCmMSySMEqhLGDbxYJNxXwTClT2SUT5yXYg7m7X
2TJfs+qiAij79mGqyslb6mxBqZpT72NXlFdNdGJaRLSoa+5omohRKiPRVVz4
Fnze3TomCWCCGfwOFB9Qt3CTpCV10iGe4yIzirXDQH+RxbXFH4zewUxWvSEs
1enRDGoGUP8mYHAUNZIeKnsNSZhKkqu8IyR1uikDEClSXX4+xDGvKf6JPSYU
8z2IZYKJ+D6w+ZDOcZ6jDkWSAdrMe+3d6q27ebbab9AKzGKoK2yD/S/FQ5D4
ynACdZKtJAg7jURd1PlOvS2cpsbdl9Gdr7UKQ31E5Z9ABrDJJOAHA1GcCyTp
b7igIBIbtVRTHh/oeRWeWAhkDYGDbDvh65zHnROAYLh22xU2Smzl6+sXxUID
0j7UT1WXo8gQxrmGVny47VlcfNLJ4EhN+TBCS058OKl7oyDtWwZGTEXH1k6+
KjZTE36otzHGSlaq1zm2YCQIEnbkNXzfs7xGM4oEG7Kh2WAa0gZGA30t3pb4
6jkPa/EUhn0f8IWxHclbsjHUU8SbgRps3TovN51bFAfq6ic584PAYe/1DFHD
icU+8NhACGPKIMoPrn+QM0zXMApoB4hgTneyIFVOKd1OpEyND02ayOIcA5mL
xGFxuy8EeFSrpEytnELdOSGHyBZVXUQJXgVZ1r+I7nhFkyMBoojNuUXLoQ9e
GzjEkYwTbkwUrHHj1LgsaUwU1Gbqg/fEEOVcW1REwNmD6VFW7LKR/eywWKqK
h5amkjOMNGj1FKkQIxsb8/J7iIk2riwQTVKAiVi8igSp9FDb0ZAB7gN7pVrq
eWKFwXx7CVJ6F/V6JduTDEc/HwuK9G6VyOwTcXajT1e4XYDjdWV3WpgJVSdA
urVmpCITAAqLvjKMd0IxjCzK0gD6VAgXNViUOPFJ0nddwvU0qla6bTJCDYJr
g0wvtT4jcz1mJVCNJFO2XHRKYxUwPw7wo6ZI8g1710ksG0i6iW01WBkHBkOj
/qUOS3OBFrac7uwcGKadpgH+cDTozlQDpZgbKYCAXCwes7S6GLvp8yb1KIkS
7G2SSZgRuwCiLBSpgaABZ54mAA5gW++WTQlx8IL4XOPkK29NZJvJRoxWsTCk
UIGXJbMG1e8FOrnlp4kqZMAzUdPfYCbZNe82Z9bfse5G8l0QQ31eQUDOYbT7
qCraqmAuTbivOb+WWA65H9S6xLY+SXxDhLkpZIxeZW7rgw3ZekduboUR5/6r
1awTzuMmaEtmJI0krhDp9El2cfbd2cHtJupRtsWWTCq45qblJ8XBhQH60+mU
FDzKaC0wVgk4LDc0Nm+eMgWz5VcPFqAPWkx8ffXy2UsYQJ8EsP4fVMSYZYu4
AAA=

-->

</rfc>
