Title: Games for non-repudiation protocol correctness

Authors: K. Adi, L. Pene, L. Sullivan

Addresses: Computer Science and Engineering Department, Universite du Quebec en Outaouais, Gatineau (Quebec) J8X 3X7, Canada. ' Computer Science and Engineering Department, Universite du Quebec en Outaouais, Gatineau (Quebec) J8X 3X7, Canada. ' Computer Science and Engineering Department, Universite du Quebec en Outaouais, Gatineau (Quebec) J8X 3X7, Canada

Abstract: The aim of this paper is to investigate the correctness of non-repudiation protocols without a Trusted Third Party (TTP) with respect to the fairness property. We first present sufficient syntactic conditions under which probabilistic fairness can be guaranteed and by modelling non-repudiation protocols as games, we use game theory results to show that the best level of fairness such protocols can achieve is probabilistic fairness.

Keywords: security protocols; non-repudiation; protocol correctness; games theory; probabilistic fairness; modelling.

DOI: 10.1504/IJWMC.2010.035890

International Journal of Wireless and Mobile Computing, 2010 Vol.4 No.4, pp.305 - 313

Published online: 07 Oct 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article