Abstract
Fairness of non-repudiation is naturally expressed as a liveness specification, as in [Sch98]; to formalize this idea, we apply the process algebra CSP to analyze the well-known Zhou-Gollmann protocol. We here model and verify a variant of the ZG protocol that includes a deadline (timestamp) for completion of the protocol, after which an agent can no longer initiate the recovery protocol with the TTP to get hold of the non-repudiation evidence. The verification itself is performed by the FDR model-checker.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
[Eva03] Evans, N.: Investigating Security through Proof. PhD thesis, Royal Holloway, University of London (2003)
[For97]Formal Systems (Europe) Ltd. Failures-Divergence Refinement—FDR 2 user manual, Available from Formal Systems (1997), http://www.formal.demon.co.uk/FDR2.html
[KMZ02] Kremer, S., Markowitch, O., Zhou, J.: An intensive survey of non-repudiation protocols. Technical Report 473 (2002)
[KR01]Kremer, S., Raskin, J.-F.: A game-based verification of nonrepudiation and fair exchange protocols. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, p. 551. Springer, Heidelberg (2001)
[MR99] Markowitch, O., Roggeman, Y.: Probabilistic non-repudiation without trusted third party. In:Second Workshop on Security in Communication Network 1999 (1999)
[Ros98]Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall International, Englewood Cliffs (1998)
[Sch98] Schneider, S.A.: Formal analysis of a non-repudiation protocol. In: Proceedings of the 11th IEEE Computer Security Foundations Workshop (1998)
[Sch99] Schneider, S.A.: Concurrent and real-time systems: the CSP approach. John Wiley & Sons, Chichester (1999)
[SM01] Shmatikov, V., Mitchell, J.C.: Analysis of abuse-free contract signing. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 174–191. Springer, Heidelberg (2001)
[Ted83]Tedrick, T.: How to exchange half a bit. In: CRYPTO, pp. 147–151 (1983)
[ZG96] Zhou, J., Gollmann, D.: A fair non-repudiation protocol. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 55–61. IEEE Computer Society Press, Los Alamitos (1996)
[ZG97]Zhou, J., Gollmann, D.: An efficient non-repudiation protocol. In: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (1997)
[ZG98]Zhou, J., Gollmann, D.: September 1998. In: Proceedings of 1998 International Refinement Workshop and Formal Methods Pacific, Canberra, Australia, September 1998, pp. 370–380 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, K., Heather, J. (2006). Towards Verification of Timed Non-repudiation Protocols. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds) Formal Aspects in Security and Trust. FAST 2005. Lecture Notes in Computer Science, vol 3866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11679219_18
Download citation
DOI: https://doi.org/10.1007/11679219_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32628-1
Online ISBN: 978-3-540-32629-8
eBook Packages: Computer ScienceComputer Science (R0)