[freehaven-cvs] flesh out section 1.

[arma@seul.org (Roger Dingledine)]

Update of /home/freehaven/cvsroot/doc/sync-batching
In directory moria.mit.edu:/home2/arma/work/freehaven/doc/sync-batching

Modified Files:
	sync-batching.tex 
Log Message:
flesh out section 1.


Index: sync-batching.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/sync-batching/sync-batching.tex,v
retrieving revision 1.17
retrieving revision 1.18
diff -u -d -r1.17 -r1.18
--- sync-batching.tex	22 Jan 2004 01:51:20 -0000	1.17
+++ sync-batching.tex	22 Jan 2004 02:32:42 -0000	1.18
@@ -17,20 +17,19 @@
     }}{\end{list}}
 
 \begin{document}
-%\title{Improved Anonymity from Synchronous Batching}
 %\title{The Disadvantages of Cascade Mix Networks and How to Overcome Them}
-\title{Synchronous Batching in Mix Networks}
-% need a better title
+%\title{Synchronous Batching:\\Cascade Networks vs Free-Route Networks
+\title{Synchronous Batching:\\From Cascade Networks to Free Routes
+\thanks{Portions of this paper were inspired by discussions with David
+Hopwood. We would consider him an author, but have been unable to contact
+him since beginning the paper. We'll keep trying.}}
 
 \author{Roger Dingledine\inst{1} and Vitaly Shmatikov\inst{2} and Paul Syverson\inst{3}}
-% XXX add a footnote here about David Hopwood, how he should be an
-%     author, but we can't find him (but we'll keep trying).
 \institute{The Free Haven Project \email{(arma@freehaven.net)} \and
-Vitaly's affiliation \and
+SRI International \email{(shmat@csl.sri.com)} \and
 Naval Research Lab \email{(syverson@itd.nrl.navy.mil)}}
 
 \maketitle
-%\centerline{\LARGE\bf *DRAFT* --- not for publication}
 %======================================================================
 \begin{abstract}
 
@@ -40,7 +39,7 @@
 in various topologies including a free-route network (a topology where
 senders choose paths freely), and that such topologies can provide better
 anonymity and better message reliability in the face of node failure
-than a cascade network (where users choose from a set of fixed paths).
+than a cascade network (where senders choose from a set of fixed paths).
 
 \end{abstract}
 %======================================================================
@@ -56,8 +55,8 @@
 Berthold et al argue in \cite{disad-free-routes} that partitioning
 opportunities arise because the networks use a \emph{free-route}
 topology---one where the sender can choose the mixes that make up her
-message's path. They suggest instead a \emph{cascade} topology, where
-all senders use the same fixed path through the mix network.
+message's path. They suggest instead a \emph{cascade network} topology,
+where all senders choose from a few fixed paths through the mix network.
 
 Here we argue that the cascade design resolves the attacks not because
 of its network topology but because of a property of its batching
@@ -82,15 +81,26 @@
 
 \end{tightlist}
 
-We investigate synchronous batching in three topologies: cascade,
-stratified (a restricted route), and free-route. We find that the foo
-topology provides the highest expected anonymity of these three.
-
-
-In Section~\ref{sec:foo} we describe foo, in bar bar, etc.
+We investigate synchronous batching in three network topologies:
+cascade, stratified (a restricted route), and free-route. We find that
+the free-route network provides the highest expected anonymity as well
+as the best robustness to node failure.
 
+%In Section~\ref{sec:sync-batching},
+Next we describe the synchronous batching model in more
+detail. Then in Section~\ref{sec:related} we relate previous work
+to synchronous batching, including refuting each of the arguments in
+\cite{disad-free-routes}. Section~\ref{sec:scenarios} presents the three
+topologies in detail, and provides a walk-through of calculating entropy
+(average anonymity the sender expects from the network) for each. Then we
+use a model checker to automatically calculate the entropy for networks
+with 16 nodes, and present results in Section~\ref{sec:graphs}. We go on
+in Section~\ref{sec:other} to consider other metrics such as robustness,
+and wrap up in Section~\ref{sec:conclusion} with future work and other
+possible extensions.
 
 \section{Synchronous batching}
+\label{sec:sync-batching}
 
 A mix-net design groups messages into batches and chooses paths; the
 approaches it uses affect the degree of anonymity it can provide
@@ -171,6 +181,7 @@
 will be $\frac{T_{batch}}{wt_{hop}} = \frac{nT_{batch}}{wt_{batch}}$.
 
 \section{Related work}
+\label{sec:related}
 
 Which system is advantageous depends on the adversary model and the
 desired security properties. Against an adversary who can observe only
@@ -299,6 +310,7 @@
 
 
 \section{Scenarios}
+\label{sec:scenarios}
 
 explain threat model: adversary can see all incoming and outgoing
 messages at the network edges
@@ -401,6 +413,7 @@
 \clearpage
 
 \section{Other considerations}
+\label{sec:other}
 
 \subsection{Choosing the same node twice in a row}
 %{Choose path hops with or without replacement?}
@@ -680,6 +693,7 @@
 cascade, respectively) will be more uniform.
 
 \section{Extensions and Future Work}
+\label{sec:conclusion}
 
 In practice, several considerations have to be balanced when choosing
 a batching strategy and network structure. These include maximizing

***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs       in the body. http://freehaven.net/