<?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.17 (Ruby 3.1.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-iab-privacy-partitioning-00" category="info" submissionType="IAB" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.15.3 -->
  <front>
    <title abbrev="Partitioning for Privacy">Partitioning as an Architecture for Privacy</title>
    <seriesInfo name="Internet-Draft" value="draft-iab-privacy-partitioning-00"/>
    <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="January" day="10"/>
    <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" 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>
    </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>
      </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>
    <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="connect-proxying-and-masque">
        <name>CONNECT Proxying and MASQUE</name>
        <t>HTTP forward proxies, when using encryption, provide privacy partitioning by separating
a connection into multiple segments. When connections over 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 a Client-to-Proxy context (the transport
metadata between the client and the target, and the request to the proxy to open a connection
to the target),
and a Client-to-Target context (the end-to-end data, which generally would be a TLS-encrypted
connection). There is also a Proxy-to-Target context; in case of MASQUE this context only
contains any (unprotected) packet header information that is added or modified by the proxy,
e.g., the IP and UDP headers.</t>
        <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="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 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 240,320 L 240,384" 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 336,320 L 336,384" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 456,320 L 456,384" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 528,320 L 528,384" 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 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 136,96" fill="none" stroke="black"/>
                <path d="M 200,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 104,224 L 128,224" fill="none" stroke="black"/>
                <path d="M 208,224 L 240,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 8,288 L 552,288" fill="none" stroke="black"/>
                <path d="M 240,320 L 336,320" fill="none" stroke="black"/>
                <path d="M 456,320 L 528,320" fill="none" stroke="black"/>
                <path d="M 336,352 L 352,352" fill="none" stroke="black"/>
                <path d="M 432,352 L 456,352" fill="none" stroke="black"/>
                <path d="M 240,384 L 336,384" fill="none" stroke="black"/>
                <path d="M 456,384 L 528,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="168" y="100">Proxied</text>
                  <text x="288" y="100">Proxy</text>
                  <text x="492" y="100">Target</text>
                  <text x="172" y="116">flow</text>
                  <text x="80" y="180">Client-to-Proxy</text>
                  <text x="176" y="180">Context</text>
                  <text x="68" y="228">Client</text>
                  <text x="168" y="228">Transport</text>
                  <text x="288" y="228">Proxy</text>
                  <text x="164" y="244">flow</text>
                  <text x="80" y="308">Proxy-to-Target</text>
                  <text x="176" y="308">Context</text>
                  <text x="288" y="356">Proxy</text>
                  <text x="392" y="356">Transport</text>
                  <text x="492" y="356">Target</text>
                  <text x="388" y="372">flow</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Client-to-Target Context                                          |
|  +--------+                +-----------+              +--------+  |
|  |        |                |           |              |        |  |
|  | Client +----Proxied-----+   Proxy   +--------------+ Target |  |
|  |        |      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="688" width="560" viewBox="0 0 560 688" class="diagram" text-anchor="middle" font-family="monospace" font-size="13px">
                <path d="M 8,32 L 8,672" 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 184,448 L 184,512" 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 248,448 L 248,512" 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 328,448 L 328,512" fill="none" stroke="black"/>
                <path d="M 328,576 L 328,640" fill="none" stroke="black"/>
                <path d="M 392,64 L 392,128" fill="none" stroke="black"/>
                <path d="M 392,192 L 392,256" fill="none" stroke="black"/>
                <path d="M 392,448 L 392,512" fill="none" stroke="black"/>
                <path d="M 392,576 L 392,640" fill="none" stroke="black"/>
                <path d="M 456,64 L 456,128" fill="none" stroke="black"/>
                <path d="M 456,576 L 456,640" fill="none" stroke="black"/>
                <path d="M 528,64 L 528,128" fill="none" stroke="black"/>
                <path d="M 528,576 L 528,640" fill="none" stroke="black"/>
                <path d="M 552,32 L 552,672" 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 392,64" fill="none" stroke="black"/>
                <path d="M 456,64 L 528,64" fill="none" stroke="black"/>
                <path d="M 104,96 L 184,96" fill="none" stroke="black"/>
                <path d="M 248,96 L 328,96" fill="none" stroke="black"/>
                <path d="M 392,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 392,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 392,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 392,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"/>
                <path d="M 184,448 L 248,448" fill="none" stroke="black"/>
                <path d="M 328,448 L 392,448" fill="none" stroke="black"/>
                <path d="M 248,480 L 328,480" fill="none" stroke="black"/>
                <path d="M 184,512 L 248,512" fill="none" stroke="black"/>
                <path d="M 328,512 L 392,512" fill="none" stroke="black"/>
                <path d="M 8,544 L 552,544" fill="none" stroke="black"/>
                <path d="M 328,576 L 392,576" fill="none" stroke="black"/>
                <path d="M 456,576 L 528,576" fill="none" stroke="black"/>
                <path d="M 392,608 L 456,608" fill="none" stroke="black"/>
                <path d="M 328,640 L 392,640" fill="none" stroke="black"/>
                <path d="M 456,640 L 528,640" fill="none" stroke="black"/>
                <path d="M 8,672 L 552,672" 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="216" y="100">Proxied</text>
                  <text x="360" y="100">Proxy</text>
                  <text x="492" y="100">Target</text>
                  <text x="212" y="116">flow</text>
                  <text x="360" y="116">B</text>
                  <text x="80" y="180">Client-to-Proxy</text>
                  <text x="152" y="180">B</text>
                  <text x="192" y="180">Context</text>
                  <text x="68" y="228">Client</text>
                  <text x="216" y="228">Proxy</text>
                  <text x="360" y="228">Proxy</text>
                  <text x="216" y="244">A</text>
                  <text x="360" y="244">B</text>
                  <text x="80" y="308">Client-to-Proxy</text>
                  <text x="152" y="308">A</text>
                  <text x="192" y="308">Context</text>
                  <text x="68" y="356">Client</text>
                  <text x="216" y="356">Proxy</text>
                  <text x="216" y="372">A</text>
                  <text x="40" y="436">Proxy</text>
                  <text x="108" y="436">A-to-Proxy</text>
                  <text x="160" y="436">B</text>
                  <text x="200" y="436">Context</text>
                  <text x="216" y="484">Proxy</text>
                  <text x="360" y="484">Proxy</text>
                  <text x="216" y="500">A</text>
                  <text x="360" y="500">B</text>
                  <text x="40" y="564">Proxy</text>
                  <text x="112" y="564">B-to-Target</text>
                  <text x="192" y="564">Context</text>
                  <text x="360" y="612">Proxy</text>
                  <text x="492" y="612">Target</text>
                  <text x="360" y="628">B</text>
                </g>
              </svg>
            </artwork>
            <artwork type="ascii-art"><![CDATA[
+-------------------------------------------------------------------+
| Client-to-Target Context                                          |
|  +--------+                           +-------+       +--------+  |
|  |        |                           |       |       |        |  |
|  | Client +----------Proxied----------+ Proxy +-------+ Target |  |
|  |        |           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="privacy-pass">
        <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 identity or identities (such as an account name or IP address) that can be linked and (b) user data (such as the content a user is accessing), which can be often sensitive when combined with user identity. Note that 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>This partitioning process 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>
      <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 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.</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 the requests in transit.</t>
        <t>It is not currently possible to guarantee with technical protocol measure 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, and see <xref target="security-considerations"/> for more discussion.</t>
      </section>
    </section>
    <section anchor="impacts-of-partitioning">
      <name>Impacts of Partitioning</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>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. Privacy partitioning provides
an opportunity for improvements in these management techniques by providing 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.</li>
        <li>Varying performance effects. 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. In general, while performance
and privacy tradeoffs are often cast as a zero sum game, in reality this is often not the case.</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="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>IP Proxying Support for 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="27" month="September" year="2022"/>
          <abstract>
            <t>   This document describes a method of proxying IP packets over HTTP.
   This protocol is similar to CONNECT-UDP, but allows transmitting
   arbitrary IP packets, without being limited to just TCP like CONNECT
   or UDP like CONNECT-UDP.

            </t>
          </abstract>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-masque-connect-ip-03"/>
      </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="15" month="December" year="2022"/>
          <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-06"/>
      </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="8" month="December" year="2022"/>
          <abstract>
            <t>   This document specifies the Privacy Pass architecture and
   requirements for its constituent protocols used for constructing
   anonymous-credential 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-09"/>
      </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="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:
H4sIAAAAAAAAA91923Ibx7Xoe39FF/0QMgIgyd6XRD5OQlPyFiuxxG3SSZ2X
XdUYNIDZHEwj0wNCsKR82X47P3bWrS8zGJCiSdWOjUrFIjDTvXr16nXvtcbj
sWrLtrIv9NGFaeCfpavLeqGN16bWp02xLFtbtJvG6rlr9EVT3phid6TMdNrY
m/5bnUcK09qFa3YvdFnPnfJtY83qhT4//VapmStqs4JZZ42Zt+PSTMdrfm+8
zgYcP3umYJKv1LXdbV0zg7fr1ja1bccv8UWlzKZduuaF0mOl4TPfVBUP/H3Z
/LfRf/5//7Os7LasZ/SzaxamLn8yOPwL/aopC+9drX+w3hpYKj1jV6asXugV
vj+53lh5/09Wnp4UbrU/3ZVbrXb6wmyq3cBMp+t1ZfPR2zU++SeD3w8PeLZs
St+69dI2+nSi/+bc0BLOKreZzSvTdEYvzPZPS2vWgMFp2foJ4Eup2jUreOvG
vlAKNyT+pfWZrf3G/2ALV8MubQoamwYU2rhaWnlIfwukYDa/8fqyXG0q2OKZ
7r44Pp3alr8elzNbt+W8LAhcfdq2prjW8K8WBvzy2fNnMirPZZqFbV/oZduu
/YunT7fb7aSgnycLd/N0Zlrz1BRmZle7p1s7LWvT+KdfPvvy+dNZ6YvKeYBs
bG5cOTN1YcceNsz6pz6AOW66YBoGE77ugTk2BOYY/gVgjhHMscCxbFeVUmo8
HmszhaFMAYi9WpZeA0FvVjCKnllfNOXUelojEHVdlLDJ2s21ULjOKXykt8uy
WGpvKzhmsB/VTvs1oHgGY8KK4RTONBDIalMHLJqicd4rWFZLI9NwMB8eWb2y
poapnS5X68bd2AAFTTyFsS08DuPAYd0AhjQvvd3peeNW/BVOOzm4KruyzQJf
XwOa4Ch6ON0wgWtd4SqaOS4PlmbatIqVbQ39UXoFvMOaCoikXTZus1jGEWA0
GNXQFvkRfn0DIHpCAdKNbVZl7Sq32I1oUNz6jffwxNJtFcxualPtfrLabwCr
KzezlZ/wjq3K2QxOofoCmUjjZkwHSl1E4OkdQOPVXy5p8PMLb4sAAyAX/kJG
eIxMB9FWEPnjk7Yumt0a/jrRxdLUta0UkNfWWgB56+Dn2drByryGLWlky9OX
QEi1n+NuhHMJbEa/4jFpy2GKbFIEG+iJkVnz62ULeNW1Laz3ptnRRsDCgKjy
UXmbpxY30CN0wLABSUD7sJDpLtCSci3ynRaWQgSEm1LP4JG4TfQgULYB+Cf6
lHE3gocBiGtgl0jvhC6krQ5gKCPwNDUIA8zQqhy+gIoGJiNcwfTeBqR63SCL
q5miWws7+9ptgZaaUdoeeVYPb0CJBOs3czjtJVI2ghPOB8CMq40PK/hrBSfz
xsIaz2uYvMBXdiAsiDb5rcb+fVMCXBaHXxo4c/Yd4AXRNbU7V89o0NoitadN
6W3eMLlM9KVb4XhmBSfdM4CwAprAI76AvVSbGfL0sT7l82sKRDUJcUBJc1MW
Flmu0cA0YSYLB2GxbHXtWo0MEVcEcPGJRFDLRleOqWykphugnzntUxwMADBT
YDzwlpvil8xligoRCpLh/EKb2awBIEYayLIAIqoAZbX2sBiAv16A+uBgYHwL
QYZ3wowTTYwH/geIgkmQLIrOJsHKCp4wwEMTlPW1iuwLQRsaPMMSI2FrePVT
G5fE6EPUtIE++LzCgDsNklazzlH+ZGcjFViGgQ3ewn/wVFQWuHoJz8AScduJ
0B2ThnD7tS1Q3oTnSVjsFLJ9kY4l7aPbAAR8WlF6NUBTPwNBKiAo0AfIGTyW
XSTJdIIj3kzg+4Rh2n5cCjH4zbpyhvg5qkSEMyCvxaKxCz7EYWP6OFYBx4hc
ECcbIMZ8u/zOt3YVcQcIYx6B2Igoi++ihGDkKBBF+BWfMDy0DyEjWbvqThRA
jGDQQxMU/1akk6mI2dXCs+KpLT0jkF/xESFB1NGCkRPDTqQzqwIa4LA7zzTk
9ArpDXdsHCFxQYrPd/hUh5u6zsklJsacG3SiBqg3aQOBEtK4UTXYkx/d50Sm
d1m8EjzjRmyADyDtNjn/I1KUh4hN4Hat1q5pBTvX1q4TDMfbpTthiQ/TqWNU
LU6CNmMn+1rYvKwB9UdDOtcRHlhc78LWsAHA9GyxrMu/bwgDRENhYHqMZuxo
MDelL4WUb0xTOtCLgxYG2w/qNhgr1121jVkCjWfKFXJy1tCQfHNcTHTHokJe
S0QHeuuK1o9828B0tSmsgR0lzIEEn+OmEuYWG4AdaIugB8sA98YxaQcpc2Cn
cfz9zZ3oJGTBYClZD1jbptqN1BCC9dJWa89SXphHvkRAn6tMOL+AJUDbyuGT
tA+FqUAJjisipQ7MUABANIJyhRt+iRDB5p2/uvpOI75x4gVok2tPXDp85XL1
FM4KMxk5kmaGGAqHO2rr6qC2zvIWx337+vR8pL8/vfzPH1+NgtULm4dSD/F4
cfG9cKFIlX6zWhkUHF4RgRCrcHDoA9hI3lHTNnDYwBSkJ5FzgXTwYpxH6QlC
Fs0AVMcDuM6TtY76IaAQVgesLFN/EBsoAQrE4RcZ3GmVSn3nGkbIpoHxWPHo
Hti2s7A5/IMe26OsXKFFZCiWCaK2wIp3h5kXbhDMEgdDQqDxR1FTZ9lAZq8S
nQP3ONdAnKgEXZWjP8QMDzusclo27RL5JMFRIYUTp3BAaQeIgvi761C7BYKl
Z0gcmCDYMnUQYcjUS8Ac0PzS+KB+oG5Vw2i7tQ3IH8aqcD7mEyUKHD6kYiyK
StuxQ0EZ8y0tpazsApUVPAQAKJ6oXYRbRbgHgMNBwRID4xq40or0FGRp2fah
usDMdL6p5mUluqWab+qC6eFiCJlmdoPaGqBkTkQIC6N5xOWBRkrHekiHe6Sy
hcshDIedViAq7kFcRuPV+qTxyJqVrLkrDPmYlE1mIPGJgW25AGqjDdmNhskG
xIDvyJrfgoz7LSnJuPWwcBK2v0VR91vWPmeORDj8G3RF30Z7wNtCZIyNDAQN
4uGJUdGZJlkXmCuNhISOjCFxhjNUhN+BMaReEVWXtridJEFhKT2qOSXq+rQe
1qbftUJqQKryhSJbgj0pyPRJbM9YofaWFrjvPzByhkhoxc3yS9LNs90ybZf/
nNe5GgJLrtECAlOzimfl8KLE6yJwo/kXUOqjbZezAORsqLVVAieoMD2jWlTs
sgUWMD9RM2c9CfdoWrdoeItkxJeQKmR+wSPb5glIwKaoJrCH79//8Yfvzv7t
9//+1cePmZ+E3hFFi3cyuL9sQ/IBTO9NQXSS4YZ2ZGt2KldcAnmB9fn+xd83
oNh9VH8AgkmvlTwfyHj01wUsR50Jacn3GQe9LKSJBu4M+NRsYyoYms4bINdN
W1OKhABzH6nHorsU9gwQU8t8YCxNJn1w0FFoiRmEWWDcrgNwoqObOVMd8NTM
TVGCko87kyMHeBKICrdlCRbg9b+BkcXYIiolMxNJ/Vq8RgHMXK/5A7x04e1m
5urdSpwn6DqvF+j+gWdpgRWyYdDAPFodfETkVKOaF+0gvQ4jfU3vwdhkxIBa
kX7CGYgX0KBuDpyMHU5E8XputwBcoPuv6SeCAVZq18j1aji6MHKBqkydxmU1
jMh3jj4Seo5nQsYJ9rIWP58+XplrMUJWI2Z7SO/sXEDjFAwKwCX5ZelvXPqa
HaYjvalx0WhbngDZC7+Knk7e9jmIqBn9hfq+O8CRYWlD1D9RpxQOEYtuRH6T
EjkJfLmpo/NPv766uoCJPblmaFOvzi6SfOWjwOCJBgQasGOzQAWPg4hscgwx
gvD0bS1IUIrK7BInJEzFh/FMi98SNHAD8Ml24ei5wy6qX4kNjTSooEDzqDAR
mwpGDHtNp+6dRW8OHouVnZUGfesiYmmPAPH/+Mc/tDH+ZqGejB/+eaI+BNGj
T/XP/XyAUXQE50n/5xzQJwd+eiKjfOj9gnu9/2Zv6fGnD3GUM2b7H3Tv80F/
H1Dd//GDviQkZ6N0pwMqG1jFXbD08TIHFnZ/vDz48+GR6AXoD8SQ/gKocwGG
0zhSLkexvjl6yT/gATN6ajxIi/zw8kEYt27MJI1HtWbFim337CgcfVTqdEZ2
IAYLbHLVC+PtcIJcOe8wnOR4YBUG1NfW83EF/YRkZOIXOPI2UxcDS36R+Mow
9yD7f8s6sKgHQZ0Nhx8WMebYCnuDDh90FCRlxawjRXTqLgdSiQMFj72wP9eU
ixJ5sEAv+iwKucLWqBck3ymyuvmmIXbUscLVvvbXU5qIqQYEkWgkAR3dOfvP
sHQOTB9Uh18kQ7vlc5ih3ecQ5y91GdoQjvAUXA7h4iBDexAsj4OXB38ei6El
evn2AbA8vgAcEF3D/9afQi9Rdj3JBOCe6LqLXqLsug8sj4OXB38+lwCkRIoB
4YeOAcPCKxNcSfjsyRySdjXrhWADUgSnschqTRbtZzcYuzwolJFLKhGkfqLR
txgVabC+aN6uZCPhSSYD+hFIyUXb1zAIGOoV27lwm2oGE/uNFXeovONqFUcD
AsshGLF3jiKi0UMa1F2WdJi1EH9Bs0z0aEouUckF7KYso3MDuiqvZQGFc9eU
l8F2VA7fL1O4/ExmAbpADtL/PrMgXnGavjj9JFh+Zczin1e4AL3kIP2T0Mu3
6YtvPwmWXxm99IULeriEqw6IGPHnDEkAilBS4LW1+8YMipovvoi0eRmdOErl
7lt2FDNTloQvlGqdYOyekeU1s3jkxFPyB6Fxg+BuOdSkONUivg1GYXDtgm0A
jNtMq9Iv8yQM4uqO4yrFnudpL+BePtwFrQ+6oNUDXdD6kAs6zKjY60yGk8SM
ScDBd8ntPOB/E9ekBBpmOGSSr6BQwFLmuVYQ3aGjsObgjQKIlvA0GO+wXBj5
2NYnhZtRaNa2xYQyVUMmMdiaMEGWteZjcGTG9mgew5RkgApDXzeuurGKXJeF
Q5je9cLAUwklZrTVyXzsZmxGI9O3GAezMKLbkZlPntg0yAulnncT/9Bq7dFz
orQYYzF6UQItddA0waF+9AePYVBLAM0UFl+bwoqVfHA63KUUVc7jjJm/wXNS
jO9gxwx4gZmy/lvigTT40BHKFUYVFFby1rKeZd9hxt8ipBuFY2X2XZghGYaC
60L7KVSsSNGEX/N0mJiFFXIkeO9BY8XDUv8mzYdv9N0o7DLhgdmbjd/unR8K
BQgTEC94llMpE/R80krSDn2e0ptYQ4huTxHXHKpx73aSiQaPFRgJHUICoWhL
ejUxi20JGxmihXwrIKm7lEJwqi83sExKn0y5tDxrN60AD+fchUiJBC2z0FSx
aRqmD1ePFw4fSnkSljI9VMgKQOLbdRIfsqk4gnn29s2bV2dXCBQvHRHNCRtK
EekAyW1NQwziHfm5KLDBoCfTKKYhD0cNOlnVyuRuQzKgYqK2twtKEp3ov3GQ
Kh3GkOrK26SzxAA8ONFHyZ4vfgaYKrJqz2k+mDOKrktLtESuwAkfD4zbL/Eq
QSOZNX6zRj8dh2Hi8hFBCo8gqkxkxPCFDYwoGpohoBNzOB2IwO+RPXJKbLVj
qfq9LPUdDH6auIO63FCMt5UMnv/88fws53LHvCkn3TQegnwGtF+5NXD7To45
WJklCFRYDSPjx5cX+v37PwqIY/jzmx++O/v9l7//948fQ0hkjcEjEGLZc+cX
35yPX05K287HK+OBO41lV8blGt4kOUMZmRtMKWbKOqeMDpKrY57d2xbApWQr
9vXy4zklxPTeJHURLH6f1ZjeFoY3A8HzmBVlFQ+OxfcnRDUhkEZ4YD0oRtH9
Oi8XqB5MAafbXH9QXYFFdGtEmUaYLpjkhDsfd0JOKrqBDwGGTxNwo/i3WMIp
84rI3mnY6lrnZyh4qnmAkxEl4uWgXdEPXdgyTCJg4ZJFEvHM4FAnIZ4dD5hK
E5+QMiE7WnnEB2Fhf86vSZIBqSAHZFJm3SLAhJ53Cu+ZsuYI3vGmlkRIvDLA
lCke88EcKODOSIjdZP2IOBCLk8WEjyCyclg2HgjxwH8eZ0Mf/0Htu4dh8k/t
mbwgkTCL8/MJGAiqyfpvNR7vDcuvzHj8sMdK7k0uD8DL3ig/i14GRsno5Spw
wz693D1KZ7pELveC5XHw8uDP49FLn9X+THo5/Hmcc3SfM337KBl/yWlpj7/c
A5YB1nP3KL9I/tJ3Tj1fuvWAV8rVdoy/rHNthlxOig1ljEIck5Rt7EmwCtIl
RLox2gxbHD1Pj2T7b120LRQnBYvCKIl4wkGCBsXGJar1ZE3Szn+d/bv7O78c
1a+vNWVVlaiH/jJlfvZ50nvm50WvPxz4763R61zyy5R8OBNMd8h8+mScPP72
7W2wPA5eHvz5fDL/23sTzCG89LEw9E1vlIE92tuJgW/2Rtmjlz51pG9uGWVw
5tO9b77Vt8DyOHh58Ofz0cvpZ6SXO0f5JHr5hFEO0su9RhmEpUsvd47yOHh5
8OeRdUR9+gAGc2hFj3OOfgZ/GRzl3vzlACz35C8Dn182fxEieYAC8+krehw5
faf+8omj3KG/fDIst+ovn/T55egvfZviy2GbAlT8AzbFdz3veufKYScmKS5u
dCOG+6R0nZICRVmK1jG64q/+ckkXoVUWYOUYXYwm0HMMEIDmY9iLU4C5GgVQ
Pfx2kl8AOxxJeTutSk51opACOhhfvrlUqvf9+/d/fIv/SE51tzQl/F/brj9+
HHVXimD03s9DBucxA5mXjtdtewGCEbpF6S7IeIU3zxdWdROxO+FBRAPXmjF0
+WcnlwMnIqLRZ073PySFLD5dZ2D+gC+OFLuTJQJDVRsEgBB78SO5vpRe/Q/T
2i28rOPLgA+CVnKpaQCPFp6SkZNT3upZ2Vi6IxevkYuHHYy+UIWj6FqTnIuW
YnuT/n4BGkq+tft6N23Kmb7YwAOF/rPd5eEZ2NbXF39+RRGV57979vEjxbpt
g27qjDwne/QwSMScSn6IdO8kx6uuez+irRMn60QizlIkQvZAHyPoXCElKZ3h
RznDEmqQfMgUNm9S1spsP1BCBBId/xyroO8GZgiX9ym6EGsfYMADNl9yOHD6
ofdDdCikVoREj/TTCK/z1ly8RcagiNrK1LuUHCm0L1GjvqfD1OEW2nSn0x2t
7O7YGgiLkywkIMETtU4BVHQlM14kw4njfL8W/0R46mH+ifCvT/JP7K890vUT
+ftT/BP3huVx8PLgz+ewNwP+Pr9/Ygh79/dPDO3kYXuTj2T+TVjvwVEeA5bH
wcuDP5+DXhijjxfD+ufyT/DqHu6fuCcsvzL/RN9+IC14wIDo6Uy5BZF+Am2b
U2foRhUp2i/fvuYcl69QI+PCPD673h0rfoDM787BUQQs4EN1NkDZxuGjJoVG
AqWfoQ2BJfW8a2LJD8z5kTQKLIC2N3LZZlplAEah+qhJN3Ow7DUowAgfKBbl
TbhdGBQZzuaNFgKtBVhVtyYFVtnBwo3pL9KjQLnMC9YCli5+OP/r6dn/vTi9
vExGiSiWa3htnL8gqUJSdyIaaJIVvGe8dKbvZi5x+i3lUoaiX5zwS9X2YGQM
Rs01bGgqjooFV2rRuBCfVIsp3mzXc+OXpNVROpa7tjUpbZRmSX/Fq5VoI2De
Cuhx5SJW05B7O1QUlJPoYvbfEuwXjxmvlFhzenF19vqUaSRsilR9wvwcTiDe
rbOiQJgUynXisCSobyXpdWmLa6/k6jrFx7pFkgJmumXQEAc0CqmfcrmnCaVW
OhWJ8CdW4gkDrK9HfHOJgt7QjCPJy+SyhzNr7QrorJzxMJzh1QX1UNmfmNFM
4/cJnPJ7yHgN2VdoMGGRoQoLEuPuGCLUbn0qTm07ucNQCum7W5cuAiujj3BB
q3WednwUraGAm4gIr48ZFeIjCFlZXAihsOVNoK4TuRlVqyNEO5UOOTT+qEMH
MoGkfuFgOo4gv3Hadgd9KkMf57T7vYouOlaRnYV6QFb3oaP6GdFeo0zcbAg1
NMQ+Cj+LufJDmub+mkQSeLeIzU+Tm3eJ8E+T4TLKWz5guTpxqODBZ4blcfDy
4M/jqZ/ngbJ/JrXc7dYPeMkg7n9zixnX36MPez99isu4r5E+warhLA7iN+cs
E24d5TFgeRy83O/zudTPTOkZUELjDY+yK/rkOlb8CjUYvsTwvTXIlTGhnRP7
b39GH19cfN9P8MYU2SWIVNuwciEqViYPsxpurLRgZUm8uEt1wLKSs3R3pKpE
Yoh8p1QeSUkfadCsxvgM390V0XNCF3ywEG0YzaobU9FlMSlDQbWLg2yg36iC
SL3jglyh6nEq/IRF2MO6J/pl6aXW7UyfJohj2XF9/PL04iTcJUO1GEuoBkSV
VH+PfXiENBBFp6i7LcvFEkADhI00DMC+VtOvtPXJKom3RWO5iBqpVCtXL3yr
DuAML5qF23BdFQR1iyMpEHyL/jHr7obqVw9GjSRUTRr6DXRAvG+2k8LS4R5b
qGMqWVLLTrFMKtMXi4llewQCH32voqKADiWUlBYQQQlEBoRFM/tENro7Itbl
DCvNa15nZBJqLFO9/XsrGINPoZz4kbF/q5TA27+8xuyxO9lgYHTDfOvD0Ft/
wG9fw6GF48i89tDLHWb74Z4zxx+ejPvS/b/SmgeyG/nlgypKR45EpLmGf7hj
5pv9mZ90Z77fmnMhdgu2/8LXCOCh/9Nf7YGXO2Pcie0HkWcQS2szbt2aGjnc
IY6AuZEUouggXePq1KyVq2Wnt10Hk1gc1aWkK41cfS5UN21SW4N4qa7tXlVr
7VouZ55LtVq+lBLs4NwqoZtydGcRLdVZpwJsNteIK2PS7eMQEMyqcoaquFLy
lgWcFCdKhnhAFF32TLftYlV1KZ3KV8RSnVa6Y5zX3c1GJ29Dp6hkTcKOb5gG
q4rq09JdWa4kJzeoe30euEBjqP3JF574tmQQNLHAZ/duM3NclOHC6a1UWl85
ME/L1RqM+vmmGt6Azk1cQw07TnrdTmLNdLqAeRyr+Nfxvid24emWEj6R5XTq
LOKajqcnqXNKGiyvyiWbWPrUneFk1N14LrzoLXaDKKlTQFbIkh0MnTVM9JsY
JUyz42B8nVuIqbPPWMEvzuoteuv8MlyFaqmky9Alz07Jlswp6V7T+nsezIT7
LEqd0KiTlyb6G6QkF1aD6RcEGPG9ur2yv7ULl9qzqsqhLEwqHknh5wkx7o0f
uESvuIQM0ZqXGrj7V725gJgn99kKsY7ay94h6tFg//ceHmEnwo1KSQrPC5Nj
/Ry8JsmXuujCZBb1PX/JfUyWVu7LDsGjuMUBl9YPFRdgqYB/t4J3jt+//yMO
TF7kZ8+ejfSlDP+vk+cfP55kZd/LeY8SpRRPYgekmxu/t+hOc5fOyejTxcGV
8vnAMvH7fGugEnaH8QNmuZtH15EJiEFuR/kUyApqvuXfWvR8h4LHeiWhelPW
XAvg9h1fUkaHB/Exo6rjxN77jDRiDAefikN9D2k0VqgpzTdtHW0EFUuK3ZsO
wkKhgnjvODJV3CCuZTFD04WdlsAg6Z4oVXTCgaTsQVY7D/CDxedZitSb1RTl
0bxXgS+rlNE2Gy8VfDmNBdV84OBvkJpgjIq2O6tegZOQZZd3rYqWVb+0PXHG
sJUIP3ZNwwjBK7TOTBuuev8dlGxBTjtYK58KQQ5oAewel4jKoELBlW+9cp2i
roIJ0jPY3Zn7yQ/uFlZex7shMS3kEs+JlcVQZS2F2EGBN+91+8DqGYmpx3Ln
TWZD0w4mvJZNH6G9EguxuO3LN5djpKRxDDpJzOl3//K7f8F8Lp50Tb20rO8k
oUiR6lKWRRdfQ6XbdPbVgEwAidDAKXxb7xWyH9yJYGkBDt6CQNoDKrdORyqS
/WHRRFUqudRZ70GGTCnsd7eoy5+IlBzK9xKLKSCw0tViD9gAq2iX+Q526Kck
9XHUL+ytOrpkR6FqQ3uuvQL8Q+9M9I/4RLupDTI7TMnjehUL0uBUT4QF7S4r
MZK51Q2KnRbbCGBNZeOv+RJUCDzurSJQgsUaahkrTCrIvJSGXFJFPxXBSPp6
j7pTWE6Gwe4qoEh0CuFU1Z2YYdcCddGbw1wxzmR8UkH1SwqpEbaYNuBkpkBr
rMbsW9h0aYKCQU5yD1AgK7QdabCqRsl8wQf/zgAnKmszQ57JNbYRjvkuRFY7
pYFuTFmJ5p6MAjAFF9TrKNcsqA0VjVRybYPBcVQ2TpBVnSYzUnMl7yeie1Wy
KeErGl0GKH5splQYUDx6zEURBpKVICuC26rnzwmKw4DSAPrbuooRuORRGYVo
JwzCHr1eZ538zLUURw1ootlC9t2Oeuc4WGsTa230wYvnGqhUeVd1W0ZlC5dm
VFQ25S8Y//ZcNGW/B4t+/0VFD3zM49wD3SOibO73Z+HkVaw5xJmKvtc5SGWl
kqSfDwnztCkg6W2Dav3coM/DZ91v4gQ4JgFK4p7a0L0Jnr0hfZsKKcJDV8vU
3OTA0ezIRKX+ZjWYp1PHZUTkZypkwbkBf82aCu2Swp/Ql+kbOXOIOdGhFnI5
sVJLQbaXJUqJpYz9GoUjxeNdvyhx7B+G7Oa2JiMLS+IF8wScjphCe04Ejw19
t4KrEM7+dY2FoLDIWevSNKFM0YGCYZ4oV1RubB+S62N8ZLgYJk6reluVipxt
l7vkr00VredYQg3dnSY6TqQb0PAdWcxsdVg8irqUwheo0IQHuS3kjKwYTA89
VHH/LeeZ5CX1e+nZmlGVpf72/cIq+415RZCke+na+4NxpZO9a7jJLlfn80Gw
8gRk2YIR70uknD68od9ZJBqq0ENb1g3VE112q35jWSKuxZoqT3VqpKbmk5jy
0AYOkYowBbnX7SnGki906kqiStzfwji3KIGz+nCJ7uiydLQsuWgOJVWjCBBp
yewz87aItq84Y2MjnftAil6zuzDQ5RIetJydkQQTcaULB6rkTmpt1dRwBn3w
ZtFYad0ZohQRbqkDR8yo6xPAWFXpKcFHVW6xEBdaz6lFViBBTGdDG1h8S46A
cSyU1e0eih47c22zBYXuVWFoMs6iIMaRpAw9/ZCxuLBQ8aHIwGUbBAZq6rue
SM/4Auwe9+UN/ZAcdaC8sbnjbIjxnufNVbvlv5jGcqqSMo5d80m0xF7jmzs7
YY1AnfBr7G9q56ji0vguFTHbU0+6LCU1JumnGS1LClFJe4BDRhy+CXyhAW6B
mUVg42J/zHTJhBeP7zY2P1vc2Y3iT6hzsaaz935ommli3XqGJvVGiy8w5QWN
KTci8khYfDFADAYaNQQa5c1GDq3ZrPiGwb5D5zdehW6rXe/pRL+6oQsZRFZv
pT8CO/sOeIQyhZrjuWBoKLm8M8q/57KKEpDjqo7htkwcIvbrfEsiFgYBA7tu
O711O42Bu7leYgiFztCv4k0TYdmvAWNOH786e32ChnLMNWwrP7a+Lj9+pOy0
v168QbkaRjl7TY6+w1HadG+Ggq7LctbV+7kdZ5060oYDy517M1LxWQ8Hr4+5
zTAf4xPdaRDb6+wZPJn73SKPM9/4RF2Gkmwj6RCBaxWIO03GbYKDdxEeDDu5
NKFIJoIU9O3ktp9n7XLStR5pQaNvDwJxza/QX44PbCvN8BAdWBIdnwWpkDxb
Top+c55YrN54PNCYNDbXpSt41KD0RFaMAjtKE+qvhwotYQnr4mHdylCLL+uN
2Wu6yNe5uCOeoRoiq723KeTDBifm4ipuvsEZf1hZTQwQ5r1s+ZM/jc4E2MJg
AxjKj9zzJjACvD4KXWiPJLJuVKQMhDavmkYNTyxaYNJpTKrEkf0C5vAKsHEk
rbyPkF0cxfTXI1SxyEm+BDXY4xpHaov/RL057UbsibvnZ+ZswTaUUCUZErqg
muKabaeYDiCH5GuiOfR0AaSXtkVXDzDGhnvFf/Py7fnk+bPJ8+fPfv/08mLy
5bNnv5t89ZXkDb9/f4Z2he++Awd/LhVl9vt4iwLbYDHOrWuqWei0gjCE9unj
IKiYLGC2OKCUzmTv9xf6nOJibFN2JO+d0dFu+b/kXanwbiNdcfNYwtGwqyvZ
/r33MO+zwQKwvUgHiDAjLeFrbofdmDlxmMCneQ5uUzzSwFHYq1btojUV30FD
zFE6jVzRVCYRbLdtTUwTMZmSlN0ebLAKNAxcruNehIjBMdvBJXeQTe4ZJWUb
CUEnYiMtuQN49IyL5gmoQg08taRM5YeD4fp8QtXHqUf7WrYYW4026D0xCzao
AN9VZfEOa+xM2i0N2ZjAulC1gKNV3tio+MeMdaV1rImLE4RrojF4M6XWwDW7
E8NwMUM2dMAWcMW30oRrsLFGLB7ghiYjY4UqE0YvUCBqxvOM8npj9DVz95KV
T44F0a1fvnSXmXkwwfGjFREr/SacZbWHYScrt7PU1yHk4HO0lVSxngssIDV4
IqY7nIrizoECUbTmTYqiceTTpc1eW0ZTwLqxU/Vw19Nw8RKnIl69JictyUz0
+LP7fiX58uKvGl7tdCejEeLiQEGaUc+8itYUCyfnsCanQPRC0EUQLqm9Tsl9
WzFpxZ6kkrnvuI1n33tNdEfdYFlLTlqr8USKoScsbjsXKJfNkeNHwmKdtsfQ
9QaAiT2YJrigcCZhBQfJuLPY/B43EHDcyBDJCuRC/UfNjqw+sDBNwxu14/LZ
gKL5hiIpdKD/ahpmtnxFmnJ2wSYBRufRhZyxFXTn7Je8pobeIK8O3DsAOGh2
GrFzaLIJ96yd7mUZMIBD0KYWo2SPL+IkyBpJUlKLFbloAYiZIyMto3lOtyhW
GPcMwXq82s5WZheq81rMb9+Knkh7Jp5X0nA6UXFZMGs7ogDZUL+1sYtGGmGG
GUZysqlrCxEiJkoyvTugoBUpyXLvgm/5cJ1BjsFTfXmSeuxc5XM3kxnMKqxB
rkAFVTcDgAljFrcOebN18zm7QRi4AlVOEhk/2cZhW3C9MCvOCUBdAI9dK743
fiP4mjBrg0T9ZeCjZx3lALu+it847/kaMo1wCPr5UJwqmjuZVz9bbuz2XqKw
gEXclHYb+/Xud6nHVFS0Yalj6rFoepR+5doT1tcphhuC8SM10EY+xC6lQjKH
THohzER4cks9U6OXRjouqJnj21PBeYUpWEWJ/0WPJTuI0DXZ71KECCalp7ZV
EldBGtCVNV9SYWmy+xq8YwY8YjHe2qkHvjSelxg/wEgR8knYGkf9DTgswm+z
D4xMn+gbCPfi2NFEvUYzS0/4Myq1lATb8fyyap7lZ8ChCX44k/o7kCScYC4y
C7vc/ya+EJ+luXEHVmyhRFJ9LWpVrxEAYQVelpwTKiyOzif5aRS4BnUbBzGL
KU830syDmxo3zGCI6ndrqVuekjeyFva9lIJBfuluhBWAvmhBetxwCmfsKxX1
H9ZGU5dzdWurcIolkwCJ8R/WL8n9FHDE6eVBr4OH3KYp0D5vnRCpjWQd4Gdl
/vTN6d7pvuq0rECYa8dPpt4Lajwek4lDSZMFOrBB7nHpefX+BWupdvbN0Rzs
OYu5lVdvX76FAcKTgNb/D8zvLacYkAAA

-->

</rfc>
