A new information leakage measure for anonymity protocols

Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

Volumn 50 LNICST, Issue , 2010, Pages 398-414

  Zhioua, Sami ^a  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION FUNCTIONS; EMPIRICAL RESULTS; GEOMETRIC INTERPRETATION; INFORMATION LEAKAGE; MATRIX; MUTUAL INFORMATIONS; N-DIMENSIONAL SPACE; NETWORK COMMUNICATIONS; NOISY CHANNEL; PRIORI DISTRIBUTION; STATISTICAL DISPERSION;

DISPERSIONS; EXPERIMENTAL REACTORS; INFORMATION THEORY; NETWORK SECURITY; TELECOMMUNICATION NETWORKS;

NETWORK PROTOCOLS;

EID: 80053022791     PISSN: 18678211     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-16161-2_23     Document Type: Conference Paper

References (27)

1. Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24(2), 84-90 (1981)
2. Reiter, M., Rubin, A.: Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security 1(1), 66-92 (1998)
3. Syverson, P., Goldschlag, D., Reed, M.: Anonymous connections and onion routing. In: Proceedings of the 1997 IEEE Symposium on Security and Privacy (SP 1997), Washington, DC, USA. IEEE Computer Society, Los Alamitos (1997)
4. Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untrace-ability. Journal of Cryptology 1(1), 65-75 (1988) (Pubitemid 18606152)
5. Shields, C., Levine, B.: A protocol for anonymous communication over the internet. In: Proceedings of the 7th ACM Conference on Computer and Communications Security, pp. 33-42. ACM, New York (2000) (Pubitemid 32393899)
6. Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 41-53. Springer, Heidelberg (2003) (Pubitemid 36309878)
7. Diaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, pp. 54-68. Springer, Heidelberg (2003) (Pubitemid 36309879)
8. Zhu, Y., Bettati, R.: Anonymity vs. information leakage in anonymity systems. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), Columbus, Ohio, pp. 514-524 (2005)
9. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Information and Computation 206(2-4), 378-401 (2008)
10. Moskowitz, I., Newman, R., Crepeau, D., Miller, A.: Covert channels and anonymizing networks. In: WPES 2003: Proceedings of the 2003 ACM workshop on Privacy in the electronic society, pp. 79-88. ACM, New York (2003)
11. Cover, T., Thomas, J.: Elements of Information Theory. Wiley-Interscience, New York (1991)
12. Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 288-302. Springer, Heidelberg (2009)
13. Rény, A.: On measures of entropy and information. In: Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics, and Probability, pp. 547-561 (1960)
14. Moskowitz, I., Newman, R., Syverson, P.: Quasi-anonymous channels. In: IASTED CNIS, pp. 126-131 (2003)
15. Newman, R., Moskowitz, I., Syverson, P., Serjantov, A.: Metrics for traffic analysis prevention. In: Dingledine, R. (ed.) PET 2003. LNCS, vol. 2760, pp. 48-65. Springer, Heidelberg (2003)
16. Tóth, G., Hornák, Z., Vajda, F.: Measuring anonymity revisited. In: Liimatainen, S., Virtanen, T. (eds.) Proceedings of the Ninth Nordic Workshop on Secure IT Systems, Espoo, Finland, pp. 85-90 (November 2004)
17. Edman, M., Sivrikaya, F., Yener, B.: A combinatorial approach to measuring anonymity. In: 2007 IEEE Intelligence and Security Informatics, pp. 356-363 (2007)
18. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: On the bayes risk in information-hiding protocols. Journal of Computer Security 16(5), 531-571 (2008)
19. Clark, D., Hunt, S., Malacaria, P.: Quantitative analysis of the leakage of confidential data. Electrical Notes in Theoretical Computer Science 59, 238-251 (2001)
20. University of Oxford: Prism, http://www.prismmodelchecker.org
21. Chatzikokolakis, K.: Probabilistic and Information-Theoretic Approaches to Anonymity. PhD thesis, Laboratoire d'Informatique (LIX), École Polytechnique, Paris (October 2007)
22. MacKay, D.: Information Theory, Inference and Learning Algorithms. Cambridge University Press, Cambridge (2003)
23. Wright, M., Adler, M., Levine, B., Shields, C.: An analysis of the degradation of anonymous protocols. In: Proceedings of the Network and Distributed Security Symposium (NDSS 2002). IEEE Computer Society, Los Alamitos (2001)
24. Syverson, P., Tsudik, G., Reed, M., Landwehr, C.: Towards an analysis of onion routing security. In: Proceedings of the international workshop on Designing privacy enhancing technologies, pp. 96-114. Springer, New York (2001) (Pubitemid 33241789)
25. Gibbs, A., Su, F.: On choosing and bounding probability metrics. International Statistical Institute 70, 418-435 (2002)
26. Danezis, G., Diaz, C.: A survey of anonymous communication channels. Technical Report MSR-TR-2008-35, Microsoft Research (January 2008)
27. Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: Proceedings of the 13th Usenix Security Symposium (August 2004)