Secrecy and Group Creation

We add an operation of group creation to the typed π-calculus, where a group is a type for channels. Creation of fresh groups has the effect of statically preventing certain communications, and can block the accidental or malicious leakage of secrets. Intuitively, no channel belonging to a fresh group can be received by processes outside the initial scope of the group, even if those processes are untyped. We formalize this intuition by adapting a notion of secrecy introduced by Abadi, and proving a preservation of secrecy property.

[1]  Flemming Nielson,et al.  Control Flow Analysis for the pi-calculus , 1998, CONCUR.

[2]  Martin Odersky,et al.  Polarized Name Passing , 1995, FSTTCS.

[3]  Andrew M. Pitts,et al.  A New Approach to Abstract Syntax with Variable Binding , 2002, Formal Aspects of Computing.

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

[5]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[7]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[8]  Luca Cardelli,et al.  Types for the Ambient Calculus , 2002, Inf. Comput..

[9]  Matthew Hennessy.  A Typed Language for Distributed Mobile Processes , 1998 .

[10]  Vasco Thudichum Vasconcelos,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[11]  Kohei Honda,et al.  Principal Typing Schemes in a Polyadic pi-Calculus , 1993, CONCUR.

[12]  Martín Abadi,et al.  Security Protocols and Specifications , 1999, FoSSaCS.

[13]  Simon J. Gay,et al.  A sort inference algorithm for the polyadic π-calculus , 1993, POPL '93.

[14]  Martín Abadi,et al.  Secrecy by typing in security protocols , 1999, JACM.

[15]  Dorothy E. Denning,et al.  A lattice model of secure information flow , 1976, CACM.

[16]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[17]  Andrew D. Gordon,et al.  Region Analysis and a pi-Calculus wiht Groups , 2000, MFCS.

[18]  Mads Tofte,et al.  Region-based Memory Management , 1997, Inf. Comput..

[19]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

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

[21]  James Riely,et al.  A typed language for distributed mobile processes (extended abstract) , 1998, POPL '98.

[22]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[23]  Andrew D. Gordon,et al.  Region analysis and a pi-calculus with groups , 2002, J. Funct. Program..

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