Towards verification of non-repudiation protocols
From MaRDI portal
Recommendations
- On the security of fair non-repudiation protocols
- Formal analysis of non-repudiation protocols with SVO logic
- Mechanical proofs about a non-repudiation protocol
- Security analysis of a probabilistic non-repudiation protocol
- On-the-Fly Model Checking of Fair Non-repudiation Protocols
- Security analysis of efficient (Un-) fair non-repudiation protocols
Cited in
(13)- Non-repudiation analysis using \textsc{LySa} with annotations
- An extension of formal analysis method with reasoning: a case study of flaw detection for non-repudiation and fairness
- Formal modeling and analysis of fairness characterization of E-commerce protocols
- Achieving fairness in non-repudiation protocols
- On-the-Fly Model Checking of Fair Non-repudiation Protocols
- Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
- A proof of non-repudiation
- Non-repudiation in SET: Open issues
- Mechanical proofs about a non-repudiation protocol
- scientific article; zbMATH DE number 6741937 (Why is no real title available?)
- Formal analysis of non-repudiation protocols with SVO logic
- Formal analysis of timeliness in non-repudiation protocols
- Assume-guarantee synthesis for digital contract signing
This page was built for publication: Towards verification of non-repudiation protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250674)