Confidentiality for multithreaded programs via bisimulation

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

Volumn 2890, Issue , 2003, Pages 260-273

  Sabelfeld, Andrei ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

BISIMULATIONS; CONCURRENT PROGRAM; INDISTINGUISHABILITY; MULTI-THREADED PROGRAMS; SHARED MEMORY;

MULTITASKING;

EID: 33745197683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (35)

1. J. Agat. Transforming out timing leaks. In Proc. ACM Symp. on Principles of Programming Languages, pages 40-53, January 2000.
2. A. Aldini. Probabilistic information flow in a process algebra. In Proc. CONCUR'01, volume 2154 of LNCS, pages 152-168. Springer-Verlag, August 2001.
3. A. Aldini, M. Bravetti, and R. Gorrieri. A process algebraic approach for the analysis of probabilistic non-interference. Technical Report UBLCS-2002-02, University of Bologna, Bologna, Italy, 2002.
4. G. Boudol and I. Castellani. Noninterference for concurrent programs. In Proc. ICALP, volume 2076 of LNCS, pages 382-395. Springer-Verlag, July 2001.
5. K. Cerans. Decidability of bisimulation equivalences for parallel timer processes. In Proc. CAV 1992, volume 663 of LNCS, pages 302-315. Springer-Verlag, June 1992.
6. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Comm. of the ACM, 20(7):504-513, July 1977.
7. E. W. Felten and M. A. Schneider. Timing attacks on web privacy. In ACM Conference on Computer and Communications Security, pages 25-32, 2000.
8. R. Focardi and R. Gorrieri. A classification of security properties for process algebras. J. Computer Security, 3(1):5-33, 1995.
9. R. Focardi, R. Gorrieri, and F. Martinelli. Information flow analysis in a discrete-time process algebra. In Proc. IEEE Computer Security Foundations Workshop, pages 170-184, July 2000.
10. R. Focardi, R. Gorrieri, and F. Martinelli. Real-time information flow analysis. IEEE J. Selected Areas in Communications, 21(1):20-35, January 2003.
11. P. Giambiagi and M. Dam. On the secure implementation of security protocols. In Proc. European Symposium on Programming, volume 2618 of LNCS, pages 144-158. Springer-Verlag, April 2003.
12. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symp. on Security and Privacy, pages 11-20, April 1982.
13. J.W. Gray III. Probabilistic interference. In Proc. IEEE Symp. on Security and Privacy, pages 170-179, May 1990.
14. K. Honda and N. Yoshida. A uniform type structure for secure information flow. In Proc. ACM Symp. on Principles of Programming Languages, pages 81-92, January 2002.
15. J. Jürjens. Secure information flow for concurrent processes. In Proc. CONCUR 2000, volume 1877 of LNCS, pages 395-409. Springer-Verlag, August 2000.
16. P. C. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Proc. CRYPTO'96, volume 1109 of LNCS, pages 104-113. Springer-Verlag, 1996.
17. D. Kozen. Language-based security. In Proc. Mathematical Foundations of Computer Science, volume 1672 of LNCS, pages 284-298. Springer-Verlag, September 1999.
18. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
19. H. Mantel. On the composition of secure systems. In Proc. IEEE Symp. on Security and Privacy, pages 81-94, May 2002.
20. H. Mantel and A. Sabelfeld. A unifying approach to the security of distributed and multi-threaded programs. J. Computer Security, 2003. To appear.
21. D. McCullough. Specifications for multi-level security and hook-up property. In Proc. IEEE Symp. on Security and Privacy, pages 161-166, April 1987.
22. J. McLean. Security models and information flow. In Proc. IEEE Symp. on Security and Privacy, pages 180-187, May 1990.
23. J. McLean. A general theory of composition for trace sets closed under selective interleaving functions. In Proc. IEEE Symp. on Security and Privacy, pages 79-93, May 1994.
24. P. Ryan and S. Schneider. Composing and decomposing systems under security properties. In Proc. IEEE Computer Security Foundations Workshop, pages 9-15, March 1995.
25. P. Ryan and S. Schneider. Process algebra and non-interference. In Proc. IEEE Computer Security Foundations Workshop, pages 214-227, June 1999.
26. A. Sabelfeld. The impact of synchronisation on secure information flow in concurrent programs. In Proc. Andrei Ershov International Conference on Perspectives of System Informatics, volume 2244 of LNCS, pages 227-241. Springer-Verlag, July 2001.
27. A. Sabelfeld and H. Mantel. Static confidentiality enforcement for distributed programs. In Proc. Symposium on Static Analysis, volume 2477 of LNCS, pages 376-394. Springer-Verlag, September 2002.
28. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, January 2003.
29. A. Sabelfeld and D. Sands. Probabilistic noninterference for multi-threaded programs. In Proc. IEEE Computer Security Foundations Workshop, pages 200-214, July 2000.
30. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. Higher Order and Symbolic Computation, 14(1):59-91, March 2001.
31. F. B. Schneider, G. Morrisett, and R. Harper. A language-based approach to security. In Informatics - 10 Years Back, 10 Years Ahead, volume 2000 of LNCS, pages 86-101. Springer-Verlag, 2000.
32. S. Schneider. May testing, non-interference, and compositionality. Technical Report CSD-TR-00-02, Royal Holloway, University of London, January 2001.
33. G. Smith. A new type system for secure information flow. In Proc. IEEE Computer Security Foundations Workshop, pages 115-125, June 2001.
34. D. Volpano and G. Smith. Verifying secrets and relative secrecy. In Proc. ACM Symp. on Principles of Programming Languages, pages 268-276, January 2000.
35. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. J. Computer Security, 4(3):167-187, 1996.