Unconditionally Secure Group Authentication

Marten van Dijk, Christian Gehrmann, Ben Smeets

Research output: Contribution to journalArticlepeer-review


Group authentication schemes as introduced by Boyd and by Desmedt and Frankel are cryptographic schemes in which only certain designated groups can provide messages with authentication information. In this paper we study unconditionally secure group authentication schemes based on linear perfect secret sharing and authentication schemes, for which we give expressions for the probabilities of successful attacks. Furthermore, we give a construction that uses maximum rank distance codes.
Original languageEnglish
Pages (from-to)281-296
JournalDesigns, Codes, and Cryptography
Publication statusPublished - 1998

Subject classification (UKÄ)

  • Computer Science
  • Telecommunications


Dive into the research topics of 'Unconditionally Secure Group Authentication'. Together they form a unique fingerprint.

Cite this