Seal: A Framework for Secure Mobile Computations

The Seal calculus is a distributed process calculus with localities and mobility of computational entities called seals. Seal is also a framework for writing secure distributed applications over large scale open networks such as the Internet. This paper motivates our design choices, presents the syntax and reduction semantics of the calculus, and demonstrates its expressiveness by examples focused on security and management distributed systems.

[1]  Mike Hibler,et al.  Microkernels meet recursive virtual machines , 1996, OSDI '96.

[2]  Jan Vitek,et al.  Flexible Alias Protection , 1998, ECOOP.

[3]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[4]  Luca Cardelli,et al.  Abstractions for Mobile Computation , 1999, Secure Internet Programming.

[5]  Jim Waldo,et al.  A Note on Distributed Computing , 1996, Mobile Object Systems.

[6]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[7]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[8]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

[9]  James Riely,et al.  Distributed Processes and Location Failures (Extended Abstract) , 1997, ICALP.

[10]  Roberto M. Amadio,et al.  An Asynchronous Model of Locality, Failure and Process Mobility , 1997, COORDINATION.

[11]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[12]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[13]  Jan Vitek,et al.  Secure composition of insecure components , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[14]  Rocco De Nicola,et al.  Locality Based Linda: Programming with Explicit Localities , 1997, TAPSOFT.

[15]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[16]  Roberto M. Amadio.  On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation , 1993, CONCUR.

[17]  Peter Sewell.  Global/Local Subtyping and Capability Inference for a Distributed pi-calculus , 1998, ICALP.

[18]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[19]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[20]  James Riely,et al.  Type-Safe Execution of Mobile Agents in Anonymous Networks , 1998, ECOOP Workshops.

[21]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[22]  Luca Cardelli,et al.  Mobile Ambients , 1998, Foundations of Software Science and Computation Structure.

[23]  Rocco De Nicola,et al.  Coordinating Mobile Agents via Blackboards and Access Rights , 1997, COORDINATION.

[24]  Fred B. Schneider.  What good are models and what models are good , 1993 .

[25]  Benjamin C. Pierce,et al.  Location-Independent Communication for Mobile Agents: A Two-Level Architecture , 1998, ICCL Workshop: Internet Programming Languages.

[26]  Helena Rodrigues,et al.  Cyclic Distributed Garbage Collection with Group Merger , 1998, ECOOP.

[27]  Corrado Priami,et al.  Mobile Processes with a Distributed Environment , 1996, ICALP.