On A2-codes including arbiter's attacks

Summary, in English

We comment on the work by R. Taylor presented at Euro-Crypt'94 (see this proceedings). We first extend some known results on authentication codes with arbitration to the case when protection against arbiter's attacks is provided. We give lower bounds on the secret key size for each participant and give a construction showing that these bounds are tight. These results improve upon previously known work and show that a claim in the aforementioned paper is wrong.

This work

• Author: Thomas Johansson; Ben Smeets
• Department/s: Department of Electrical and Information Technology
• Publishing year: 1995
• Language: English
• Pages: 456-461
• Publication/Series: Advances in Cryptology / Lecture Notes in Computer Science
• Volume: 950
• Links: http://dx.doi.org/10.1007/BFb0053463
• Document type: Conference paper
• Publisher: Springer
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: Workshop on the Theory and Application of Cryptographic Techniques EUROCRYPT'94
• Conference date: 1994-05-09 - 1994-05-12
• Conference place: Perugia, Italy
• Status: Published
• ISBN/ISSN/Other: ISSN: 0302-9743; ISSN: 1611-3349; ISBN: 978-3-540-60176-0