Bounds and constructions for threshold shared generation of authenticators

Rei Safavi-Naini*, Huaxiong Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Shared generation of authenticates systems (or SGA-systems) generalise Simmons' traditional authentication codes when authenticators for source states are produced by collaboration of a group of senders, rather than a single sender. In this paper we study threshold SGA-systems. We derive information-theoretic and combinatorial lower bounds on the probability of success and the size of the key space, and give two key efficient constructions for SGA-systems based on den Boer A-codes and error-correcting codes. We also give a recursive construction method using perfect hash families to construct SGA-systems for large groups.

Original languageEnglish
Pages (from-to)1285-1301
Number of pages17
JournalInternational Journal of Computer Mathematics
Issue number12
Publication statusPublished - 2002


  • Authentication codes
  • Distributed authentication
  • Perfect hash families
  • Shared generation of authenticators
  • Threshold authentication codes


Dive into the research topics of 'Bounds and constructions for threshold shared generation of authenticators'. Together they form a unique fingerprint.

Cite this