Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
The combinatorics of authentication and secrecy codes
Journal of Cryptology
Elements of information theory
Elements of information theory
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)
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the relation between A-codes and codes correcting independent errors
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Universal hashing and authentication codes
Designs, Codes and Cryptography
On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Multireceiver authentication code4: models, bounds, constructions, and extensions
Information and Computation
Characterisation of (k, n) Multi-receiver Authentication
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Perfect and essentially perfect authentication schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Security Notions for Unconditionally Secure Signature Schemes
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Unconditionally Secure Digital Signature Schemes Admitting Transferability
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Logarithm Cartesian authentication codes
Information and Computation
| Hi-index | 0.00 |
Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal definition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new efficient constructions for such codes, our constructions are based on the linear error-correcting codes.