Proceedings ArticleDOI
Information-theoretic bounds in authentication theory
Ueli Maurer
- pp 12
Reads0
Chats0
TLDR
This paper gives a simplified treatment of, and new results on, information-theoretic lower bounds on an opponent's cheating probability in an authentication system with a given key entropy.Abstract:
This paper gives a simplified treatment of, and new results on, information-theoretic lower bounds on an opponent's cheating probability in an authentication system with a given key entropy.read more
Citations
More filters
Information-theoretic secret key agreement
TL;DR: The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers.
References
More filters
Journal ArticleDOI
Codes which detect deception
TL;DR: If the key can take K values, then an optimal strategy for B secures him a probability of an undetected substitution ≪ K−1, and several encoding functions Φ(.,.) are given, some of which achieve this bound.
Book ChapterDOI
Authentication theory/coding theory
TL;DR: This work considers a communications scenario in which a transmitter attempts to inform a remote receiver of the state of a source by sending messages through an imperfect communications channel, and considers the deliberate introduction of redundant information into the transmitted message.
Journal ArticleDOI
A lower bound on authentication after having observed a sequence of messages
TL;DR: A lower bound is proved on the probability that a spoofer observing i messages succeeds in generating an authentic message without knowing the encoding rule used, based on the conditional entropy of the encoding rules when a sequence of messages is known.
Journal ArticleDOI
Information-theoretic bounds for authentication schemes
TL;DR: A lower bound is derived for the average PN of the probabilities P(0), P(1),...;, P(N) in terms of the entropy of the space of encoding rules, and to derive necessary and sufficient conditions which the encoding scheme must satisfy in order to ensure that this bound cannot be exceeded.
Journal ArticleDOI
Bounds on the probability of deception in multiple authentication
TL;DR: 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 and Stinson's (1988) bound for the substitution attack is strengthened.