Quantifying maximal loss of anonymity in protocols

Proceedings of the 4th International Symposium on ACM Symposium on Information, Computer and Communications Security, ASIACCS'09

Volumn , Issue , 2009, Pages 206-217

  Chen, Han ^a   Malacaria, Pasquale ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Anonymity; Lagrange multipliers; Quantitative analysis

Indexed keywords

CURRENT THEORIES; LAGRANGE MULTIPLIER METHOD; LAGRANGIAN APPROACHES; ONION ROUTING; QUANTITATIVE ANALYSIS;

CHANNEL CAPACITY; CRYPTOGRAPHY; HARMONIC ANALYSIS; NETWORK SECURITY;

LAGRANGE MULTIPLIERS;

EID: 77951534380     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1533057.1533087     Document Type: Conference Paper

References (30)

1. Mohit Bhargava, Catuscia Palamidessi. Probabilistic Anonymity. CONCUR 2005, LNCS 3653, pp. 171-185, 2005.
2. Michele Boreale: Quantifying Information Leakage in Process Calculi. ICALP (2) 2006:119-131
3. David Chaum: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology 1 (1):65-75, 1988.
4. K. Chatzikokolakis, C. Palamidessi, P. Panangaden. Anonymity Protocols as Noisy Channels, in: Postproceedings of the Symp. on Trustworthy Global Computing, Lecture Notes in Computer Science, Springer, 2006.
5. Han Chen, Pasquale Malacaria: Quantitative Analysis of Leakage for Multi-threaded Programs. Proc. ACM 2007 workshop on Programming languages and analysis for security.
6. T. Cover, J. Thomas. Elements of Information Theory. Wiley
7. David Clark, Sebastian Hunt, Pasquale Malacaria: A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security, Volume 15, Number 3/2007.
8. David Clark, Sebastian Hunt, Pasquale Malacaria: Quantitative Analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science 59, 2002
9. D. E. Denning: Cyptography and Data Security. Addison-Wesley, 1982.
10. George Danezis, Claudia Diaz and Carmela Troncoso. Two-Sided Statistical Disclosure Attack. In Proc. PET 2007, LNCS 4476, pp. 30-44, 2007.
11. D. E. Denning: A lattice model of secure information flow. Communications of the ACM, 19 (5), May 1976.
12. C. Díaz, S. Seys, J Claessens and B. Preneel: Towards measuring anonymity. Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), Springer-Verlag, LNCS 2482.
13. Matthew Edman, Fikret Sivrikaya, Bulent Yener. A Combinatorial Approach to Measuring Anonymity. In Proc. Intelligence and Security Informatics, 2007 IEEE, 2007, pages 356-363.
14. J. Feigenmbaum, A. Johnson, P. Syverson. Probabilistic Analysis of Onion Routing in a Black-box Model. In proceedings of WPES'07, ACM 2007.
15. Matthias Franz, Bernd Meyer and Andreas Pashalidis, Attacking Unlinkability: The Importance of Context. In Proc. PET 2007, LNCS 4776, pp. 1-16, 2007.
16. James W Gray III: Toward a methematical foundataion for information flow security. Proc. 1991 IEEE Symposium on Security and Privacy. Oakland, California, May 1991.
17. Yong Guan, Xinwen Fu, Riccardo Bettati, and Wei Zhao: A quantitative analysis of anonymous communications. IEEE Transactions on Reliability, Page 103-115, Volume 53 (1), March 2004.
18. S. Kullback: Information Theory and Statistics. Dover Publications. 1997.
19. John Mclean: Security models and information flow. Proc. 1990 IEEE Symposium on Security and Privacy. Oakland, California, May 1990.
20. Jonathan Millen: Covert channel capacity. Proc. 1987 IEEE Symposium on Research in Security and Privacy.
21. Pasquale Malacaria, Han Chen,: Lagrange Multipliers and Maximum Information Leakage in Different Observational Models. ACM SIGPLAN Third Workshop on Programming Languages and Analysis for Security. June, 2008.
22. Pasquale Malacaria: Assessing security threats of looping constructs. Proc. ACM Symposium on Principles of Programming Language, 2007.
23. Andreas Pashalidis and Bernd Meyer Linking Anonymous Transactions: The Consistent View Attack. In Proc. PET 2006, LNCS 4258, pp. 384-392, 2006.
24. M. Reed, P. Syverson, D. Goldschlag, "Anonymous Connections and Onion Routing", IEEE Symposium on Security and Privacy (1997)
25. M. Reiter and A. Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security (TISSEC), 1 (1), pages 66-92. 1998.
26. C. E. Shannon and W. Weaver: A Mathematical Theory of Communication. Urbana, IL: Univ. of Illinois press, 1963.
27. A. Serjantov, G. Danezis. Towards an Information Theoretic Metric for Anonymity. Proceedings of Privacy Enhancing Technologies Workshop (PET 2002), Springer-Verlag, LNCS 2482.
28. M. Wright, M. Adler, B. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In ISOC Network and Distributed System Security Symposium (NDSS), 2002.
29. Vitaly Shmatikov. Probabilistic model checking of an anonymity system. Journal of Computer Security, vol 12, 2004.
30. Vitaly Shmatikov and Ming-hsiu Wang. Measuring Relationship Anonymity in Mix Networks. In proceedings of WPES'06, ACM 2006.