Quantifying probabilistic information flow in computational reactive systems

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

Volumn 3679 LNCS, Issue , 2005, Pages 336-354

  Backes, Michael ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROBABILISTIC; COMPUTATIONAL RESTRICTIONS; CRYPTOGRAPHIC SYSTEMS; ERROR PROBABILITIES;

CRYPTOGRAPHY; DATA PRIVACY; ERROR ANALYSIS; NETWORK PROTOCOLS; PROBABILITY; SIGNAL INTERFERENCE;

INFORMATION THEORY;

EID: 33646022579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555827_20     Document Type: Conference Paper

References (40)

1. M. Backes and B. Pfitzmann. Computational probabilistic non-interference. In Proc. 7th European Symposium on Research in Computer Security (ESORICS), volume 2502 of Lecture Notes in Computer Science, pages 1-23. Springer, 2002.
2. M. Backes and B. Pfitzmann. Intransitive non-interference for cryptographic purposes. In Proc. 24th IEEE Symposium on Security & Privacy, pages 140-152, 2003.
3. M. Backes, B. Pfitzmann, and M. Waidner. Secure asynchronous reactive systems. IACR Cryptology ePrint Archive 2004/082, Mar. 2004.
4. D. Bell and L. LaPadula. Secure computer systems: Unified exposition and multics interpretation. Computer Science Technical Report ESD-TR-75-306, The Mitre Corporation, 1976.
5. D. Clark, S. Hunt, and P. Malacaria. Quantitative analysis of the leakage of confidential data. In Proc. Quantitative Aspects of Programming Languages, volume 59 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002.
6. D. Denning. Cryptography and Data Security. Addison-Wesley, 1982.
7. D. E. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236-243, 1976.
8. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. In Proc. 15th IEEE Computer Security Foundations Workshop (CSFW), pages 1-17, 2002.
9. R. Focardi and R. Gorrieri. The compositional security checker: A tool for the verification of information flow security properties. IEEE Transactions on Software Engineering, 23(9):550-571, 1997.
10. R. Focardi and F. Martinelli. A uniform approach to the definition of security properties. In Proc. 8th Symposium on Formal Methods Europe (FME 1999), volume 1708 of Lecture Notes in Computer Science, pages 794-813. Springer, 1999.
11. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. 3rd IEEE Symposium on Security & Privacy, pages 11-20, 1982.
12. J. A. Goguen and J. Meseguer. Unwinding and inference control. In Proc. 5th IEEE Symposium on Security & Privacy, pages 75-86, 1984.
13. J. W. Gray III. Probabilistic interference. In Proc. 11th IEEE Symposium on Security & Privacy, pages 170-179, 1990.
14. J. W. Gray III. Toward a mathematical foundation for information flow security. Journal of Computer Security, 1(3):255-295, 1992.
15. C. A. R. Hoare. Communicating Sequential Processes. International Series in Computer Science, Prentice Hall, Hemel Hempstead, 1985.
16. M. H. Rang, I. S. Moskowitz, and D. C. Lee. A network version of the pump. In Proc. 16th IEEE Symposium on Security & Privacy, pages 144-154, 1995.
17. B. W. Lampson. A note on the confinement problem. Communications of the ACM, 16(10):613-615, 1973.
18. P. Laud. Semantics and program analysis of computationally secure information flow. In Proc. 10th European Symposium on Programming (ESOP), pages 77-91, 2001.
19. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. 25th IEEE Symposium on Security & Privacy, pages 71-85, 2004.
20. G. Lowe. Quantifying information flow. In Proc. 15th IEEE Computer Security Foundations Workshop (CSFW), pages 18-31, 2002.
21. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, 1996.
22. H. Mantel. Unwinding possibilistic security properties. In Proc. 6th European Symposium on Research in Computer Security (ESORICS), volume 1895 of Lecture Notes in Computer Science, pages 238-254. Springer, 2000.
23. H. Mantel and A. Sabelfeld. A generic approach to the security of multi-threaded programs. In Proc. 14th IEEE Computer Security Foundations Workshop (CSFW), pages 200-214, 2001.
24. D. McCullough. Specifications for multi-level security and a hook-up property. In Proc. 8th IEEE Symposium on Security & Privacy, pages 161-166, 1987.
25. J. McLean. Security models and information flow. In Proc. 11th IEEE Symposium on Security & Privacy, pages 180-187, 1990.
26. J. McLean. Security models. Chapter in Encyclopedia of Software Engineering, 1994.
27. J. K. Millen. Covert channel capacity. In Proc. 8th IEEE Symposium on Security & Privacy, pages 60-66, 1987.
28. A. Myers and B. Liskov. A decentralized model for information flow control. In Proc. ACM Symposium on Operating System Principles, pages 129-142, 1997.
29. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. 22nd IEEE Symposium on Security & Privacy, pages 184-200, 2001.
30. Extended version of the model (with Michael Backes) IACR Cryptology ePrint Archive 2004/082, http://eprint.iacr.org/.
31. R. G. Riccardo Focardi, Anna Ghelli. Using non-interference for the analysis of security protocols. In Proc. DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997.
32. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. In Proc. European Symposium on Programming (ESOP), pages 40-58. Springer, 1999.
33. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proc. 13th IEEE Computer Security Foundations Workshop (CSFW), pages 200-214, 2000.
34. D. Sutherland. A model of information. In Proc. 9th National Computer Security Conference, pages 175-183, 1986.
35. D. Volpano. Secure introduction of one-way functions. In Proc. 13th IEEE Computer Security Foundations Workshop (CSFW), pages 246-254, 2000.
36. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. In Proc. 11th IEEE Computer Security Foundations Workshop (CSFW), pages 34-43, 1998.
37. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996.
38. J. T. Wittbold and D. M. Johnson. Information flow in nondeterministic systems. In Proc. 11th IEEE Symposium on Security & Privacy, pages 144-161, 1990.
39. A. C. Yao. Theory and applications of trapdoor functions. In Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOGS), pages 80-91, 1982,
40. S. Zdancewic and A. C. Myers. Secure information flow and CPS. In Proc. 10th European Symposium on Programming (ESOP), volume 2028 of Lecture Notes in Computer Science, pages 46-61. Springer, 2001.