Probabilistic noninterference through weak probabilistic bisimulation

Proceedings of the Computer Security Foundations Workshop

Volumn 2003-January, Issue , 2003, Pages 3-13

  Smith, G ^a  

^a Florida International University   (United States)

Author keywords

Application software; Computer languages; Computer science; Computer security; Conferences; Mobile computing; Probability distribution; Processor scheduling; Timing; Yarn

Indexed keywords

APPLICATION PROGRAMS; CHAINS; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; MARKOV PROCESSES; MOBILE COMPUTING; SCHEDULING; SECURITY OF DATA; SECURITY SYSTEMS; YARN;

APPLICATION SOFTWARES; CONFERENCES; MULTI-THREADED PROGRAMS; PROBABILISTIC BISIMULATIONS; PROBABILISTIC NONINTERFERENCE; PROCESSOR SCHEDULING; SECURE INFORMATION FLOW; TIMING;

PROBABILITY DISTRIBUTIONS;

EID: 18544362925     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2003.1212701     Document Type: Conference Paper

References (19)

1. J. Agat. Transforming out timing leaks. InProceedings 27th Symposium on Principles of Programming Languages, pages 40-53, Boston, MA, Jan. 2000.
2. J. Agat. Type Based Techniques for Covert Channel Elimination and Register Allocation. PhD thesis, Chalmers University of Technology, Göteborg, Sweden, Dec. 2000.
3. A. Aldini. Probabilistic information flow in a process algebra. In Proc. CONCUR 2001 - Concurrency Theory, pages 152-168. Lecture Notes in Computer Science2154, Aug. 2001.
4. T. M. Apostol. Mathematical Analysis. Addison-Wesley, 1960.
5. C. Baier and H. Hermanns. Weak bisimulation for fully probabilistic processes. InProc. Computer Aided Verification '97, pages 119-130. Lecture Notes in Computer Science1254, 1997.
6. A. Banerjee and D. A. Naumann. Secure information flow and pointer confinement in a java-like language. In Proceedings 15th IEEE Computer Security Foundations Workshop, pages 253-267, Cape Breton, Nova Scotia, Canada, June 2002.
7. G. Boudol and I. Castellani. Noninterference for concurrent programs and thread systems. Technical Report 4254, INRIA, Sept. 2001.
8. W. Feller. An Introduction to Probability Theory and Its Applications, volume I. John Wiley & Sons, Inc., third edition, 1968.
9. K. Honda, V. Vasconcelos, and N. Yoshida. Secure information flow as typed process behaviour. In Proceedings 9th European Symposium on Programming, volume 1782 of Lecture Notes in Computer Science, pages 180-199, Apr. 2000.
10. K. Honda and N. Yoshida. A uniform type structure for secure information flow. InProceedings 29th Symposium on Principles of Programming Languages, pages 81-92, Portland, Oregon, Jan. 2002.
11. J. Kemeny and J. L. Snell. Finite Markov Chains.D. Van Nostrand, 1960.
12. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
13. J. R. Norris. Markov Chains.Cambridge University Press, 1998.
14. A. Sabelfeld and A. C. Myers. Language-based information flow security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, Jan. 2003.
15. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proceedings 13th IEEE Computer Security Foundations Workshop, pages 200-214, Cambridge, UK, July 2000.
16. G. Smith. A new type system for secure information flow. In Proceedings 14th IEEE Computer Security Foundations Workshop, pages 115-125, Cape Breton, Nova Scotia, Canada, June 2001.
17. G. Smith and D. Volpano. Secure information flow in a multi-threaded imperative language. In Proceedings 25th Symposium on Principles of Programming Languages, pages 355-364, San Diego, CA, Jan. 1998.
18. D. Volpano and G. Smith. Probabilistic noninterference in a concurrent language. Journal of Computer Security, 7(2,3):231-253, 1999.
19. R. Yocum. Type checking for secure information flow in a multi-threaded language. Master's thesis, Florida International University, 2002.