On the construction of perfect authentication codes that permit arbitration

Summary, in English

Authentication codes that permit arbitration are codes that unconditionally protect against deceptions from the outsiders and additionally also protect against some forms of deceptions from the insiders. Simmons introduced this authentication model and he also showed a way of constructing such codes, called the Cartesian product construction. We present a general way of constructing such codes and we also derive two specific classes of such codes. One that is perfect in the sense that it meets the lower bounds on the size of the transmitter’s and the receiver’s keys and one that allows the number of source states to be chosen arbitrarily large.

• Author: Thomas Johansson
• Department/s: Department of Electrical and Information Technology
• Publishing year: 1993
• Language: English
• Pages: 343-354
• Publication/Series: Advances in Cryptology / Lecture Notes in Computer Science
• Volume: 773
• Links: http://dx.doi.org/10.1007/3-540-48329-2_29
• Document type: Conference paper
• Publisher: Springer
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: 13th Annual International Cryptology Conference CRYPTO’ 93
• Conference date: 1993-08-22 - 1993-08-26
• Status: Published
• ISBN/ISSN/Other: ISSN: 1611-3349; ISSN: 0302-9743; ISBN: 978-3-540-57766-9