Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
The combinatorics of authentication and secrecy codes
Journal of Cryptology
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Universal hashing and authentication codes
Designs, Codes and Cryptography
Authentication codes for nontrusting parties obtained from rank metric codes
Designs, Codes and Cryptography
Universal Hashing and Geometric Codes
Designs, Codes and Cryptography
Unconditionally Secure Group Authentication
Designs, Codes and Cryptography
Communications of the ACM
Multisender authentication systems with unconditional security
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Society and Group Oriented Cryptography: A New Concept
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Fail-Stop Signature for Long Messages
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Some Recent Research Aspects of Threshold Cryptography
ISW '97 Proceedings of the First International Workshop on Information Security
On the cardinality of systematic authentication codes via error-correcting codes
IEEE Transactions on Information Theory
Constructions of authentication codes from algebraic curves over finite fields
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.