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 introduced by M. Buchholtz and H. 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.
|Title of host publication||Proceedings of the IFIP 24th International Information Security Conference (IFIP SEC'09, Pafos, Cyprus, Greece, May 18-20, 2009)|
|Editors||D. Gritzalis, J. Lopez|
|Place of Publication||Boston|
|Publication status||Published - 2009|
|Name||IFIP Conference Proceedings|