[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[freehaven-cvs] the table fits
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.pdf taxonomy.tex
Log Message:
the table fits
the bibliography is in style 'plain'
multiple-cites are now in numerical order
we're now 16 pages
Index: taxonomy.bib
===================================================================
RCS file: /home/freehaven/cvsroot/doc/batching-taxonomy/taxonomy.bib,v
retrieving revision 1.9
retrieving revision 1.10
diff -u -d -r1.9 -r1.10
--- taxonomy.bib 22 Oct 2002 22:42:57 -0000 1.9
+++ taxonomy.bib 1 Nov 2002 22:42:15 -0000 1.10
@@ -24,7 +24,7 @@
booktitle = {Principles of Distributed Computing - {PODC} '99},
year = 1999,
publisher = {ACM},
- note = {\newline \url{http://citeseer.nj.nec.com/jakobsson99flash.html}},
+ note = {\url{http://citeseer.nj.nec.com/jakobsson99flash.html}},
}
@InProceedings{mix-acc,
@@ -37,7 +37,7 @@
year = 2001,
editor = {Ira Moskowitz},
publisher = {Springer-Verlag, LNCS 2137},
- note = {\newline \url{http://www.freehaven.net/papers.html}},
+ note = {\url{http://www.freehaven.net/papers.html}},
}
@@ -49,7 +49,7 @@
year = 2002,
editor = {Matt Blaze},
publisher = {Springer Verlag, LNCS (forthcoming)},
- note = {\newline \url{http://www.freehaven.net/papers.html}}
+ note = {\url{http://www.freehaven.net/papers.html}}
}
@article{chaum81untraceable,
Index: taxonomy.pdf
===================================================================
RCS file: /home/freehaven/cvsroot/doc/batching-taxonomy/taxonomy.pdf,v
retrieving revision 1.6
retrieving revision 1.7
diff -u -d -r1.6 -r1.7
Binary files /tmp/cvsH6s5Aw and /tmp/cvsiJ2YZV differ
Index: taxonomy.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/batching-taxonomy/taxonomy.tex,v
retrieving revision 1.37
retrieving revision 1.38
diff -u -d -r1.37 -r1.38
--- taxonomy.tex 29 Oct 2002 16:52:29 -0000 1.37
+++ taxonomy.tex 1 Nov 2002 22:42:16 -0000 1.38
@@ -5,8 +5,8 @@
\usepackage[dvips]{graphicx}
-%\bibliographystyle{plain}
-\bibliographystyle{try1}
+\bibliographystyle{plain}
+%\bibliographystyle{try1}
\newtheorem{exa}{Example}
\newcommand{\piece} {\mathbin{\mathit{frac}}}
@@ -66,7 +66,7 @@
Many modern anonymity systems are based on mixes. Chaum first
introduced the concept in 1981 \cite{chaum81untraceable}, and since
then researchers and developers have described many mix variations,
-eg. \cite{flash-mix,babel,Kesdogan98}. These have different aims and
+eg. \cite{babel,flash-mix,Kesdogan98}. These have different aims and
approaches, yet we still fail to understand the performance and
anonymity tradeoffs between them.
@@ -889,7 +889,7 @@
that messages will leave each mix predictably.
Yet more verification
schemes that work in a system with pool mixes are described in
-\cite{Jer2000,FGJP98}. There the authors propose a commitment scheme
+\cite{FGJP98,Jer2000}. There the authors propose a commitment scheme
which ensures that the mix commits to a decision before he receives the
target message, and his actions are verifiable by the sender of the
target message.
@@ -1062,49 +1062,51 @@
\begin{center}
\renewcommand{\arraystretch}{1.3}
-\begin{tabular}[b]{|l|c||c|c|c||c|c|c|}
+\begin{tabular}[b]{|l|c||c||c|c|}
\hline
-\multicolumn{2}{|c||}{}&\multicolumn{3}{c||}{Delay} & \multicolumn{3}{c|}{Anonymity} \\
-\cline{3-8}
-\multicolumn{2}{|c||}{} & Avg. & Min. & Max. & Avg. & Min. & Max \\
+\multicolumn{2}{|c||}{}& Average & \multicolumn{2}{c|}{Anonymity} \\
+\cline{4-5}
+\multicolumn{2}{|c||}{} & Delay & Min. & Max \\
\hline
- & Threshold & $\frac{n-1}{2r}$ & $\epsilon$ & $\infty$ & $n$ & $n$ & $n$ \\
+ & Threshold & $\frac{n-1}{2r}$ & $n$ & $n$ \\
-\cline{2-8}
+\cline{2-5}
- & Timed & $\frac{t}{2}$ & $\epsilon$ & $t-\epsilon$ & $rt$ & 0 & mix capacity \\
+ & Timed & $\frac{t}{2}$ & 0 & mix capacity \\
-\cline{2-8}
+\cline{2-5}
-\raisebox{1.5ex}[0pt]{Simple } & Thresh.\ or Time & & $\epsilon$ & $t - \epsilon$ & & 0 & n \\
+\raisebox{1.5ex}[0pt]{Simple } & Thresh.\ or Time & & 0 & n \\
-\cline{2-8}
+\cline{2-5}
- & Thresh.\ \& Time & & $\epsilon$ & $\infty$ & & $n$ & mix capacity \\
+ & Thresh.\ \& Time & & $n$ & mix capacity \\
\hline \hline
-Constant & Threshold & $(1+\frac{f}{n+f})\frac{n}{r}$ & $\epsilon$ & $\infty$ & & $\geq n$ & $-\left(1 - \frac{f}{n}\right) \log{(n + f)} + \frac{f}{n}\log{f}$
+Constant & Threshold & $(1+\frac{f}{n+f})\frac{n}{r}$ & $\geq n$ &
+$-\left(1 - \frac{f}{n}\right) \log{(n + f)} + \frac{f}{n}\log{f}$
\\
-\cline{2-8}
+\cline{2-5}
-Pool & Timed & & $\epsilon$ & $\infty$ & & $\geq 1$ & $<$ total \# of senders \\
+Pool & Timed & & $\geq 1$ & $<$ total \# of senders \\
-%\cline{2-8}
+%\cline{2-5}
\hline
-Dynamic & Cottrell & & $\epsilon$ & $\infty$ & & $\geq 1$ & $<$ total \# of senders \\
+Dynamic & Cottrell & & $\geq 1$ & $<$ total \# of senders \\
-\cline{2-8}
+\cline{2-5}
-Pool & Thresh.\ \& Time & & $\epsilon$ & $\infty$ & & $\geq n$ & $<$ total \# of senders \\
+Pool & Thresh.\ \& Time & & $\geq n$ & $<$ total \# of senders \\
\hline
\end{tabular}
\end{center}
+
\section*{Acknowledgements}
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/