Secure Composition of Untrusted Code: Wrappers and Causality Types

Authors:
Peter Sewell;Jan Vitek
Affiliations:
-;-
Venue:
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Year:
2000

Citing 0
Cited 16

Secure safe ambients

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
π-calculi

Formal methods for distributed processing
Boxed Ambients

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Reasoning about Security in Mobile Ambients

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Composability of Secrecy

MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
Secrecy-Preserving Refinement

FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Models for Name-Passing Processes: Interleaving and Causal

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Simple View of Type-Secure Information Flow in the "-Calculus

CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Secure composition of untrusted code: box π, wrappers, and causality types

Journal of Computer Security - CSFW13
Dynamic rebinding for marshalling and update, with destruct-time ?

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Classification of security properties in a Linda-like process algebra

Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction

Journal of Functional Programming
Causality and Accountability

Formal Aspects in Security and Trust
A language for information flow: dynamic tracking in multiple interdependent dimensions

Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems

FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Behavioural typing for safe ambients

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of assembling concurrent software systems from untrusted or partially trusted off-the-shelf components, using wrapper programs to encapsulate components and enforce security policies. In previous work, we introduced the box-pi process calculus with constrained interaction to express wrappers and discussed the rigorous formulation of their security properties. This paper addresses the verification of wrapper information flow properties. We present a novel causal type system that statically captures the allowed flows between wrapped possibly-badly-typed components; we use it to prove that an example unidirectional-flow wrapper enforces a causal flow property.