On the composition of secure systems

Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy

Volumn , Issue , 2002, Pages 88-101

  Mantel, Heiko ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW ANALYSIS; INTERFACES (COMPUTER); LARGE SCALE SYSTEMS; SYSTEM THEORY; SYSTEMS ANALYSIS;

LEMMA; SECURITY PROPERTIES;

SECURITY OF DATA;

EID: 0036083020     PISSN: 10637109     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. A core calculus of dependency
2. Transforming out timing leaks
3. Conjoining specifications
4. Defining liveness
5. A classification of security properties for process algebras
6. Security policies and security models
7. Inference control and unwinding
8. What needs securing?
9. Security and the composition of machines
10. Secure information flow for concurrent processes
11. Possibilistic definitions of security - An assembly kit
12. Unwinding possibilistic security properties
13. Information flow control and applications - Bridging a gap
14. Preserving information flow properties under refinement
15. Proofs of networks of processes
16. Specifications for multi-level security and a hook-up property
17. A hookup theorem for multilevel security
18. Proving noninterference and functional correctness using traces
19. A general theory of composition for trace sets closed under selective interleaving functions
20. A general theory of composition for a class of "possibilistic" security properties
21. Unwinding forward correctability
22. A genetic approach to the security of multi-threaded programs
23. A unifying approach to the security of distributed and multi-threated programs
24. A calculus of information flow
25. Process algebra and non-interference
26. Composing and decomposing systems under security properties
27. A CSP formulation of non-interference and unwinding
28. May testing, non-interference, and compositionality
29. A new type system for secure information flow
30. Probabilistic noninterference for multi-threaded programs
31. A model of information
32. Trace-based network proof systems: Expressiveness and completeness
33. Information flow in nondeterministic systems
34. The composability of non-interference
35. How and why feedback composition fails
36. A general theory of security properties
37. Composing secure systems that have emergent properties