Bounds on the probability of deception in multiple authentication

Ben Smeets

doi:10.1109/18.333871

Bounds on the probability of deception in multiple authentication

Ben Smeets

Department of Electrical and Information Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	1586 - 1591
Journal	IEEE Transactions on Information Theory
Volume	40
Issue number	5
DOIs	https://doi.org/10.1109/18.333871
Publication status	Published - 1994 Sept

Subject classification (UKÄ)

Telecommunications
Communication Systems

Access to Document

10.1109/18.333871

Cite this

@article{2ffa55a0333a45c6918e4b6f2475349b,

title = "Bounds on the probability of deception in multiple authentication",

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

author = "Ben Smeets",

year = "1994",

month = sep,

doi = "10.1109/18.333871",

language = "English",

volume = "40",

pages = "1586 -- 1591",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "5",

}

TY - JOUR

T1 - Bounds on the probability of deception in multiple authentication

AU - Smeets, Ben

PY - 1994/9

Y1 - 1994/9

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

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

U2 - 10.1109/18.333871

DO - 10.1109/18.333871

M3 - Article

SN - 0018-9448

VL - 40

SP - 1586

EP - 1591

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

Bounds on the probability of deception in multiple authentication

Abstract

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this