Non-repudiation analysis using LySa with annotations

This work introduces a formal analysis of the non-repudiation property for security protocols. Protocols are modelled in the process calculus LySa, using an extended syntax with annotations. Non-repudiation is verified using a Control Flow Analysis, following the same approach of Buchholtz and Gao for authentication and freshness analyses. The result is an analysis that can statically check the protocols to predict if they are secure during their execution and which can be fully automated.

[1]  Muhammad Torabi Dashti,et al.  On the Quest for Impartiality: Design and Analysis of a Fair Non-repudiation Protocol , 2005, ICICS.

[2]  Dieter Gollmann,et al.  Evidence and non-repudiation , 1997 .

[3]  Lawrence C. Paulson,et al.  Mechanical Proofs about a Non-repudiation Protocol , 2001, TPHOLs.

[4]  Pierpaolo Degano,et al.  Detecting and Preventing Type flaws: a Control Flow Analysis with Tags , 2007, Electron. Notes Theor. Comput. Sci..

[5]  Flemming Nielson,et al.  Static validation of security protocols , 2005, J. Comput. Secur..

[6]  Flemming Nielson,et al.  Automated Analysis of Security in Networking Systems , 2004 .

[7]  Steve A. Schneider,et al.  Formal analysis of a non-repudiation protocol , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).

[8]  Hanne Riis Nielson,et al.  A Formal Analysis for Capturing Replay Attacks in Cryptographic Protocols , 2007, ASIAN.

[9]  Dieter Gollmann,et al.  Computer Security , 1979, Lecture Notes in Computer Science.

[10]  Pierpaolo Degano,et al.  A Formal Analysis of Complex Type Flaw Attacks on Security Protocols , 2008, AMAST.

[11]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[12]  Jean-François Raskin,et al.  A game-based verification of non-repudiation and fair exchange protocols , 2003 .

[13]  Dieter Gollmann,et al.  A fair non-repudiation protocol , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[14]  Steve A. Schneider.  Security properties and CSP , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[15]  Hanne Riis Nielson,et al.  Analysis of LYSA-calculus with explicit confidentiality annotations , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[16]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[17]  Steve A. Schneider.  Modelling security properties with CSP , 1996 .

[18]  Dieter Gollmann,et al.  Towards Verification of Non-repudiation Protocols , 1998 .