Broadcast authentication for group communication

Traditional point-to-point message authentication systems have been extensively studied in the literature. In this paper we consider authentication for group communication. The basic primitive is a multireceiver authentication system with dynamic sender (DMRA-code). In a DMRA-code any member of a group can broadcast an authenticated message such that all other group members can individually verify its authenticity. In this paper first we give a new and flexible 'synthesis' construction for DMRA-codes by combining an authentication code (A-code) and a key distribution pattern. Next we extend DMRA-codes to tDMRA-codes in which t senders are allowed. We give two constructions for tDMRA-codes, one algebraic and one by 'synthesis' of an A-code and a perfect hash family. To demonstrate the usefulness of DMRA systems, we modify a secure dynamic conference key distribution system to construct a key-efficient secure dynamic conference system that provides secrecy and authenticity for communication among conferencees. The system is key-efficient because the key requirement is essentially the same as the original conference key distribution system and so authentication is effectively obtained without any extra cost. We show universality of 'synthesis' constructions for unconditional and computational security model that suggests direct application of our results to real-life multi-casting scenarios in computer networks. We discuss possible extensions to this work.

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

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

[3]  Reihaneh Safavi-Naini,et al.  Bounds and Constructions for Multireceiver Authentication Codes , 1998, ASIACRYPT.

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

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

[6]  Hugo Krawczyk,et al.  New Hash Functions For Message Authentication , 1995, EUROCRYPT.

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

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

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

[10]  Douglas R Stinson,et al.  Some recursive constructions for perfect hash families , 1996 .

[11]  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.

[12]  Reihaneh Safavi-Naini,et al.  Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions , 1999, Inf. Comput..

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

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

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

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

[17]  Jürgen Bierbrauer,et al.  Universal Hashing and Geometric Codes , 1997, Des. Codes Cryptogr..

[18]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[19]  Christine M. O'Keefe.  Key distribution patterns using Minkowski planes , 1995, Des. Codes Cryptogr..

[20]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

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

[22]  Yvo Desmedt,et al.  Efficient Multiplicative Sharing Schemes , 1996, EUROCRYPT.

[23]  Tsutomu Matsumoto,et al.  Incidence structures for key sharing , 1995 .

[24]  Simon R. Blackburn,et al.  Optimal Linear Perfect Hash Families , 1998, J. Comb. Theory, Ser. A.

[25]  Amos Fiat,et al.  Broadcast Encryption , 1993, CRYPTO.

[26]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[27]  S. Wei.  Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures , 1997 .

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