A lower bound on the probability of deception in multiple authentication

Ben Smeets

doi:10.1109/ISIT.1991.695236

A lower bound on the probability of deception in multiple authentication

Ben Smeets

Institutionen för elektro- och informationsteknik

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer 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, P_D(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 P_D{L) = 1/√b, then the key entropy is lower bounded by 1/2(L + l)log₂ 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	https://doi.org/10.1109/ISIT.1991.695236
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

Tillgång till dokument

10.1109/ISIT.1991.695236

Citera det här

@inproceedings{710891282ff64afeb65f0d80c820f300,

title = "A lower bound on the probability of deception in multiple authentication",

abstract = "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.",

author = "Ben Smeets",

note = "Publisher Copyright: {\textcopyright} 1991 Institute of Electrical and Electronics Engineers Inc. All rights reserved.; 1991 IEEE International Symposium on Information Theory, ISIT 1991 ; Conference date: 24-06-1991 Through 28-06-1991",

year = "1991",

doi = "10.1109/ISIT.1991.695236",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

pages = "180",

booktitle = "Proceedings 1991 IEEE International Symposium on Information Theory",

address = "United States",

}

Smeets, B 1991, A lower bound on the probability of deception in multiple authentication. i Proceedings 1991 IEEE International Symposium on Information Theory., 695236, IEEE International Symposium on Information Theory - Proceedings, IEEE - Institute of Electrical and Electronics Engineers Inc., s. 180, 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Ungern, 1991/06/24. https://doi.org/10.1109/ISIT.1991.695236

A lower bound on the probability of deception in multiple authentication. / Smeets, Ben.

Proceedings 1991 IEEE International Symposium on Information Theory. IEEE - Institute of Electrical and Electronics Engineers Inc., 1991. s. 180 695236 (IEEE International Symposium on Information Theory - Proceedings).

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

TY - GEN

T1 - A lower bound on the probability of deception in multiple authentication

AU - Smeets, Ben

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.1991.695236

DO - 10.1109/ISIT.1991.695236

M3 - Paper in conference proceeding

AN - SCOPUS:85067506484

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 180

BT - Proceedings 1991 IEEE International Symposium on Information Theory

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - 1991 IEEE International Symposium on Information Theory, ISIT 1991

Y2 - 24 June 1991 through 28 June 1991

ER -

A lower bound on the probability of deception in multiple authentication

Sammanfattning

Publikationsserier

Konferens

Bibliografisk information

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här