论文信息 - Games for non-repudiation protocol correctness

Games for non-repudiation protocol correctness

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.

Kamel Adi | L. Pene | L. Sullivan

[1] Vitaly Shmatikov,et al. Analysis of a Fair Exchange Protocol , 2000, NDSS.

[2] Silvio Micali,et al. A fair protocol for signing contracts , 1990, IEEE Trans. Inf. Theory.

[3] Jianying Zhou,et al. An Intensive Survey of Non-Repudiation Protocols , 2002 .

[4] Olivier Markowitch,et al. Probabilistic Non-Repudiation without Trusted Third Party , 1999 .

[5] Dieter Gollmann,et al. Towards Verification of Non-repudiation Protocols , 1998 .

[6] Jianying Zhou,et al. An intensive survey of fair non-repudiation protocols , 2002, Comput. Commun..

[7] Vitaly Shmatikov,et al. Analysis of probabilistic contract signing , 2002, J. Comput. Secur..

[8] Levente Buttyán,et al. Rational Exchange - A Formal Model Based on Game Theory , 2001, WELCOM.

[9] J. Berger. Statistical Decision Theory and Bayesian Analysis , 1988 .

[10] Vitaly Shmatikov,et al. Finite-state analysis of two contract signing protocols , 2002, Theor. Comput. Sci..

[11] P. Syverson,et al. A Unified Cryptographic Protocol Logic , 1996 .

[12] Jean-François Raskin,et al. A game-based verification of non-repudiation and fair exchange protocols , 2003 .

[13] Paul F. Syverson,et al. Weakly secret bit commitment: applications to lotteries and fair exchange , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).