Proven secure signature schemes and unconditionally secure authentication schemes with arbiter have been proposed. The former are not practical (too slow) and the latter cannot be reused. All these limitations are solved in this paper by presenting a resuable conditionally secure authentication scheme with arbiter. The scheme is unconditionally secure against denial by the sender of having sent a message (which signatures do not have) and conditionally secure against a receiver impersonating the sender or substituting a message and conditionally secure against a similar fraud by the arbiter.
CITATION STYLE
Desmedt, Y., & Seberry, J. (1993). Practical proven secure authentication with arbitration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 718 LNCS, pp. 27–32). Springer Verlag. https://doi.org/10.1007/3-540-57220-1_49
Mendeley helps you to discover research relevant for your work.