Statistical measurement of information leakage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6015 LNCS, Issue , 2010, Pages 390-404

  Chatzikokolakis, Konstantinos ^a   Chothia, Tom ^b   Guha, Apratim ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONFIDENCE INTERVAL; INFORMATION FLOWS; INFORMATION LEAKAGE; MEASURES OF INFORMATION; MUTUAL INFORMATIONS; SECURE SYSTEM;

COMPUTER SOFTWARE; INFORMATION THEORY; PROBABILITY DENSITY FUNCTION;

PROBABILITY DISTRIBUTIONS;

EID: 77951581039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12002-2_33     Document Type: Conference Paper

References (29)

1. Arimoto, S.: An algorithm for computing the capacity of arbitrary memoryless channels. IEEE Trans. on Inform. Theory IT-18(1), 14-20 (1972)
2. Backes, M., Köpf, B.: Formally bounding the side-channel leakage in unknown-message attacks. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 517-532. Springer, Heidelberg (2008)
3. Bayes, T.: An essay towards solving a problem in the doctrine of chances. Philo. Trans. of the Royal Society of London 53, 370-418 (1774)
4. Bickel, P.J., Doksum, K.A.: Mathematical Statistics: Basic Ideas and Selected Topics. Prentice Hall, Englewood Cliffs (2006)
5. Blahut, R.E.: Computation of channel capacity and rate distortion functions. IEEE Trans. on Inform. Theory IT-18(4), 460-473 (1972)
6. Brillinger, D.R.: Some data analysis using mutual information. Brazilian Journal of Probability and Statistics 18(6), 163-183 (2004)
7. Brillinger, D.R.: Personal correspondence (April 2009)
8. Chatzikokolakis, K., Chothia, T., Guha, A.: Calculating probabilistic anonymity from sampled data. Technical report, University of Birmingham (2009)
9. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Information and Computation 206, 378-401 (2008)
10. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: On the bayes risk in information-hiding protocols. J. Comput. Secur. 16(5), 531-571 (2008)
11. Chen, H., Malacaria, P.: Quantifying maximal loss of anonymity in protocols. In: ASIACCS, pp. 206-217 (2009)
12. Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. J. Comput. Secur. 15(3), 321-371 (2007)
13. Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type iii anonymous remailer protocol. In: Proceedings of the 2003 IEEE Symposium on Security and Privacy, pp. 2-15 (2003)
14. Deng, Y., Pang, J., Wu, P.: Measuring anonymity with relative entropy. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol. 4691, pp. 65-79. Springer, Heidelberg (2007)
15. Díaz, 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)
16. Dupuis, F., Yu, W., Willems, F.M.J.: Blahut-arimoto algorithms for computing channel capacity and rate-distortion with side information. In: Proceedings of International Symposium on Information Theory. ISIT 2004, p. 179+ (2004)
17. Hutter, M.: Distribution of mutual information. In: Advances in Neural Information Processing Systems 14, pp. 399-406. MIT Press, Cambridge (2002)
18. Malacaria, P., Chen, H.: Lagrange multipliers and maximum information leakage in different observational models. In: PLAS 2008: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security, pp. 135-146. ACM, New York (2008)
19. Mantel, H., Sudbrock, H.: Information-theoretic modeling and analysis of interrupt-related covert channels. In: Degano, P., Guttman, J., Martinelli, F. (eds.) FAST 2008. LNCS, vol. 5491, pp. 67-81. Springer, Heidelberg (2009)
20. Matz, G., Duhamel, P.: Information geometric formulation and interpretation of accelerated blahut-arimoto-type algorithms. In: Proceedings of the IEEE Information Theory Workshop (ITW), pp. 66-70 (2004) (Pubitemid 40731298)
21. McIver, A., Morgan, C.: A probabilistic approach to information hiding in Programming methodology, pp. 441-460. Springer, Heidelberg (2003)
22. Millen, J.K.: Covert channel capacity. In: IEEE Symposium on Security and Privacy, pp. 60-66 (1987)
23. Moddemejer, R.: On estimation of entropy and mutual information of continuous distributions. Signal Processing 16, 233-248 (1989)
24. Moskowitz, I.S., Newman, R.E., Syverson, P.F.: Quasi-anonymous channels. In: IASTED CNIS, pp. 126-131 (2003)
25. Paninski, L.: Estimation of entropy and mutual information. Neural Comp. 15(6), 1191-1253 (2003)
26. 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)
27. Troncoso, C., Danezis, G.: The bayesian traffic analysis of mix networks. In: Proceedings of the 16th ACM conference on Computer and communications security, pp. 369-379 (2009)
28. Wheeler, A.J., Ganji, A.R.: Introduction to Engineering Experimentation, 3rd edn. Prentice Hall, Englewood Cliffs (2009)
29. Zhu, Y., Bettati, R.: Anonymity vs. information leakage in anonymity systems. In: Proc. of ICDCS, pp. 514-524. IEEE Computer Society, Los Alamitos (2005)