Back to Search
Start Over
Non-repudiation analysis using LySa with annotations
- Source :
-
Computer Languages, Systems & Structures . Dec2010, Vol. 36 Issue 4, p352-377. 26p. - Publication Year :
- 2010
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 14778424
- Volume :
- 36
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Computer Languages, Systems & Structures
- Publication Type :
- Academic Journal
- Accession number :
- 51811416
- Full Text :
- https://doi.org/10.1016/j.cl.2010.04.002