[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
[freehaven-cvs] making the paper single-column friendly
Update of /home/freehaven/cvsroot/doc/routing-zones
In directory moria.mit.edu:/tmp/cvs-serv32465
Modified Files:
endpoint-tables.tex network-tables.tex routing-zones.ps
routing-zones.tex sig-alt-full.cls
Log Message:
making the paper single-column friendly
adding keywords, copyright info, etc.
change the font to times (more space-efficient)
remove some widows
Index: endpoint-tables.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/endpoint-tables.tex,v
retrieving revision 1.6
retrieving revision 1.7
diff -u -d -r1.6 -r1.7
--- endpoint-tables.tex 25 Aug 2004 11:37:57 -0000 1.6
+++ endpoint-tables.tex 27 Aug 2004 19:42:42 -0000 1.7
@@ -1,5 +1,5 @@
-\begin{table*}[h!]
-%%\begin{small}
+%\begin{table*}[h!]
+\begin{scriptsize}
%%\label{table:tor-network}
\begin{center}
\begin{tabular}{l|lp{2in}|l|l}
@@ -23,8 +23,7 @@
www.yahoo.com & 17110 \\
www.indymedia.org & 22489 \\
www.geocities.com & 26101 \\
-\vspace{8in}
\end{tabular}
\end{center}
-%%\end{small}
-\end{table*}
+\end{scriptsize}
+%\end{table*}
Index: network-tables.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/network-tables.tex,v
retrieving revision 1.11
retrieving revision 1.12
diff -u -d -r1.11 -r1.12
--- network-tables.tex 25 Aug 2004 11:37:57 -0000 1.11
+++ network-tables.tex 27 Aug 2004 19:42:42 -0000 1.12
@@ -1,5 +1,4 @@
-\begin{table*}
-\begin{small}
+\begin{scriptsize}
%%\caption{Mixmaster nodes as of June 2004}
%%\label{table:tor-network}
\begin{center}
@@ -61,10 +60,10 @@
\hline
\end{tabular}
\end{center}
-\end{small}
-\end{table*}
-\begin{table*}
-\begin{small}
+\end{scriptsize}
+%\end{table*}
+%\begin{table*}
+\begin{scriptsize}
%%\caption{Tor nodes as of June 2004}
%%\label{table:tor-network}
\begin{center}
@@ -110,5 +109,5 @@
\hline
\end{tabular}
\end{center}
-\end{small}
-\end{table*}
+\end{scriptsize}
+%\end{table*}
Index: routing-zones.ps
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/routing-zones.ps,v
retrieving revision 1.4
retrieving revision 1.5
diff -u -d -r1.4 -r1.5
--- routing-zones.ps 25 Aug 2004 11:37:57 -0000 1.4
+++ routing-zones.ps 27 Aug 2004 19:42:42 -0000 1.5
@@ -1,16 +1,16 @@
%!PS-Adobe-2.0
%%Creator: dvips(k) 5.86 Copyright 1999 Radical Eye Software
%%Title: routing-zones.dvi
-%%Pages: 16
+%%Pages: 11
%%PageOrder: Ascend
%%BoundingBox: 0 0 612 792
%%DocumentFonts: Helvetica-Bold Helvetica Times-Bold Times-Roman
-%%+ Times-Italic
+%%+ Times-Italic Courier Times-BoldItalic
%%EndComments
[...5786 lines suppressed...]
+1169 1914 V 206 w(66.93.132.237)p 1651 1914 V 147 w(US)p
+1932 1914 V 206 w(23504)f(\(Speak)o(easy)h(Inc\))p 3124
+1914 V 753 1980 V 800 1960 a(metacolo)p 1169 1980 V 194
+w(193.111.87.20)p 1651 1980 V 147 w(US)p 1932 1980 V
+206 w(24812)f(\(MetaColo)g(AS\))p 3124 1980 V 753 2047
+V 800 2027 a(ned)p 1169 2047 V 326 w(80.190.251.24)p
+1651 2047 V 147 w(DE)p 1932 2047 V 199 w(24900)g(\(IPX)f(Ser)o(v)o
+(er\))p 3124 2047 V 753 2113 V 800 2093 a(petra)p 1169
+2113 V 284 w(69.20.9.201)p 1651 2113 V 205 w(US)p 1932
+2113 V 206 w(27357)h(\(Rackspace.com\))p 3124 2113 V
+753 2180 V 800 2160 a(TheoryOr)o(g)p 1169 2180 V 136
+w(64.147.163.247)p 1651 2180 V 118 w(US)p 1932 2180 V
+206 w(29752)g(\(SFcolocation\))p 3124 2180 V 753 2246
+V 800 2226 a(incognito)p 1169 2246 V 188 w(199.173.10.10)p
+1651 2246 V 147 w(US)p 1932 2246 V 206 w(29944)g(\(PullThePlug)g(T)-5
+b(echnologies)14 b(LLC\))p 3124 2246 V 755 2249 2371
+4 v Black Black eop
%%Trailer
end
userdict /end-hook known{end-hook}if
Index: routing-zones.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/routing-zones.tex,v
retrieving revision 1.80
retrieving revision 1.81
diff -u -d -r1.80 -r1.81
--- routing-zones.tex 25 Aug 2004 11:37:57 -0000 1.80
+++ routing-zones.tex 27 Aug 2004 19:42:43 -0000 1.81
@@ -1,7 +1,7 @@
\documentclass{sig-alt-full}
-\usepackage{pst-all,epsfig}
+\usepackage{pst-all,epsfig,times}
\usepackage{url}
\newpsobject{showgrid}{psgrid}{subgriddiv=2,griddots=10,gridlabels=6pt}
@@ -22,7 +22,7 @@
\begin{document}
\conferenceinfo{WPES'04,}{October 28, 2004, Washington, DC, USA.}
\CopyrightYear{2004}
-\crdata{1-58113-968-3/04/0010}
+\crdata{1-58113-968-3/04/0010}
%\title{Automated Location Arbitrage}
%\title{Blocking Observers with }
@@ -33,8 +33,8 @@
\numberofauthors{2}
\author{
\alignauthor Nick Feamster\\
- \affaddr{MIT Laboratory for Computer Science}\\
- \email{feamster@lcs.mit.edu}
+ \affaddr{MIT Computer Science and AI Laboratory}\\
+ \email{feamster@csail.mit.edu}
\alignauthor Roger Dingledine\\
\affaddr{The Free Haven Project}\\
\email{arma@mit.edu}
@@ -62,19 +62,29 @@
\end{abstract}
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\category{C.2.2}{Network Protocols}{Routing Protocols}
+\vspace*{-0.1in}
+\terms{Measurement}
+\vspace*{-0.1in}
+\keywords{anonymity, mix networks, interdomain routing}
+
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Introduction}
\label{sec:intro}
-A variety of organizations, ranging from corrupt law enforcement
-to curious ISPs, % to subpoena-wielding religious fanatics
-can passively observe large pieces of the Internet. Anonymity
+Anonymity
networks aim to provide communications privacy for individuals or
groups on the Internet, but these networks are still vulnerable to
-such powerful
-eavesdroppers. Against high-latency \emph{mix networks} such as Mixmaster
-\cite{mixmaster-spec}, an adversary who observes a large volume of
+powerful
+eavesdroppers.
+A variety of organizations, ranging from corrupt law enforcement
+to curious ISPs, % to subpoena-wielding religious fanatics
+can passively observe large pieces of the Internet. Against high-latency
+\emph{mix networks} such as Mixmaster~\cite{mixmaster-spec}, an
+adversary who observes a large volume of
network traffic can notice over time that certain recipients are more
likely to receive messages after particular senders have transmitted messages
\cite{statistical-disclosure,e2e-traffic}. Low-latency
@@ -83,7 +93,7 @@
link sender to recipient through packet counting or timing attacks
\cite{danezis-pet2004,defensive-dropping,SS03}.
-Anonymity designs use three major strategies to mitigate these attacks.
+Anonymity designs use three strategies to mitigate these attacks.
\begin{tightlist}
\item {\bf{Batching and pooling:}} The network collects a group of input
messages and reorders them before they exit, to hinder the adversary
@@ -104,13 +114,13 @@
the overlay
topology so messages can enter or exit at more places in the network
(compared to a cascade topology~\cite{disad-free-routes});
-and by \emph{location arbitrage} --- coordinating network behavior
+and by \emph{location diversity} --- coordinating network behavior
so each transaction is spread over multiple jurisdictions.
-In this paper, we investigate a variant of location arbitrage that
+In this paper, we investigate a variant of location diversity that
takes advantage of the fact that the Internet is divided into thousands
of independently operated networks called {\em autonomous systems}
-(ASes). By considering the topology of the underlying Internet routing,
+(ASes). By considering the underlying topology of Internet routing,
we can assess the vulnerability of existing mix networks to certain classes
of adversary. Specifically, our {\em location
independence} metric reflects the probability that the path to the
@@ -223,17 +233,17 @@
\subsubsection{Border Gateway Protocol}\label{sec:bgp}
The Internet is composed of about 17,000 independently operated networks,
-or autonomous systems (ASes), that exchange reachability information via
+or autonomous systems (ASes), that exchange reachability information using
the Border Gateway Protocol (BGP)~\cite{rfc1771}. An AS could be an
Internet Service Provider (ISP), a corporate network, or a university.
Each AS has a network of routers that route traffic to global
destinations using the information propagated by routing protocols. To
-find the route to a destination IP address, a router typically performs
+find the route to a destination IP address, a router performs
a ``longest prefix match'' on that IP address to
find the most specific IP prefix
in the routing table that contains that IP address. For example, a
-router performing a route lookup for {\em IP address} {\tt 18.31.0.82}
-might find a route for the {\em prefix} {\tt 18.0.0.0/8}. % a prefix that
+to look up {\em IP address} {\tt 18.31.0.82}, a router
+might use a route for the {\em prefix} {\tt 18.0.0.0/8}. % a prefix that
%contains the destination IP address.
The router then forwards packets
for that destination to the next hop specified for the route to the
@@ -242,7 +252,7 @@
had a prefix for, say, {\tt 18.31.0.0/16}, that router would prefer this
route over the former.
-The Internet's routing table has over 130,000 distinct prefixes, each of
+The Internet's routing table has over 130,000 prefixes, each of
which has an associated route. An AS that originates a route
advertises this route to neighboring ASes via BGP and attaches its AS
number to the {\em AS path} of the route. When a router in a neighboring
@@ -264,12 +274,12 @@
\begin{figure}[t]
\include{policy_summary}
-\caption{Summary of common export restrictions and route preferences.}
+\caption{Common relationships and export restrictions.}
\label{fig:policy_summary}
\end{figure}
-BGP is based on {\em
-policy} rather than on shortest paths. For example, the AS in
+BGP routing is based on {\em
+policy}, not on shortest paths. For example, the AS in
Figure~\ref{fig:policy_summary} will
typically prefer to route traffic to a destination via one of its
customers (who pays it for connectivity) than via one of its providers
@@ -282,7 +292,7 @@
will advertise to another---an AS will typically not
advertise a route learned from one of its peers or providers to any of
its other peers or providers: doing so would constitute an implicit
-agreement to forward traffic (i.e., provide ``transit'' service) between
+agreement to forward traffic between
two of its providers, two of its peers, etc. The AS in
Figure~\ref{fig:policy_summary} would advertise routes learned from its
customer to all of its neighbors, but would not readvertise routes learned
@@ -291,25 +301,25 @@
to other peers.
\begin{figure}[t]
-\begin{small}
+\begin{scriptsize}
\begin{verbatim}
- Network Next Hop Metric LocPrf Wgt Path
-*>i18.0.0.0/8 64.243.30.141 100 0 6347 3356 3 i
-* i 65.115.97.141 10 100 0 209 10578 3 i
+ Network Next Hop Metric LocPrf Path
+*>i18.0.0.0/8 64.243.30.141 100 6347 3356 3 i
+* i 65.115.97.141 10 100 209 10578 3 i
\end{verbatim}
-\end{small}
+\end{scriptsize}
\caption{Example BGP routing table entry (taken from a Cisco-like router).}
\label{fig:bgp_example}
\end{figure}
Figure~\ref{fig:bgp_example} shows a simplified BGP routing table entry.
This router has learned two routes to the destination prefix {\tt
-18.0.0.0/8} via BGP. Each route has various attributes, which include
+18.0.0.0/8}. Each route has various attributes, including
the ``next hop'' IP address (where to route packets that use this path),
various attributes that affect which route is selected as the preferred
route to the destination, and the AS path (``Path''). The ``$>$'' at
the beginning of the first line indicates that the router has selected
-this route as the best route to the destination, based on applying the
+this route as the best route to the destination using the
BGP decision process.
Each router can only have a single best route to a destination at
@@ -331,18 +341,18 @@
the differences are minor and occur infrequently~\cite{Mao2003}. }
\subsubsection{AS-level Internet Topology}
-Paths between end-hosts in the Internet cross a sequence of ASes (or
+Paths between end-hosts in the Internet traverse a sequence of ASes (or
jurisdictions); to estimate the sequence of ASes that any given path
crosses, we must first have a representation of the Internet topology at
the AS-level (i.e., the ASes that each AS connects to, as well as their
business relationships). Determining a complete view
of the AS-level graph is notoriously difficult, because bilateral
-policies may hide edges in the graph from some
+policies hide edges in the graph from some
perspectives~\cite{Chang2004}. For example, in
Figure~\ref{fig:policy_summary}, a routing table captured at Peer 1 will
not contain any routes with the $AS \leftrightarrow \mbox{Peer} 2$ link,
since the AS in the center will not readvertise routes learned from one
-peer to another peer.
+peer to another.
There are many publicly-available places that provide access to routing
table data. The most prevalent is the Oregon RouteViews
@@ -698,7 +708,7 @@
%% Tor nodes, current Mixminion nodes, current Mixmaster nodes, and we
%% can compare robustness of the network to zone-based attacks.
-\subsection{Location Independence of Nodes and Paths}
+\subsection{Independence of Mix Nodes and Paths}
In this section, we explore and quantify the location independence
of the Mixmaster and Tor topologies. We examine cases where Tor
@@ -777,6 +787,45 @@
\label{tab:path_ind}
\end{table*}
+
+\begin{figure}[t]
+\begin{minipage}[ht]{6.75cm}
+\mbox{\epsfig{figure=as_observe_all_fwd_log.eps,width=7.75cm}}
+\caption{Fraction of paths where a single AS can observe all
+ of the links in the mix network path.}
+\label{fig:as_observe}
+\end{minipage}
+\hfill
+\begin{minipage}[ht]{6.75cm}
+\mbox{\epsfig{figure=as_observe_75_fwd_log.eps,width=7.75cm}}
+\caption{Fraction of paths where a single AS can observe all but one
+ of the links in the mix network path.%\protect\footnotemark
+}
+\label{fig:as_observe_75}
+\end{minipage}
+\hfill
+\end{figure}
+
+\begin{figure}[h!]
+\begin{minipage}[ht]{6.75cm}
+\mbox{\epsfig{figure=as_observe_all_rev_log.eps,width=7.75cm}}
+\caption{Fraction of paths where a single AS can observe all
+ of the links in the {\em reverse} mix network path.}
+\label{fig:as_observe_rev}
+\end{minipage}
+\hfill
+\begin{minipage}[ht]{6.75cm}
+\mbox{\epsfig{figure=as_observe_75_rev_log.eps,width=7.75cm}}
+\caption{Fraction of paths where a single AS can observe all but one
+ of the links in the {\em reverse} mix network path. ({\em Note:}
+ slightly different $y$-axis scale.)%\protect\footnotemark
+}
+\label{fig:as_observe_75_rev}
+\end{minipage}
+\hfill
+\end{figure}
+
+
%% \begin{table}[t]
%% \begin{tabular}{r|p{1.25in}|p{0.5in}p{0.5in}p{0.5in}p{0.5in}}
%% {\bf Mix Network} & \parbox{1.25in}{{\centering\bf \# of \\ AS-disjoint Edges}} &
@@ -834,45 +883,6 @@
%% links on a 4-hop path'' is 3 out of 4 links.}
-\begin{figure}[t]
-\begin{minipage}[ht]{6.75cm}
-\mbox{\epsfig{figure=as_observe_all_fwd_log.eps,width=7.75cm}}
-\caption{Fraction of paths where a single AS can observe all
- of the links in the mix network path.}
-\label{fig:as_observe}
-\end{minipage}
-\hfill
-\begin{minipage}[ht]{6.75cm}
-\mbox{\epsfig{figure=as_observe_75_fwd_log.eps,width=7.75cm}}
-\caption{Fraction of paths where a single AS can observe all but one
- of the links in the mix network path.%\protect\footnotemark
-}
-\label{fig:as_observe_75}
-\end{minipage}
-\hfill
-\end{figure}
-
-\begin{figure}[t]
-\begin{minipage}[ht]{6.75cm}
-\mbox{\epsfig{figure=as_observe_all_rev_log.eps,width=7.75cm}}
-\caption{Fraction of paths where a single AS can observe all
- of the links in the {\em reverse} mix network path.}
-\label{fig:as_observe_rev}
-\end{minipage}
-\hfill
-\begin{minipage}[ht]{6.75cm}
-\mbox{\epsfig{figure=as_observe_75_rev_log.eps,width=7.75cm}}
-\caption{Fraction of paths where a single AS can observe all but one
- of the links in the {\em reverse} mix network path. ({\em Note:}
- slightly different $y$-axis scale.)%\protect\footnotemark
-}
-\label{fig:as_observe_75_rev}
-\end{minipage}
-\hfill
-\end{figure}
-
-
-
Figure~\ref{fig:as_observe} shows the probability that a single AS will
be able to observe all of the links along the mix network path, for mix
@@ -1326,7 +1336,7 @@
Second, mix networks should strive to deploy more nodes in locations
with rich connectivity to other ASes.
-\subsection{Explicit Consideration of AS-level Paths}
+\subsection{Consideration of AS-level Paths}
Our results suggest that designers and users of mix networks should
take into account the underlying AS-level paths of each link in the mix
@@ -1345,7 +1355,7 @@
of our suggested algorithm on all levels of adversary; we leave this
investigation to future work.
-\subsection{Node Placement}
+\subsection{Improved Node Placement}
%Our analysis of inter-mix network paths suggests that currently deployed
%mix networks could benefit from increased diversity in node placement,
@@ -1471,16 +1481,15 @@
%\section*{Acknowledgments}
+\begin{scriptsize}
\bibliographystyle{plain}
\bibliography{routing-zones}
+\end{scriptsize}
-\pagebreak
+\onecolumn
\begin{appendix}
-\newpage
\section{Summary of Endpoints}\label{sec:send_recv}
\input{endpoint-tables}
-\clearpage
-\newpage
\section{Summary of Mix Networks}\label{sec:mixnode_summary}
\input{network-tables}
\end{appendix}
Index: sig-alt-full.cls
===================================================================
RCS file: /home/freehaven/cvsroot/doc/routing-zones/sig-alt-full.cls,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- sig-alt-full.cls 19 Aug 2004 22:54:36 -0000 1.1
+++ sig-alt-full.cls 27 Aug 2004 19:42:43 -0000 1.2
@@ -1354,7 +1354,7 @@
\def\permission#1{\global\boilerplate{#1}}
%
\global\boilerplate={
-Copyright 2003 Association for Computing Machinery. ACM
+Copyright 2004 Association for Computing Machinery. ACM
acknowledges that this contribution was authored or co-authored
by a contractor or affiliate of the U.S. Government. As such,
the Government retains a nonexclusive, royalty-free right to
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/