A combinatorial approach to measuring anonymity

ISI 2007: 2007 IEEE Intelligence and Security Informatics

Volumn , Issue , 2007, Pages 357-364

  Edman, Matthew ^a   Sivrikaya, Fikret ^a   Yener, Bülent ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESSAGE PASSING; METRIC SYSTEM; PATTERN RECOGNITION; PROBABILISTIC LOGICS; USER INTERFACES;

ANONYMOUS COMMUNICATION SYSTEMS; COMBINATORIAL APPROACH; SENDER-RECIPIENT RELATIONSHIPS;

INFORMATION THEORY;

EID: 34748911762     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol. 4, no. 2, February 1981.
2. G. Danezis, R. Dingledine, and N. Mathewson, "Mixminion: Design of a Type III Anonymous Remailer Protocol," in Proceedings of the 2003 IEEE Symposium on Security and Privacy, May 2003.
3. R. Dingledine, N. Mathewson, and P. Syverson, "Tor: The second-generation onion router," in Proceedings of the 13th USENIX Security Symposium, August 2004.
4. D. Chaum, "The dining cryptographers problem: Unconditional sender and recipient untraceability," Journal of Cryptology, vol. 1, pp. 65-75, 1988.
5. D. Kesdogan, J. Egner, and R. Büschkes, "Stop-and-go MIXes: Providing probabilistic anonymity in an open system," in Proceedings of Information Hiding Workshop (IH1998). Springer-Verlag, LNCS 1525, 1998.
6. A. Serjantov and G. Danezis, "Towards an information theoretic metric for anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), R. Dingledine and P. Syverson, Eds. Springer-Verlag, LNCS 2482, April 2002.
7. C. Diaz, S. Seys, J. Claessens, and B. Preneel, "Towards measuring anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), R. Dingledine and P. Syverson, Eds. Springer-Verlag, LNCS 2482, April 2002.
8. M. Reiter and A. Rubin, "Crowds: Anonymity for web transactions," ACM Transactions on Information and System Security, vol. 1, no. 1, June 1998.
9. G. Tóth and Z. Hornák, "Measuring anonymity in a non-adaptive, real-time system," in Proceedings of Privacy Enhancing Technologies workshop (PET 2004), ser. Springer-Verlag, LNCS, vol. 3424, 2004, pp. 226-241.
10. G. Tóth, Z. Hornák, and F. Vajda, "Measuring anonymity revisited," in Proceedings of the Ninth Nordic Workshop on Secure IT Systems, S. Liimatainen and T. Virtanen, Eds., Espoo, Finland, November 2004, pp. 85-90.
11. R. E. Newman, I. S. Moskowitz, P. Syverson, and A. Serjantov, "Metrics for traffic analysis prevention," in Proceedings of Privacy Enhancing Technologies workshop (PET 2003), R. Dingledine, Ed. Springer-Verlag, LNCS 2760, March 2003.
12. G. P. Egorychev, "The solution of van der waerden's problem for permanents," Advances in Mathematics, vol. 42, pp. 299-305, 1981.
13. D. I. Falikman, "Proof of the van der waerden's conjecture on the permanent of a doubly stochastic matrix," Mat. Zametki, vol. 29, no. 6, pp. 931-938, 957, 1981, in Russian.
14. H. W. Kuhn, "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, vol. 2, no. 1, pp. 83-98, 1955.
15. L. G. Valiant, "The complexity of computing the permanent," Theoretical Computer Science, vol. 8, no. 2, pp. 189-201, April 1979.
16. R. A. Servedio and A. Wan, "Computing sparse permanents faster," Inf. Process. Lett., vol. 96, no. 3, pp. 89-92, 2005.
17. P. Sankowski, "Alternative algorithms for counting all matchings in graphs," vol. 2607. Springer Berlin / Heidelberg, March 2003, pp. 427-438.
18. M. Jerrum, A. Sinclair, and E. Vigoda, "A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries," J. ACM, vol. 51, no. 4, pp. 671-697, July 2004.
19. I. Bezakova, D. Stefankovic, V. V. Vazirani, and E. Vigoda, "Accelerating simulated annealing for the permanent and combinatorial counting problems," in SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. ACM Press, 2006, pp. 900-907.
20. P. A. Ostrand, "Systems of distinct representatives ii," Journal of Mathematics Analysis and Applications, vol. 32, pp. 1-4, 1970.
21. W. B. Jurkat and H. J. Ryser, "Matrix factorizations of determinants and permanents," Journal of Algebra, vol. 3, pp. 1-27, 1966.
22. R. A. Brualdi and H. J. Ryser, Combinatorial Matrix Theory, ser. Encyclopedia of Mathematics, 1991.
23. H. Mine, "Bounds for permanents of nonnegative matrices," in Proceedings of the Edinburgh Mathematical Society, vol. 16, 1968, pp. 233-237.
24. W. B. Jurkat and H. J. Ryser, "Term ranks and permanents of nonnegative matrices," Journal of Algebra, vol. 5, pp. 342-357, 1967.