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

Combinatorial characterizations of authentication codes II

โœ Scribed by Rolf S. Rees, Douglas R. Stinson


Book ID
118771425
Publisher
Springer
Year
1996
Tongue
English
Weight
814 KB
Volume
7
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Combinatorial characterizations of authe
โœ D. R. Stinson ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 536 KB

In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs. In both of these characteri

A problem of combinatorial designs relat
โœ Dingyi Pei ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 433 KB ๐Ÿ‘ 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially