A bisimulation method for cryptographic protocols

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

Volumn 1381, Issue , 1998, Pages 12-26

  Abadi, Martin ^a   Gordon, Andrew D ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

BISIMULATIONS; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; OPTIMISATIONS; PI CALCULUS; PRECISE MODELING; SECURITY PROPERTIES; SPI CALCULUS;

CALCULATIONS;

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

References (21)

1. M. Abadi. Secrecy by typing in security protocols. In Theoretical Aspects of Computer Software, volume 1281 of Lecture Notes in Computer Science, pages 611-638. Springer-Verlag, 1997.
2. 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.
3. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Technical Report 414, University of Cambridge Computer Laboratory, January 1997.
4. M. Abadi and A. D. Gordon. Reasoning about cryptographic protocols in the spi calculus. In CONCUR’97: Concurrency Theory, volume 1243 of Lecture Notes in Computer Science, pages 59-73. Springer-Verlag, 1997.
5. D. Bolignano. An approach to the formal verification of cryptographic protocols. In 3rd ACM Conference on Computer and Communications Security, pages 106-118, March 1996.
6. Data encryption standard. Fed. Inform. Processing Standards Pub. 46, National Bureau of Standards, Washington DC, January 1977.
7. R. Focardi and R. Gorrieri. A classification of security properties. Journal of Computer Security, 3(1), 1995.
8. 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.
9. R. A. Kemmerer. Analyzing encryption protocols using formal verification techniques. IEEE Journal on Selected Areas in Communications, 7, 1989.
10. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 147-166. Springer-Verlag, 1996.
11. 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, February 1987.
12. Meadows. Applying formal methods to the analysis of a key management protocol. Journal of Computer Security, 1(1):5-36, 1992.
13. R. Milner. Communication and Concurrency. Prentice-Hall International, 1989.
14. J. K. Millen. The Interrogator model. In IEEE Symposium on Security and Privacy, pages 251-260, 1995.
15. 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.
16. A Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science: 5th GI-Conference, Karlsruhe, volume 104 of Lecture Notes in Computer Science, pages 167-183. Springer-Verlag, March 1981.
17. L. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 70-83, 1997.
18. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What’s new? In Mathematical Foundations of Computer Science, Proc. 18th Int. Symp., Gdansk, 1993, volume 711 of Lecture Notes in Computer Science, pages 122-141. Springer-Verlag, 1993.
19. A Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409-453, October 1996.
20. S. Schneider. Security properties and CSP. In IEEE Symposium on Security and Privacy, pages 174-187, 1996.
21. B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, Inc., second edition, 1996.