Notes on nominal calculi for security and mobility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2171 LNCS, Issue , 2001, Pages 262-330

  Gordon, Andrew D ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); PATHOLOGY; SECURITY SYSTEMS;

AMBIENT CALCULUS; MOBILE COMPUTATIONS; NOMINAL CALCULI; PI CALCULUS; RELATED WORKS; SPI CALCULUS;

CALCULATIONS;

EID: 23044531604     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45608-2_5     Document Type: Conference Paper

References (91)

1. [Aba99] M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749–786, September 1999. 289, 323
2. [ABLP93] M. Abadi, M. Burrows, B. Lampson, and G. Plotkin. A calculus for access control in distributed systems. ACM Transactions on Programming Languages and Systems, 15(4):706–734, 1993. 273
3. [AF01] M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In 28th ACM Symposium on Principles of Programming Languages (POPL’01), pages 104–115, 2001. 288, 289
4. [AFG98] M. Abadi, C. Fournet, and G. Gonthier. Secure communications implementation of channel abstractions. In 13th IEEE Symposium on Logic in Computer Science (LICS’98), pages 105–116, 1998. 289
5. [AG98] M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. Nordic Journal of Computing, 5:267–303, 1998. 289
6. [AG99] M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148:1–70, 1999. An extended version with full proofs appears as Digital Equipment Corporation Systems Research Center report No. 149, January 1998. 264, 266
7. [Ama97] R. M. Amadio. An asynchronous model of locality, failure, and process mobility. In COORDINATION 97, volume 1282 of Lecture Notes in Computer Science. Springer, 1997. 293, 323
8. [AN96] M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering, 22(1):6– 15,January 1996. 281
9. [AP94] R. M. Amadio and S. Prasad. Localities and failures. In Foundations of Software Technology and Theoretical Computer Science (FST&TCS’94), volume 880 of Lecture Notes in Computer Science, pages 205–216. Springer, 1994. 317
10. [AP99] R. Amadio and S. Prasad. The game of the name in cryptographic tables. In Advances in Computing Science (ASIAN’99), volume 1742 of Lectures Notes in Computer Science, pages 5–26. Springer, 1999. 289
11. [AR00] M. Abadi and P. Rogaway. Reconciling two views of cryptography. In Theoretical Computer Science (IFIP TCS 2000), volume 1872 of Lectures Notes in Computer Science, pages 3–33. Springer, 2000. 273
12. [BAN89] M. Burrows, M. Abadi, and R. M. Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233–271, 1989. 270, 272, 273, 274
13. [BB90] G. Berry and G. Boudol. The chemical abstract machine. In 17th ACM Symposium on Principles of Programming Languages (POPL’90), pages 81–94, 1990. 284
14. [BC01] M. Bugliesi and G. Castagna. Secure safe ambients. In 28th ACM Symposium on Principles of Programming Languages (POPL’01), pages 222–235, 2001. 324
15. [BDNN98] C. Bodei, P. Degano, F. Nielson, and H. Nielson. Control flow analysis for the π-calculus. In CONCUR’98: Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 84–98. Springer, 1998. 323
16. [BN95] M. Boreale and R. De Nicola. Testing equivalence for mobile processes. Information and Computation, 120(2):279–303, August 1995. 272, 286
17. [BNP99] M. Boreale, R. De Nicola, and R. Pugliese. Proof techniques for cryptographic processes. In 14th IEEE Symposium on Logic in Computer Science, pages 157–166, 1999. 289
18. [Box98] D. Box. Essential COM. Addison-Wesley, 1998. 263
19. [BR95] M. Bellare and P. Rogaway. Provably secure session key distribution: The three party case. In 27th ACM Symposium on Theory of Computing, 1995. 273
20. [BV01] C. Bryce and J. Vitek. The JavaSeal mobile agent kernel. Agent Systems Journal, 2001. To appear. A preliminary version appears in the proceedings of the 3rd International Symposium on Mobile Agents (MA/ASA’99), 1999. 266
21. [Car95] L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, January 1995. 265, 292
22. [Car97] L. Cardelli. Mobile ambient synchronization. SRC Technical Note 1997– 013, Digital Equipment Corporation Systems Research Center, July 1997. 325
23. [Car99] L. Cardelli. Abstractions for mobile computation. In C. Jensen and J. Vitek, editors, Secure Internet Programming: Issues in Distributed and Mobile Object Systems, volume 1603 of Lecture Notes in Computer Science, pages 51–94. Springer, 1999. 265, 324
24. + 01] W. Charatonik, S. Dal Zilio, A. D. Gordon, S. Mukhopadhyay, and J.-M. Talbot. The complexity of model checking mobile ambients. In Foundations of Software Science and Computation Structures (FoS-SaCS’01), Lecture Notes in Computer Science. Springer, 2001. To appear. 324
25. [CG89] N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, 1989. 292
26. [CG99] L. Cardelli and A. D. Gordon. Types for mobile ambients. In 26th ACM Symposium on Principles of Programming Languages (POPL’99), pages 79–92, January 1999. 266, 298, 317, 324
27. [CG00a] L. Cardelli and A. D. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL’00), pages 365–377, 2000. 324
28. [CG00b] L. Cardelli and A. D. Gordon. Mobile ambients. Theoretical Computer Science, 240:177–213, 2000. 265, 266, 294, 297, 324
29. [CG01] L. Cardelli and A. D. Gordon. Logical properties of name restriction. In Typed Lambda Calculi and Applications (TLCA’01), Lecture Notes in Computer Science. Springer, 2001. To appear. 324
30. [CGG99] L. Cardelli, G. Ghelli, and A. D. Gordon. Mobility types for mobile ambients. In 26th International Colloquium on Automata, Languages and Programming (ICALP’99), volume 1644 of Lecture Notes in Computer Science, pages 230–239. Springer, 1999. 322, 324
31. [CGG00a] L. Cardelli, G. Ghelli, and A. D. Gordon. Ambient groups and mobility types. In Theoretical Computer Science (IFIP TCS 2000), volume 1872 of Lecture Notes in Computer Science, pages 333–347. Springer, 2000. 266, 324
32. [CGG00b] L. Cardelli, G. Ghelli, and A. D. Gordon. Group creation and secrecy. In C. Palamidessi, editor, CONCUR 2000—Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, pages 365–379. Springer, 2000. 323
33. [CGZ95] N. Carriero, D. Gelernter, and L. Zuck. Bauhaus linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of Lecture Notes in Computer Science, pages 66–76. Springer, 1995. 292
34. [CH88] T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76(2/3):95–120, February/March 1988. 297
35. [Dam96] M. Dam. Model checking mobile processes. Information and Computation, 129(1):35–51, 1996. 272
36. [Dam98] M. Dam. Proving trust in systems of second-order processes. In 31st Hawaii International Conference on System Sciences, volume VII, pages 255–264, 1998. 272
37. [DES77] Data encryption standard. Fed. Inform. Processing Standards Pub. 46, National Bureau of Standards, Washington DC, January 1977. 274
38. [DFP99] R. De Nicola, G. Ferrari, and R. Pugliese. Types as specifications of access policies. In Secure Internet Programming 1999, volume 1603 of Lecture Notes in Computer Science, pages 117–146. Springer, 1999. 323
39. [DG00] S. Dal Zilio and A. D. Gordon. Region analysis and a π-calculus with groups. In Mathematical Foundations of Computer Science 2000 (MFCS2000), volume 1893 of Lectures Notes in Computer Science, pages 1–21. Springer, 2000. 324
40. [DH76] W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644–654, November 1976. 287
41. [DH84] R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984. 286
42. [DS81] D. E. Denning and G. M. Sacco. Timestamps in key distribution protocols. Communications of the ACM, 24(8):533–536, 1981. 264
43. [DY83] D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT–29(2):198–208, 1983. 273
44. [FG94] R. Focardi and R. Gorrieri. A classification of security properties for process algebra. Journal of Computer Security, 3(1):5–33, 1994. 273
45. [FG96] C. Fournet and G. Gonthier. The reflexive CHAM and the Join-calculus. In 23rd ACM Symposium on Principles of Programming Languages (POPL’96), pages 372–385, 1996. 264, 266, 293
46. + 96] C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, and D. Rémy. A calculus of mobile agents. In CONCUR’96: Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 406–421. Springer, 1996. 266, 293
47. [FLS00] C. Fournet, J.-J. Lévy, and A. Schmitt. An asynchronous, distributed implementation of mobile ambients. In Theoretical Computer Science (IFIP TCS 2000), volume 1872 of Lecture Notes in Computer Science. Springer, 2000. 266, 325
48. [GC99] A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. In Foundations of Software Science and Computation Structures (FoSSaCS’99), volume 1578 of Lecture Notes in Computer Science, pages 212–226. Springer, 1999. An extended version appears as Microsoft Research Technical Report MSR–TR–99–11, April 1999. 324
49. [GJ01] A. D. Gordon and A. Jeffrey. Authenticity by typing for security protocols. Submitted for publication. Available at http://research.microsoft.com/∼adg/Publications, 2001. 289
50. [GJS96] J. Gosling, B. Joy, and G. Steele. The Java language specification. Addison-Wesley, 1996. 292
51. [GM95] J. Gray and J. McLean. Using temporal logic to specify and verify cryptographic protocols (progress report). In Proceedings of the 8th IEEE Computer Security Foundations Workshop, pages 108–116, 1995. 273
52. [GS01] A. D. Gordon and D. Syme. Typing a multi-language intermediate code. In 28th ACM Symposium on Principles of Programming Languages (POPL’01), pages 248–260, 2001. 297
53. [HJNN99] R. R. Hansen, J. G. Jensen, F. Nielson, and H. R. Nielson. Abstract interpretation of mobile ambients. In Static Analysis Symposium (SAS’99), volume 1694 of Lecture Notes in Computer Science, pages 134–148. Springer, 1999. 323
54. [Hoa85] C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985. 263
55. [IK01] A. Igarashi and N. Kobayashi. A generic type system for the pi calculus. In 28th ACM Symposium on Principles of Programming Languages, pages 128–141, 2001. 272
56. [Kem89] R. Kemmerer. Analyzing encryption protocols using formal verification techniques. IEEE Journal on Selected Areas in Communications, 7(4):448–457, 1989. 273
57. [LABW92] B. Lampson, M. Abadi, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. ACM Transactions on Computer Systems, 10(4):265–310, November 1992. 273
58. [Lie93] A. Liebl. Authentication in distributed systems: A bibliography. ACM Operating Systems Review, 27(4):31–41, 1993. 272
59. [LMMS98] P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In Fifth ACM Conference on Computer and Communications Security, pages 112–121, 1998. 273
60. [Low96] G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR. In T. Margaria and B. Steffen, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), volume 1055 of Lectures Notes in Computer Science, pages 147–166. Springer, 1996. 264, 273
61. [LS00] F. Levi and D. Sangiorgi. Controlling interference in ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL’00), pages 352–364, 2000. 324
62. [LY97] T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1997. 297
63. [Mao96] W. Mao. On two proposals for on-line bankcard payments using open networks: Problems and solutions. In IEEE Symposium on Security and Privacy, pages 201–210, 1996. 289
64. [MCF87] J. K. Millen, S. C. Clark, and S. B. Freedman. The interrogator: Protocol security analysis. IEEE Transactions on Software Engineering, SE–13(2):274–288, 1987. 273
65. [Mea92] C. Meadows. Applying formal methods to the analysis of a key management protocol. Journal of Computer Security, 1(1):5–36, 1992. 273
66. [Mil89] R. Milner. Communication and Concurrency. Prentice-Hall International, 1989. 263
67. [Mil92] R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2:119–141, 1992. 283
68. [Mil99] R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999. 263, 272, 298, 318, 323
69. [MPW92] R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Information and Computation, pages 1–40 and 41–77, 1992. 263, 272
70. [MPW93] R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, 114:149–171, 1993. 272
71. [MS92] R. Milner and D. Sangiorgi. Barbed bisimulation. In 19th International Colloquium on Automata, Languages and Programming (ICALP’92), volume 623 of Lecture Notes in Computer Science. Springer, 1992. 272
72. [Nee89] R. M. Needham. Names. In S. Mullender, editor, Distributed Systems, pages 89–101. Addison-Wesley, 1989. 263
73. [NFP97] R. De Nicola, G.-L. Ferrari, and R. Pugliese. Locality based linda: programming with explicit localities. In Proceedings TAPSOFT’97, volume 1214 of Lecture Notes in Computer Science, pages 712–726. Springer, 1997. 293
74. [NNHJ99] F. Nielson, H. R. Nielson, R. R. Hansen, and J. G. Jensen. Validating firewalls in mobile ambients. In CONCUR’99: Concurrency Theory, volume 1664 of Lecture Notes in Computer Science, pages 463–477. Springer, 1999. 323
75. [NS78] R. M. Needham and M. D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993– 999, 1978. 264, 272
76. [Ode00] M. Odersky. Functional nets. In European Symposium on Programming (ESOP 2000), volume 1782 of Lecture Notes in Computer Science, pages 1–25. Springer, 2000. 264
77. [PS96] B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409–454, 1996. 272
78. [PT00] B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000. 264
79. [RH98] J. Riely and M. Hennessy. A typed language for distributed mobile processes. In 25th ACM Symposium on Principles of Programming Languages (POPL’98), pages 378–390, 1998. 292, 317, 323
80. [RSA78] R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120–126, February 1978. 287
81. [San01] D. Sangiorgi. Extensionality and intensionality of the ambient logics. In 28th ACM Symposium on Principles of Programming Languages (POPL’01), pages 4–13, 2001. 324
82. [Sch96a] S. Schneider. Security properties and CSP. In IEEE Symposium on Security and Privacy, pages 174–187, 1996. 273
83. [Sch96b] B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., second edition, 1996. 286
84. [Sew98] P. Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In 25th International Colloquium on Automata, Languages and Programming (ICALP’98), volume 1443 of Lecture Notes in Computer Science, pages 695–706. Springer, 1998. 292, 317, 323
85. [SV01] D. Sangiorgi and A. Valente. A distributed abstract machine for Safe Ambients. Available from the authors, 2001. 325
86. [SW01] D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001. 263, 272
87. [TT97] M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109–176, 1997. 323
88. [VC99] J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, volume 1686 of Lecture Notes in Computer Science, pages 47–77. Springer, 1999. 266
89. [Whi96] J. E. White. Mobile agents. In J. Bradshaw, editor, Software Agents. AAAI Press/The MIT Press, 1996. 265, 292
90. [WL93] T. Y. C. Woo and S. S. Lam. A semantic model for authentication protocols. In IEEE Symposium on Security and Privacy, pages 178–194, 1993. 289
91. [Zim00] P. Zimmer. Subtyping and typing algorithms for mobile ambients. In Foundations of Software Science and Computation Structures (FoS-SaCS’00), volume 1784 of Lecture Notes in Computer Science, pages 375– 390. Springer, 2000. 300, 312, 324