Adversaries and information leaks

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

Volumn 4912 LNCS, Issue , 2008, Pages 383-400

  Smith, Geoffrey ^a  

^a FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONFORMAL MAPPING; CRYPTOGRAPHY; DATA FLOW ANALYSIS; PROBABILITY;

INFORMATION FLOW ANALYSIS; INFORMATION LEAKS; PLAINTEXT; PROBABILISTIC SIMULATION;

SECURITY OF DATA;

EID: 41549117992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78663-4_25     Document Type: Conference Paper

References (28)

1. Sabelfeld, A., Myers, A.C.: Language-based information flow security. IEEE Journal on Selected Areas in Communications 21(1), 5-19 (2003)
2. Denning, D., Denning, P.: Certification of programs for secure information flow. Communications of the ACM 20(7), 504-513 (1977)
3. Volpano, D., Smith, G., Irvine, C.: A sound type system for secure flow analysis. Journal of Computer Security 4(2,3), 167-187 (1996)
4. Smith, C., Alpízar, R.: Secure information flow with random assignment and encryption. In: Proc. 4th ACM Workshop on Formal Methods in Security Engineering, Fairfax, Virginia, pp. 33-43 (November 2006)
5. Smith, C., Alpízar, R.: Fast probabilistic simulation, nontermination, and secure information flow. In: Proc. 2007 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security, San Diego, California, pp. 67-71 (June 2007)
6. Bellare, M., Rogaway, P.: Introduction to modern cryptography (2005), http://www-cse.ucsd.edu/users/mihir/cse207/classnotes.html
7. Courant, J., Ene, C., Lakhnech, Y.: Computationally sound typing for non-interference: The case of deterministic encryption. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 364-375. Springer. Heidelberg (2007)
8. Laud, P.: Semantics and program analysis of computationally secure information flow. In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, pp. 77-91. Springer, Heidelberg (2001)
9. Laud. P.: Handling encryption in an analysis for secure information flow. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 159-173. Springer, Heidelberg (2003)
10. Laud. P., Vene, V.: A type system for computationally secure information flow. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 365-377. Springer, Heidelberg (2005)
11. Askarov, A., Hedin, D., Sabelfeld, A.: Cryptographically-masked flows. In: Proceedings of the 13th International Static Analysis Symposium, Seoul. Korea, pp. 353-369 (2006)
12. Laud, P.: On the computational soundness of cryptographically masked flows. In: Proceedings 35th Symposium on Principles of Programming Languages, San Francisco, California (January 2008)
13. Vaughan, J., Zdancewic, S.: A cryptographic decentralized label model. In: IEEE Symposium on Security and Privacy, Oakland, California, pp. 192-206 (2007)
14. Fournet, C., Rezk. T.: Cryptographically sound implementations for typed information-flow security. In: Proceedings 35th Symposium on Principles of Programming Languages. San Francisco, California (January 2008)
15. Backes, M., Pfitzmann, B.: Relating symbolic and cryptographic secrecy. In: Proceeding 26th IEEE Symposium on Security and Privacy, Oakland, California (2005)
16. Laud, P.: Secrecy types for a simulatable cryptographic library. In: Proceedings 12th CCS (ACM Conference on Computer and Communications Security), pp. 26-35 (2005)
17. Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. I. John Wiley & Sons, Inc., Chichester (1968)
18. Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings 13th IEEE Computer Security Foundations Workshop, Cambridge, UK, pp. 200-214 (July 2000)
19. Jonsson, B., Larsen, K.: Specification and refinement of probabilistic processes. In: Proc. 6th IEEE Symposium on Logic in Computer Science, pp. 266-277 (1991)
20. Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation 200(2), 149-214 (2005)
21. Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate non-interference. In: Proceedings 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova, Scotia, Canada, pp. 1-17 (June 2002)
22. Clark, D., Hunt, S., Malacaria, P.: Quantitative analysis of the leakage of confidential data. Electronic Notes in Theoretical Computer Science 59(3) (2002)
23. Clark, D., Hunt, S., Malacaria, P.: Quantitative information flow, relations and polymorphic types. Journal of Logic and Computation 18(2), 181-199 (2005)
24. Malacaria, P.: Assessing security threats of looping constructs. In: Proceedings 34th Symposium on Principles of Programming Languages, Nice, France, pp. 225-235 (January 2007)
25. Köpf, B., Basin, D.: An information-theoretic model for adaptive side-channel attacks. In: Proceedings 14th ACM Conference on Computer and Communications Security, Alexandria, Virginia (2007)
26. Clarkson, M., Myers, A., Schneider, F.: Belief in information flow. In: Proceedings 18th IEEE Computer Security Foundations Workshop, Aix-en-Provence, France, pp. 31-45 (June 2005)
27. Lowe, G.: Quantifying information flow. In: Proceedings 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, pp. 18-31 (June 2002)
28. Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Information and Computation (to appear, 2008)