2005-01-22 09:35:01 +01:00
|
|
|
\documentclass{llncs}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-22 09:35:01 +01:00
|
|
|
\usepackage{url}
|
|
|
|
\usepackage{amsmath}
|
|
|
|
\usepackage{epsfig}
|
|
|
|
|
|
|
|
\newenvironment{tightlist}{\begin{list}{$\bullet$}{
|
|
|
|
\setlength{\itemsep}{0mm}
|
|
|
|
\setlength{\parsep}{0mm}
|
|
|
|
% \setlength{\labelsep}{0mm}
|
|
|
|
% \setlength{\labelwidth}{0mm}
|
|
|
|
% \setlength{\topsep}{0mm}
|
|
|
|
}}{\end{list}}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-22 02:35:29 +01:00
|
|
|
\begin{document}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
\title{Challenges in practical low-latency stream anonymity (DRAFT)}
|
2005-01-22 09:35:01 +01:00
|
|
|
|
|
|
|
\author{Roger Dingledine and Nick Mathewson}
|
|
|
|
\institute{The Free Haven Project\\
|
|
|
|
\email{\{arma,nickm\}@freehaven.net}}
|
|
|
|
|
2005-01-23 00:10:53 +01:00
|
|
|
\maketitle
|
|
|
|
\pagestyle{empty}
|
|
|
|
|
|
|
|
\begin{abstract}
|
|
|
|
foo
|
|
|
|
\end{abstract}
|
|
|
|
|
2005-01-07 04:22:18 +01:00
|
|
|
\section{Introduction}
|
|
|
|
|
2005-01-27 05:51:56 +01:00
|
|
|
Tor is a low-latency anonymous communication overlay network designed
|
|
|
|
to be practical and usable for securing TCP streams over the Internet
|
|
|
|
\cite{tor-design}. We have been operating a publicly deployed Tor network
|
|
|
|
since October 2003 that has grown to over a hundred nodes and carries
|
|
|
|
over 70 megabits per second of average traffic.
|
2005-01-23 00:10:53 +01:00
|
|
|
|
|
|
|
Tor aims to resist observers and insiders by distributing each transaction
|
|
|
|
over several nodes in the network. This ``distributed trust'' approach
|
|
|
|
means the Tor network can be safely operated and used by a wide variety
|
|
|
|
of mutually distrustful users, providing more sustainability and security
|
|
|
|
than previous attempts at anonymizing networks.
|
|
|
|
The Tor network has a broad range of users, including ordinary citizens
|
|
|
|
who want to avoid being profiled for targeted advertisements, corporations
|
|
|
|
who don't want to reveal information to their competitors, and law
|
|
|
|
enforcement and government intelligence agencies who need
|
|
|
|
to do operations on the Internet without being noticed.
|
|
|
|
|
2005-01-27 05:51:56 +01:00
|
|
|
Tor research and development has been funded by the U.S. Navy, for use
|
|
|
|
in securing government
|
2005-01-25 11:38:09 +01:00
|
|
|
communications, and also by the Electronic Frontier Foundation, for use
|
|
|
|
in maintaining civil liberties for ordinary citizens online. The Tor
|
|
|
|
protocol is one of the leading choices
|
2005-01-23 00:10:53 +01:00
|
|
|
to be the anonymizing layer in the European Union's PRIME directive to
|
|
|
|
help maintain privacy in Europe. The University of Dresden in Germany
|
|
|
|
has integrated an independent implementation of the Tor protocol into
|
2005-01-25 11:38:09 +01:00
|
|
|
their popular Java Anon Proxy anonymizing client. This wide variety of
|
2005-01-23 00:10:53 +01:00
|
|
|
interests helps maintain both the stability and the security of the
|
|
|
|
network.
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
Tor has a weaker threat model than many anonymity designs in the
|
2005-01-27 05:51:56 +01:00
|
|
|
literature, because our primary requirements are to have a
|
|
|
|
practical and useful network. Given that fixed assumption, we then aim
|
|
|
|
to provide as much anonymity as we can.
|
2005-01-25 11:38:09 +01:00
|
|
|
|
|
|
|
%need to discuss how we take the approach of building the thing, and then
|
|
|
|
%assuming that, how much anonymity can we get. we're not here to model or
|
|
|
|
%to simulate or to produce equations and formulae. but those have their
|
|
|
|
%roles too.
|
|
|
|
|
|
|
|
This paper aims to give the reader enough information to understand the
|
|
|
|
technical and policy issues that Tor faces as we continue deployment,
|
|
|
|
and to lay a research agenda for others to help in addressing some of
|
|
|
|
these issues. Section \ref{sec:what-is-tor} gives an overview of the Tor
|
|
|
|
design and ours goals. We go on in Section \ref{sec:related} to describe
|
|
|
|
Tor's context in the anonymity space. Sections \ref{sec:crossroads-policy}
|
|
|
|
and \ref{sec:crossroads-technical} describe the practical challenges,
|
|
|
|
both policy and technical respectively, that stand in the way of moving
|
|
|
|
from a practical useful network to a practical useful anonymous network.
|
2005-01-07 04:22:18 +01:00
|
|
|
|
|
|
|
\section{What Is Tor}
|
2005-01-25 11:38:09 +01:00
|
|
|
\label{sec:what-is-tor}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-23 00:10:53 +01:00
|
|
|
\subsection{Distributed trust: safety in numbers}
|
|
|
|
|
|
|
|
Tor provides \emph{forward privacy}, so that users can connect to
|
|
|
|
Internet sites without revealing their logical or physical locations
|
|
|
|
to those sites or to observers. It also provides \emph{location-hidden
|
|
|
|
services}, so that critical servers can support authorized users without
|
|
|
|
giving adversaries an effective vector for physical or online attacks.
|
|
|
|
Our design provides this protection even when a portion of its own
|
|
|
|
infrastructure is controlled by an adversary.
|
|
|
|
|
|
|
|
To make private connections in Tor, users incrementally build a path or
|
|
|
|
\emph{circuit} of encrypted connections through servers on the network,
|
|
|
|
extending it one step at a time so that each server in the circuit only
|
|
|
|
learns which server extended to it and which server it has been asked
|
|
|
|
to extend to. The client negotiates a separate set of encryption keys
|
|
|
|
for each step along the circuit.
|
|
|
|
|
|
|
|
Once a circuit has been established, the client software waits for
|
|
|
|
applications to request TCP connections, and directs these application
|
|
|
|
streams along the circuit. Many streams can be multiplexed along a single
|
|
|
|
circuit, so applications don't need to wait for keys to be negotiated
|
|
|
|
every time they open a connection. Because each server sees no
|
|
|
|
more than one end of the connection, a local eavesdropper or a compromised
|
|
|
|
server cannot use traffic analysis to link the connection's source and
|
|
|
|
destination. The Tor client software rotates circuits periodically
|
|
|
|
to prevent long-term linkability between different actions by a
|
|
|
|
single user.
|
|
|
|
|
|
|
|
Tor differs from other deployed systems for traffic analysis resistance
|
|
|
|
in its security and flexibility. Mix networks such as Mixmaster or its
|
|
|
|
successor Mixminion \cite{minion-design}
|
|
|
|
gain the highest degrees of anonymity at the expense of introducing highly
|
|
|
|
variable delays, thus making them unsuitable for applications such as web
|
|
|
|
browsing that require quick response times. Commercial single-hop proxies
|
|
|
|
such as {\url{anonymizer.com}} present a single point of failure, where
|
|
|
|
a single compromise can expose all users' traffic, and a single-point
|
|
|
|
eavesdropper can perform traffic analysis on the entire network.
|
|
|
|
Also, their proprietary implementations place any infrastucture that
|
|
|
|
depends on these single-hop solutions at the mercy of their providers'
|
|
|
|
financial health. Tor can handle any TCP-based protocol, such as web
|
|
|
|
browsing, instant messaging and chat, and secure shell login; and it is
|
|
|
|
the only implemented anonymizing design with an integrated system for
|
|
|
|
secure location-hidden services.
|
|
|
|
|
|
|
|
No organization can achieve this security on its own. If a single
|
|
|
|
corporation or government agency were to build a private network to
|
|
|
|
protect its operations, any connections entering or leaving that network
|
|
|
|
would be obviously linkable to the controlling organization. The members
|
|
|
|
and operations of that agency would be easier, not harder, to distinguish.
|
|
|
|
|
|
|
|
Instead, to protect our networks from traffic analysis, we must
|
|
|
|
collaboratively blend the traffic from many organizations and private
|
|
|
|
citizens, so that an eavesdropper can't tell which users are which,
|
|
|
|
and who is looking for what information. By bringing more users onto
|
|
|
|
the network, all users become more secure \cite{econymics}.
|
|
|
|
|
|
|
|
Naturally, organizations will not want to depend on others for their
|
|
|
|
security. If most participating providers are reliable, Tor tolerates
|
|
|
|
some hostile infiltration of the network. For maximum protection,
|
|
|
|
the Tor design includes an enclave approach that lets data be encrypted
|
|
|
|
(and authenticated) end-to-end, so high-sensitivity users can be sure it
|
|
|
|
hasn't been read or modified. This even works for Internet services that
|
|
|
|
don't have built-in encryption and authentication, such as unencrypted
|
|
|
|
HTTP or chat, and it requires no modification of those services to do so.
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-22 02:35:29 +01:00
|
|
|
weasel's graph of \# nodes and of bandwidth, ideally from week 0.
|
2005-01-07 04:22:18 +01:00
|
|
|
|
|
|
|
Tor has the following goals.
|
|
|
|
|
|
|
|
and we made these assumptions when trying to design the thing.
|
|
|
|
|
|
|
|
\section{Tor's position in the anonymity field}
|
2005-01-25 11:38:09 +01:00
|
|
|
\label{sec:related}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
|
|
|
There are many other classes of systems: single-hop proxies, open proxies,
|
|
|
|
jap, mixminion, flash mixes, freenet, i2p, mute/ants/etc, tarzan,
|
|
|
|
morphmix, freedom. Give brief descriptions and brief characterizations
|
|
|
|
of how we differ. This is not the breakthrough stuff and we only have
|
|
|
|
a page or two for it.
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
have a serious discussion of morphmix's assumptions, since they would
|
|
|
|
seem to be the direct competition. in fact tor is a flexible architecture
|
|
|
|
that would encompass morphmix, and they're nearly identical except for
|
|
|
|
path selection and node discovery. and the trust system morphmix has
|
|
|
|
seems overkill (and/or insecure) based on the threat model we've picked.
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-26 11:46:53 +01:00
|
|
|
\section{Threat model}
|
|
|
|
|
|
|
|
discuss $\frac{c^2}{n^2}$, except how in practice the chance of owning
|
|
|
|
the last hop is not c/n since that doesn't take the destination (website)
|
|
|
|
into account. so in cases where the adversary does not also control the
|
|
|
|
final destination we're in good shape, but if he *does* then we'd be better
|
|
|
|
off with a system that lets each hop choose a path.
|
|
|
|
|
|
|
|
in practice tor's threat model is based entirely on the goal of dispersal
|
|
|
|
and diversity. george and steven describe an attack \cite{draft} that
|
|
|
|
lets them determine the nodes used in a circuit; yet they can't identify
|
|
|
|
alice or bob through this attack. so it's really just the endpoints that
|
2005-01-26 12:09:57 +01:00
|
|
|
remain secure. and the enclave model seems particularly threatened by
|
|
|
|
this, since this attack lets us identify endpoints when they're servers.
|
|
|
|
see \ref{subsec:helper-nodes} for discussion of some ways to address this
|
|
|
|
issue.
|
|
|
|
|
|
|
|
see \ref{subsec:routing-zones} for discussion of larger
|
2005-01-26 11:46:53 +01:00
|
|
|
adversaries and our dispersal goals.
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
\section{Crossroads: Policy issues}
|
|
|
|
\label{sec:crossroads-policy}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
Many of the issues the Tor project needs to address are not just a
|
|
|
|
matter of system design or technology development. In particular, the
|
|
|
|
Tor project's \emph{image} with respect to its users and the rest of
|
|
|
|
the Internet impacts the security it can provide.
|
|
|
|
|
|
|
|
As an example to motivate this section, some U.S.~Department of Enery
|
|
|
|
penetration testing engineers are tasked with compromising DoE computers
|
|
|
|
from the outside. They only have a limited number of ISPs from which to
|
|
|
|
launch their attacks, and they found that the defenders were recognizing
|
|
|
|
attacks because they came from the same IP space. These engineers wanted
|
|
|
|
to use Tor to hide their tracks. First, from a technical standpoint,
|
|
|
|
Tor does not support the variety of IP packets they would like to use in
|
|
|
|
such attacks (see Section \ref{subsec:ip-vs-tcp}). But aside from this,
|
|
|
|
we also decided that it would probably be poor precedent to encourage
|
|
|
|
such use -- even legal use that improves national security -- and managed
|
|
|
|
to dissuade them.
|
|
|
|
|
|
|
|
With this image issue in mind, here we discuss the Tor user base and
|
|
|
|
Tor's interaction with other services on the Internet.
|
2005-01-26 01:39:03 +01:00
|
|
|
|
2005-01-27 02:16:52 +01:00
|
|
|
|
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
\subsection{Usability}
|
2005-01-26 01:39:03 +01:00
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
Usability: fc03 paper was great, except the lower latency you are the
|
|
|
|
less useful it seems it is.
|
|
|
|
A Tor gui, how jap's gui is nice but does not reflect the security
|
|
|
|
they provide.
|
|
|
|
Public perception, and thus advertising, is a security parameter.
|
2005-01-26 01:39:03 +01:00
|
|
|
|
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
\subsection{Image, usability, and sustainability}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-07 15:01:56 +01:00
|
|
|
Image: substantial non-infringing uses. Image is a security parameter,
|
|
|
|
since it impacts user base and perceived sustainability.
|
|
|
|
|
|
|
|
Sustainability. Previous attempts have been commercial which we think
|
|
|
|
adds a lot of unnecessary complexity and accountability. Freedom didn't
|
|
|
|
collect enough money to pay its servers; JAP bandwidth is supported by
|
|
|
|
continued money, and they periodically ask what they will do when it
|
|
|
|
dries up.
|
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
good uses are kept private, bad uses are publicized. not good.
|
|
|
|
|
|
|
|
\subsection{Tor and file-sharing}
|
|
|
|
|
|
|
|
Bittorrent and dmca. Should we add an IDS to autodetect protocols and
|
|
|
|
snipe them?
|
|
|
|
|
2005-01-27 05:51:56 +01:00
|
|
|
because only at the exit is it evident what port or protocol a given
|
|
|
|
tor stream is, you can't choose not to carry file-sharing traffic.
|
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
\subsection{Tor and blacklists}
|
|
|
|
|
|
|
|
Takedowns and efnet abuse and wikipedia complaints and irc
|
|
|
|
networks.
|
|
|
|
|
2005-01-27 02:16:52 +01:00
|
|
|
It was long expected that, alongside Tor's legitimate users, it would also
|
|
|
|
attract troublemakers who exploited Tor in order to abuse services on the
|
|
|
|
Internet. Our initial answer to this situation was to use ``exit policies''
|
|
|
|
to allow individual Tor servers to block access to specific IP/port ranges.
|
|
|
|
This approach was meant to make operators more willing to run Tor by allowing
|
|
|
|
them to prevent their servers from being used for abusing particular
|
|
|
|
services. For example, all Tor servers currently block SMTP (port 25), in
|
|
|
|
order to avoid being used to send spam.
|
|
|
|
|
|
|
|
This approach is useful, but is insufficient for two reasons. First, since
|
|
|
|
it is not possible to force all ORs to block access to any given service,
|
|
|
|
many of those services try to block Tor instead. More broadly, while being
|
|
|
|
blockable is important to being good netizens, we would like to encourage
|
|
|
|
services to allow anonymous access; services should not need to decide
|
|
|
|
between blocking legitimate anonymous use and allowing unlimited abuse.
|
|
|
|
|
2005-01-26 23:14:25 +01:00
|
|
|
This is potentially a bigger problem than it may appear.
|
|
|
|
On the one hand, if people want to refuse connections from you on
|
|
|
|
their servers it would seem that they should be allowed to. But, a
|
|
|
|
possible major problem with the blocking of Tor is that it's not just
|
|
|
|
the decision of the individual server administrator whose deciding if
|
|
|
|
he wants to post to wikipedia from his Tor node address or allow
|
|
|
|
people to read wikipedia anonymously through his Tor node. If e.g.,
|
|
|
|
s/he comes through a campus or corporate NAT, then the decision must
|
|
|
|
be to have the entire population behind it able to have a Tor exit
|
|
|
|
node or write access to wikipedia. This is a loss for both of us (Tor
|
|
|
|
and wikipedia). We don't want to compete for (or divvy up) the NAT
|
|
|
|
protected entities of the world.
|
|
|
|
|
2005-01-27 02:16:52 +01:00
|
|
|
(A related problem is that many IP blacklists are not terribly fine-grained.
|
|
|
|
No current IP blacklist, for example, allow a service provider to blacklist
|
|
|
|
only those Tor servers that allow access to a specific IP or port, even
|
|
|
|
though this information is readily available. One IP blacklist even bans
|
|
|
|
every class C network that contains a Tor server, and recommends banning SMTP
|
|
|
|
from these networks even though Tor does not allow SMTP at all.)
|
|
|
|
|
|
|
|
Problems of abuse occur mainly with services such as IRC networks and
|
|
|
|
Wikipedia, which rely on IP-blocking to ban abusive users. While at first
|
|
|
|
blush this practice might seem to depend on the anachronistic assumption that
|
|
|
|
each IP is an identifier for a single user, it is actually more reasonable in
|
|
|
|
practice: it assumes that non-proxy IPs are a costly resource, and that an
|
|
|
|
abuser can not change IPs at will. By blocking IPs which are used by Tor
|
|
|
|
servers, open proxies, and service abusers, these systems hope to make
|
|
|
|
ongoing abuse difficult. Although the system is imperfect, it works
|
|
|
|
tolerably well for them in practice.
|
|
|
|
|
|
|
|
But of course, we would prefer that legitimate anonymous users be able to
|
|
|
|
access abuse-prone services. One conceivable approach would be to require
|
|
|
|
would-be IRC users, for instance, to register accounts if they wanted to
|
|
|
|
access the IRC network from Tor. But in practise, this would not
|
|
|
|
significantly impede abuse if creating new accounts were easily automatable;
|
|
|
|
this is why services use IP blocking. In order to deter abuse, pseudonymous
|
|
|
|
identities need to impose a significant switching cost in resources or human
|
|
|
|
time.
|
|
|
|
|
|
|
|
Once approach, similar to that taken by Freedom, would be to bootstrap some
|
|
|
|
non-anonymous costly identification mechanism to allow access to a
|
|
|
|
blind-signature pseudonym protocol. This would effectively create costly
|
|
|
|
pseudonyms, which services could require in order to allow anonymous access.
|
|
|
|
This approach has difficulties in practise, however:
|
|
|
|
\begin{tightlist}
|
|
|
|
\item Unlike Freedom, Tor is not a commercial service. Therefore, it would
|
|
|
|
be a shame to require payment in order to make Tor useful, or to make
|
|
|
|
non-paying users second-class citizens.
|
|
|
|
\item It is hard to think of an underlying resource that would actually work.
|
|
|
|
We could use IP addresses, but that's the problem, isn't it?
|
|
|
|
\item Managing single sign-on services is not considered a well-solved
|
|
|
|
problem in practice. If Microsoft can't get universal acceptance for
|
|
|
|
passport, why do we think that a Tor-specific solution would do any good?
|
|
|
|
\item Even if we came up with a perfect authentication system for our needs,
|
|
|
|
there's no guarantee that any service would actually start using it. It
|
|
|
|
would require a nonzero effort for them to support it, and it might just
|
|
|
|
be less hassle for them to block tor anyway.
|
|
|
|
\end{tightlist}
|
|
|
|
|
2005-01-26 23:14:25 +01:00
|
|
|
Squishy IP based ``authentication'' and ``authorization'' is a reality
|
|
|
|
we must contend with. We should say something more about the analogy
|
|
|
|
with SSNs.
|
|
|
|
|
|
|
|
|
|
|
|
|
2005-01-26 01:39:03 +01:00
|
|
|
\subsection{Other}
|
|
|
|
|
|
|
|
Tor's scope: How much should Tor aim to do? Applications that leak
|
2005-01-26 13:49:34 +01:00
|
|
|
data: we can say they're not our problem, but they're somebody's problem.
|
|
|
|
Also, the more widely deployed Tor becomes, the more people who need a
|
|
|
|
deployed overlay network tell us they'd like to use us if only we added
|
|
|
|
the following more features. For example, Blossom \cite{blossom} and
|
|
|
|
random community wireless projects both want source-routable overlay
|
|
|
|
networks for their own purposes. Fortunately, our modular design separates
|
|
|
|
routing from node discovery; so we could implement Morphmix in Tor just
|
|
|
|
by implementing the Morphmix-specific node discovery and path selection
|
|
|
|
pieces. On the other hand, we could easily get distracted building a
|
|
|
|
general-purpose overlay library, and we're only a few developers.
|
2005-01-26 01:39:03 +01:00
|
|
|
|
|
|
|
Should we allow revocation of anonymity if a threshold of
|
|
|
|
servers want to?
|
2005-01-25 11:38:09 +01:00
|
|
|
|
2005-01-07 04:22:18 +01:00
|
|
|
Logging. Making logs not revealing. A happy coincidence that verbose
|
2005-01-22 02:35:29 +01:00
|
|
|
logging is our \#2 performance bottleneck. Is there a way to detect
|
2005-01-07 04:22:18 +01:00
|
|
|
modified servers, or to have them volunteer the information that they're
|
|
|
|
logging verbosely? Would that actually solve any attacks?
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
\section{Crossroads: Scaling and Design choices}
|
|
|
|
\label{sec:crossroads-design}
|
|
|
|
|
|
|
|
\subsection{Transporting the stream vs transporting the packets}
|
|
|
|
|
2005-01-26 11:46:53 +01:00
|
|
|
We periodically run into ex ZKS employees who tell us that the process of
|
2005-01-25 11:38:09 +01:00
|
|
|
anonymizing IPs should ``obviously'' be done at the IP layer. Here are
|
|
|
|
the issues that need to be resolved before we'll be ready to switch Tor
|
|
|
|
over to arbitrary IP traffic.
|
|
|
|
|
2005-01-26 11:46:53 +01:00
|
|
|
\begin{enumerate}
|
|
|
|
\setlength{\itemsep}{0mm}
|
|
|
|
\setlength{\parsep}{0mm}
|
2005-01-27 05:51:56 +01:00
|
|
|
\item \emph{IP packets reveal OS characteristics.} We still need to do
|
2005-01-26 11:46:53 +01:00
|
|
|
IP-level packet normalization, to stop things like IP fingerprinting
|
|
|
|
\cite{ip-fingerprinting}. There exist libraries \cite{ip-normalizing}
|
|
|
|
that can help with this.
|
2005-01-27 05:51:56 +01:00
|
|
|
\item \emph{Application-level streams still need scrubbing.} We still need
|
2005-01-26 11:46:53 +01:00
|
|
|
Tor to be easy to integrate with user-level application-specific proxies
|
|
|
|
such as Privoxy. So it's not just a matter of capturing packets and
|
|
|
|
anonymizing them at the IP layer.
|
2005-01-27 05:51:56 +01:00
|
|
|
\item \emph{Certain protocols will still leak information.} For example,
|
2005-01-26 11:46:53 +01:00
|
|
|
DNS requests destined for my local DNS servers need to be rewritten
|
|
|
|
to be delivered to some other unlinkable DNS server. This requires
|
|
|
|
understanding the protocols we are transporting.
|
2005-01-27 05:51:56 +01:00
|
|
|
\item \emph{The crypto is unspecified.} First we need a block-level encryption
|
2005-01-26 11:46:53 +01:00
|
|
|
approach that can provide security despite
|
2005-01-25 11:38:09 +01:00
|
|
|
packet loss and out-of-order delivery. Freedom allegedly had one, but it was
|
2005-01-26 11:46:53 +01:00
|
|
|
never publicly specified, and we believe it's likely vulnerable to tagging
|
|
|
|
attacks \cite{tor-design}. Also, TLS over UDP is not implemented or even
|
|
|
|
specified, though some early work has begun on that \cite{ben-tls-udp}.
|
2005-01-27 05:51:56 +01:00
|
|
|
\item \emph{We'll still need to tune network parameters}. Since the above
|
2005-01-26 11:46:53 +01:00
|
|
|
encryption system will likely need sequence numbers and maybe more to do
|
|
|
|
replay detection, handle duplicate frames, etc, we will be reimplementing
|
|
|
|
some subset of TCP anyway to manage throughput, congestion control, etc.
|
2005-01-27 05:51:56 +01:00
|
|
|
\item \emph{Exit policies for arbitrary IP packets mean building a secure
|
|
|
|
IDS.} Our server operators tell us that exit policies are one of
|
2005-01-26 11:46:53 +01:00
|
|
|
the main reasons they're willing to run Tor over previous attempts
|
|
|
|
at anonymizing networks. Adding an IDS to handle exit policies would
|
|
|
|
increase the security complexity of Tor, and would likely not work anyway,
|
2005-01-26 12:09:57 +01:00
|
|
|
as evidenced by the entire field of IDS and counter-IDS papers. Many
|
|
|
|
potential abuse issues are resolved by the fact that Tor only transports
|
|
|
|
valid TCP streams (as opposed to arbitrary IP including malformed packets
|
|
|
|
and IP floods), so exit policies become even \emph{more} important as
|
|
|
|
we become able to transport IP packets. We also need a way to compactly
|
|
|
|
characterize the exit policies and let clients parse them to decide
|
|
|
|
which nodes will allow which packets to exit.
|
2005-01-27 05:51:56 +01:00
|
|
|
\item \emph{The Tor-internal name spaces would need to be redesigned.} We
|
2005-01-26 11:46:53 +01:00
|
|
|
support hidden service \tt{.onion} addresses, and other special addresses
|
|
|
|
like \tt{.exit} (see Section \ref{subsec:}), by intercepting the addresses
|
|
|
|
when they are passed to the Tor client.
|
|
|
|
\end{enumerate}
|
2005-01-25 11:38:09 +01:00
|
|
|
|
2005-01-26 12:09:57 +01:00
|
|
|
This list is discouragingly long right now, but we recognize that it
|
|
|
|
would be good to investigate each of these items in further depth and to
|
|
|
|
understand which are actual roadblocks and which are easier to resolve
|
|
|
|
than we think. We certainly wouldn't mind if Tor one day is able to
|
|
|
|
transport a greater variety of protocols.
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
\subsection{Mid-latency}
|
|
|
|
|
|
|
|
Mid-latency. Can we do traffic shape to get any defense against George's
|
|
|
|
PET2004 paper? Will padding or long-range dummies do anything then? Will
|
|
|
|
it kill the user base or can we get both approaches to play well together?
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-26 11:46:53 +01:00
|
|
|
explain what mid-latency is. propose a single network where users of
|
|
|
|
varying latency goals can combine.
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-26 11:46:53 +01:00
|
|
|
Note that in practice as the network is growing and we accept cable
|
|
|
|
modem and dsl nodes, and nodes in other continents, we're *already*
|
|
|
|
looking at many-second delays for some transactions. The engineering
|
|
|
|
required to get this lower is going to be extremely hard. It's worth
|
|
|
|
considering how hard it would be to accept the fixed (higher) latency
|
|
|
|
and improve the protection we get from it.
|
|
|
|
|
|
|
|
% can somebody besides arma flesh this section out?
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
%\subsection{The DNS problem in practice}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
\subsection{Measuring performance and capacity}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
|
|
|
How to measure performance without letting people selectively deny service
|
|
|
|
by distinguishing pings. Heck, just how to measure performance at all. In
|
|
|
|
practice people have funny firewalls that don't match up to their exit
|
|
|
|
policies and Tor doesn't deal.
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
Network investigation: Is all this bandwidth publishing thing a good idea?
|
|
|
|
How can we collect stats better? Note weasel's smokeping, at
|
|
|
|
http://seppia.noreply.org/cgi-bin/smokeping.cgi?target=Tor
|
|
|
|
which probably gives george and steven enough info to break tor?
|
|
|
|
|
|
|
|
\subsection{Plausible deniability}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
|
|
|
Does running a server help you or harm you? George's Oakland attack.
|
|
|
|
Plausible deniability -- without even running your traffic through Tor! We
|
|
|
|
have to pick the path length so adversary can't distinguish client from
|
|
|
|
server (how many hops is good?).
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
\subsection{Helper nodes}
|
|
|
|
|
2005-01-07 04:22:18 +01:00
|
|
|
When does fixing your entry or exit node help you?
|
|
|
|
Helper nodes in the literature don't deal with churn, and
|
|
|
|
especially active attacks to induce churn.
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
Do general DoS attacks have anonymity implications? See e.g. Adam
|
|
|
|
Back's IH paper, but I think there's more to be pointed out here.
|
|
|
|
|
|
|
|
\subsection{Location-hidden services}
|
|
|
|
|
2005-01-07 04:22:18 +01:00
|
|
|
Survivable services are new in practice, yes? Hidden services seem
|
|
|
|
less hidden than we'd like, since they stay in one place and get used
|
|
|
|
a lot. They're the epitome of the need for helper nodes. This means
|
|
|
|
that using Tor as a building block for Free Haven is going to be really
|
|
|
|
hard. Also, they're brittle in terms of intersection and observation
|
|
|
|
attacks. Would be nice to have hot-swap services, but hard to design.
|
|
|
|
|
2005-01-27 02:16:52 +01:00
|
|
|
\subsection{Trust and discovery}
|
|
|
|
|
|
|
|
The published Tor design adopted a deliberately simplistic design for
|
|
|
|
authorizing new nodes and informing clients about servers and their status.
|
|
|
|
In the early Tor designs, all ORs periodically uploaded a signed description
|
|
|
|
of their locations, keys, and capabilities to each of several well-known {\it
|
|
|
|
directory servers}. These directory servers constructed a signed summary
|
|
|
|
of all known ORs (a ``directory''), and a signed statement of which ORs they
|
|
|
|
believed to be operational at any given time (a ``network status''). Clients
|
|
|
|
periodically downloaded a directory in order to learn the latest ORs and
|
|
|
|
keys, and more frequently downloaded a network status to learn which ORs are
|
|
|
|
likely to be running. ORs also operate as directory caches, in order to
|
|
|
|
lighten the bandwidth on the authoritative directory servers.
|
|
|
|
|
|
|
|
In order to prevent Sybil attacks (wherein an adversary signs up many
|
|
|
|
purportedly independent servers in order to increase her chances of observing
|
|
|
|
a stream as it enters and leaves the network), the early Tor directory design
|
|
|
|
required the operators of the authoritative directory servers to manually
|
|
|
|
approve new ORs. Unapproved ORs were included in the directory, but clients
|
|
|
|
did not use them at the start or end of their circuits. In practice,
|
|
|
|
directory administrators performed little actual verification, and tended to
|
|
|
|
approve any OR whose operator could compose a coherent email. This procedure
|
|
|
|
may have prevented trivial automated Sybil attacks, but would do little
|
|
|
|
against a clever attacker.
|
|
|
|
|
|
|
|
There are a number of flaws in this system that need to be addressed as we
|
|
|
|
move forward. They include:
|
|
|
|
\begin{tightlist}
|
|
|
|
\item Each directory server represents an independent point of failure; if
|
|
|
|
any one were compromised, it could immediately compromise all of its users
|
|
|
|
by recommending only compromised ORs.
|
|
|
|
\item The more servers appear join the network, the more unreasonable it
|
|
|
|
becomes to expect clients to know about them all. Directories
|
|
|
|
become unfeasibly large, and downloading the list of servers becomes
|
|
|
|
burdonsome.
|
|
|
|
\item The validation scheme may do as much harm as it does good. It is not
|
|
|
|
only incapable of preventing clever attackers from mounting Sybil attacks,
|
|
|
|
but may deter server operators from joining the network. (For instance, if
|
|
|
|
they expect the validation process to be difficult, or if they do not share
|
|
|
|
any languages in common with the directory server operators.)
|
|
|
|
\end{tightlist}
|
|
|
|
|
|
|
|
We could try to move the system in several directions, depending on our
|
|
|
|
choice of threat model and requirements. If we did not need to increase
|
|
|
|
network capacity in order to support more users, there would be no reason not
|
|
|
|
to adopt even stricter validation requirements, and reduce the number of
|
|
|
|
servers in the network to a trusted minimum. But since we want Tor to work
|
|
|
|
for as many users as it can, we need XXXXX
|
|
|
|
|
|
|
|
In order to address the first two issues, it seems wise to move to a system
|
|
|
|
including a number of semi-trusted directory servers, no one of which can
|
|
|
|
compromise a user on its own. Ultimately, of course, we cannot escape the
|
|
|
|
problem of a first introducer: since most users will run Tor in whatever
|
|
|
|
configuration the software ships with, the Tor distribution itself will
|
|
|
|
remain a potential single point of failure so long as it includes the seed
|
|
|
|
keys for directory servers, a list of directory servers, or any other means
|
|
|
|
to learn which servers are on the network. But omitting this information
|
|
|
|
from the Tor distribution would only delegate the trust problem to the
|
|
|
|
individual users, most of whom are presumably less informed about how to make
|
|
|
|
trust decisions than the Tor developers.
|
|
|
|
|
|
|
|
%Network discovery, sybil, node admission, scaling. It seems that the code
|
|
|
|
%will ship with something and that's our trust root. We could try to get
|
|
|
|
%people to build a web of trust, but no. Where we go from here depends
|
|
|
|
%on what threats we have in mind. Really decentralized if your threat is
|
|
|
|
%RIAA; less so if threat is to application data or individuals or...
|
|
|
|
|
|
|
|
|
2005-01-26 12:09:57 +01:00
|
|
|
Game theory for helper nodes: if Alice offers a hidden service on a
|
|
|
|
server (enclave model), and nobody ever uses helper nodes, then against
|
|
|
|
George+Steven's attack she's totally nailed. If only Alice uses a helper
|
|
|
|
node, then she's still identified as the source of the data. If everybody
|
|
|
|
uses a helper node (including Alice), then the attack identifies the
|
|
|
|
helper node and also Alice, and knows which one is which. If everybody
|
|
|
|
uses a helper node (but not Alice), then the attacker figures the real
|
|
|
|
source was a client that is using Alice as a helper node. [How's my
|
|
|
|
logic here?]
|
|
|
|
|
2005-01-27 05:51:56 +01:00
|
|
|
people are using hidden services as a poor man's vpn and firewall-buster.
|
|
|
|
rather than playing with dyndns and trying to pierce holes in their
|
|
|
|
firewall (say, so they can ssh in from the outside), they run a hidden
|
|
|
|
service on the inside and then rendezvous with that hidden service
|
|
|
|
externally.
|
|
|
|
|
2005-01-26 11:46:53 +01:00
|
|
|
in practice, sites like bloggers without borders (www.b19s.org) are
|
|
|
|
running tor servers but more important are advertising a hidden-service
|
|
|
|
address on their front page. doing this can provide increased robustness
|
|
|
|
if they used the dual-IP approach we describe in tor-design, but in
|
|
|
|
practice they do it to a) increase visibility of the tor project and their
|
|
|
|
support for privacy, and b) to offer a way for their users, using vanilla
|
|
|
|
software, to get end-to-end encryption and end-to-end authentication to
|
|
|
|
their website.
|
2005-01-25 11:38:09 +01:00
|
|
|
|
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
\section{Crossroads: Scaling}
|
2005-01-25 11:38:09 +01:00
|
|
|
%\label{sec:crossroads-scaling}
|
|
|
|
%P2P + anonymity issues:
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-26 11:46:53 +01:00
|
|
|
Tor is running today with hundreds of servers and tens of thousands of
|
|
|
|
users, but it will certainly not scale to millions.
|
2005-01-26 06:29:08 +01:00
|
|
|
|
|
|
|
Scaling Tor involves three main challenges. First is safe server
|
|
|
|
discovery, both bootstrapping -- how a Tor client can robustly find an
|
|
|
|
initial server list -- and ongoing -- how a Tor client can learn about
|
|
|
|
a fair sample of honest servers and not let the adversary control his
|
|
|
|
circuits (see Section x). Second is detecting and handling the speed
|
|
|
|
and reliability of the variety of servers we must use if we want to
|
|
|
|
accept many servers (see Section y).
|
|
|
|
Since the speed and reliability of a circuit is limited by its worst link,
|
|
|
|
we must learn to track and predict performance. Finally, in order to get
|
|
|
|
a large set of servers in the first place, we must address incentives
|
|
|
|
for users to carry traffic for others (see Section incentives).
|
2005-01-26 01:39:03 +01:00
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
\subsection{Incentives}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-26 06:29:08 +01:00
|
|
|
There are three behaviors we need to encourage for each server: relaying
|
|
|
|
traffic; providing good throughput and reliability while doing it;
|
|
|
|
and allowing traffic to exit the network from that server.
|
|
|
|
|
|
|
|
We encourage these behaviors through \emph{indirect} incentives, that
|
|
|
|
is, designing the system and educating users in such a way that users
|
|
|
|
with certain goals will choose to relay traffic. In practice, the
|
|
|
|
main incentive for running a Tor server is social benefit: volunteers
|
|
|
|
altruistically donate their bandwidth and time. We also keep public
|
|
|
|
rankings of the throughput and reliability of servers, much like
|
|
|
|
seti@home. We further explain to users that they can get \emph{better
|
|
|
|
security} by operating a server, because they get plausible deniability
|
|
|
|
(indeed, they may not need to route their own traffic through Tor at all
|
|
|
|
-- blending directly with other traffic exiting Tor may be sufficient
|
|
|
|
protection for them), and because they can use their own Tor server
|
|
|
|
as entry or exit point and be confident it's not run by the adversary.
|
|
|
|
Finally, we can improve the usability and feature set of the software:
|
|
|
|
rate limiting support and easy packaging decrease the hassle of
|
|
|
|
maintaining a server, and our configurable exit policies allow each
|
|
|
|
operator to advertise a policy describing the hosts and ports to which
|
|
|
|
he feels comfortable connecting.
|
|
|
|
|
|
|
|
Beyond these, however, there is also a need for \emph{direct} incentives:
|
|
|
|
providing payment or other resources in return for high-quality service.
|
|
|
|
Paying actual money is problematic: decentralized e-cash systems are
|
|
|
|
not yet practical, and a centralized collection system not only reduces
|
|
|
|
robustness, but also has failed in the past (the history of commercial
|
|
|
|
anonymizing networks is littered with failed attempts). A more promising
|
|
|
|
option is to use a tit-for-tat incentive scheme: provide better service
|
|
|
|
to nodes that have provided good service to you.
|
|
|
|
|
|
|
|
Unfortunately, such an approach introduces new anonymity problems.
|
|
|
|
Does the incentive system enable the adversary to attract more traffic by
|
|
|
|
performing well? Typically a user who chooses evenly from all options is
|
|
|
|
most resistant to an adversary targetting him, but that approach prevents
|
|
|
|
us from handling heterogeneous servers \cite{casc-rep}.
|
|
|
|
When a server (call him Steve) performs well for Alice, does Steve gain
|
|
|
|
reputation with the entire system, or just with Alice? If the entire
|
|
|
|
system, how does Alice tell everybody about her experience in a way that
|
|
|
|
prevents her from lying about it yet still protects her identity? If
|
|
|
|
Steve's behavior only affects Alice's behavior, does this allow Steve to
|
|
|
|
selectively perform only for Alice, and then break her anonymity later
|
|
|
|
when somebody (presumably Alice) routes through his node?
|
|
|
|
|
|
|
|
These are difficult and open questions, yet choosing not to scale means
|
|
|
|
leaving most users to a less secure network or no anonymizing network
|
|
|
|
at all. We will start with a simplified approach to the tit-for-tat
|
|
|
|
incentive scheme based on two rules: (1) each node should measure the
|
|
|
|
service it receives from adjacent nodes, and provide service relative to
|
|
|
|
the received service, but (2) when a node is making decisions that affect
|
|
|
|
its own security (e.g. when building a circuit for its own application
|
|
|
|
connections), it should choose evenly from a sufficiently large set of
|
|
|
|
nodes that meet some minimum service threshold. This approach allows us
|
|
|
|
to discourage bad service without opening Alice up as much to attacks.
|
|
|
|
|
|
|
|
%XXX rewrite the above so it sounds less like a grant proposal and
|
|
|
|
%more like a "if somebody were to try to solve this, maybe this is a
|
|
|
|
%good first step".
|
|
|
|
|
|
|
|
%We should implement the above incentive scheme in the
|
|
|
|
%deployed Tor network, in conjunction with our plans to add the necessary
|
|
|
|
%associated scalability mechanisms. We will do experiments (simulated
|
|
|
|
%and/or real) to determine how much the incentive system improves
|
|
|
|
%efficiency over baseline, and also to determine how far we are from
|
|
|
|
%optimal efficiency (what we could get if we ignored the anonymity goals).
|
|
|
|
|
|
|
|
\subsection{Peer-to-peer / practical issues}
|
2005-01-07 04:22:18 +01:00
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
Making use of servers with little bandwidth. How to handle hammering by
|
|
|
|
certain applications.
|
2005-01-22 09:35:01 +01:00
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
Handling servers that are far away from the rest of the network, e.g. on
|
|
|
|
the continents that aren't North America and Europe. High latency,
|
|
|
|
often high packet loss.
|
2005-01-22 09:35:01 +01:00
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
Running Tor servers behind NATs, behind great-firewalls-of-China, etc.
|
|
|
|
Restricted routes. How to propagate to everybody the topology? BGP
|
|
|
|
style doesn't work because we don't want just *one* path. Point to
|
|
|
|
Geoff's stuff.
|
2005-01-22 09:35:01 +01:00
|
|
|
|
2005-01-26 01:39:03 +01:00
|
|
|
\subsection{ISP-class adversaries}
|
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
Routing-zones. It seems that our threat model comes down to diversity and
|
|
|
|
dispersal. But hard for Alice to know how to act. Many questions remain.
|
2005-01-22 09:35:01 +01:00
|
|
|
|
2005-01-26 01:39:03 +01:00
|
|
|
\subsection{The China problem}
|
|
|
|
|
|
|
|
We have lots of users in Iran and similar (we stopped
|
2005-01-25 11:38:09 +01:00
|
|
|
logging, so it's hard to know now, but many Persian sites on how to use
|
|
|
|
Tor), and they seem to be doing ok. But the China problem is bigger. Cite
|
|
|
|
Stefan's paper, and talk about how we need to route through clients,
|
|
|
|
and we maybe we should start with a time-release IP publishing system +
|
|
|
|
advogato based reputation system, to bound the number of IPs leaked to the
|
|
|
|
adversary.
|
2005-01-22 09:35:01 +01:00
|
|
|
|
2005-01-25 11:38:09 +01:00
|
|
|
\section{The Future}
|
|
|
|
\label{sec:conclusion}
|
2005-01-22 09:35:01 +01:00
|
|
|
|
|
|
|
|
|
|
|
\bibliographystyle{plain} \bibliography{tor-design}
|
|
|
|
|
2005-01-22 02:35:29 +01:00
|
|
|
\end{document}
|
|
|
|
|