Li, Ruihu; Guo, Luobin Construction of authentication codes with arbitration from unitary geometry. (English) Zbl 1158.94386 Appl. Math., Ser. B (Engl. Ed.) 14, No. 4, 475-480 (1999). Summary: A family of authentication codes with arbitration is constructed from unitary geometry. The parameters and the probabilities of deceptions of the codes are also computed. In a special case a perfect authentication code with arbitration is obtained. Cited in 1 Document MSC: 94A60 Cryptography 94A62 Authentication, digital signatures and secret sharing PDFBibTeX XMLCite \textit{R. Li} and \textit{L. Guo}, Appl. Math., Ser. B (Engl. Ed.) 14, No. 4, 475--480 (1999; Zbl 1158.94386) Full Text: DOI References: [1] Simmons, G. J., Message authentication with arbitration of transmitter/receiver disputes, In: Chaum, D. and Price, W. L. eds., Proc. Eurocrypt’87, Amsterdan, Netherlands, April 13–15, 1987, Springer-Verlag, Berlin, 1988, 151–165. [2] Li Ruihu, On the construction of authentication codes that permit arbitration over projective spaces, Appl. Math J. Chinese Univ. Ser. B, 1998, 13 (3): 330–338. · Zbl 0918.94014 · doi:10.1007/s11766-998-0025-3 [3] Wan Zhexian, Construction of Cartesian authentication codes from unitary geometry, Designs, Codes and Cryptography, 1992, 2: 336–356. · Zbl 0764.94022 [4] Gao Suogang, Two constructions of Cartesian authentication codes from unitary geometry, Appl. Math. J. Chinese Univ. Ser. A, 1996, 11 (3): 343–354. · Zbl 0856.94019 [5] Wan Zhexian, Geometry of Classical Groups over Finite Fields, Student Litterature, Lund, 1993. · Zbl 0817.51001 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.