Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
Some constructions for authentication-secrecy codes
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
The combinatorics of authentication and secrecy codes
Journal of Cryptology
Three Constructions of Authentication Codes with Perfect Secrecy
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Authentication Codes and Combinatorial Designs (Discrete Mathematics and Its Applications)
Authentication Codes and Combinatorial Designs (Discrete Mathematics and Its Applications)
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Combinatorial bounds and characterizations of splitting authentication codes
Cryptography and Communications
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
We give new combinatorial constructions for codes providing authentication and secrecy for equiprobable source probability distributions. In particular, we construct an infinite class of optimal authentication codes which are multiple-fold secure against spoofing and simultaneously achieve perfect secrecy. Several further new optimal codes satisfying these properties will also be constructed and presented in general tables. Almost all of these appear to be the first authentication codes with these properties.