Linear authentication codes : bounds and constructions | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/17938

33 Visitors

38 Hits

1 Downloads

File	Description	Size	Format
DS01	Publisher version (open access)	443 KB	Adobe Acrobat PDF	View/Open

Title: Linear authentication codes : bounds and constructions
Related: IEEE transactions on information theory, Vol. 49, Issue 4, p.866-872
DOI: 10.1109/TIT.2003.809567
Publisher: IEEE Institute of Electrical and Electronics
Date: 2003
Author/Creator: Wang, Huaxiong
Author/Creator: Xing, Chaoping
Author/Creator: Safavi-Naini, Rei
Description: 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 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.
Description: 7 page(s)
Subject Keyword: authentication codes (A-codes)
Subject Keyword: distributed A-codes
Subject Keyword: linear A-codes
Resource Type: journal article
Organisation: Macquarie University. Dept. of Computing

Identifier: http://hdl.handle.net/1959.14/17938
Identifier: ISSN:0018-9448
Identifier: mq-rm-2003018275
Language: eng
Rights: Copyright 2003 IEEE. Reprinted from IEEE transactions on information theory. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Full Text
Reviewed

Macquarie University ResearchOnline