Practical proven secure authentication with arbitration [chapter]

Yvo Desmedt, Jennifer Seberry
1993 Lecture Notes in Computer Science  
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
more » ... sender or substituting a message and conditionally secure against a similar fraud by the arbiter. Disciplines Physical Sciences and Mathematics Publication Details Yvo Desmedt and Jennifer Seberry, Practical proven secure authentication with arbitration, ( Jennifer Seberry Abstract. 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.
doi:10.1007/3-540-57220-1_49 fatcat:6taum7bvfjg57gptnlr2v7fu2q