Unconditionally Secure Group Authentication

Authors:
Marten Van Dijk;Christian Gehrmann;Ben Smeets
Affiliations:
Philips Research Labratories, Prof. Holstlaan 4, 5656 AA, Eindhoven, The Netherlands E-mail: mvandijk@natlab.research.philips.com;Ericsson Telecom, Switchlab, S-126 25 Stockholm, Sweden E-mail: etxcgeh@kk.etx.ericsson.se;Department of Information Technology, Lund University, Box 118, S-221 00 Lund, Sweden E-mail: ben@it.lth.se
Venue:
Designs, Codes and Cryptography
Year:
1998

Citing 8
Cited 2

Some improved bounds on the information rate of perfect secret sharing schemes

Journal of Cryptology
Geometric secret sharing schemes and their duals

Designs, Codes and Cryptography
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
Authentication codes for nontrusting parties obtained from rank metric codes

Designs, Codes and Cryptography
How to share a secret

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Linear Algebra Approach to Secret Sharing Schemes

Selected papers from the Workshop on Information Protection, Error Control, Cryptology, and Speech Compression
Shared Generation of Authenticators and Signatures (Extended Abstract)

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology

Linear Authentication Codes: Bounds and Constructions

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Threshold MACs

ICISC'02 Proceedings of the 5th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Group authentication schemes as introduced by Boyd and by Desmedtand Frankel are cryptographic schemes in which only certain designatedgroups can provide messages with authentication information. In this paperwe study unconditionally secure group authentication schemes based onlinear perfect secret sharing and authentication schemes, for which we giveexpressions for the probabilities of successful attacks. Furthermore, wegive a construction that uses maximum rank distance codes.