Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419143 | Computer Languages, Systems & Structures | 2010 | 26 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mayla Brusò, Agostino Cortesi,