<?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.25 (Ruby 3.1.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-iab-privacy-partitioning-01" category="info" submissionType="IAB" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.16.0 -->
  <front>
    <title abbrev="Partitioning for Privacy">Partitioning as an Architecture for Privacy</title>
    <seriesInfo name="Internet-Draft" value="draft-iab-privacy-partitioning-01"/>
    <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="March" day="13"/>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <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>
    <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><xref target="RFC6973"/> discusses data minimization, especially in the context of
user identity and identity management systems.
In these systems usually an identify provider issues credentials that can be used to access a
service without revealing the user's identity by relying on the authentication assertion from
the identity provider (see <xref section="6.1.4" sectionFormat="of" target="RFC6973"/>). This describes a specific form of
privacy partitioning, similar as used for privacy pass (see Section <xref target="privacypass"/>).
Privacy partitioning as defined in this document goes further, to consider different deployment
models that can create multiple contexts where data is minimized in each context.</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">
                <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">
                <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">
                <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">
                <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">
                <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">
                <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">
                <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>
      </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">
                <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. 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, or to require auditing.</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"/>
      </reference>
      <reference anchor="RFC6973">
        <front>
          <title>Privacy Considerations for Internet Protocols</title>
          <author fullname="A. Cooper" initials="A." surname="Cooper">
            <organization/>
          </author>
          <author fullname="H. Tschofenig" initials="H." surname="Tschofenig">
            <organization/>
          </author>
          <author fullname="B. Aboba" initials="B." surname="Aboba">
            <organization/>
          </author>
          <author fullname="J. Peterson" initials="J." surname="Peterson">
            <organization/>
          </author>
          <author fullname="J. Morris" initials="J." surname="Morris">
            <organization/>
          </author>
          <author fullname="M. Hansen" initials="M." surname="Hansen">
            <organization/>
          </author>
          <author fullname="R. Smith" initials="R." surname="Smith">
            <organization/>
          </author>
          <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">
            <organization/>
          </author>
          <author fullname="L. Pardue" initials="L." surname="Pardue">
            <organization/>
          </author>
          <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="1" month="March" 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 a proxy.  This document updates RFC 9298.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-masque-connect-ip-08"/>
      </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="9" month="March" year="2023"/>
          <abstract>
            <t>   This document describes a system for forwarding encrypted HTTP
   messages.  This 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-07"/>
      </reference>
      <reference anchor="HPKE">
        <front>
          <title>Hybrid Public Key Encryption</title>
          <author fullname="R. Barnes" initials="R." surname="Barnes">
            <organization/>
          </author>
          <author fullname="K. Bhargavan" initials="K." surname="Bhargavan">
            <organization/>
          </author>
          <author fullname="B. Lipp" initials="B." surname="Lipp">
            <organization/>
          </author>
          <author fullname="C. Wood" initials="C." surname="Wood">
            <organization/>
          </author>
          <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">
            <organization/>
          </author>
          <author fullname="P. McManus" initials="P." surname="McManus">
            <organization/>
          </author>
          <author fullname="T. Pauly" initials="T." surname="Pauly">
            <organization/>
          </author>
          <author fullname="T. Verma" initials="T." surname="Verma">
            <organization/>
          </author>
          <author fullname="C.A. Wood" initials="C.A." surname="Wood">
            <organization/>
          </author>
          <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="6" month="March" year="2023"/>
          <abstract>
            <t>   This document specifies the Privacy Pass architecture and
   requirements for its constituent protocols used for constructing
   privacy-preserving authentication mechanisms.  It provides
   recommendations on how the architecture should be deployed to ensure
   the privacy of clients and the security of all participating
   entities.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-privacypass-architecture-11"/>
      </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">
            <organization/>
          </author>
          <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson">
            <organization/>
          </author>
          <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">
            <organization/>
          </author>
          <author fullname="P. McManus" initials="P." surname="McManus">
            <organization/>
          </author>
          <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="3" month="October" year="2022"/>
          <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-15"/>
      </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"/>
      </reference>
      <reference anchor="HTTP2">
        <front>
          <title>HTTP/2</title>
          <author fullname="M. Thomson" initials="M." role="editor" surname="Thomson">
            <organization/>
          </author>
          <author fullname="C. Benfield" initials="C." role="editor" surname="Benfield">
            <organization/>
          </author>
          <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>
    <section numbered="false" anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>TODO acknowledge.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+1923Ybx5Xoe31FL/khZARAku3clHESmpJHXIksjikna17O
WgWgAPSo0Y10NUjDlPJl83Z+7OxrXRoNijSpc+KcwcqKRaC7Lrt27ftlPB6b
ruwq97x4dG5b+GfZ1GW9LKwvbF2ctLNV2blZt21dsWja4rwtL+1s98jY6bR1
l/23skdmtnPLpt09L8p60Rjftc6unxdnJ18bM29mtV3DrPPWLrpxaafjDb83
3iQDjp8+MzDJF+ad21017RzerjvX1q4bv8AXjbHbbtW0z00xNgV8Ftuq4oFf
l+1/2eLP//u/V5W7Kus5/dy0S1uXP1oc/nnxsi1n3jd18Z3zzsJW6Rm3tmX1
vFjj+5N3Wyfv/8nJ05NZs96f7m2zXu+Kc7utdgMznWw2lUtH7zb45J8sfj88
4OmqLX3XbFauLU4mxd+aZmgLp1WznS8q22ajz+zVn1bObgCC07LzE4CXMXXT
ruGtS/fcGDyQ8FdRnLrab/13btbUcErbGY1NAwpuvF05eaj4GlDBbn/hi4ty
va3giOdF/uL4ZOo6/npczl3dlYtyRsstTrrOzt4V8K8OBvz86bOnMirPZdul
654Xq67b+OdPnlxdXU1m9PNk2Vw+mdvOPrEzO3fr3ZMrNy1r2/onnz/9/NmT
eelnVeNhZWN72ZRzW8/c2MOBOf/E6zLHbb5My8uEr3vLHFta5hj+Bcsc4zLH
so5Vt66MMePxuLBTGMrOALBvV6UvAKG3axilmDs/a8up87RHQOp6VsIhF82i
EAwvUgwfFVercrYqvKvgmsF5VLvCbwDEcxgTdgy3cF4Agqy3tULRztrGewPb
6mhkGg7mwytbrJ2tYeqmKNebtrl0ugqaeApjO3gcxoHLugUIFbz1blcs2mbN
X+G0k4O7cmvXLvH1DYAJrqKH2w0TNF0zayqaOWwPtma7uIu16yz9UXoDtMPZ
CpCkW7XNdrkKI8BoMKqlI/Ij/PoSlugJBIg3rl2XdVM1y92IBsWj33oPT6ya
KwOz29pWux9d4bcA1XUzd5Wf8Imty/kcbqH5DIlI28wZD4w5D4undwCMb/9y
QYOfnXs30zUAcOEvJIRHSHQQbDNCf3zS1bN2t4G/jovZyta1qwyg15VzsOSr
Bn6ebxrYmS/gSFo58vglIFLtF3gaei+BzBQveUw6cpgimRSXDfjEwKz59bID
uBa1mznvbbujg4CNAVKlo/IxTx0eoMfVAcEGIAHuw0amO8Ul03RIdzrYCiEQ
Hko9h0fCMdGDgNkW1j8pThh2I3gYFvEOyCXiO4ELcStbGPIIvE0trgFm6Ey6
PgVFC5MRrGB67xSovmiRxNWM0Z2Dk33VXAEutaN4PPJsMXwAJSKs3y7gtpeI
2bgcvR+wZtxteNjAX2u4mZcO9nhWw+QzfGUHzIJwk99q3d+3JazL4fArC3fO
/QBwQXBN3a6p5zRo7RDb46H0Dm8YXSbFRbPG8ewabrrnBcIOaAKP8ALyUm3n
SNPHxQnfXztDUBMTB5C0l+XMIcm1BRBNmMnBRViuuqJuugIJIu4I1sU3Epda
tkXVMJaNzHQL+LOgcwqDwQLsFAgPvNVM8UumMrMKAQqc4ey8sPN5C4sYFYCW
M0CiCkBWFx42A+uvlyA+NDAwvoVLhnd0xklBhAf+B4CCSRAtZtkhwc5mPKGu
hyYo63cmkC9c2tDgCZQYCFeWdz91YUsMPgRNp/jB9xUG3BXAaQuWOcof3Xxk
lGRYOOAr+A/eisoBVS/hGdgiHjshesOoIdR+42bIb/R5YhY7g2RfuGNJ59hs
YQV8W5F7tYBTPwFARgGk+AF8Bq9lDiSZTmDEhwl0nyBMx49bIQK/3VSNJXqO
IhHBDNBruWzdki+xHkwfxkZhjMAFdrIFZEyPy+9859YBdgAwphEIjQCy8C5y
CAaOAVaEX/ENw0t7HzSSvZt8Il1iWAY9NEH274Q72YqIXS00K9za0jMA+RUf
AKKsjjaMlBhOIt5Zo2CAy954xqGmWCO+4YmNw0oa5eKLHT6VUdMmu7lExJhy
g0zUAvZGaUAxIY4bRIM9/pE/Jzw9J/FG4IwHsQU6gLjbpvSPUFEeIjKBx7Xe
NG0n0Hnn3Cau4ehq1Rwzx4fpzBGKFscqzbjJvhS2KGsA/aNBmesRU6JyjVJT
5ZH4CctBXGbJ7dEcLhxgOok6KsU9MtfXf3zx8vTN9+d/Ofv237968eZs8uzp
5NmzL3/15Itf/fqL3/z61xP475fPnn3+4cNIh1q6Gs4ZaKubrery71sCNM2l
66fHaGOZoHRZ+lJuzKVtywbEbxX2AMtAqged6F0uHTLlofFsuUaGwYIg3pIU
5JMiU9yQpBNug3i8JjAje7AwXW1nzgLi0AGBoLBA3KEDWm5h7YDCtHpQQBAF
Gr5ByswOIBSOv49DkyLyctCLShY3Nq6tdiMzdI7FylUbz8KE0Kh0iwC+prJK
JgBKALZ1g0/SOcxsBbJ22BHJjqDtwgJE8AD0ALy6wBXB4Z29fPtNgfDGiZcg
tG48MQP9qkmlYLiSTMvk5ts5QkhpSEAnc1ApYLaO4755dXI2Kl6fXPzH9y9H
qlzD4SFzRTien78WYheQ32/Xa4v8yRtCEKJIDdAWXTbeoiDQW7jToHHSk0gg
gQl5sQEEJg28HLUNvgq83MaTUQDFUAAh7A4oZiJlITSQ0cwQhnBpvvvm9Ne/
+80XHz4kEjvhOIjz5Vr02VHhCCPoZJiOMh/+oYOJTK6w4C7CH2vA06Xj3TPg
J+ZMCbEexdZvaWSg80owVbiHcb3fop4BVAB/spUSbXh6Gm+sSAfWKNdQKs3y
U0pJgaeG9U1RTKx2gih0OzNxHkgFvBEorCGhW18OazwCkb24vr5wpLkUv548
m3yJJxCAe6yokJxuuGNIxBGMwxgHenIJPAFpFu015ZUbWB1PrlNfX8tv+BPO
a86HLqj1QonnfJwpli4bWN5i2yLxGIlQ4GmbAaHgZRA1dvi4YVUungkcFBLO
oAULngB3paumTEnQixfg4ILrgxNUBON1ios25pum5Xu6bQHNWezO2VW+kwX8
gx7bI3ipOocHY1giEqEdEHF3mHXjRmGWMBgiH40/CnoqS0Zk9DEicSPpSeXv
RgTiXODuDzFHUMIupyUcB0oJtI4KCS8xsAYI4AFaRdJNkxFhAjM+Q5fYqliX
KEO4hkS5AsjBtVxZr9cLNYsaRtttnAJ/GKrC95l9lShuMe+QWyUKXWaFAVXE
d7SVsnJLFNURYRA7gNDvwrpNWPfA4nBQwixklmuS0pHTJseHwjJTjMW2WpSV
aFZmsa1njA/DF2Z+iboK3gxCwojBPCzQkUx3jjxnZJKNC29Qwkc7EAXvICyD
6cb5KO/Lno3sOZME+ZaUbWId4AsDp3IOyEbnsRsNYw0IJz6TgH4JAt4vSS7D
k4d9k6T5S5Tzfsmq17wh+RX+DYqS74Iy7JkmwUG6QPjQGjQ88R49Z5ZPIyGe
I12IhOFUqIoxLwmpSze7GSNBWi89UqESFV3aj1IcwTTAVPnCkCLNZkQURYRS
kjbpHW1w33hm5QoRbwhn5VekmCaHZbuc/JzVqQwOW65R/QehtwpX5fCmxOSo
NHYUQeqDYSOlAEjYUGWpZJ0gv/csSqJflh1QgMWxmSMzQJEz2JU6xDaR1/Al
xAqVBRiOfYQEaIrAfFjkoHdEy+CTVNuva0lqAfa/nRGeJLChE7myO5OK04pe
z2Gy53/fglbzwfwBECa+VnqRYNZorFYoB0keccn36Qa9LKiJ1p05kKk5iC0w
NN03AG4z7WwpDGIG5w7Y49BXAGcGgKllPjefTCb95aCV3BEt0Flg3Nz6PSmC
jyURaPHWLOysBA0XTyYFDpAk4BTNFTMwXa//BYwslgbCUrKxIKq/E5OpLjOV
tv8AL517t5039W4tlkP0G9VLFJbgWdpghVQY9AKPKjdfEbnVqHwEI0Cx0ZF+
T+/B2KTBg7Abf8IZiBbQoM0CKBlbWwnji4W7gsUp3v+efqI1wE7dBqleDVcX
Rp6hgF3HcVk5IPRdoIGQnouSVe2uCjFyF0dr+07kxvWIyR7iO1vWUIoEbRpg
SU4J+hu3vmFvwajY1rhpNKyAEGaEXgUzPx/7AjjUnP5CLbQ5QJFha0PYPzEn
5AsUc8Yoymnw5bYOlu/i1du35zCxJ7skHerb0/PIXlNhXgQg0MsaVlaNmtuE
Y5NVlAGEt+/KAQMll+QuUkKCVHgY77QY7UEvtLA+OS4cPbVWB+krkqFRAYoR
4DzKS0SmVLVml8G0+cGhKROvxdrNS4uOJeGwdEYA+H/84x+Ftf5yaR6P7/95
bN4r6ylOip/6eQ+jFGE5j/s/pwt9fOCnxzLK+94veNb7b/a2Hn56H0Y5ZbL/
vuh93hevFdT9H9+D0oFATkbJpwMsG9jFx9bSh8sCSNjd4XLvz/sHwhfAP2BD
xWeAnUtQ58cBc9mF+9WjF/wDXjBbTK0HbpFeXr4I464ZM0rjVa1F2SOLUnIV
Hn0w5mRO1gn0lLnopxLCm1GCVDbPCE40h7EIA9Jr5/m6gnxCPDLSCxz5KhEX
lSQ/j3RlmHqQVeqKRWARD1Sa1csPmxizY5FNoYcvOjKSsmLSEd2ZdU6BTKRA
6q4S8te05bJEGqw6KMuzyORmrka5IDoOkNSJdpxr6mZf+usJTURUgz6MrJEY
dDAy7j/D3FmJPogOP0uCdsPnMEG7yyVOX8oJ2hCM8BZcDMHiIEG711oeBi73
/jwUQYv48vU91vLwDHCAdQ3/u7gNvgTe9ThhgHus62P4EnjXXdbyMHC59+dT
MUCKIhpgfmgYsMy8EsYVmc8ezyFuV7NcCDogWSrZ9miTUBe2grHJg/x4KacS
RuonBZoWgyAN2hfNm3M2Yp6kMqAdgYRc1H0tLwHjHER3njXbas52azHSyztN
bcJogGDpCkZsnKNwgGhmFXGXOR2G7IRfyEfGcjRFVpnomGimzKNTBboq38kG
Zk3zjoKSWI9K1/fzZC4/kViALJAu6f89sSBacRK/OLnVWv7FiMU/L3MBfEmX
9E+CL1/HL76+1Vr+xfClz1zQwiVUdYDFiD1niAOQ35zCATq3r8wgq/ne3/Su
cJ69N0nKJ+sNahmFq0rSZhwpC3ZaUmQKhuSpdTdY+pso9sfIIKHaOnr0zJvE
ZVWiCYgVlcruXBtcVhKrKYNEZpItduoMWcPUtjq8kknxNXuNok8LNbI1Tsos
eQGPNq03uV1/6djcnPDqBcDVtegK6lgJjsEHHOR0JD4x8/rkNJ1MfuZYhI40
Qt8suis08MUviUdOHcYsNRrBIF4ojzZT4Lzd7Ji9C0p8LoKVzpjUPs+eAOa6
Es6KYksWA7KnRfuCeTie+JQMfqi94lav+FwMB5KFtwFQarsHwAFnttOq9Ks0
xIzYdsN+s9meaXEvnKi8v4+hOOhjMPf0MRSHfAw6o2G3AmnG4nunc4Xvol9h
wMAqmCeeJHI0R5wHzIatLFKxL9i7R7pnNTfCilbw9NQCEhsY+cjVx7NmTv55
wJ4JxeFrnkTT4u6SmNzo9h/ytnMMEsVVXDbVpTNkm4arCmv6oRcLMBVXcYJb
WVx3Ho8errXv0M/p1uizJzsOmdrjIM+NeZaHNaNZoofPEdOCE80WyxJwKQPT
BIe6gVaq3AlgpmicjYUrzGaQg9PhKcVglvQGJwYlzyF/PoOOHTDzM2b9l/h7
afChK5RqBEY1EjLHsyDtfsB45qUGU+q1svs2ag31o6gPwf1INg1pEvBrGqIS
Ykw11oTPHlQSvCz1L+J8+EbfTsY2MR6Y3RX47d79IV+PEAFxcyQR4zJBz+lg
JKjapwkLkTRo9MIUYc2+uOaHncTZwmMz9HQPAYFAdEWKExGLqxIOUtkG5zxF
7sbE+mQDg8Pl5kuQR4r8jayBgFYh0iDFrVtdTOZPZp+j88ZclgTwpMkMsxGP
gl7nOFLBbNmyamXxjBscxuVzCuVd59NrMCkuKDSWeezCcAxV3Avieu2uNGZz
5zSAmvIJkE/RUsLMV0gUAreH+WYWYRb1QnU3jsS7RqEHV5K7wa9T0okTM6pZ
bDH0jO8her3bJAxIxAHeb4Xx1BQ3MwcC0noJz7XpiZoDgXccUc+GgkF/GbIj
9PWnJ124WaNBF5sKSI43WXYA3wVMQrKcDcIAC2duiSRLkhIy4tM333778vTt
2He7Cu3iguWUxCBBF7AOogNkpecrqVGHMNq2tiSoJNE74RrJ2nBAYga53VuC
dSn1BRbUREqLqBeCP4EevgG5gW0BSLFGGuHG3BiI1xwjYf12Tbc5Wd+sQeEJ
kZ7WrlERKVazA2/rRbZlhGkoIrMq6u16CjPA1lwlABZDu2+qbQj4/9uKhUF0
uzZ5NkwgriG2fQXIAWg8LedwaDN2mXIwoq1NyE26RETzKxxi7pgkcgZSX8YN
zGkuqRxoGppZlCsNGUs0iB6Qp3KRU5yfvx7REM1stm0ZPlnwjTjcya1BEYMa
XE4xNQRkhh557pUJIamVIAF5nG5zU1QNCsdKW9ABkEaakg8neIBZesZNZBGS
riQopzBiiI8Mu8ol+BGzSZp3IMnpizO8inPxPyOV6KF9JO7oXMmRTTz2csny
Y+MI0WQ5mdhCqIHy1NwtW0exuZybEU4wEY5TmZk3wyGu8LVpUmHzF4ihSNGV
fOEaKgA7c4h26xEBoyQ/nE6VyQTweP+ChcMjeQZ55o4OnrNsslyDGBbECUFR
XE8FnCiRLwFXQWYF0X4Rxpg3dHF49TKbRJkTIQpoOeJArRldFaCCdi4pDUSe
x6tmM3SyCauQUIG6Ucmeo/FoXySfE4r1cjD2NxnTa+IWc6UGNCxLYey0Jzor
s0iituluvkVFjpWCwF9gDzyfBpDNW0SteXNVS6hhM030baG5JglFn28lBaaq
thwq0YZ4HA7y8BSbelJcbOEe0zAxRZGlglwKQSxeNBqDI+FwSdATUJCWBVM4
6WWDD8W4cEeR7UZ1d4TY7hDPE+2VjxAXFa6lBKgX15+trQfB44MxdD0BpsB+
SEf5gTRnIj57ok0TwkNUtAnpcFGPC8EcOG9IDR1mznmmq01HJrt+OE/vlsQ5
JiDLUexUZm7hlGSMK7N6uj+QaqOBq4gJwYnOrll+Bu4A3hnP2RGY0Ye+dcf8
H33VE6ZfKK2tMNG7lYQEv92gI5njhALsEM6EoGjTI+TkdPq4ND0VzLBrgIS+
Ro7OCYvVjq0Cr2XTP8DgJ/FmmIstBSF2kvjwH9+fnaZa2hGf7XGe/UArnyNl
AyY+N1kGsMSSVzsBxvcvzovr6z/q3Yc/v/rum9Pfff6733z4oDE7G4xuAiU8
ee7s/Kuz8YtJ6brFmNFqLOczLjfwJunJhDtbTPhkBD2jiGOiHmOeHQRcWC7l
qHAwAj9+C2wT8gRcB7lfdoT6pt4bHrOinM9hzCVUEipESxoZgKBfIeWQm7go
l2jemAJMrzL7R65wIwaTeGrF4ovrOme0i6GmystA0vS9MKkQurC/VqPxpbxe
lcCC9ybmsNBNaIoGxaXsgskTPMDv++t8S18LQZj3FyzkOYF1mh/IQyrMDaVu
JTlSYV1RQbQUoSKhKIfWkkTB3AC+/StsQqpVMkm+1rgS8YrRi7wQtO4xEU3W
0luBXHl6GG9RoAVhaail8d2RoJPBLALQf/Gq5MneEV7GTZYTJhJnPBlM+gQn
lECWT+Oz6x/Ey3AQamb7qH3/ZxQQcigeBJYg+79FQIhGOt1iLf96ASF9fDkX
InJLbPmnDwiR/YT5maYPxDLeiC9IjDQi5P/jgJD3e8zx1miSrOWnwmVvlJ+E
LwOjJPjyVhl6H18+Pko2XQx9vdNaHgYu9/48HL70efFPxJfDn4e5R3e50zeP
ktCXFJf26Msd1hJx6Q5r+VnSl35MwDM0b+wHAzS1I8PHJpXPydMvrn4M/joi
yax1x6oox8JHVKWqHVbHe/5XMcpcNUHdNpyKKWqQmE+FgqgSwC4fMvCgJMtS
e/Lv/Hd+2ejLvycbH5v+/kdGHJ4/+cf/yIjDn5+RjDgAh8e9v++GL+8P/PdG
fEklRZmSiXlc0y3wJZUUw29f37SWh4HLvT+fTkb8+s5c/xBc+lAY+qY3ysAZ
7Z3EwDd7o+zhSx874jc3jDI488neN18XN6zlYeBy78+nw5eTT4gvHx3lVvhy
i1EO4sudRhlcS44vHx3lYeBy788D6xTFyT0IzKEdPcw9+gn0ZXCUO9OXA2u5
I30Z+Py86YsgyT200Nvv6GH49Efll1uO8hH55dZruVF+udXn5yO/9HXQz4d1
UFAJD+ig3/R8jFlhoCyATRx96KrSYmRU9IjC/RJX7hE6JEGwpGJ9SSyPhJgF
7yo9xwsin7oGL3JIS0cVUwHr4bfjtE7LYbd0LzAEnRgvvr0w/YCR6+s/vsF/
RNdis7Il/F/XbbBmX7ZTXEbv/dRxehYCpnjrWKut5yYdoeuFSjaM11gdcelM
ni+dBXlS9AjVQ7YcaCEBCRNh0eg5pDAZyfQKT6cxIt/hiyMjLiz2Q1NlUVmA
6od+JFVG4qv/ztEfwf9lMb6JVispzzSAR4uAkZGja9IVHHwDxxccY+IAbdpQ
KXaWWx840iJGaPajyRAMJdfWerWbtuW8ON/CA7Piz26XOqnhWF+d//kl+ZWf
/fbphw8UvuZaKnoWIT7Zw4dBJOaM70Oo+1F0fJu7CwPYsmiBzPl6Gh3FcgbF
ES6doxei0Kk/yh0+HgV/bRb83CaBZxzwkA5CCBKCkdkPSd8NzKCVH8nXGupz
Yiw+HL4EgOH0Q++rQ1gD5DWoJ/404oi0chHHoLgCjD2NIbGC++I771vGbK3F
Yqa7IpZSSUq8bACxOFRenJ48UdcYDNDDykmh3gsFvep8/1fsWXc2Mt9dD9en
7mef0H/dyZ6VrEAR47H8fXt71h3W8jBwuffnU+ibCr9Pb58Ygt7d7RNDJ3lY
3+QrmX6j+z04ykOs5WHgcu/Pp8AXhujD+Tz/uewTvLv72yfuuJZ/MftEX38g
KXhAgejJTKkGEX8CaZsDCMmJQYL2izevONLvC5TIuKqzT6qwhbqcwPP7Qc7o
dZL8ACppgMMHSQqVBEoiQh0C2z74pg2FOTHyUfLdqPJrf+SyS6RKXYxB8bEg
2ayBbW9WmCTbliBYlJcuiaVHQYZzMoOGQHvBoOmsdCQFzl9/ltbJNUNR9Tbt
sQRAO//u7K8np/95fnJxEXWUZJRx+oLET0q1yKCvSarnni6TTZ+Hc3LGCAWU
J6kEIjrhyOjLXBRwvrGfD1ZJrUUAQ/BSXe9Qj05TJEYco0ox/5TCiIkDnAGg
BZFQZaCqvc6Xy1ADU7KCqY8NByiHlK4VqDMe0xhRdj09OX97+uqEUUbPSCqI
Y4QiZ4XuNkklX8z047Re7GKDCbokqK7c7J03UnCO3Kt5wW2FTF65H2FAo5A0
KiU5Wi2QmpURxp9YpicIsPge4M2FBXtDM4wkqYM7dcydc2tAu3LOw3DYa77U
Q7V6Q5oq59z08J1q85MuqyGpXDS6gCuE6jycjiVEzWudc7zv8Uf0Js35umpi
+S5ji0e4ofUmzSV9FJSjEOKvgKBC1EkSkcalcvrIzGE0PmPXsdQzqc0jBDsV
/Dw0/ijDgyyBhgYrwgjyG+fiZuAzCfg4Udnv1WEtQuOjuRbxdUV/dVT1Mqhv
lF6ZDGGGhtgH4SfRXr6L09xdsIj87wYuejs2+jGOfjuWLqO84QuWSheHyhR+
4rU8DFzu/Xk4afRMMfsnYsvHrfwKl2TF/W9u0Or6Z/R+76fbWJD7AupjbHTH
7CB8c8Y84cZRHmItDwOXu30+lTSaCD0DMmnI0ytz1odCaSqGoQTDmemvnUWq
TO0EyEZ38zPF0fn5637WC5Y3WQFLddItRkSsND86Fl5noQW7lGAKMlXvTrok
US53yPoU/k6RYJKnMypAshpTotg85tv7Y6ragL2TdDRnLm1FFUCkeCQlzClv
oN8oaRMTuuskVTGWa8a+gbrvSfGi9NKeaV6cxBWHTnnF0YuT82NN1kApGbv+
KKBKKprPJj0CGrCiE5TdVuVyxcmQowIGYNOr7dfHvrVI4t2sdVz6nESqdVMv
fWcOwAzTtbXESS6CoGzxSHpa3SB/zPPTMP2GVyiRaALj0G8gA2KmimQzhuIk
oUMIB9mtssYrVFw/lABPzggYPppiRUQBGUowKW4gLEWRDBCL8ygj2hT5iFwc
QJr/JG3aEjTRtmDUIvLOAsbgU8gnvmfo38glsGYX7zF57KNkUAndMN16P/TW
H/DbV3Bp4ToyrT30ckZs399x5vDD43Gfu/+vuOeB4Fh++aCIkvGRALSm5R8+
MvPl/syP85nvtueUid0A7b9w5hI89G/93R54ORvjo9C+F3oqW9rYcddsqPfo
R9gREDfiQuQspBTZrNGMpO2e3JRqK665UGFCasZrS5I2po6HSildngbcuY1U
3DnTZkeUl6Z6cKqVUDIzJZ2jpjrP2rYkc42on4WhklLqH0x6aYSmSjYo2bGi
V1DEQ50RXFrMZA6Jftqxh1Ybm6tQ4ai0WU4yOlobsi6iVK5hJ2WDVKuipjJU
y4Hrv0tZrF5rUupIGrLwOAuUS+AoowltOfKCVUxxkYcLpZcKJcW6waT/9QaU
+sW2Gj6ArLySpR6zx/tbTlPtQ+fJvCtWaAZItXeOYrlOrfSD3aV7XYIcssdY
ycFIFwXc+9H0mNjeTUtJZ9HQY8YAo6XuaELO0Heol2fowyUcvMM2qCW1yEya
WLCZItsjWzv2W79wvntoTyDp9tTHKrtYbIAaOAW2332PWz1LtnqW6N7m+9Bi
FFfPpcXkDmQAwkoyYZswX4n4Q3WHqA2G43T/vYJDWX3YxLTavKLj6NlhI8ok
vvZ4rkU0LgUzidT/xtKz/YpDI86R3msxVDdaYC3p4KQ1aGOnCnKiT4jfcF2D
3v0wXK+WroiXhjv7Zce4Wrknq98aPcwfxT5sSNr7vQdHOAnNjpdUiLQ3H1ao
wJR3Tn+l5PfEd332govtrJyUUBhaj+FmolwQSXEetgrwb9bwztH19R9xYLKF
P336dBT6qP1q8oy6toXOh+Wih/pS9zdSMVIp5N5ni0iBkkbx7OHFwZ3yhZxJ
nZqDIMeuiPhMr/lOWddC6GVGGsMu2b4WacTcdbasvPSm5Mo9Kv0ndQTg1IDg
zql6EelUUnORibJWP+v3DU6W1ONOoa6SuZGuxkR0Ck+ijl+xW2ivUWhSU5LQ
7kVa6Ib4V1JELiqGaQ0oCqNqMfJgR0k2SSdiZTz5LEbbXyelnMQVwiL8qPdC
f3t71HUQpUMv5ZEUmtYLmTVZ/giafIa91olLzygICP/AI4dh8hImg83Qeqb8
UkeqmM2FsdAVdKpceC2xKwBcLnF4M/FYUYiTBwFqTs3y/B5i17FhFw0+FQ/T
HsRoLC3LxQU4GrrTVOSbTuLGtZDvbL+fId51rkI0B+Wdaw7M+B54rh4XCnhl
xacAPtjKk+WopFRW1jkiqXFEpXD4L47rQkUXZJhvkTDBGBVRjrQoBUxCtg1u
idVrAt5vFEp4p0eJ6wdZqEJebl6igUIKtcAV+TvomQKdbrD1KBdv3ReE2UMk
PsZBmVpKN4WSTaH9BXUtRFGbLf6pq+jgcfX7SRYXSHOdbIZIokHwoMy36PVo
xqqgUUAIbfraxIxERxgBW7Z9iPbKRKnYg27YMaLSOLhhxQv72y9/+yVGOPKk
MDJXVEvDsqS7Wlb7Qls0RT5iBuQLkC5auIZv6r0GjIMnkVQifAPCzd6iUgPN
yKDRqh9S2BNzYsG5/oO8MqZFw1IdV1zL6NF3wAWXdfkj4V2DIm2JBcVwZyJX
7u1MNybaWHrcGbKVpG4xD07dOpnulSkg/KQ2uMnr1+2/Mym+xye6LXJjLP2j
FeqWpPGYnuyk2lBSZzVxQ1lkDh32ysTOYda/45xT9dvv7ULRxmGngIRwRtl3
UXYsk0uvyFgJNOq3vasQ3dgyDHa2Bgk2qwZcVR+FDJviPDFumCv4Za2PKlvx
glzQBC0tcWZinELoOeY7OHRpQI0xAmROkx7CUnwRS4uWC2HvYg8dIFtlbedI
YUm8NLiOxU7Fh6w+8iVITSQaJDWLJ8Vf3JLa2aci7cpi8T0cqeQCSYPjmGQc
5WxZg2+pjZj2ci56veAoXjIYKSxg/NhOt7HnspT+wzUQZwXOombenv1TJdYB
aZX6sAePdbRAjpISlWwB73U1T+9cl7WCptk0eHWXVEDUgl395YV7DVhqtLxk
6AWbbBwLwIFMSyXc/oLhI54LuO03Gi6uP6vogSwuZKBHauDk/SbEHPvtucD4
nFtdpV3bTVIvOi1VHg8F5ALXoj4pdVMTOT1MgGPSQkk4oMJT36olfEjRo3Yh
UlxRO/geuJq9hsx/c4UD1Gy4Fpn8TNWwmH7/NWnovoua5oD4mHeFDykF2vGr
nDgpdyTHG4R+OOINclKKX2n6rbeQKVODeyQ3N3XSlfrzGFeTlPqbAOCES8m8
0bQOd/9djdWwsYoo1nLUabRW84Gq6Z4wV3S9ndZqFOmNrwyXBsZpzV5hfy2K
eLXaRf9G7Nu2wDrypKAFQ6O0vB4uSYCB4Q1WFkbXAn6B0o8+SFXQ6znpGn6v
eAGXKNMSk3SIq3ITlfTWE11jATiWL9ZGBha+mHXaaUZlRja7KTmVruyyHnRL
Hehs+YYDxdLWlb38ioIPK4nd73tyTPIbUyvl5Xv5FvuDcXW2vboLiQ3sbDG4
rDSDQJAgVuVkpOqv18Yqa4y2VGiQkCYPrqGbkXfXwzqL3PMoFgAP2SnaGK/E
u81pBISboRylcl3qiqEFhYXvUnH1ma0ioxRnlWAESIgm6DJcxVbRnkpjBItK
F4pEEwcSZs3UOylfK6qJ4QAr7KNBmFT6d2zd12vBBYJZGQh8kYjieQNi705r
PFNXZ3SZWSwvy9WJ1akY1i21+OdaTDbawtC1XHqKxzNVs1yKxbtngyaVlVbM
9W8tbJ4tEeNQM7TIKlCjgd2+c3n5UTp9HZo0ySAHTGIVbPohobC6UbEdysBl
p/wKtYpdT6JIyBKcHrGXpBMJKPekBEcL9hDdPwPKjmMSFudiOyNZilbSSiNX
9URI7XWX/mi3eSxk7DfABwu3QAmbxm9iIfk96SinJ7H7bz8qcFWSR1l6cB5S
OPFNIAotkAoMBKSa110bU8R48/hu69LLtaACs+QuRpGPBa2998VERnDh5pC8
mgCI+AJjngpsqQ6TOq7Di7piLAmMwUCjtKPvoT3bNZur9g2Zv/BGjX65G2NS
vLykdCpCqzfShJSN3AcsoYk8z+EXoOcYSb0bpd9zawvxn3MBf811C0Pw6Jhh
RhweBnGXQNEUHcTbkOBuHpopehjW5MCbldS54VW/Aog1xdHL01fHqNSH0OCu
8mPn6/LDBwom/ev5t8jWdZTTV1xy/GBQRcx6oxiJVTnP1Q7aHuiSW4BrS+HU
cmFHBvlTgio+aZTqiyNU4fUaH0fuk9+uzI4Y75yypqN4VMcTc6FlZUfShhX3
KivWN2i5Lq6DTxEe1JNcWW1UgktScT/6zxZJT+qYlCd9noubfbbcWALUuYbS
IenCUjCO5x5/2HcQnwWuEM1wjXTW47DOUjtoHEUgXK0aDq2Vlh2SQIva/PGx
7Bi5deAmVDV7ou0pyNK8XHVaTzipRa3h0LobSsYk9EZ90FOUce9t8tCyvouR
9IY73HKALpaCFf2Haa+Uxi+0cjeo4qCCWApn3jNmMAB88ahrsEDzbPVIAmGs
CZiBq6XQW6nlS/XoHSqA6IBRzyxHv3PPgXnxiHbXuUdILh6FaPVHKF+Rc2gF
UrjHPY5AuMTS7iC2x9PQ1RR7/hUO7u20jQ3xEBHcp3b2jlW3EL0jl+T3hHNo
lYOVXrgOLU3imICBv3rx5mzy7Onk2bOnv3tycT75/OnT306++ELC/K+vT1Gt
8fk7cPEXUj8sozVSnV0kYsC5q6atsLWvtNQaqhPLZqZSuh6ESOPp7ubC4NoM
hD13wnhoVT1rE/pj6gOTaDIzskyyPdSu6rfMlO1IQruRAs1ti4YKUkyyTivX
11KN/MNIC3FIf5w6lCQnUnmgGDIpslKRYVLwbZLeOCRuBh7AIV17ANWKHzjn
KLw59DDt3MSSbCnb68q12sY9xkWQEV+ZQ4LvUlIZrkdrF1T9HvNUPDVkE+Mb
qN5Vg4q8Cd0CpPNHj+DT/HE5iVGgFEsON7HIjL1MzOPGT4or601NMRGoDnbc
nALlpEq49LCZXuGLLUap3R1Bg2vjRzhmDo5Zg6F/IZIDhRlAC67VXnAQW2LF
uqAr6DFxCCjsOA8ZgMsW7pMEFZRao57avG7KGZl3MmPNGWma/hZhPXkx72jm
jN1qPBZkt2xzjka43nuYsNBiO6reBeG+CxQfya7ITtAhYCvPgdoaCmMYk0FT
wS9q1gjvoEWkoThQxVEbSXfeJT3EN9pEXUiy4FvsSQcDo05fhmYJ5F89mvf9
piyTGrmnBKBjMVZQf6PEoSWnCqBCRVTAQ237lBKoBenZhJpdYtYPJ5YxK8az
hqsiBATgXVUOazFMMh9BKPTeWmXiKGQDkykvXdB/Q6qVKYrgo8YJtNxBcN9P
kdQcpoVNkD6l9+AlKRJSdCF0rEJW1tJkpLNTFe9gjlX8ZjjPSXcOhdGTe0vm
NrLwiZb54kVzkSjKExw/6NOh71iEWdIJDU6yanbc6UmTx7RHCzWgGGQ7ahKc
7nAqCphSDEQhU8OaKaYrNB4K9tt+IILFnjmwJzjyoigGXcuhiACJLRtyl5D4
iCyLvW5pQyHvDmyXFFmYJI6hMh21nKl2scVQusholgt2QAo34M5+mxiOfiUm
HbGpoJYIs8Ft54vc2zt6c0XFTJqgoNsGTzV0AQLYcJ9EORW5dyQvbcK54ESW
cvKww8mce0arHVhowEH8zTabFiIBzA0nKJ5nnEhRBfeKoifaPjYbYFB05tTF
r8Q+RtL4C27yX4HM00lyjQ/KMnFiA2TLBLaaLrKIjKRBU5qmRu3YancgZw6W
Q6CgsbN7k0y9p/rniZ51F7yttWjoe6QRJ0HqSGIjNfWWJEEA0YKYdLBVUQbg
GiMWNGILq7SwySVf1VkttijfidKE02RdbrLQKNkwi/6iDbidKDYtdkryPp1h
JJebo2MQHzHIv9rxnegokHNeSM4gZ6hyiWWW3KjhJTE+dnTwzZvLDHaNe+BL
nJwyro8Fza1fsaRtl6iDMDHgaA66g8iJD1TOzZgmecpxmiQcilpRUVkZ+PFz
rivz7IsYufW7yTOM3VLhP8mZpZZHSegu++G1PQT3+5sryUalQTI8SV1Ikz+j
kTukPgrdEn+3ZM/qAEj6WE3HeKpLUkAJq4iA2QrlBSuNuWg8YKnfOW7Gk+Zp
enupBhOkxFkWZ0yiWJMnBckzynY+0IzEaoLoWsOdI5Uoiw4JnYbVW+9JqC9U
7tINq0l6X/MmqrGvfMd+laVXM0G320hzHeEXuq2qh82Ma3BnJHtcB0hpDIsk
jFIoC7hmsWADNN+EGSr7JKL86FoQd7frYmnXrLqoAMpeZZiq9PKWmvlRqubU
0tQJElQTnZgWkSzqkjv2ZWKUykh0FRehxVRw9A1JApjaBL8DxQfUnflR1nI1
64DMEXkFRXlhiLnI4trCCkZvYSYnNjmR9/Roejmx1J8EGBzFK+SHyv4qEqay
tB61QfXcPcoARIpUZ1MIrrMVRd5gR7eGo417UTQwEd8HNh/SOU4t6lAkGaDN
vNPehMG6a4vVboNWYBZD/czV2N9NWodlXhqcQN0zKwn/zWMgF5W9UscEJ0hx
d1F0JGstrlj/S/knkAFsogb4wUBEl4FEKQKZpIJZSGzUUk0ZZKDnlXhiMYQy
hqyx7YSvs00rgwPB8M22nbF1i1k7X9+wKBYakPahfqq6HMUkMM7VtOL9bU/S
4mpeBkdqyocRW87hw1ldBwVp1zAwUio6tHZy67CZmvBD/VwpVrJSvbbYYowg
SNhhK/i+Y3mNZhQJFo5GohTYYBoD1gdDTB3elvTq+QBr8eDGfe/xhaEdyVuy
MdRTxJuBGmzV+CA3nToUB6ryRznzvZDV4G+L8aqZxT7y2EgIU8ogyg+uHxl+
T5RKQ6kBIpj0ni1IlVNK9BIpUyMTsyaJOEdP5iJxWBy+CwEe5eLPcytn2gub
yRZVFUMJXgVZ1r+I7gRFk33QSazg1KHlMIRN9VyxSMYJN0YK1rQxYFp2LyUK
ajMNYWNiiPK+mZVEwDkqPKCs2GUT+9l+MUAVDx1NJWeYaNDqKVIhRjY25F8O
EBNtXFkgmqQAE7E4CwlS+aE2g85q7nN4oVrqaWaFMeb6WsJjPiS9DMn2JMPR
z4fC8YJbJTH7JJzd6NMlbhfgeFm6Ky08gqoTIN1acyGRCQCFRV8ZRtqgGEYW
ZWlweiyEy0mja9TNRllfYQkU03hO6SbHCNUL64wyvdSyS8z1GA9PNUDMvOGi
Kuolx8wswI+KHMIbdkSTWNaTdDPbarQy9gyGRv1LLZaeAS1sOb5yU2CYbpyH
lsPRNG00UIq5kXzt5GIJmKXVc9ihbevcoyRKcLBJZgEu7AJI8h/cLvj7bUoT
AAewbW3DpoTUzy8+1zTtJ1gT2WayEaNVr+k7QQVelpwOVL8X6OSWn0aqkAHP
RE1/gzlMl7xby6y/Zd2N5LsohoaI9oic/TjrQVW0UcFcmsxecmYnd2CvXbQu
sa1PUq4QYW4KVqJXmduGMDe23pGbW2HEWedqNWuF8/gR2pIZSROJK8bYfFac
nXx7sne732Zd0HHNdcNPioMLQ8PH4zEpeJRLOcMoGeCw3LDTXD9nCubmXz1a
gD7oMOXy7ZsXb2AAfRLA+n8Av2cdluKyAAA=

-->

</rfc>
