Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Fairness in electronic commerce
Fairness in electronic commerce
Finite-state analysis of two contract signing protocols
Theoretical Computer Science
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Mechanical Proofs about a Non-repudiation Protocol
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Exploring Fair Exchange Protocols Using Specification Animation
ISW '00 Proceedings of the Third International Workshop on Information Security
A Realistic Protocol for Multi-party Certified Electronic Mail
ISC '02 Proceedings of the 5th International Conference on Information Security
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The Dolev-Yaho Intruder is the Most Powerful Attacker
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
A fair non-repudiation protocol
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
An intensive survey of fair non-repudiation protocols
Computer Communications
Formal methods for cryptographic protocol analysis: emerging issues and trends
IEEE Journal on Selected Areas in Communications
An intruder model for verifying liveness in security protocols
Proceedings of the fourth ACM workshop on Formal methods in security
Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
Formal Aspects in Security and Trust
Optimistic non-repudiation protocol analysis
WISTP'07 Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems
Non-repudiation analysis using LySa with annotations
Computer Languages, Systems and Structures
Verification of A Key Chain Based TTP Transparent CEM Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Design and formal verification of a CEM protocol with transparent TTP
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
We design and analyze a simple optimistic fair non-repudia- tion protocol. Our protocol is considerably simpler and more efficient than current proposals, due mainly to the avoidance of using session labels. We model-check both safety and liveness properties. The safety properties are verified using a standard intruder, and the liveness properties using an intruder that respects the resilient communication channels assumption. Finally, to provide further confidence in the protocol, several vulnerabilities on weaker versions of our protocol are exposed.