SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
A Multi-party Optimistic Non-repudiation Protocol
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Analyzing the Needham-Schroeder Public-Key Protocol: A Comparison of Two Approaches
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Analysis of Abuse-Free Contract Signing
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
An Efficient Non-repudiation Protocol
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Formal Analysis of a Non-Repudiation Protocol
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder
Formal Aspects in Security and Trust
Quantitative Analysis of a Probabilistic Non-repudiation Protocol through Model Checking
ICISS '09 Proceedings of the 5th International Conference on Information Systems Security
Games for non-repudiation protocol correctness
International Journal of Wireless and Mobile Computing
Complexity of fairness constraints for the Dolev-Yao attacker model
Proceedings of the 2011 ACM Symposium on Applied Computing
Proof of service in a hybrid p2p environment
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
On the quest for impartiality: design and analysis of a fair non-repudiation protocol
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
A game based model of security for key predistribution schemes in wireless sensor network
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Towards verification of timed non-repudiation protocols
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A cryptographic model for branching time security properties: the case of contract signing protocols
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
A Practical Approach of Fairness in E-Procurement
International Journal of Information Security and Privacy
Design and formal verification of a CEM protocol with transparent TTP
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
In this paper, we report on a recent work for the verification of non-repudiation protocols. We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. To formalize this idea, we use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. This method is automated by using the model-checker MOCHA, a model-checker that supports the alternating transition systems and the alternating temporal logic. Several optimistic protocols are analyzed using MOCHA.