The Hitting Set Attack on Anonymity Protocols

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

Volumn 3200, Issue , 2004, Pages 326-339

  Kesdogan, Dogan ^a   Pimenidis, Lexi ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING SEARCH ALGORITHMS; FREQUENCY ANALYSIS; HITTING SET PROBLEMS; HITTING SETS; MINIMAL HITTING SET; NP-HARD; TRAFFIC ANALYSIS ATTACKS;

ARTIFICIAL INTELLIGENCE;

COMPUTER SCIENCE; COMPUTERS;

EID: 35048865346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30114-1_23     Document Type: Article

References (18)

1. [BFK01] Oliver Berthold, Hannes Federrath, and Stefan Köpsell. Web Mixes: A System for Anonymous and Unobservable Internet Access. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies, (PET2001).115-129. Springer-Verlag LNCS 2009, May 2001.
2. [CB95] D.A. Cooper and K.P. Birman. Preserving privacy in a network of mobile computers. In 1995 IEEE Symposium on Research in Security and Privacy.26 - 38. IEEE, 1995.
3. [CGKS95] B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In 36th IEEE Conference on the Foundations of Computer Science.41 - 50. IEEE Computer Society Press, 1995.
4. [Cha81] David L. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24(2):84 - 88, Feb 1981.
5. [Cha88] David L. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, (1):65 - 75, 1988.
6. [Dan03] George Danezis. Statistical disclosure attacks: Traffic confirmation in open environments. In Gritzalis, Vimercati, Samarati, and Katsikas, editors, Proceedings of Security and Privacy in the Age of Uncertainty, (SEC2003).421-426, Athens, May 2003. IFIP TC11, Kluwer.
7. [FK96] Michael L. Fredman and Leonid Khachiyan. On the Complexity of Dualization of Monotone Disjunctive Normal Forms. Journal of Algorithms, (21):618 - 628, 1996. Article No. 0062.
8. [GJ79] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. 1979.
9. [GRS96] David M. Goldschlag, Michael G. Reed, and Paul F. Syverson. Hiding Routing Information. Information Hiding.137 - 150, 1996. Springer-Verlag LNCS 1174.
10. [GT96] Ceki Gülcü and Gene Tsudik. Mixing E-mail with Babel. In Proceedings of the Network and Distributed Security Symposium - NDSS '96.2-16. IEEE, February 1996.
11. [KAP02] Dogan Kesdogan, Dakshi Agrawal, and Stefan Penz. Limits of Anonymity in Open Environments. In Information Hiding, 5th International Workshop. Springer Verlag, 2002.
12. [KAP03] Dogan Kesdogan, Dakshi Agrawal, and Stefan Penz. Probabilistic Treatment of MIXes to Hamper Traffic Analysis. IEEE Symposium on Security and Privacy, 2003.
13. [KBS02] Dogan Kesdogan, Mark Borning, and Michael Schmeink. Unobservable Surfing on the World Wide Web: Is Private Information Retrieval an Alternative to the Mix Based Approach? Privacy Enhancing Technologies (PET 2002), Springer-Verlag (LNCS 2482):224 - 238, 2002.
14. [KEB98] Dogan Kesdogan, J. Egner, and R. Büschkes. Stop-and-Go-Mixes Providing Anonymity in an Open System. In D. Aucsmith, editor, Information Hiding 98 - Second International Workshop.83 - 98. Springer Verlag, 1998.
15. [Pfi90] A. Pfitzmann. Dienstintegrierende Kommunikationsnetze mit teilnehmerüberprüfbarem Datenschutz. IFB 234, Springer-Verlag, Heidelberg 1990, 1990. (in German).
16. [Pim03] Lexi Pimenidis. Structure and Analysis of Chaumian Mixes. Nov 2003. Master Thesis at the RWTH Aachen, Germany.
17. [PP90] B. Pfitzmann and A. Pfitzmann. How to break the direct rsaimplementation of mixes.373 - 381. Eurocrypt '89, LNCS 434. Springer-Verlag, Berlin, 1990.
18. [RR98] Michael K. Reiter and Aviel D. Rubin. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security.66 - 92, April 1998.