๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Information-theoretic bounds for authentication codes and block designs

โœ Scribed by Dingyi Pei

Publisher
Springer
Year
1995
Tongue
English
Weight
480 KB
Volume
8
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

โœฆ Synopsis

Authentication codes with secrecy and with splitting are investigated. An information-theoretic lower bound for the probability of successful deception for a spoofing attack of order r is obtained. The condition necessary on authentication codes to achieve the lower bound is determined as a single simple requirement. Based on the simplicity of the result a construction, by use of so-called partially balanced t-designs, for authentication codes that can achieve the lower bound is suggested.

๐Ÿ“œ SIMILAR VOLUMES

Information-theoretic bounds for authent
Information-theoretic bounds for authentication schemes
โœ Michael Walker ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 604 KB

Consider the situation whereby each member of a sequence of n distinct messages from a finite source space is provided with an authentication check, generated using one and the same encoding rule selected from a finite space of such rules. Let P(n) be the expected probability that a spoofer, who obs

Information theoretical based design of
Information theoretical based design of hierarchical channel coding and modulation for mobile radio channels
โœ Alexander Seeger ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

For the transmission of video on time-variant mobile radio channels we discuss a self-adapting hierarchical channel coding scheme. Based on the cutoff rate for multilevel coding on fading channels we derive a procedure for the joint design of unequal error protection and clustered signal constellati