We indicate two problems with the specifications of fairness that are currently used for the verification of non-repudiation and other fair-exchange protocols. The first of these problems is the implicit assumption of perfect information. The second problem is the possible lack of effectiveness. We solve both problems in isolation by giving new definitions of fairness, but leave the combined solution for further work. Moreover, we establish a hierarchy of various definitions of fairness, and indicate the consequences for existing work. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jamroga, W., Mauw, S., & Melissen, M. (2012). Fairness in non-repudiation protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7170 LNCS, pp. 122–139). https://doi.org/10.1007/978-3-642-29963-6_10
Mendeley helps you to discover research relevant for your work.