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.

Authors

• R. Safavi-Naini
• H. Wang

Keywords

No keywords are indexed for this paper.