IEEE Transactions on Information Theory · 2003 · 116 citations · 17 references
ComputingComputer ScienceMathematicsAuthenticationCryptographyDistributed SystemsCode-based CryptographyCoding TheoryCryptographic ComplexityError-correcting CodesInformation-theoretic CryptographyAuthentication CodesCodes Over Finite FieldsLinear Block CodesLinear CodesSecure AuthenticationVector Space Models
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.
17
Adi Shamir · Communications of the ACM · 1979 · 13.5K citations · Full text
Universal classes of hash functions
J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 1979 · 2.6K citations
E. N. Gilbert, F. MacWilliams, N. J. A. Sloane · Bell System Technical Journal · 1974 · 383 citations
Universal hashing and authentication codes
Douglas R. Stinson · Designs Codes and Cryptography · 1994 · 294 citations