[Author Prev][Author Next][Thread Prev][Thread Next][Author Index][Thread Index]
[freehaven-cvs] Update the bib with missing references.
Update of /home/freehaven/cvsroot/doc/sync-batching
In directory moria.mit.edu:/tmp/cvs-serv25517/sync-batching
Modified Files:
sync-batching.bib sync-batching.tex
Log Message:
Update the bib with missing references.
Add the small changes to the tex file to avoid another case of
redundant cleaning latex and merging conflicts.
Index: sync-batching.bib
===================================================================
RCS file: /home/freehaven/cvsroot/doc/sync-batching/sync-batching.bib,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- sync-batching.bib 13 Jan 2004 02:05:35 -0000 1.1
+++ sync-batching.bib 20 Jan 2004 19:54:32 -0000 1.2
@@ -51,6 +51,20 @@
pages = {2--15},
}
+@InProceedings{mix-acc,
+ author = {Roger Dingledine and Michael J. Freedman and David
+ Hopwood and David Molnar},
+ title = {{A Reputation System to Increase MIX-net
+ Reliability}},
+ booktitle = {Information Hiding (IH 2001)},
+ pages = {126--141},
+ year = 2001,
+ editor = {Ira S. Moskowitz},
+ publisher = {Springer-Verlag, LNCS 2137},
+ note = {\url{http://www.freehaven.net/papers.html}}
+}
+
+
@inproceedings{trickle02,
title = {From a Trickle to a Flood: Active Attacks on Several Mix Types},
author = {Andrei Serjantov and Roger Dingledine and Paul Syverson},
@@ -62,6 +76,31 @@
www_pdf_url = {http://freehaven.net/doc/batching-taxonomy/taxonomy.pdf},
}
+@InProceedings{Diaz02,
+ author = {Claudia Diaz and Stefaan Seys and Joris Claessens
+ and Bart Preneel},
+ title = {Towards measuring anonymity},
+ booktitle = {Privacy Enhancing Technologies (PET 2002)},
+ year = 2002,
+ editor = {Roger Dingledine and Paul Syverson},
+ month = {April},
+ publisher = {Springer-Verlag, LNCS 2482},
+ note = {\url{http://www.freehaven.net/papers.html}}
+}
+
+
+@InProceedings{Serj02,
+ author = {Andrei Serjantov and George Danezis},
+ title = {Towards an Information Theoretic Metric for Anonymity},
+ booktitle = {Privacy Enhacing Technologies (PET 2002)},
+ year = 2002,
+ editor = {Roger Dingledine and Paul Syverson},
+ publisher = {Springer-Verlag, LNCS 2482},
+ month = {April},
+ note = {\url{http://www.freehaven.net/papers.html}}
+}
+
+
@inproceedings{limits-open,
title = {Limits of Anonymity in Open Environments},
author = {Dogan Kesdogan and Dakshi Agrawal and Stefan Penz},
@@ -90,15 +129,23 @@
publisher = {USENIX},
}
-@misc{mixmaster-spec,
- title = {Mixmaster {P}rotocol --- {V}ersion 2},
- author = {Ulf M{\"o}ller and Lance Cottrell and Peter Palfrader and Len Sassaman},
- year = {2003},
- month = {July},
- howpublished = {Draft},
- www_txt_url = {http://www.abditum.com/mixmaster-spec.txt},
+@Misc{mixmaster-attacks,
+ author = {Lance Cottrell},
+ title = {Mixmaster and Remailer Attacks},
+ note = {\url{http://www.obscura.com/~loki/remailer/remailer-essay.html}},
}
+@Misc{mixmaster-spec,
+ author = {Ulf M{\"o}ller and Lance Cottrell and Peter
+ Palfrader and Len Sassaman},
+ title = {Mixmaster {P}rotocol --- {V}ersion 2},
+ year = {2003},
+ month = {July},
+ howpublished = {Draft},
+ note = {\url{http://www.abditum.com/mixmaster-spec.txt}},
+}
+
+
@inproceedings{stop-and-go,
title = {Stop-and-Go {MIX}es: Providing Probabilistic Anonymity in an Open System},
author = {Dogan Kesdogan and Jan Egner and Roland B\"uschkes},
Index: sync-batching.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/sync-batching/sync-batching.tex,v
retrieving revision 1.7
retrieving revision 1.8
diff -u -d -r1.7 -r1.8
--- sync-batching.tex 20 Jan 2004 19:31:25 -0000 1.7
+++ sync-batching.tex 20 Jan 2004 19:54:32 -0000 1.8
@@ -39,7 +39,7 @@
\section{Introduction}
\label{sec:intro}
-Modern deployed mix networks, including Mixmaster \cite{mixmaster} and
+Modern deployed mix networks, including Mixmaster \cite{mixmaster-spec} and
its successor Mixminion \cite{minion-design}, are subject to partitioning
attacks: a passive adversary can observe the network until a target
message happens to stand out from the others \cite{disad-free-routes},
@@ -150,8 +150,10 @@
Typically we would have $t_\mathrm{hop} < t_\mathrm{batch}/\ell$, so the
latency is at most $2t_\mathrm{batch}$, independent of the path length.
-%[Or for free-route topology, we could let t_hop be t_batch, and now
-%it takes \ell batch times to go through, but it mixes with the other
+
+%[Or for free-route topology, we could let $t_\mathrm{hop}$ be
+%$t_\mathrm{batch}$, and now
+%it takes $\ell$ batch times to go through, but it mixes with the other
%batches.]
Let $T_\mathrm{batch}$ be the expected throughput in a single batch period,
@@ -224,10 +226,11 @@
to one time unit, but in each subheader specify "drop if not received in
period t1" and "send in period t2".
-Even more general would be "drop if not received between $t1_\mathrm{start}$ and
-$t1_\mathrm{end}$" and "send between $t2_\mathrm{start}$ and
-$t2_\mathrm{end}$, chosen uniformly at random".
-This can support almost all batching designs.
+Even more general would be "drop if not received between
+$t1_\mathrm{start}$ and $t1_\mathrm{end}$" and "send between
+$t2_\mathrm{start}$ and $t2_\mathrm{end}$, chosen uniformly at
+random". This can support almost all batching designs.
+
\subsection{Robust mixes}
@@ -299,6 +302,7 @@
point out that we could use 16x4 for a fair comparison, or we could
use $16 \times \ell$ to get more or less anonymity.
+
\subsection{further Assumptions}
also discuss how scenario 3 makes a different assumption about the
adversary, since watching all the nodes requires more power than just
@@ -367,7 +371,9 @@
I just reread George's paper, particularly section 5.1. I think he has
the beginnings of a solution there.
-% http://freehaven.net/anonbib/#danezis:pet2003
+http://freehaven.net/anonbib/\#danezis:pet2003
+
+
\subsection{Blending and flooding attacks}
***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs in the body. http://freehaven.net/