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
Combinatorial characterizations of authentication codes
Designs, Codes and Cryptography
Combinatorial Characterizations of Authentication Codes II
Designs, Codes and Cryptography
Combinatorial Bounds on Authentication Codes with Arbitration
Designs, Codes and Cryptography
New Bound on Authentication Code with Arbitration
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Combinatorial Constructions for Optimal Splitting Authentication Codes
SIAM Journal on Discrete Mathematics
A New Class of Optimal 3-splitting Authentication Codes
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)
Authentication and secrecy codes for equiprobable source probability distributions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Message authentication with arbitration of transmitter/receiver disputes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
A new class of splitting 3-designs
Designs, Codes and Cryptography
A new class of 3-fold perfect splitting authentication codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We present several generalizations of results for splitting authentication codes by studying the aspect of multi-fold security. As the two primary results, we prove a combinatorial lower bound on the number of encoding rules and a combinatorial characterization of optimal splitting authentication codes that are multi-fold secure against spoofing attacks. The characterization is based on a new type of combinatorial designs, which we introduce and for which basic necessary conditions are given regarding their existence.