Petri nets in cryptographic protocols

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages 1507-1515

  Crazzolara, F ^a,b   Winskel, G ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b DANISH NATIONAL RESEARCH FOUNDATION   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY; SEMANTICS;

CRYPTOGRAPHIC PROTOCOLS; PETRI NET SEMANTICS; PROCESS LANGUAGES; SECURITY PROPERTIES; SECURITY PROTOCOLS; SET OF EVENTS;

PETRI NETS;

EID: 66349124909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925135     Document Type: Conference Paper

References (18)

1. M. Abadi and A. Gordon. A calculus for cryptographic protocols: The Spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security. ACM Press, 1997.
2. T. Aura. Modelling the Needham-Schroeder authentication protocol with high level Petri nets. Technical Report B14, Helsinki University of Technology, 1995.
3. I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In R. Gorrieri, editor, Proceedings of the 12th IEEE Computer Security Foundations Workshop - CSFW'99, pages 55-69, Mordano, Italy, 28-30 June 1999. IEEE Computer Society Press.
4. I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. Relating strands and multiset rewriting for security protocol analysis. In P. Syverson, editor, 13th IEEE Computer Security Foundations Workshop - CSFW'00, Cambridge, UK, 3-5 July 2000. IEEE Computer Society Press.
5. F. Crazzolara and G. Winskel. Language, semantics, and methods for cryptographic protocols. Technical Report RS-00-18, Aug. 2000. ii+42 pp.
6. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 2(29), 1983.
7. E. Doyle, S. E. Tavares, and H. Meijer. Automated security analysis of cryptographic protocols using coloured Petri net specifications. In SAC'95, 1995.
8. D. Gelernter. Generative communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80-112, 1985.
9. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In 2nd International Workshop on Tools and Algorithms for the construction and Analysis of Systems. Springer-Verlag, 1996.
10. B. B. Nieh and S. E. Tavares. Modelling and analyzing cryptographic protocols using Petri nets. In Advances in Cryptology-AUSCRYPT '92, volume 718 of LNCS, pages 275-295. Springer-Verlag, 1992.
11. L. C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
12. L. C. Paulson. Proving security protocols correct. In Proceedings of the 14th Symposium on Logic in Computer Science, July 1999.
13. A. M. Pitts and I. 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., Gdañsk, 1993, volume 711 of Lecture Notes in Computer Science, pages 122-141. Springer-Verlag, Berlin, 1993.
14. 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, 1978.
15. J. Thayer, J. Herzog, and J. Guttman. Honest ideals on strand spaces. In Proceedings of the 11th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 1998.
16. J. Thayer, J. Herzog, and J. Guttman. Strand spaces: Why is a security protocol correct? In 1998 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 1998.
17. G. Winskel. Event Structures, volume 255 of LNCS, pages 325-392. Springer-Verlag, 1986.
18. G. Winskel. Petri nets, algebras, morphisms, and compositionality. Information and Computation, 72:197-238, 1987.