A Calculus for Cryptographic Protocols: The Spi Calculus

Abadi, 1997, Secrecy by typing in security protocols, 1281

Abadi, 1993, A calculus for access control in distributed systems, ACM Trans. Program. Languages Systems, 15, 706, 10.1145/155183.155225

Abadi, 1997, A calculus for cryptographic protocols: The Spi Calculus, Technical Report

Abadi, 1997, A calculus for cryptographic protocols: The spi calculus

Abadi, 1997, Reasoning about cryptographic protocols in the spi calculus, 1243

Abadi, 1998, A bisimulation method for cryptographic protocols

Abadi, 1996, Prudent engineering practice for cryptographic protocols, IEEE Trans. Software Engrg., 22, 6, 10.1109/32.481513

Burrows, 1989, A logic of authentication, Proc. Roy. Soc. London Ser. A, 426, 233, 10.1098/rspa.1989.0125

Berry, 1992, The chemical abstract machine, Theoret. Comput. Sci., 96, 217, 10.1016/0304-3975(92)90185-I

Boreale, 1995, Testing equivalence for mobile processes, Inform. and Comput., 120, 279, 10.1006/inco.1995.1114

Bellare, 1995, Provably secure session key distribution: The three party case

Data encryption standard. Fed. Inform. Processing Standards Pub. 46, National Bureau of Standards, Washington DC, Jan. 1977

Diffie, 1976, New directions in cryptography, IEEE Trans. Inform. Theory, 22, 644, 10.1109/TIT.1976.1055638

De Nicola, 1984, Testing equivalences for processes, Theoret. Comput. Sci., 34, 83, 10.1016/0304-3975(84)90113-0

Dolev, 1981, On the security of public key protocols

Gray, 1995, Using temporal logic to specify and verify cryptographic protocols (progress report)

Gordon, 1995, Bisimilarity as a theory of functional programming, Minicourse, BRICS Notes Series NS-95-3

Hoare, 1985

Kemmerer, 1989, Analyzing encryption protocols using formal verification techniques, IEEE J. Selected Areas Commun., 7, 448, 10.1109/49.17707

Lampson, 1992, Authentication in distributed systems: Theory and practice, ACM Trans. Comput. Systems, 10, 265, 10.1145/138873.138874

Liebl, 1993, Authentication in distributed systems: A bibliography, ACM Oper. Systems Rev., 27, 31, 10.1145/163640.163643

Lowe, 1996, Breaking and fixing the Needham–Schroeder public-key protocol using FDR, 1055

Mao, 1996, On two proposals for on-line bankcard payments using open networks: Problems and solutions

Millen, 1987, The Interrogator: Protocol security analysis, IEEE Trans. Software Engrg., 13, 274, 10.1109/TSE.1987.233151

Meadows, 1992, Applying formal methods to the analysis of a key management protocol, J. Comput. Security, 1, 5, 10.3233/JCS-1992-1102

Milner, 1989

Milner, 1992, Functions as processes, Math. Structures Comput. Sci., 2, 119, 10.1017/S0960129500001407

Millen, 1995, The Interrogator model

Milner, R. 1995, Theπ, Cambridge University

Milner, 1992, A calculus of mobile processes, Parts I and II, Inform. and Comput., 1, 10.1016/0890-5401(92)90008-4

Milner, 1992, Barbed bisimulation, 623

Needham, 1978, Using encryption for authentication in large networks of computers, Comm. ACM, 21, 993, 10.1145/359657.359659

Paulson, 1997, Proving properties of security protocols by induction

Pierce, 1996, Typing and subtyping for mobile processes, Math. Structures Comput. Sci., 6, 409, 10.1017/S096012950007002X

Rivest, 1978, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21, 120, 10.1145/359340.359342

Sangiorgi, 1994, On the bisimulation proof method, Technical Report

Schneider, 1996, Security properties and CSP

Schneier, 1996