[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
[freehaven-cvs] Fix spelling, add URL reference for the Mixmaster sp...
Update of /home2/freehaven/cvsroot/doc/mixmaster-vs-reliable
In directory moria.mit.edu:/tmp/cvs-serv24592
Modified Files:
mixvreliable.tex
Log Message:
Fix spelling, add URL reference for the Mixmaster spec.
Index: mixvreliable.tex
===================================================================
RCS file: /home2/freehaven/cvsroot/doc/mixmaster-vs-reliable/mixvreliable.tex,v
retrieving revision 1.24
retrieving revision 1.25
diff -u -d -r1.24 -r1.25
--- mixvreliable.tex 30 Jun 2004 23:56:14 -0000 1.24
+++ mixvreliable.tex 1 Jul 2004 00:11:40 -0000 1.25
@@ -71,7 +71,7 @@
necessary. As individual nodes are the basic component to the network of
mixes, we aim to provide information to be considered when choosing this
component. We have used as input real-life data gathered from a popular
-remailer, and simulated the behaviour of the mix.
+remailer, and simulated the behavior of the mix.
% (Len) Summary of what we have done
@@ -137,7 +137,7 @@
else s=0.65*n;
\end{verbatim}
-Mixmaster is represented in the generalised mix model proposed by
+Mixmaster is represented in the generalized mix model proposed by
D\'iaz and Serjantov~\cite{DS03} as shown in
figure~\ref{fig-mm}. In this model, the mix is represented at the time of
flushing. The function $P(n)$ represents the probability of a message
@@ -241,7 +241,7 @@
in~\cite{Serj02} and by D\'{\i}az \emph{et al.} in \cite{Diaz02}. The
difference between the two models for measuring anonymity is that
in~\cite{Diaz02} the entropy is normalized with respect to the number of
-users. In this paper we will use the non-normalized flavour of the metric.
+users. In this paper we will use the non-normalized flavor of the metric.
The anonymity provided by a mix can be computed for the incoming or for
the outgoing messages. We call this \emph{sender anonymity} and
@@ -312,7 +312,7 @@
$1$ hour, and the results obtained do not differ significantly from
the ones presented in this paper (i.e., some messages do not get any
anonymity at all). We do not include these figures here due to a lack
-of space, but they will be added to an extended abstact version of the
+of space, but they will be added to an extended abstract version of the
paper.}. We have assumed
users choose their delays from an exponential distribution. The
mix-chosen uniform delay option has not been taken into account, due
@@ -377,7 +377,7 @@
the evolution of the arrivals per day. We can observe that the traffic
arrived to the mix during the first month is much heavier than in the
following three months. This shows that the input traffic pattern that
-gets to a mix node is highly inpredictable and that the assumption of lambda being
+gets to a mix node is highly unpredictable and that the assumption of lambda being
time-independent cannot be hold.
Figure~\ref{frec-day} shows the frequency in hours and in days of receiving a
@@ -451,7 +451,7 @@
We also observe that the delays of the messages don't take high
values, unless the traffic load getting to the mix is very low.
-In order to study the behaviour of the mix under different traffic loads,
+In order to study the behavior of the mix under different traffic loads,
we have plotted values of delay and anonymity obtained in the simulation
for the rounds with few arrivals (low traffic), intermediate number of
arrivals (medium traffic) and many arrivals (high traffic).
@@ -551,14 +551,14 @@
\subsection{Mixmaster vs. Reliable}
As we have shown in the previous two sections, Mixmaster and Reliable
-have very different behaviours for the same traffic stream. Note that
+have very different behaviors for the same traffic stream. Note that
we have modified the default ($1$ hour) mean delay of Reliable in
order to make a fair comparison between the two mixes (so the average
delay of all messages is the same for the two mixes).
Mixmaster priorizes the anonymity over the delay, and it provides a
minimum recipient (sender)
-anonymity of around $7$, equivalent to perfect indistinguisability
+anonymity of around $7$, equivalent to perfect indistinguishability
among $2^7=128$ input (output) messages. When the traffic load
decreases, Mixmaster provides a larger latency in order to keep the
anonymity in high levels.
@@ -697,7 +697,7 @@
In order to facilitate source code review and verification of an
application's correctness with regard to its implementation of a protocol,
it is beneficial for both good commenting in the source code and a clear
-specification for its behaviour to exist.
+specification for its behavior to exist.
While neither program is sufficiently commented or written clearly enough
to allow a reviewer to easily learn how either system works, there exists
@@ -815,7 +815,7 @@
\subsection{Network timing attacks}
-By analysing the input and output traffic of a mix, a skilled attacker may
+By analyzing the input and output traffic of a mix, a skilled attacker may
be able to deduce the value of pool variables by timing observation. This
affects pool-mixes more than S-G mixes, and possibly aids attacker in some
non-host based active attacks such as $(n-1)$ attacks. The anonymity
@@ -903,7 +903,7 @@
\label{form-reliable}
% BEGIN ADDITION EVELYNE
-To formalize the behaviour of the mixes, we define:
+To formalize the behavior of the mixes, we define:
\begin{itemize}
\item
$X_{s}$ : an incoming message arriving at time $s$;
@@ -1084,7 +1084,7 @@
\bibitem[DS03b]{DS03}
Claudia Diaz and Andrei Serjantov.
\newblock Generalising mixes.
-\newblock In {\em Privacy Enhacing Technologies}, LNCS 2760, Dresden, Germany, April
+\newblock In {\em Privacy Enhancing Technologies}, LNCS 2760, Dresden, Germany, April
2003.
\bibitem[DSCP02]{Diaz02}
@@ -1118,7 +1118,7 @@
\bibitem[MCPS03]{mixmaster-spec}
Ulf M\"oller, Lance Cottrell, Peter Palfrader, and Len Sassaman.
\newblock Mixmaster {P}rotocol --- {V}ersion 2, July 2003.
-
+\newblock {\url{http://www.abditum.com/mixmaster-spec.txt}}
\bibitem[PK00]{Pfitzmann00}
Andreas Pfitzmann and Marit Kohntopp.
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/