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åk | engelska |
---|---|
Titel på värdpublikation | Proceedings 1991 IEEE International Symposium on Information Theory |
Förlag | IEEE - Institute of Electrical and Electronics Engineers Inc. |
Sidor | 180 |
Antal sidor | 1 |
ISBN (elektroniskt) | 0780300564 |
DOI | |
Status | Published - 1991 |
Evenemang | 1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Ungern Varaktighet: 1991 juni 24 → 1991 juni 28 |
Publikationsserier
Namn | IEEE International Symposium on Information Theory - Proceedings |
---|---|
ISSN (tryckt) | 2157-8095 |
Konferens
Konferens | 1991 IEEE International Symposium on Information Theory, ISIT 1991 |
---|---|
Land/Territorium | Ungern |
Ort | Budapest |
Period | 1991/06/24 → 1991/06/28 |
Bibliografisk information
Publisher Copyright:© 1991 Institute of Electrical and Electronics Engineers Inc. All rights reserved.
Ämnesklassifikation (UKÄ)
- Telekommunikation
- Sannolikhetsteori och statistik