[freehaven-cvs] finish tweaking secs 1 and 2

[arma@seul.org (Roger Dingledine)]

Update of /home/freehaven/cvsroot/doc/e2e-traffic
In directory moria.mit.edu:/home2/arma/work/freehaven/doc/e2e-traffic

Modified Files:
	e2e-traffic.tex 
Log Message:
finish tweaking secs 1 and 2


Index: e2e-traffic.tex
===================================================================
RCS file: /home/freehaven/cvsroot/doc/e2e-traffic/e2e-traffic.tex,v
retrieving revision 1.24
retrieving revision 1.25
diff -u -d -r1.24 -r1.25
--- e2e-traffic.tex	24 Jan 2004 21:29:13 -0000	1.24
+++ e2e-traffic.tex	24 Jan 2004 21:40:33 -0000	1.25
@@ -323,11 +323,12 @@
 \[\V{v} \approx b\frac{\sum_{i=1}^t \V{o_i}}{t} - (b-i)\V{u}\]
 
 Danezis also derives a precondition that the attack will only succeed when
-\( m < \frac{N}{b-1} \), and is expected to take
-\[t > \left[ ml \left(\sqrt{\frac{m-1}{m}} +
+\( m < \frac{N}{b-1} \), and calculates the expected number of rounds to
+succeed (with $95\%$ confidence for security parameter $\ell=2$ and $99\%$
+confidence for $\ell=3$):
+
+\[t > \left[ m\ell \left(\sqrt{\frac{m-1}{m}} +
                        \sqrt{\frac{N-1}{N^2}(b-1)} \right) \right]^2 \]
-rounds to succeed with $95\%$ confidence for $l=2$ and $99\%$ confidence for
-$l=3$.
 
 %======================================================================
 \section{Extending the statistical disclosure attack}

***********************************************************************
To unsubscribe, send an e-mail to majordomo@seul.org with
unsubscribe freehaven-cvs       in the body. http://freehaven.net/