Quantifying information flow using min-entropy

Proceedings of the 2011 8th International Conference on Quantitative Evaluation of Systems, QEST 2011

Volumn , Issue , 2011, Pages 159-167

  Smith, Geoffrey ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYES RISK; CONFIDENTIAL INFORMATION; INFORMATION FLOWS; MIN-ENTROPY; MUTUAL INFORMATIONS; PRACTICAL SYSTEMS; PROBABILISTIC SYSTEMS; QUANTITATIVE THEORY; SHANNON ENTROPY;

ENTROPY; INFORMATION THEORY; RANDOM VARIABLES;

INFORMATION USE;

EID: 80055063879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2011.31     Document Type: Conference Paper

References (36)

1. D. Clark, S. Hunt, and P. Malacaria, "Quantitative information flow, relations and polymorphic types," Journal of Logic and Computation, vol. 18, no. 2, pp. 181-199, 2005. (Pubitemid 40860589)
2. M. Clarkson, A. Myers, and F. Schneider, "Belief in information flow," in Proc. 18th IEEE Computer Security Foundations Workshop (CSFW '05), 2005, pp. 31-45.
3. B. Köpf and D. Basin, "An information-theoretic model for adaptive side-channel attacks," in Proc. 14th ACM Conference on Computer and Communications Security (CCS '07), 2007, pp. 286-296.
4. M. Alvim, M. Andrés, and C. Palamidessi, "Probabilistic information flow," in Proc. 25th IEEE Symposium on Logic in Computer Science (LICS 2010), 2010, pp. 314-321.
5. S. Hamadou, V. Sassone, and C. Palamidessi, "Reconciling belief and vulnerability in information flow," in Proc. 31st IEEE Symposium on Security and Privacy, 2010, pp. 79-92.
6. C. E. Shannon, "A mathematical theory of communication,"Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, 1948.
7. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. John Wiley & Sons, Inc., 2006.
8. J. Newsome, S. McCamant, and D. Song, "Measuring channel capacity to distinguish undue influence," in Proc. Fourth Workshop on Programming Languages and Analysis for Security (PLAS '09), 2009, pp. 73-85.
9. M. R. Clarkson and F. B. Schneider, "Quantification of integrity," in Proc. 23nd IEEE Computer Security Foundations Symposium (CSF '10), 2010, pp. 28-43.
10. C. E. Shannon, "The bandwagon," IRE Transactions on Information Theory, vol. 2, no. 1, p. 3, 1956.
11. A. Rényi, "On measures of entropy and information," in Proc. 4th Berkeley Symposium on Mathematics, Statistics and Probability 1960, 1961, pp. 547-561.
12. N. Abramson, Information Theory and Coding. McGraw-Hill, 1963.
13. W. Feller, An Introduction to Probability Theory and Its Applications, 3rd ed. John Wiley & Sons, Inc., 1968, vol. I.
14. R. G. Gallager, Information Theory and Reliable Communication. John Wiley and Sons, Inc., 1968.
15. D. J. MacKay, Information Theory, Inference, and Learning Algorithms. Cambridge University Press, 2003.
16. P. Malacaria, "Assessing security threats of looping constructs,"in Proc. 34th Symposium on Principles of Programming Languages (POPL '07), 2007, pp. 225-235.
17. K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, "Anonymity protocols as noisy channels," Information and Computation, vol. 206, pp. 378-401, 2008.
18. J. L. Massey, "Guessing and entropy," in Proc. 1994 IEEE International Symposium on Information Theory, 1994, p. 204.
19. G. Smith, "On the foundations of quantitative information flow," in Proc. 12th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS '09), ser. Lecture Notes in Computer Science, L. de Alfaro, Ed., vol. 5504, 2009, pp. 288-302.
20. K. Chatzikokolakis, C. Palamidessi, and P. Panangaden, "On the Bayes risk in information-hiding protocols," Journal of Computer Security, vol. 16, no. 5, pp. 531-571, 2008.
21. C. Cachin, "Entropy measures and unconditional security in cryptography," Ph.D. dissertation, Swiss Federal Institute of Technology, 1997.
22. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," SIAM Journal of Computing, vol. 38, no. 1, pp. 97-139, 2008.
23. C. Braun, K. Chatzikokolakis, and C. Palamidessi, "Quantitative notions of leakage for one-try attacks," in Proc. 25th Conference on Mathematical Foundations of Programming Semantics (MFPS 2009), ser. ENTCS, vol. 249, 2009, pp. 75-91.
24. B. Köpf and G. Smith, "Vulnerability bounds and leakage resilience of blinded cryptography under timing attacks," in Proc. 23nd IEEE Computer Security Foundations Symposium (CSF '10), 2010, pp. 44-56.
25. N. Santhi and A. Vardy, "On an improvement over Rényi's equivocation bound," in 44th Annual Allerton Conference on Communication, Control, and Computing, 2006.
26. K. Chatzikokolakis and K. Martin, "A monotonicity principle for information theory." in Proc. 24th Conference on the Mathematical Foundations of Programming Semantics, ser. Electronic Notes in Theoretical Computer Science, vol. 218, 2008, pp. 111-129.
27. B. Espinoza and G. Smith, "Min-entropy leakage of channels in cascade," 2011, submitted for publication.
28. M. Alvim, M. Andrés, K. Chatzikokolakis, P. Degano, and C. Palamidessi, "Differential privacy: on the trade-off between utility and information leakage," LIX, Ecole Polytechnique, Tech. Rep., 2011.
29. G. Barthe and B. Köpf, "Information-theoretic bounds for differentially private mechanisms," in Proc. 24th IEEE Computer Security Foundations Symposium (CSF 2011), 2011, to appear.
30. C. Dwork, "A firm foundation for private data analysis, "Communications of the ACM, vol. 54, no. 1, 2011.
31. H. Yasuoka and T. Terauchi, "Quantitative information flow - verification hardness and possibilities," in Proc. 23nd IEEE Computer Security Foundations Symposium (CSF '10), 2010, pp. 15-27.
32. M. Andrés, C. Palamidessi, P. van Rossum, and G. Smith, "Computing the leakage of information-hiding systems," in Tools and Algorithms for the Construction and Analysis of Systems (TACAS '10), ser. Lecture Notes in Computer Science, J. Esparza and R. Majumdar, Eds., vol. 6015, 2010, pp. 373-389.
33. K. Chatzikokolakis, T. Chothia, and A. Guha, "Statistical measurement of information leakage," in Tools and Algorithms for the Construction and Analysis of Systems (TACAS '10), ser. Lecture Notes in Computer Science, J. Esparza and R. Majumdar, Eds., vol. 6015, 2010, pp. 390-404.
34. B. Köpf and A. Rybalchenko, "Approximation and randomization for quantitative information-flow analysis," in Proc. 23nd IEEE Computer Security Foundations Symposium (CSF '10), 2010, pp. 3-14.
35. J. Heusser and P. Malacaria, "Quantifying information leaks in software," in Proc. ACSAC '10, 2010.
36. Z. Meng and G. Smith, "Calculating bounds on information leakage using two-bit patterns," in Proc. Sixth Workshop on Programming Languages and Analysis for Security (PLAS '11), 2011.