Anonymity protocols as noisy channels

Information and Computation

Volumn 206, Issue 2-4, 2008, Pages 378-401

  Chatzikokolakis, Konstantinos ^a   Palamidessi, Catuscia ^a   Panangaden, Prakash ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); INFORMATION ANALYSIS; MODEL CHECKING;

ANONYMITY PROTOCOL; COVERT CHANNELS;

NETWORK PROTOCOLS;

EID: 40149107259     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.07.003     Document Type: Article

References (33)

1. S. Schneider A. Sidiropoulos CSP and anonymity Proceeding of the European Symposium on Research in Computer Security (ESORICS) Lecture Notes in Computer Science vol. 1146 1996 Springer 198 218
2. P.Y. Ryan S. Schneider Modelling and Analysis of Security Protocols 2001 Addison-Wesley
3. P.F. Syverson, S.G. Stubblebine, Group principals and the formalization of anonymity, in: World Congress on Formal Methods (1), 1999, pp. 814–833.
4. J.Y. Halpern K.R. O’Neill Anonymity and information hiding in multiagent systems Journal of Computer Security 13 3 2005 483 512
5. D. Hughes V. Shmatikov Information hiding anonymity and privacy: a modular approach Journal of Computer Security 12 1 2004 3 36
6. L. Sweene k-Anonymity: a model for protecting privacy International Journal of Uncertainty, Fuzziness and Knowledge-based Systems 10 5 2002 557 570
7. L. Sweene Achieving k-anonymity privacy protection using generalization and suppression International Journal of Uncertainty, Fuzziness and Knowledge-based Systems 10 5 2002 571 588
8. D. Chaum The dining cryptographers problem: unconditional sender and recipient untraceability Journal of Cryptology 1 1988 65 75
9. M. Bhargava C. Palamidessi Probabilistic anonymity M. Abadi L. de Alfaro Proceedings of CONCUR Lecture Notes in Computer Science vol. 3653 2005 Springer 171 185
10. M.K. Reiter A.D. Rubin Crowds: anonymity for Web transactions ACM Transactions on Information and System Security 1 1 1998 66 92
11. K. Chatzikokolakis C. Palamidessi Probable innocence revisited Theoretical Computer Science 367 1-2 2006 123 138
12. A. Serjantov G. Danezis Towards an information theoretic metric for anonymity Proceedings of the Workshop on Privacy Enhancing Technologies (PET) 2002 R. Dingledine P.F. Syverson Lecture Notes in Computer Science vol. 2482 2002 Springer 41 53
13. C. Díaz S. Seys J. Claessens B. Preneel Towards measuring anonymity Proceedings of the Workshop on Privacy Enhancing Technologies (PET) 2002 R. Dingledine P.F. Syverson Lecture Notes in Computer Science Vol. 2482 2002 Springer 54 68
14. I.S. Moskowitz, R.E. Newman, D.P. Crepeau, A.R. Miller, Covert channels and anonymizing networks, in: S. Jajodia, P. Samarati, P.F. Syverson (Eds.), WPES, ACM, 2003, pp. 79–88.
15. I.S. Moskowitz, R.E. Newman, P.F. Syverson, Quasi-anonymous channels, in: IASTED CNIS, 2003, pp. 126–131.
16. Y. Zhu, R. Bettati, Anonymity vs. information leakage in anonymity systems, in: Proc. of ICDCS, IEEE Computer Society, 2005, pp. 514–524.
17. M.R. Clarkson, A.C. Myers, F.B. Schneider, Belief in information flow, in: Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW’05), IEEE, 2005, pp. 31–45.
18. Y. Deng J. Pang P. Wu Measuring anonymity with relative entropy T. Dimitrakos F. Martinelli P.Y.A. Ryan S.A. Schneider Proceeddings of the of the 4th International Workshop on Formal Aspects in Security and Trust Lecture Notes in Computer Science Vol. 4691 2006 Springer 65 79
19. J. McLean, Security models and information flow, in: IEEE Symposium on Security and Privacy, 1990, pp. 180–189.
20. J.W. Gray, III, Toward a mathematical foundation for information flow security, in: Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy (SSP ’91), IEEE, Washington– Brussels–Tokyo, 1991, pp. 21–35.
21. D. Clark, S. Hunt, P. Malacaria, Quantitative analysis of the leakage of confidential data, in: Proc. of QAPL 2001, Electr. Notes Theor. Comput. Sci., vol. 59 (3), Elsevier Science B.V., 2001, pp. 238–251.
22. D. Clark S. Hunt P. Malacaria Quantified interference for a while language Proceeding of QAPL 2004 Electr. Notes Theor. Comput. Sci vol. 112 2005 Elsevier Science B.V. 149 166
23. G. Lowe Quantifying information flow Proceeding of CSFW 2002 2002 IEEE Computer Society Press 18 31
24. U.M. Maurer Authentication theory and hypothesis testing IEEE Transactions on Information Theory 46 4 2000 1350 1356
25. A.D. Pierro C. Hankin H. Wiklicky Approximate non-interference Journal of Computer Security 12 1 2004 37 82
26. A.D. Pierro C. Hankin H. Wiklicky Measuring the confinement of probabilistic systems Theoretical Computer Science 340 1 2005 3 56
27. T.M. Cover J.A. Thomas Elements of Information Theory 1991 John Wiley & Sons, Inc.
28. A. Sabelfeld D. Sands Probabilistic noninterference for multi-threaded programs Proc. of CSFW 2000 2000 IEEE Computer Society Press 200 214
29. Y. Deng, C. Palamidessi, J. Pang, Weak probabilistic anonymity, in: Proceedings of the 3rd International Workshop on Security Issues in Concurrency (SecCo), Electronic Notes in Theoretical Computer Science, vol. 180 (1), Elsevier Science B.V., 2007, pp. 55–76.
30. M.Z. Kwiatkowska, G. Norman, D. Parker, PRISM 2.0: A tool for probabilistic model checking, in: Proceedings of the First International Conference on Quantitative Evaluation of Systems (QEST) 2004, IEEE Computer Society, 2004, pp. 322–323.
31. V. Shmatikov, Probabilistic analysis of anonymity, in: 15th IEEE Computer Security Foundations Workshop (CSFW), 2002, pp. 119–128.
32. M. Wright, M. Adler, B. Levine, C. Shields, An analysis of the degradation of anonymous protocols, in: ISOC Network and Distributed System Security Symposium (NDSS), 2002.
33. K. Chatzikokolakis, C. Palamidessi, P. Panangaden, Probability of error in information-hiding protocols, in: Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF20), IEEE Computer Society, 2007, pp. 341–354.