Non-repudiation analysis using \textsc{LySa} with annotations

DOI10.1016/J.CL.2010.04.002MaRDI QIDQ1749255zbMATH OpenOpenAlexFDO

Authors Mayla Brusò, Agostino Cortesi

Publication date 16 May 2018

Published in Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cl.2010.04.002

zbMATH Keywords

securitystatic analysisprocess calculuscontrol flow analysis

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Recommendations

• Automatic analysis of a non-repudiation protocol
• Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
• Security analysis of efficient (Un-) fair non-repudiation protocols
• scientific article; zbMATH DE number 2090701
• scientific article; zbMATH DE number 1304004

Cites work

• scientific article; zbMATH DE number 1304004 (Why is no real title available?)
• scientific article; zbMATH DE number 1324833 (Why is no real title available?)
• scientific article; zbMATH DE number 1863379 (Why is no real title available?)
• scientific article; zbMATH DE number 1864595 (Why is no real title available?)
• A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
• Information and Communications Security
• Performance evaluation of security protocols specified in LySa

Cited in

(1)

• Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder

This page was built for publication: Non-repudiation analysis using \textsc{LySa} with annotations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749255)