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
โฆ 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
Combinatorial bounds and characterizatio
โ
Michael Huber
๐
Article
๐
2010
๐
Springer-Verlag
๐
English
โ 313 KB
Combinatorial Bounds on Authentication C
โ
Kaoru Kurosawa; Satoshi Obana
๐
Article
๐
2001
๐
Springer
๐
English
โ 85 KB
Combinatorial Constructions for Optimal
โ
Ge, Gennian; Miao, Ying; Wang, Lihua
๐
Article
๐
2005
๐
Society for Industrial and Applied Mathematics
๐
English
โ 196 KB
Combinatorial Classification of Optimal
โ
Satoshi Obana; Kaoru Kurosawa
๐
Article
๐
2000
๐
Springer
๐
English
โ 122 KB
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