Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
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.
Wan Zhexian, Construction of Cartesian authentication codes from unitary geometry, Designs, Codes and Cryptography, 1992, 2: 336–356.
Gao Suogang, Two constructions of Cartesian authentication codes from unitary geometry, Appl. Math. J. Chinese Univ. Ser. A, 1996, 11 (3): 343–354.
Wan Zhexian, Geometry of Classical Groups over Finite Fields, Student Litterature, Lund, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ruihu, L., Luobin, G. Construction of authentication codes with arbitration from unitary geometry. Appl. Math. Chin. Univ. 14, 475–480 (1999). https://doi.org/10.1007/s11766-999-0078-y
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11766-999-0078-y