[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
[freehaven-cvs] Fix list of acks, fix latex error, fix spelling of C...
Update of /home2/freehaven/cvsroot/doc/mixmaster-vs-reliable
In directory moria.mit.edu:/tmp/cvs-serv28414
Modified Files:
mixvreliable.tex
Log Message:
Fix list of acks, fix latex error, fix spelling of Clauda's name.
Index: mixvreliable.tex
===================================================================
RCS file: /home2/freehaven/cvsroot/doc/mixmaster-vs-reliable/mixvreliable.tex,v
retrieving revision 1.45
retrieving revision 1.46
diff -u -d -r1.45 -r1.46
--- mixvreliable.tex 1 Jul 2004 11:26:29 -0000 1.45
+++ mixvreliable.tex 1 Jul 2004 11:35:03 -0000 1.46
@@ -131,7 +131,7 @@
\end{verbatim}
Mixmaster is represented in the generalized mix model (GMM) proposed by
-D\'iaz and Serjantov~\cite{DS03} as shown in
+D\'{\i}az 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 that a message is
flushed by the mix, as a function of the number $n$ of
@@ -170,7 +170,7 @@
pool mix network in mind, these timestamps are not used, nor is it clear
that they could be utilized effectively since the sender is choosing the
delay for each hop in the path. Reliable thus does not provide any
-resistance to this kind of active attack.
+resistance to this kind of active attack.}
In Reliable, the delay may be chosen by the sender from an exponential
distribution of mean one hour. If the sender does not provide any delay to
@@ -261,7 +261,7 @@
comparative statistics, as we do in this paper.
To measure Mixmaster's sender and recipient anonymity, we have applied the
-formulas provided by D\'iaz and Preneel in~\cite{diaz_ih04}. The anonymity
+formulas provided by D\'{\i}az and Preneel in~\cite{diaz_ih04}. The anonymity
of Reliable has been measured using the formulas presented in
Appendix~\ref{form-reliable}. Note that we could not apply the method used
by Kesdogan~\cite{stop-and-go} because we did not make any assumption on
@@ -840,10 +840,10 @@
The authors also wish to thank Jasper Scholten for an assessment of the
-feasibility of some simulation algorithms, Peter Palfrader for his
-comments on our conclusions as well as assistance with the gathering of
-input data for our simulations, members of The Shmoo Group for discussion
-of secure programming issues, and Roger Dingledine, Ben Laurie and the
+feasibility of some simulation algorithms; Peter Palfrader for his
+comments on our conclusions, as well as assistance with the gathering of
+input data for our simulations; members of The Shmoo Group for discussion
+of secure programming issues; and Roger Dingledine, Ben Laurie and the
anonymous reviewers for valuable comments.
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/