A General Theory of Composition for a Class of "Possibilistic" Properties
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
Use of SBIDA cases for IS projects
Proceedings of the 2000 information resources management association international conference on Challenges of information technology management in the 21st century
Applying the dependability paradigm to computer security
NSPW '95 Proceedings of the 1995 workshop on New security paradigms
Specification and development of interactive systems: focus on streams, interfaces, and refinement
Specification and development of interactive systems: focus on streams, interfaces, and refinement
Modelling audit security for Smart-Card payment schemes with UML-SEC
Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
Towards Development of Secure Systems Using UMLsec
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Secure Information Flow for Concurrent Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Formal Verification of Cryptographic Protocols: A Survey
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Secure Composition of Untrusted Code: Wrappers and Causality Types
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Tool Supported Specification and Simulation of Distributed Systems
PDSE '98 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
Using Traces of Procedure Calls to Reason About Composability
SP '92 Proceedings of the 1992 IEEE Symposium on Security and Privacy
Formal Eavesdropping and Its Computational Interpretation
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Specification-Based Testing of Firewalls
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
A sound decision procedure for the compositionality of secrecy
ESSoS'12 Proceedings of the 4th international conference on Engineering Secure Software and Systems
| Hi-index | 0.00 |
Modularity has been seen to be very useful in system development. Unfortunately, many security properties proposed in the literature are not composable (in contrast to other system properties), which is required to reason about them in a modular way. We present work supporting modular development of secure systems by showing a standard notion of secrecy to be composable wrt. the standard composition in the specification framework Focus (extended with cryptographic primitives). Additionally, the property is preserved under the standard refinement. We consider more fine-grained conditions useful in modular verification of secrecy.