On bounding problems of quantitative information flow

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

Volumn 6345 LNCS, Issue , 2010, Pages 357-372

  Yasuoka, Hirotoshi ^a   Terauchi, Tachio ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

CHANNEL'S CAPACITY; FLOW BASED; FORMAL DEFINITION; MIN-ENTROPY; NON INTERFERENCE; POSITIVE REAL; QUANTITATIVE INFORMATION FLOWS; REAL NUMBER; SAFETY PROPERTY; SHANNON'S ENTROPY;

HARDNESS;

EID: 78049387502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15497-3_22     Document Type: Conference Paper

References (29)

1. Backes, M., Köpf, B., Rybalchenko, A.: Automatic discovery and quantification of information leaks. In: IEEE Symposium on Security and Privacy, pp. 141-153 (2009)
2. Ball, T., Rajamani, S. K.: The SLAM project: debugging system software via static analysis. In: POPL, pp. 1-3 (2002)
3. Barthe, G., D'Argenio, P. R., Rezk, T.: Secure information flow by self-composition. In: CSFW, pp. 100-114 (2004)
4. Beyer, D., Henzinger, T. A., Jhala, R., Majumdar, R.: The software model checker Blast. STTT 9 (5-6), 505-525 (2007)
5. Clark, D., Hunt, S., Malacaria, P.: Quantified interference for a while language. Electr. Notes Theor. Comput. Sci. 112, 149-166 (2005)
6. Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. Journal of Computer Security 15(3), 321-371 (2007)
7. Clarkson, M. R., Myers, A. C., Schneider, F. B.: Belief in information flow. In: CSFW, pp. 31-45 (2005)
8. Clarkson, M. R., Schneider, F. B.: Hyperproperties. In: CSF, pp. 51-65 (2008)
9. Cohen, E. S.: Information transmission in computational systems. In: SOSP, pp. 133-139 (1977)
10. Darvas, Á., Hähnle, R., Sands, D.: A theorem proving approach to analysis of secure information flow. In: Hutter, D., Ullmann, M. (eds.) SPC 2005. LNCS, vol. 3450, pp. 193-209. Springer, Heidelberg (2005)
11. Denning, D. E. R.: Cryptography and data security. Addison-Wesley Longman Publishing Co., Inc., Amsterdam (1982)
12. Goguen, J. A., Meseguer, J.: Security policies and security models. In: IEEE Symposium on Security and Privacy, pp. 11-20 (1982)
13. Henzinger, T. A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL, pp. 58-70 (2002)
14. Köpf, B., Basin, D.: An information-theoretic model for adaptive side-channel attacks. In: CCS, pp. 286-296 (2007)
15. Malacaria, P.: Assessing security threats of looping constructs. In: POPL, pp. 225-235 (2007)
16. Malacaria, P., Chen, H.: Lagrange multipliers and maximum information leakage in different observational models. In: PLAS, pp. 135-146 (2008)
17. Massey, J. L.: Guessing and entropy. In: ISIT, p. 204 (1994)
18. McCamant, S., Ernst, M. D.: Quantitative information flow as network flow capacity. In: PLDI, pp. 193-205 (2008)
19. McLean, J.: A general theory of composition for trace sets closed under selective interleaving functions. In: IEEE Security and Privacy, pp. 79-93 (1994)
20. McMillan, K. L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R. B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 123-136. Springer, Heidelberg (2006)
21. Naumann, D. A.: From coupling relations to mated invariants for checking information flow. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 279-296. Springer, Heidelberg (2006)
22. Newsome, J., McCamant, S., Song, D.: Measuring channel capacity to distinguish undue influence. In: PLAS, pp. 73-85 (2009)
23. Shannon, C.: A mathematical theory of communication. Bell System Technical Journal 27, 379-423, 623-656 (1948)
24. Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 288-302. Springer, Heidelberg (2009)
25. Terauchi, T., Aiken, A.: Secure information flow as a safety problem. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 352-367. Springer, Heidelberg (2005)
26. Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865-877 (1991)
27. Unno, H., Kobayashi, N., Yonezawa, A.: Combining type-based analysis and model checking for finding counterexamples against non-interference. In: PLAS, pp. 17-26 (2006)
28. Yasuoka, H., Terauchi, T.: On bounding problems of quantitative information flow (2010), http://www.kb.ecei.tohoku.ac.jp/~yasuoka
29. Yasuoka, H., Terauchi, T.: Quantitative information flow - verification hardness and possibilities. In: CSF (2010)