Automatic analysis of a non-repudiation protocol
From MaRDI portal
Recommendations
- On quantitative analysis of probabilistic protocols
- Security analysis of efficient (Un-) fair non-repudiation protocols
- On-the-Fly Model Checking of Fair Non-repudiation Protocols
- Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
- Information and Communications Security
Cited in
(19)- Verification and control of partially observable probabilistic systems
- Non-repudiation analysis using \textsc{LySa} with annotations
- Model checking for probabilistic timed automata
- Fairness analysis for multiparty nonrepudiation protocols based on improved strand space
- Security analysis of efficient (Un-) fair non-repudiation protocols
- On quantitative analysis of probabilistic protocols
- Verification and control of partially observable probabilistic real-time systems
- Model Checking Security Protocols
- On-the-Fly Model Checking of Fair Non-repudiation Protocols
- Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
- scientific article; zbMATH DE number 1863379 (Why is no real title available?)
- scientific article; zbMATH DE number 1864595 (Why is no real title available?)
- scientific article; zbMATH DE number 2090701 (Why is no real title available?)
- An improved non-repudiation protocol and its security analysis
- Information and Communications Security
- Quantitative analysis with the probabilistic model checker PRISM
- Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond
- Reachability results for timed automata with unbounded data structures
- Parametric probabilistic transition systems for system design and analysis
This page was built for publication: Automatic analysis of a non-repudiation protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849849)
