Characterization of optimal authentication codes with arbitration

This paper investigates authentication codes with arbitration (\(A^2\)-codes). In an \(A^2\)-code, three types of attack are considered: (i)~attack by the opponent; (ii)~attack by the receiver: he claims to have received a message and succeeds if the message could have been generated by the transmitter; (iii)~attack by the transmitter: he sends a message to the receiver, then denies having sent it. An \(A^2\)-code is called optimal if its cheating probabilities achieve their information-theoretical lower bounds [See the papers of \textit{T.~Johansson}, IEEE Trans. Inf. Theory 40, 1573-1585 (1994; Zbl 0814.94012), and \textit{Y.~Wang}, Advances in cryptology--Chinacrypt '98, Science Press, 99-104 (1998)], and has minimum number of keys. The authors give a characterization of the optimal \(A^2\)-codes in terms of combinatorial designs. This means that the construction of optimal \(A^2\)-codes is reduced to the construction of the related combinatorial structures. For the entire collection see [Zbl 0911.00058].

Recommendations

Cited in

(34)

This page was built for publication: Characterization of optimal authentication codes with arbitration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250649)