Abstract
We design and analyze a simple optimistic fair non-repudiation protocol. Our protocol is considerably simpler and more efficient than current proposals, due mainly to the avoidance of using session labels. We model-check both safety and liveness properties. The safety properties are verified using a standard intruder, and the liveness properties using an intruder that respects the resilient communication channels assumption. Finally, to provide further confidence in the protocol, several vulnerabilities on weaker versions of our protocol are exposed. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Cederquist, J., Corin, R., & Torabi Dashti, M. (2005). On the quest for impartiality: Design and analysis of a fair non-repudiation protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3783 LNCS, pp. 27–39). https://doi.org/10.1007/11602897_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
