cite the anonnet i meant to cite.

svn:r704

doc/tor-design.bib

@@ -20,8 +20,7 @@
 @misc{eax,
   author = "M. Bellare and P. Rogaway and D. Wagner",
   title = "A conventional authenticated-encryption mode",
-  text = "M. Bellare, P. Rogaway, and D. Wagner. A conventional authenticated-encryption
-    mode. Manuscript, April 2003. www.cs.ucdavis.edu/\~{}rogaway",
+  howpublished = {Manuscript},
   month = {April},
   year = {2003},
 }
@@ -35,7 +34,7 @@
 @Misc{anonymizer,
   key =          {anonymizer},
   title =        {The {Anonymizer}},
-  note =         {\url{http://www.anonymizer.com/}}
+  note =         {\url{http://anonymizer.com/}}
 }
 
 @Misc{privoxy,
@@ -44,6 +43,18 @@
   note =         {\url{http://www.privoxy.org/}}
 }
 
+@inproceedings{RRMPH02-1,
+  title = {{Analysis of an Anonymity Network for Web Browsing}}, 
+  author = {Marc Rennhard and Sandro Rafaeli and Laurent Mathy and Bernhard Plattner and
+        David Hutchison}, 
+  booktitle = {{Proceedings of the IEEE 7th Intl. Workshop on Enterprise Security (WET ICE
+        2002)}}, 
+  year = {2002}, 
+  month = {June}, 
+  address = {Pittsburgh, USA}, 
+  pages = {49--54}, 
+}
+
 @Misc{anonnet,
   key =          {anonnet},
   title =        {{AnonNet}},

doc/tor-design.tex

@@ -333,7 +333,7 @@ build the anonymous channel all at once, using a layered ``onion'' of
 public-key encrypted messages, each layer of which provides a set of session
 keys and the address of the next server in the channel.  Tor as described
 herein, Tarzan, Morphmix, Cebolla \cite{cebolla}, and AnonNet
-\cite{anonnet} build the
+\cite{RRMPH02-1} build the
 channel in stages, extending it one hop at a time. This approach
 makes perfect forward secrecy feasible.
 
@@ -988,7 +988,7 @@ incoming bytes.
 % In response, you send lots of 256 byte cells.  Can I use this to 
 % make you exceed your outgoing bandwidth limit by a factor of 256?
 
-Further, inspired by Rennhard et al's design in \cite{anonnet}, a
+Further, inspired by Rennhard et al's design in \cite{RRMPH02-1}, a
 circuit's edges heuristically distinguish interactive streams from bulk
 streams by comparing the frequency with which they supply cells.  We can
 provide good latency for interactive streams by giving them preferential