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

DOI10.1016/J.CL.2010.04.002zbMATH Open1387.68035OpenAlexW2080836433MaRDI QIDQ1749255FDOQ1749255

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

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

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)

Cites Work

• Title not available (Why is that?)
• Performance evaluation of security protocols specified in LySa
• Title not available (Why is that?)
• A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
• Title not available (Why is that?)
• Title not available (Why is that?)
• Information and Communications Security

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)