[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[freehaven-cvs] resolving a few typos
Update of /home/freehaven/cvsroot/doc/batching-taxonomy
In directory moria.seul.org:/home/arma/work/freehaven/doc/batching-taxonomy
Modified Files:
taxonomy.bib taxonomy.tex
Log Message:
resolving a few typos
Index: taxonomy.bib
===================================================================
RCS file: /home/freehaven/cvsroot/doc/batching-taxonomy/taxonomy.bib,v
retrieving revision 1.8
retrieving revision 1.9
diff -u -d -r1.8 -r1.9
--- taxonomy.bib 6 Sep 2002 22:38:32 -0000 1.8
+++ taxonomy.bib 22 Oct 2002 22:42:57 -0000 1.9
@@ -48,7 +48,7 @@
booktitle = {Financial Cryptography (FC '02)},
year = 2002,
editor = {Matt Blaze},
- publisher = {Springer Verlag, LNCS (forthocoming)},
+ publisher = {Springer Verlag, LNCS (forthcoming)},
note = {\newline \url{http://www.freehaven.net/papers.html}}
}
Index: taxonomy.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/batching-taxonomy/taxonomy.tex,v
retrieving revision 1.31
retrieving revision 1.32
diff -u -d -r1.31 -r1.32
--- taxonomy.tex 9 Sep 2002 22:28:53 -0000 1.31
+++ taxonomy.tex 22 Oct 2002 22:42:57 -0000 1.32
@@ -277,7 +277,7 @@
are $n-1$ messages already in the mix). The maximum delay can be
infinite (the target arrives at a mix and no more ever arrive).
Assuming a constant rate of arrival of messages $r$, we can calculate
-the mean delay: $\frac{n}{2r}$.
+the mean delay: $\frac{n-1}{2r}$.
\paragraph*{Anonymity:} The anonymity set against a passive
adversary has $n$ elements.
@@ -1071,7 +1071,7 @@
\hline
- & Threshold & $\frac{n}{2r}$ & $\epsilon$ & $\infty$ & $n$ & $n$ & $n$ \\
+ & Threshold & $\frac{n-1}{2r}$ & $\epsilon$ & $\infty$ & $n$ & $n$ & $n$ \\
\cline{2-8}
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/