Traffic analysis: Protocols, attacks, design issues, and open problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2009, Issue , 2001, Pages 10-29

  Raymond, Jean François ^a  

^a Zero Knowledge Systems Inc   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DESIGN ISSUES; INTERNET BASED; N-O COMPLEXES; TRAFFIC ANALYSIS;

ARTIFICIAL INTELLIGENCE;

EID: 84937555407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44702-4_2     Document Type: Conference Paper

References (42)

1. M Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers, In Advances in Cryptology Eurocrypt '98, volume 1403 of Lecture Notes in Computer Science, pages 437-447. Helsinki, Finland. 31 May-4 June 1998. S p ringer-Verlag.
2. M Abe. Mix-network on permutation networks. In Advances in cryptology ASIACRYPT'99, volume 1716, pages 258-273. Springer-Verlag, 1999.
3. Adam Back. Hashcash. http://www.cypherspace.org/~adam/hashcash/,march 1997,
4. Oliver Bert hold. 11 amies Federrath. and Mar it Kolmlopp. Project anonymity and unobscrvability in the internet. Presented at CFF 2000.
5. Stefan A. Brands. Restrictive blinding of set;ret-key certificates. Technical Report CS-R9509, CWI - Centrum voor Wiskunde en Informatica. February 28. 1995.
6. C. KRT, Advisory ca-90.21: L'cp syn Hooding and ip spooling il larks. '1\ September 1996. 7. I 'In mi ii. I he dining ii'y|il y[vi pliers pi'ohlein: I ticoudil ioitii! sender iind recipient untraceability. Journal of Cryptology. 1:65-75, 1988.
7. David Chanm. Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the A.C.M., 24(2):84-88, February 1981.
8. David Chaum. Blind signatures for untraceable payments. In R. L. Rivest. A. Sherman, and D. Chaum, editors, Proc. CRYPTO 82, pages 199-203, New York, 1983. Plenum Press.
9. Bonny Clior, Oded Goldreieh. Eyal Kushilevifz, and Madhu Sudan. Private information retrieval. In 36th J REE Conference on the Foundations of Computer Science, pages 41-50. IEEE Computer Society Press, 1995.
10. Benny Chor, Oded Coldreich, Eyal Kushilevitz, and Madhu Sudan. Private information retrieval. Journal of the ACM, 45(6):965-981, 1998.
11. David A. Cooper and Kenneth P. Birman. Preserving privacy in a network of mobile computers. In !995 IEEE Symposium on Research in Security and Privacy, pages 26-38. IEEE Computer Society Press, 1995. http://cs-tr.cs.COrnell.edu:80/Dienst/UI/1.0/Display/ncstrI.cornell/TR85-1490.
12. Lance Cottrell. Mixmaster. littp://www.oljscura.com/~loki/.
13. Ronald Cramer. Introduction to secure computation. In Lectures on data security: modern cryptology in theory and practice, volume 1561 of Lecture Notes in Computer Science, pages 16-62. Springer, 1999.
14. Daemon S. Project neptune. Phrack Magazine, 48(7): Pile 13 of 18, 8 November 1996. Available at www.fc.net/phrack/fdes/p48/p48-13.html.
15. Wei Dai. private communication, 1999.
16. Yvo Desmedt and Kaoru Kurosawa. How to break a practical mix and design a new one. To be presented at Eurocrypt 2000,
17. W. Diffie and M. II ell man. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1976.
18. Shlomi Dolev and Rafail Ostrovsky. Efficient anonymous multicast and reception. In Walter Fumy, editor, Advances in Cryptology EUROCRYPT '.97, Lecture Notes in Computer Science, pages 395-409. Springer-Verlag, Berlin Germany, 1997.
19. Cynthia Dwork and Moui Naor. Pricing via processing or combatting junk mail. In Ernest F. Brickell, editor, Advances in Cryptology—CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 139-147. Springer-Verlag, 1993, 16-20 August 1992.
20. Ian Goldberg and Adam Shostack. Freedom network whitepapers.
21. Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431-473, 1996.
22. C. Gulcu and G. Tsudik. Mixing E-mail with ISABEL In Symposium on Network and Distributed Systems Security (NDSS '96), San Diego, California, February 1996. Internet. Society, http://www.zurich.ibm.com/ cgu/publications/gt95.ps.gz.
23. Ceki Gulcu. The anonymous E-mail conversation. Master's thesis, Eurecom Institute. 229 route des Cret.es, F-06904 Sophia-Antipohs. France, June 1995.
24. Jakobsson. A practical mix. In Kaisa Nyberg, editor, Advances in Cryptology -EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 448. Springer-Verlag, 1998.
25. A. Juels and J. Braiuard. Client puzzles: A cryptographic defense against connection depletion attacks. In S. Kent, editor, NDSS '99 (Networks and Distributed Security Systems), pages 151 165, 2000.
26. D. Kahn. The Codebreakcrs. Macuiillan Publishing Company. 1967.
27. John Kelsey. private communication. 1999.
28. Dogan Kesdogan, Jan Egner, and Roland Ruschkes. Stop-and-go mixes providing probabilistic security in an open system. In David Aucsmith, editor. hijoTmation Hiding: Second International Workshop, volume 1525 ol Lecture Notes in Computer Science, pages 83-98. Springer-Verlag, Berlin, Germany, 1998.
29. W Ogata, K Kurosawa, K Sako, and K Takatani. Fault tolerant anonymous channel. In Information and Communications Security — First International Conference, volume 1334 of Lecture Notes in Computer Science, pages 440-444, Beijing, China, 11-14 November 1997. Springer-Verlag.
30. A Pfitzmann and M Waidner. Networks without user observability - design options. In Advances in Cryptology - Eurocrypt '85, volume 219 of Lecture Notes in Computer Science. Spingcr-Verlag, 1985.
31. Andreas Pfitzmann. A switched/broadcast ISDN to decrease user observability. 1984 International Zurich Seminar on Digital Communications, Applications of Source Coding, Channel Coding and Secrecy Coding, March 6-8, 1984, Zurich. Switzerland. Swiss Federal Institute of Technology, Proceedings IEEE Catalog no. 84CH1998-4, 183-190, 6-8 March 1984.
32. Andreas Pfitzmann. How to implement ISDNs without user observability-some remarks. Technical report, Institut fur informatik, University of Karlsruhe, Institut fur Informatik, University of Karlsruhe, 1985.
33. Andreas Pfitzmann. Birgit Pfitzinann. and Michael Waidner. ISDN-mixes: Untraceable communication with very small bandwidth overhead. In GI/ITG Conference: Communication in Distributed Systems, pages 451-463. Springer-Verlag, Heidelberg 1991, February 1991.
34. B Pfitzmann and A Pfitzmann. How to break the direct rsa-implementation of mixes. In Advances in Cryptology - Eurocrypt '89, volume 434 of Lecture Notes in Computer Science. Springer-Verlag, 1989.
35. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report Technical Memo TR-81, Aiken Computation Laboratory. Harvard University, 1981.
36. Michael K. Reiter and Aviel D. Rubin. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security, volume 1, pages 66-92, 1998.
37. Michael K. Reiter and Aviel D. Rubin. Anonymous Web transactions with crowds. Communications of the ACM, volume 42, number 2, pages 32 48, 1999.
38. Charles Ruekoff and Daniel R.. Simon. Cryptographic: defense against traffic analysis. In Proceedings of the Twenty-Fifth Atmval ACM Symposium on the Theory of Computing, pages 672-681, San Diego, California, 16-18 May 1993.
39. M G Reed, P F Syverson. and D M Goldschlag. Anonymous connections and onion routing. IEEE Journal on Special Areas in Communications, 16(4):482-494, May 1998.
40. G. J. Simmons. The history of subliminal channels. IEEE Journal on Selected Areas in Communications, 16(4):452-462, May 1998.
41. L. F. Turner. Digital data security system, 1989. Patent IPN WO 89/08915.
42. M Waidner. Unconditional sender and recipient untraceability in spite of active attacks. In Advances in Cryptology - Eurocrypt '89, volume 434 of Lecture Notes in Computer Science. Springer-Verlag, 1989.