In this paper, we consider a new class of unconditionally secure authentication codes, called linear authentication code (or linear A-code). We show that a linear A-code can be characterised by a family of subspaces of a vector space over a finite field. We then derive an upper bound on the size of source space when other parameters of the systems, that is the size 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 application of these codes in constructing distributed authentication systems.
CITATION STYLE
Safavi-Naini, R., Wang, H., & Xing, C. (2001). Linear authentication codes: Bounds and constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2247, pp. 127–135). Springer Verlag. https://doi.org/10.1007/3-540-45311-3_13
Mendeley helps you to discover research relevant for your work.