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

control flow analysisprocess calculussecuritystatic analysis

Mathematics Subject Classification ID

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

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
• Towards verification of non-repudiation protocols

Cites work

• A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
• A game-based verification of non-repudiation and fair exchange protocols
• Information and Communications Security
• Mechanical proofs about a non-repudiation protocol
• Performance evaluation of security protocols specified in LySa
• Principles of program analysis
• Towards verification of non-repudiation protocols

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)