Confidentiality-preserving refinement is compositional – Sometimes

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

Volumn 2502, Issue , 2002, Pages 194-211

  Santen, Thomas ^a   Heisel, Maritta ^b   Pfitzmann, Andreas ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA; SPECIFICATIONS;

AIDING SYSTEM; COMPOSITIONALITY;

SECURITY SYSTEMS;

EID: 84957012794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45853-0_12     Document Type: Conference Paper

References (16)

1. [1] J.A. Goguen and J. Meseguer. Security policies and security models. In IEEE Symposium on Security and Privacy, pages 11–20. IEEE Computer Society Press, 1982.
2. [2] J. Graham-Cumming and J.W. Sanders. On the refinement of non-interference. In 9th IEEE Computer Security Foundations Workshop, pages 35–42. IEEE Computer Society Press, 1991.
3. [3] J.W. Gray. Toward a mathematical foundation for information flow security. Journal of Computer Security, 1992.
4. [4] M. Heisel, A. Pfitzmann, and T. Santen. Confidentiality-preserving refinement. In 14th IEEE Computer Security Foundations Workshop, pages 295–305. IEEE Computer Society Press, 2001.
5. [5] J. Jacob. On the derivation of secure components. In IEEE Symposium on Security and Privacy, pages 242–247. IEEE Press, 1989.
6. [6] J. Jürjens. Secure information flow for concurrent processes. In CONCUR 2000, LNCS 1877. Springer-Verlag, 2000.
7. [7] J. Jürjens. Secrecy-preserving refinement. In J.N. Oliveira and P. Zave, editors, FME 2001: Formal Methods for Increasing Software Productivity, LNCS 2021, pages 135–152. Springer-Verlag, 2001.
8. [8] G. Lowe. Quantifying information flow. In 15th IEEE Computer Security Foundations Workshop, pages 18–31. IEEE Computer Society, 2002.
9. [9] H. Mantel. Preserving information flow properties under refinement. In IEEE Symposium on Security and Privacy, pages 78–91. IEEE Computer Society Press, 2001.
10. [10] H. Mantel. On the composition of secure systems. In IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 2002. to appear.
11. [11] C. Morgan, A. McIver, K. Seidel, and J. W. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617–647, 1996.
12. [12] A.W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.
13. [13] P.Y.A. Ryan and S.A. Schneider. Process algebra and non-interference. In 12th IEEE Computer Security Foundations Workshop, pages 214–227. IEEE Computer Society, 1999.
14. [14] T. Santen, M. Heisel, and A. Pfitzmann. Compositionality of confidentialitypreserving refinement. Technical Report 10/2002, Technische Universität Berlin, 2002.
15. [15] J. M. Spivey. The Z Notation–A Reference Manual. Prentice Hall, 2nd edition, 1992.
16. [16] J. T. Wittbold and D. M. Johnson. Information flow in nondeterministic systems. In IEEE Symposium on Security and Privacy, pages 144–161. IEEE, 1990.