Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions

Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal definition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance, and give new efficient and flexible constructions for such codes. Finally, we extend the basic model to the case that multiple messages are sent and the case that the sender can be any member of the group.

[1]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[2]  Gustavus J. Simmons,et al.  Authentication Theory/Coding Theory , 1985, CRYPTO.

[3]  Mustafa Atici,et al.  Universal Hashing and Multiple Authentication , 1996, CRYPTO.

[4]  Satoshi Obana,et al.  Characterisation of (k, n) Multi-receiver Authentication , 1997, ACISP.

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Douglas R. Stinson,et al.  Universal hashing and authentication codes , 1991, Des. Codes Cryptogr..

[7]  Kathleen A. S. Quinn.  Some constructions for key distribution patterns , 1994, Des. Codes Cryptogr..

[8]  John G. Proakis,et al.  Digital Communications , 1983 .

[9]  Moti Yung,et al.  Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[11]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[12]  Douglas R. Stinson,et al.  Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.

[13]  Moti Yung,et al.  Perfectly Secure Key Distribution for Dynamic Conferences , 1992, Inf. Comput..

[14]  Douglas R. Stinson,et al.  On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption , 1997, Des. Codes Cryptogr..

[15]  Rolf Blom,et al.  An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.

[16]  Thomas Johansson.  Lower bounds on the probability of deception in authentication with arbitration , 1994, IEEE Trans. Inf. Theory.

[17]  Ben J. M. Smeets.  Bounds on the probability of deception in multiple authentication , 1994, IEEE Trans. Inf. Theory.

[18]  Kaoru Kurosawa,et al.  Combinatorial Bounds and Design of Broadcast Authentication (Special Section on Discrete Mathematics and Its Applications) , 1996 .

[19]  Zoltán Füredi,et al.  Families of Finite Sets in Which No Set Is Covered by the Union of Two Others , 1982, J. Comb. Theory, Ser. A.

[20]  Gustavus J. Simmons,et al.  A survey of information authentication , 1988, Proc. IEEE.

[21]  J. L. Massey,et al.  Cryptography ― a selective survey , 1986 .

[22]  Reihaneh Safavi-Naini,et al.  New Results on Multi-Receiver Authentication Codes , 1998, EUROCRYPT.