Abstract
Group authentication schemes as introduced by Boyd and by Desmedt and Frankel are cryptographic schemes in which only certain designated groups can provide messages with authentication information. In this paper we study unconditionally secure group authentication schemes based on linear perfect secret sharing and authentication schemes, for which we give expressions for the probabilities of successful attacks. Furthermore, we give a construction that uses maximum rank distance codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.R. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference. AFIPS Conf. Proc.(1979) pp. 313–317.
G.R. Blakely and G.A. Kabatianskii, A linear algebra approach to secret sharing schemes, Preproceedings of the Workshop on Information Protection, December (1993) Moscow.
C. Boyd, Digital multisignatures, In Cryptography and coding, (H. Beker and F. Piper, editors), Clarendon Press (1989) pp. 241–246.
E.F. Brickell and D.R. Stinson, Some Improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, Vol. 5, (1992) pp. 153–166.
R.M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes, J. Cryptology, Vol. 6, (1993) pp. 157–167.
Y. Desmedt, Threshold cryptography, Proceedings of the 3-rd Symposium on State and Progress of Research in Cryptography, February (1993) pp. 110–122.
Y. Desmedt, Threshold cryptography, European Trans. on Telecommunications, Vol. 5 (1994) pp. 449–457
Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures, Proceedings of Crypto' 91, Springer-Verlag (1992) pp. 457–469.
E.M. Gabidulin, Theory of codes with maximum rank distance, Problems of Information Transmission, Vol. 21, No.1 (1985) pp. 1–12, (Russian original version January-March 1985).
W.-A. Jackson and K. Martin, Geometric secret sharing schemes and their duals, Designs, Codes, and Cryptography, Vol. 5, No1. (1994) pp. 83–95.
T. Johansson, Contributions to unconditionally secure authentication, Ph.D. thesis, Lund (1994).
T. Johansson, Authentication codes for nontrusting parties obtained from rank metric codes, Designs Codes and Cryptography, Vol. 6, No.3 (1995) pp. 205–218.
T. Johansson, G. Kabatanskii, and B. Smeets, On the relation between A-codes and codes correcting independent errors, Proceedings of Eurocrypt' 93, Bergen, Norway, LNCS 765, Springer-Verlag, Berlin (1993) pp. 1–11.
K. Martin and R. Safavi-Naini, Unconditionally secure authentication with shared generation of authenitcators, manuscript.
R.L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Commun. ACM, Vol. 21 (1978) pp. 294–299.
A. Shamir, How to share a secret, Commun. ACMVol. 22 (1979) pp. 612–613.
G.J. Simmons, A survey of information authentication, In Contemporary Cryptology, (G.J. Simmons, Ed.), IEEE Press (1992) pp. 379–419.
M. van Dijk, A linear construction of perfect secret sharing schemes, Proceedings Eurocrypt' 94, Perugia, Italy, LNCS 950, Springer-Verlag, Berlin (1995) pp. 23–34.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
van Dijk, M., Gehrmann, C. & Smeets, B. Unconditionally Secure Group Authentication. Designs, Codes and Cryptography 14, 281–296 (1998). https://doi.org/10.1023/A:1008261021505
Issue Date:
DOI: https://doi.org/10.1023/A:1008261021505