Probability of error in information-hiding protocols

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2007, Pages 341-351

  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

DATA PRIVACY; DECISION MAKING; ERROR ANALYSIS; INFORMATION THEORY; PROBABILITY; PROBLEM SOLVING;

HYPOTHESIS-TESTING PROBLEM; INFORMATION-HIDING PROTOCOLS; MAXIMUM APOSTERIORI PROBABILITY; SANTHI-VARDY BOUNDS;

NETWORK PROTOCOLS;

EID: 35048859323     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2007.27     Document Type: Conference Paper

References (26)

1. M. Bhargava and C. Palamidessi. Probabilistic anonymity. In M. Abadi and L. de Alfaro, editors, Proceedings of CONCUR, volume 3653 of Lecture Notes in Computer Science, pages 171-185. Springer, 2005. Available at http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/concur.pdf.
2. K. Chatzikokolakis and C. Palamidessi. Probable innocence revisited. Theoretical Computer Science, 367(1-2):123-138, 2006. Available at http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/tcsPI.pdf.
3. K. Chatzikokolakis, C. Palamidessi, and P. Panangaden. Anonymity protocols as noisy channels. In Postproceedings of the Symp. on Trustworthy Global Computing, Lecture Notes in Computer Science. Springer, 2006. To appear. Available at http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/ Channels/full.pdf.
4. D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65-75, 1988.
5. D. Clark, S. Hunt, and P. Malacaria. Quantitative analysis of the leakage of confidential data. In Proc. of QAPL 2001, volume 59 (3) of Electr. Notes Theor. Comput. Sci, pages 238-251. Elsevier Science B.V., 2001.
6. D. Clark, S. Hunt, and P. Malacaria. Quantified interference for a while language. In Proc. of QAPL 2004, volume 112 of Electr. Notes Theor. Comput. Sci, pages 149-166. Elsevier Science B.V., 2005.
7. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Designing Privacy Enhancing Technologies, International Workshop on Design Issues in Anonymity and Unobservability, volume 2009 of Lecture Notes in Computer Science, pages 44-66. Springer, 2000.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., 1991.
9. Y. Deng, J. Pang, and P. Wu. Measuring anonymity with relative entropy. In Proceedings of the 4th International Workshop on Formal Aspects in Security and Trust (FAST), Lecture Notes in Computer Science. Springer, 2006. To appear.
10. C. Díaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In R. Dingledine and P. F. Syverson, editors, Proceedings of the workshop on Privacy Enhancing Technologies (PET) 2002, volume 2482 of Lecture Notes in Computer Science, pages 54-68. Springer, 2002.
11. 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), pages 21-35, Washington - Brussels - Tokyo, May 1991. IEEE.
12. J. Y. Halpern and K. R. O'Neill. Anonymity and information hiding in multiagent systems. Journal of Computer Security, 13(3):483-512, 2005.
13. M. Hellman and J. Raviv. Probability of error, equivocation, and the chernoff bound. IEEE Trans. on Information Theory, IT-16:368-372, 1970.
14. G.Lowe. Quantifying information flow. In Proc. of CSFW 2002, pages 18-31. IEEE Computer Society Press, 2002.
15. U. M. Maurer. Authentication theory and hypothesis testing. LEEE Transactions on Information Theory, 46(4): 1350-1356, 2000.
16. J. McLean. Security models and information flow. In IEEE Symposium on Security and Privacy, pages 180-189, 1990.
17. I. S. Moskowitz, R. E. Newman, D. P. Crepeau, and A. R. Miller. Covert channels and anonymizing networks. In S. Jajodia, P. Samarati, and P. F. Syverson, editors, WPES, pages 79-88. ACM, 2003.
18. I. S. Moskowitz, R. E. Newman, and P. F. Syverson. Quasi-anonymous channels. In IASTED CNIS, pages 126-131, 2003.
19. A. D. Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. Journal of Computer Security, 12(1):3782, 2004.
20. A. D. Pierrô, C. Hankin, and H. Wiklicky. Measuring the confinement of probabilistic systems. Theoretical Computer Science, 340(1 ):3-56, 2005.
21. M. K. Reiter and A. D. Rubin. Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security, 1(1):66-92, 1998.
22. A. Rényi. On the amount of missing information and the Neyman-Pearson lemma. In Festschriftf for J. Neyman, pages 281-288. Wiley, New York, 1966.
23. N. Santhi and A. Vardy. On an improvement over Rényi's equivocation bound, 2006. Presented at the 44-th Annual Allerton Conference on Communication, Control, and Computing, September 2006. Available at http://arxiv.org/abs/cs/0608087.
24. A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In R. Dingledine and P. F. Syverson, editors, Proceedings of the workshop on Privacy Enhancing Technologies (PET) 2002, volume 2482 of Lecture Notes in Computer Science, pages 41-53. Springer, 2002.
25. V. Shmatikov. Probabilistic model checking of an anonymity system. Journal of Computer Security, 12(3/4):355-377, 2004.
26. P. Syverson, D. Goldschlag, and M. Reed. Anonymous connections and onion routing. In IEEE Symposium on Security and Privacy, pages 44-54, Oakland, California, 1997.