Abstract
Multi-sender authentication codes are always viewed as an extension of the traditional point-to-point message authentication. Multi-sender authentication codes allow a group of senders to construct an authenticated message such that the receiver can verify the authenticity of the received message. In this paper, a new construction of multi-sender authentication code from singular pseudo-symplectic geometry over finite fields is put forward. Both the parameters and the probabilities of successful deceptions from a part of senders are computed by the method of matrices and combinatorial enumeration. Finally, we appropriately adjust the parameters of our scheme for achieving the optimum case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gilbert, E.N., MacWilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell Syst. Tech. J. 53, 405–424 (1974)
Simmons, G.J.: Authentication theory/coding theory. In: Advance in Cryptology: Proceedings of the Crypto 84, Lecture Notes in Computer Science, vol. 196, pp. 411–432 (1985)
Simmons, G.J.: Message authentication with arbitration of transmitter/receiver disputes. In: Proceedings of the 6th Annual International Conference on Theory and Application of Cryptographic Techniques (Eurocrypt 87), vol. 304, pp. 151–165 (1988)
Desmedt, Y., Frankel, Y., Yung, M.: Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback. In: Proceedings of the the 11th Annual Conference of the IEEE Computer and Communications Societies (Infocom 92), pp. 2045–2054 (1992)
Ma, W.P., Wang, X.M.: Several new constructions of multi-trasmitters authentication codes. Acta Electronica Sinica 28, 117–119 (2000)
Chen, S.D., Yang, C.L.: A new construction of multi-sender authentication codes from symplectic geometry over finite fields. Ars Combinatoria 106, 353–366 (2012)
Chen, S.D., Chang, L.Z.: Two constructions of multi-sender authentication codes with arbitration based linear codes. WSEAS Trans. Math. 11, 1103–1113 (2013)
Chen, S.D., Zhao, D.W.: Two constructions of multi-receiver authentication codes from symplectic geometry over finite fields. Ars Combinatoria 99, 193–203 (2011)
Gao, Y., Chang, L.W.: Two new constructions of multi-receiver authentication codes from singular pseudo-symplectic geometry over finite fields. WSEAS Trans. Math. 11, 44–53 (2012)
Chen, S.D., An, L.: Two constructions of multi-receiver authentication codes from singular symplectic geometry over finite fields. WSEAS Trans. Math. 11, 54–63 (2012)
Pei, D.Y.: Information-theoretic bounds for authentication codes and block design. J. Cryptol. 8, 77–188 (1995)
Pei, D.Y., Li, Y.Q., Wang, Y.J., Safavi-Naini, R.: Characterization of optimal authenticaiton codes with arbitration. Inf. Secur. Priv. Lect. Notes Comput. Sci. 1587, 303–313 (1999)
Safavi-Naini, R., Wang, H.: Multi-receiver authenticaiton codes: models, bounds, constructions, and extensions. Inf. Comput. 151, 148–172 (1999)
Du, Q.L., Lv, S.W.: Bounds and constructons for multi-receiver authentication code. Comput. Eng. Appl. 10, 9–11 (2004)
Wan, Z.X.: Geometry of Classical Group Over Finite Field. Science Press, Beijing (2002)
Pei, D.Y.: Message Authentication Codes. Press of University of Science and Technology of China, China (2009)
Acknowledgments
The work is supported by the National Natural Science Foundation of China (Grant Nos. 61370194, 61202082 and 61121061) and the Fundamental Research Funds for the Central Universities (Grant Nos. BUPT2012RC0219 and BUPT2013RC0311).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chang, LW., Zheng, SH., Gao, Y. et al. A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields. AAECC 25, 407–429 (2014). https://doi.org/10.1007/s00200-014-0235-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-014-0235-2