Bounds on the probability of deception in multiple authentication

Research output: Contribution to journalArticlepeer-review


The frequently assumed "freshness" constraint on the source states in multiple authentication schemes is not necessary if one allows the encoding rule to change between subsequent transmissions. In the paper it is shown that the main existing lower bounds on the probabilities of successful attack on multiple authentication schemes also hold for this new setup. Furthermore, Stinson's (1988) bound for the substitution attack is strengthened
Original languageEnglish
Pages (from-to)1586 - 1591
JournalIEEE Transactions on Information Theory
Issue number5
Publication statusPublished - 1994 Sept

Subject classification (UKÄ)

  • Telecommunications
  • Communication Systems


Dive into the research topics of 'Bounds on the probability of deception in multiple authentication'. Together they form a unique fingerprint.

Cite this