A lower bound on the probability of deception in multiple authentication

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

Sammanfattning

New bounds are derived for the probabilities of successful attack on multiple authentication schemes by removing the frequently assumed 'freshness' constraint on the source states. We prove that the overall probability of successful deception, PD(L), for a sequences of L uses of the authentication channel, is bounded from below by max(k/v, 1/√b). We also show that if PD{L) = 1/√b, then the key entropy is lower bounded by 1/2(L + l)log2 b bits and that this bound is tight.

Originalspråkengelska
Titel på värdpublikationProceedings 1991 IEEE International Symposium on Information Theory
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor180
Antal sidor1
ISBN (elektroniskt)0780300564
DOI
StatusPublished - 1991
Evenemang1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Ungern
Varaktighet: 1991 juni 241991 juni 28

Publikationsserier

NamnIEEE International Symposium on Information Theory - Proceedings
ISSN (tryckt)2157-8095

Konferens

Konferens1991 IEEE International Symposium on Information Theory, ISIT 1991
Land/TerritoriumUngern
OrtBudapest
Period1991/06/241991/06/28

Bibliografisk information

Publisher Copyright:
© 1991 Institute of Electrical and Electronics Engineers Inc. All rights reserved.

Ämnesklassifikation (UKÄ)

  • Telekommunikation
  • Sannolikhetsteori och statistik

Fingeravtryck

Utforska forskningsämnen för ”A lower bound on the probability of deception in multiple authentication”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här