Bounds and constructions for multireceiver authentication codes

R. Safavi-Naini, H. Wang

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

9 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 1998
Subtitle of host publicationInternational Conference on the Theory and Application of Cryptology and Information Security Beijing, China, October 18-22, 1998 Proceedings
EditorsKazuo Ohta, Dingyi Pei
Place of PublicationBerlin; New York
PublisherSpringer, Springer Nature
Pages242-256
Number of pages15
ISBN (Electronic)9783540496496
ISBN (Print)3540651098, 9783540651093
DOIs
Publication statusPublished - Oct 1998
Event4th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT - 1998 - Beijing, China
Duration: 18 Oct 199822 Oct 1998

Publication series

NameLecture Notes in Computer Science
Volume1514
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT - 1998
CountryChina
CityBeijing
Period18/10/9822/10/98

Fingerprint Dive into the research topics of 'Bounds and constructions for multireceiver authentication codes'. Together they form a unique fingerprint.

Cite this