Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
The combinatorics of authentication and secrecy codes
Journal of Cryptology
Key-minimal cryptosystems for unconditional secrecy
Journal of Cryptology
Combinatorial characterizations of authentication codes
Designs, Codes and Cryptography
Construction of Cartesian authentication codes from unitary geometry
Designs, Codes and Cryptography
The Combinatorics of Perfect Authentication Schemes
SIAM Journal on Discrete Mathematics
Combinatorial Characterizations of Authentication Codes II
Designs, Codes and Cryptography
Bounds and Characterizations of Authentication/SecrecySchemes
Designs, Codes and Cryptography
New Combinatorial Bounds for Authentication Codes and KeyPredistribution Schemes
Designs, Codes and Cryptography
Cartesian authentication codes from functions with optimal nonlinearity
Theoretical Computer Science
Graph Theory With Applications
Graph Theory With Applications
On the cardinality of systematic authentication codes via error-correcting codes
IEEE Transactions on Information Theory
Constructions of authentication codes from algebraic curves over finite fields
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, a characterization of authentication codes in terms of bipartite graphs is given. By using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. The probabilities of a successful impersonation and of a successful substitution attack are discussed. As a result, some (optimal) minimal authentication codes with perfect secrecy are constructed from association schemes, from finite groups or from known authentication codes no matter whether the known ones are with or without secrecy.