Information Flow Security for Boxed Ambients

Abstract We study the problem of secure information flow for Boxed Ambients in terms of non-interference. We develop a sound type system that provides static guarantees of absence of unwanted flow of information for well typed processes. Non-interference is stated, and proved, in terms of a typed notion of contextual equivalence for Boxed Ambients akin to the corresponding equivalence defined for Mobile Ambients.

[1]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

[2]  R. Varga,et al.  Proof of Theorem 4 , 1983 .

[3]  Flemming Nielson,et al.  Shape analysis for mobile ambients , 2000, POPL '00.

[4]  Geoffrey Smith,et al.  Secure information flow in a multi-threaded imperative language , 1998, POPL '98.

[5]  Jan Vitek,et al.  Secure composition of untrusted code: wrappers and causality types , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[6]  Agostino Cortesi,et al.  Control Flow Analysis of Mobile Ambients with Security Boundaries , 2002, FMOODS.

[7]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[8]  Flemming Nielson,et al.  Validating Firewalls in Mobile Ambients , 1999, CONCUR.

[9]  R.,et al.  A CLASSIFICATION OF SECURITY PROPERTIES FOR PROCESS ALGEBRAS 1 , 1994 .

[10]  Nobuko Yoshida,et al.  Secure Information Flow as Typed Process Behaviour , 2000, ESOP.

[11]  Leonard M. Adleman,et al.  Proof of proposition 3 , 1992 .

[12]  Ilaria Castellani,et al.  Noninterference for Concurrent Programs , 2001, ICALP.

[13]  Giuseppe Castagna,et al.  Typing Mobility in the Seal Calculus , 2001, CONCUR.

[14]  Davide Sangiorgi,et al.  Controlling interference in ambients , 2000, POPL '00.

[15]  Michele Bugliesi,et al.  Secure safe ambients , 2001, POPL '01.

[16]  Geoffrey Smith,et al.  A Type-Based Approach to Program Security , 1997, TAPSOFT.

[17]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[18]  Michele Bugliesi,et al.  Reasoning about Security in Mobile Ambients , 2001, CONCUR.

[19]  Luca Cardelli,et al.  Equational properties of mobile ambients , 1999, Mathematical Structures in Computer Science.

[20]  Michele Bugliesi,et al.  Boxed Ambients , 2001, TACS.

[21]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[22]  Mariangiola Dezani-Ciancaglini,et al.  Security Types for Mobile Safe Ambients , 2000, ASIAN.

[23]  Luca Cardelli,et al.  Ambient Groups and Mobility Types , 2000, IFIP TCS.

[24]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[25]  James Riely,et al.  Information Flow vs. Resource Access in the Asynchronous Pi-Calculus , 2000, ICALP.

[26]  Geoffrey Smith,et al.  A Sound Type System for Secure Flow Analysis , 1996, J. Comput. Secur..

[27]  Luca Cardelli,et al.  Mobility Types for Mobile Ambients , 1999, ICALP.