Games for non-repudiation protocol correctness
by K. Adi, L. Pene, L. Sullivan
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 4, No. 4, 2010

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.

Online publication date: Thu, 07-Oct-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com