Games for non-repudiation protocol correctness

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.