A coding theory construction of new systematic authentication codes
Theoretical Computer Science - Insightful theory
Johnson type bounds on constant dimension codes
Designs, Codes and Cryptography
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Constant-rank codes and their connection to constant-dimension codes
IEEE Transactions on Information Theory
Optimal authentication codes from difference balanced functions
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Recursive code construction for random networks
IEEE Transactions on Information Theory
List decoding subspace codes from insertions and deletions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Rank subcodes in multicomponent network coding
Problems of Information Transmission
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 754.96 |
In this paper, we consider a new class of unconditionally secure authentication codes, called linear authentication codes (or linear A-codes). We show that a linear A-code can be characterized by a family of subspaces of a vector space over a finite field. We then derive an upper bound on the size of the source space when other parameters of the system, that is, the sizes of the key space and the authenticator space, and the deception probability, are fixed. We give constructions that are asymptotically close to the bound and show applications of these codes in constructing distributed authentication systems.