Secrecy by typing in security protocols

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

Volumn 1281, Issue , 1997, Pages 611-638

  Abadi, Martín ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER SOFTWARE; CRYPTOGRAPHY;

CLASSIFICATION TECHNIQUE; CONCURRENT LANGUAGES; CONCURRENT PROCESS; CRYPTOGRAPHIC PRIMITIVES; SECRECY PROPERTIES; SECURITY PROTOCOLS; SPI CALCULUS; TYPING RULES;

NETWORK SECURITY;

EID: 84957668700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0014571     Document Type: Conference Paper

References (19)

1. [AG97a] M. Abadi and A. D. Gordon, A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, pages 36-47, 1997.
2. [AG97b] M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Technical Report 414, University of Cambridge Computer Laboratory, January 1997. Extended version of both [AG97a] and [AG97c].
3. [AG97c] M. Abadi and A. D. Gordon. Reasoning about cryptographic protocols in the spi calculus. To appear in the Proceedings of CONCUR'97, 1997.
4. [AN96] M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering, 22(1):6-15, January 1996.
5. [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. A preliminary version appeared as Digital Equipment Corporation Systems Research Genter report No. 39, February 1989.
6. [BN95] M, Boreale and R. De Nicola. Testing equivalence for mobile processes. Information and Computation, 12Q(2):279-303, August 1995.
7. [BR95] M. Bellare and P. Rogaway. Provably secure session key distribution: The three party case. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 1995.
8. [Den82] D. E. Denning. Cryptography and Data Security. Addison-Wesley, Reading, Mass., 1982.
9. [DES77] Data encryption standard. Fed. Inform. Processing Standards Pub. 46, National Bureau of Standards, Washington DC, January 1977.
10. [DH84] R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133, 1984.
11. [Gas88] M. Gasser. Building a Secure Computer System. Van Nostrand Reinhold Company Inc., New York, 1988.
12. [LY96] T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1996.
13. [Mil91] R, Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, October 1991. Appeared in Logic and Algebra of Specification, F. L. Bauer, W. Brauer, and H. Schwichtenberg, eds., Springer-Verlag, 1993.
14. [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, September 1992.
15. [Nec97] G. Necula. Proof-carrying code. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pages 106-119, 1997.
16. [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, December 1978.
17. [PS96] B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409-453, October 1996.
18. [Sch96] B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley k. Sons, Inc., second edition, 1996.
19. [VSI96] D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):1-21, 1996.