Combinatorial bounds on authentication codes with arbitration

Authors
Kurosawa, K Obana, S
Citation
K. Kurosawa et S. Obana, Combinatorial bounds on authentication codes with arbitration, DES CODES C, 22(3), 2001, pp. 265-281
Citations number
25
Categorie Soggetti
Computer Science & Engineering
Journal title
DESIGNS CODES AND CRYPTOGRAPHY
ISSN journal
09251022 → ACNP
Volume
22
Issue
3
Year of publication
2001
Pages
265 - 281
Database
ISI
SICI code
0925-1022(200104)22:3<265:CBOACW>2.0.ZU;2-9
Abstract
Unconditionally secure authentication codes with arbitration (A(2)-codes) p rotect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bound s on the cheating probabilities and the sizes of keys of A(2)-codes. These bounds are all tight. Our main technique is a reduction of an A(2)-code to a splitting A-code.