The complexity of quantitative information flow problems

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2011, Pages 205-217

  Černý, Pavol ^a   Chatterjee, Krishnendu ^a   Henzinger, Thomas A ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

computational complexity; quantitative information flow; synthesis; verification

Indexed keywords

INFORMATION THEORY;

FINE GRAINED; FLOW PROBLEMS; INFORMATION FLOWS; LIMITED INFORMATION; MEMORYLESS; PSPACE-COMPLETE; QUANTITATIVE INFORMATION FLOWS; REASONING ABOUT PROGRAMS; SHANNON'S ENTROPY; SYNTHESIS PROBLEMS;

COMPUTATIONAL COMPLEXITY;

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

References (19)

1. F. Schneider, Ed., Trust in Cyberspace. National Academy Press, 1999.
2. S. Goodman and H. Lin, Eds., Toward a Safer and More Secure Cyberspace. National Academy Press, 2007.
3. J. Saltzer and M. Schroeder, "The protection of information in computer systems," Proceedings of the IEEE, vol. 63, no. 9, pp. 1278-1308, 1975.
4. A. Sabelfeld and A. Myers, "Language-based informationflow security," IEEE Journal on Selected Areas in Communications, vol. 21, no. 1, pp. 5-19, 2003.
5. A. Myers, "JFlow: Practical mostly-static information flow control," in Proc. of POPL'99, 1999, pp. 228-241.
6. A. Sabelfeld and D. Sands, "Dimensions and principles of declassification," in CSFW '05, 2005, pp. 255-269.
7. D. Denning, Cryptography and data security. Addison-Wesley, 1982.
8. D. Clark, S. Hunt, and P. Malacaria, "A static analysis for quantifying information flow in a simple imperative language,"Journal of Computer Security, vol. 15, no. 3, pp. 321-371, 2007. (Pubitemid 46868450)
9. -, "Quantified interference for a while language," Electr. Notes Theor. Comput. Sci., vol. 112, pp. 149-166, 2005.
10. H. Yasuoka and T. Terauchi, "Quantitative information flow - verification hardness and possibilities," in CSF, 2010, pp. 15-27.
11. -, "On bounding problems of quantitative information flow," in ESORICS, 2010, pp. 357-372.
12. G. Smith, "On the foundations of quantitative information flow," in FOSSACS, 2009, pp. 288-302.
13. E. Clarke, O. Grumberg, and D. Peled, Model Checking. MIT Press, 1999.
14. J. Reif, "The complexity of two-player games of incomplete information," Journal on Computer and System Sciences, vol. 29, pp. 274-301, 1984. (Pubitemid 15422064)
15. A. Solar-Lezama, R. Rabbah, R. Bodík, and K. Ebcioglu, "Programming by sketching for bit-streaming programs," in PLDI, 2005.
16. A. Solar-Lezama, C. Jones, and R. Bodík, "Sketching concurrent data structures," in PLDI, 2008.
17. M. Vechev, E. Yahav, and G. Yorsh, "Abstraction-guided synthesis of synchronization," in POPL, 2010.
18. C. Papadimitriou, Computational Complexity. Reading, MA, USA: Addison-Wesley Publishing, 1994.
19. A. K. Chandra, D. Kozen, and L. J. Stockmeyer, "Alternation."J. ACM, vol. 28, no. 1, pp. 114-133, 1981.