Bounds and Constructions for Multireceiver Authentication Codes
|
Abstract:
Abstract. 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 constructions for such codes, our constructions are based on the linear error-correcting codes. Multireceiver authentication codes (MRA-codes) [4] extend Simmons ' model of unconditionally secure authentication [16]. In an MRA-code [4], a sender wants to authenticate a message for a group of receivers such that each receiver can verify authenticity of the received message. Receivers are not trusted and may try to construct fraudulent messages on behalf of the transmitter. If the fraudulent message is acceptable by even one receiver the attackers have succeeded. This is a useful extension of traditional authentication code and has numerous applications. For example a director wanting to give instructions to employees in
Citations
| 1 | Perfect and essentially perfect authentication systems, Lecture – Beutelspacher |
