Perfect matching disclosure attacks

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

Volumn 5134 LNCS, Issue , 2008, Pages 2-23

  Troncoso, Carmela ^a   Gierlichs, Benedikt ^a   Preneel, Bart ^a   Verbauwhede, Ingrid ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; GRAPH THEORY; MIXING; TECHNOLOGY; TOPOLOGY;

ANONYMOUS COMMUNICATION SYSTEMS; EMPIRICAL RESULTS; INTERNATIONAL SYMPOSIUM; MIX NETWORKS; PERFECT MATCHING; PRIVACY-ENHANCING TECHNOLOGIES; TRAFFIC ANALYSIS; USER BEHAVIORS; USER MODELLING; USER PROFILING;

BEHAVIORAL RESEARCH;

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

References (19)

1. Agrawal, D., Kesdogan, D.: Measuring anonymity: The disclosure attack. IEEE Security & Privacy 1(6), 27-34 (2003)
2. Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16, 87-90 (1958)
3. Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84-90 (1981)
4. Danezis, G.: Statistical disclosure attacks: Traffic confirmation in open environments. In: Gritzalis, Vimercati, Samarati, Katsikas (eds.) Proceedings of Security and Privacy in the Age of Uncertainty (SEC 2003), Athens, May 2003, IFIP TC11 pp. 421-426. Kluwer, Dordrecht (2003)
5. Danezis, G., Diaz, C., Troncoso, C.: Two-sided statistical disclosure attack. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, p. 15. Springer, Heidelberg (2007)
6. Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a Type III Anonymous Remailer Protocol. In: Proceedings of the 2003 IEEE Symposium on Security and Privacy, pp. 2-15 (May 2003)
7. Danezis, G., Serjantov, A.: Statistical disclosure or intersection attacks on anonymity systems. In: Fridrich, J. (ed.) IH 2004. LNCS, vol. 3200. Springer, Heidelberg (2004)
8. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269-271 (1959)
9. Edman, M., Sivrikaya, F., Yener, B.: A combinatorial approach to measuring anonymity. In: ISI, pp. 356-363. IEEE, Los Alamitos (2007)
10. Hughes, D., Shmatikov, V.: Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security 12(1), 3-36 (2004)
11. Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomized partial checking. In: Proceedings of the 11th USENIX Security Symposium (August 2002)
12. Kesdogan, D., Agrawal, D., Penz, S.: Limits of anonymity in open environments. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, pp. 53-69. Springer, Heidelberg (2003)
13. Kesdogan, D., Pimenidis, L.: The hitting set attack on anonymity protocols. In: Fridrich, J.J. (ed.) IH 2004. LNCS, vol. 3200, pp. 326-339. Springer, Heidelberg (2004)
14. Kilian, J., Sako, K.: Receipt-free MIX-type voting scheme - a practical solution to the implementation of a voting booth. In: EUROCRYPT 1995. Springer, Heidelberg (1995)
15. Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2, 83-97 (1955)
16. Mathewson, N., Dingledine, R.: Practical traffic analysis: Extending and resisting statistical disclosure. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 17-34. Springer, Heidelberg (2005)
17. Möller, U., Cottrell, L., Palfrader, P., Sassaman, L.: Mixmaster Protocol - Version 2. IETF Internet Draft (July 2003)
18. Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482. Springer, Heidelberg (2003)
19. Sinkhorn, R.: A relationship between arbitrary positive matrices and doubly stochastic matrices. The Annals of Mathematical Statistics 35(2), 876-879 (1964)