The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Evolution of Fair Non-repudiation with TTP
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Mechanical Proofs about a Non-repudiation Protocol
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Analysis of Abuse-Free Contract Signing
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party
ISC '01 Proceedings of the 4th 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
A Hierarchy of Authentication Specifications
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
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
On the security of fair non-repudiation protocols
International Journal of Information Security - Special issue on SC 2003
Security analysis of efficient (Un-) fair non-repudiation protocols
Formal Aspects of Computing
LTL Model Checking for Security Protocols
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Authentication tests and disjoint encryption: A design method for security protocols
Journal of Computer Security - Special issue on CSFW15
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
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
Compiling and verifying security protocols
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A theorem-proving approach to verification of fair non-repudiation protocols
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Estimation of TTP features in non-repudiation service
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
The AVISPA tool for the automated validation of internet security protocols and applications
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
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
On the formal analyses of the zhou-gollmann non-repudiation protocol
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Towards verification of timed non-repudiation protocols
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
An intensive survey of fair non-repudiation protocols
Computer Communications
State and Progress in Strand Spaces: Proving Fair Exchange
Journal of Automated Reasoning
Comparison of cryptographic verification tools dealing with algebraic properties
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
| Hi-index | 0.00 |
Non-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing the limitations of this method, we define a new one, based on the handling of the knowledge of protocol participants. This second method is general and of natural use, as it consists in adding simple annotations in the protocol specification. It is very easy to implement in tools able to handle participants knowledge. We have implemented it in the AVISPA Tool and analyzed the Fair Zhou-Gollmann protocol and the optimistic Cederquist-Corin-Dashti protocol, discovering attacks in each. This extension of the AVISPA Tool for handling non-repudiation opens a highway to the specification of many other properties, without any more change in the tool itself.