Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 102301, 7 pages
http://dx.doi.org/10.1155/2014/102301
Research Article

A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields

1College of Science, Civil Aviation University of China, Tianjin 300300, China
2Information Security Center, Beijing University of Posts and Telecommunications, P.O. Box 126, Beijing 100876, China

Received 26 August 2013; Revised 26 December 2013; Accepted 5 January 2014; Published 30 April 2014

Academic Editor: Francesco Pellicano

Copyright © 2014 Shangdi Chen and Chunli Yang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. E. N. Gilbert, F. J. MacWilliams, and N. J. A. Sloane, “Codes which detect deception,” The Bell System Technical Journal, vol. 53, pp. 405–424, 1974. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. G. J. Simmons, “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.
  3. Z. X. Wan, “Construction of cartesian authentication codes from unitary geometry,” Designs, Codes and Cryptography, vol. 2, no. 4, pp. 333–356, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. W. P. Ma and X. M. Wang, “A construction of authentication codes with arbitration based on symplectic spaces,” Chinese Journal of Computers, vol. 22, no. 9, pp. 949–952, 1999. View at Google Scholar · View at MathSciNet
  5. G. You, S. Xinhua, and W. Hongli, “Construction of authentication codes with arbitration from symplectic geometry over finite fields,” Acta Scientiarum Naturalium Universitatis Nankaiensis, vol. 41, no. 6, pp. 72–77, 2008. View at Google Scholar
  6. S. Chen and D. Zhao, “New construction of authentication codes with arbitration from pseudo-symplectic geometry over finite fields,” Ars Combinatoria, vol. 97, pp. 453–465, 2010. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. S. Chen and D. Zhao, “Two constructions of optimal Cartesian authentication codes from unitary geometry over finite fields,” Acta Mathematicae Applicatae Sinica, vol. 29, no. 4, pp. 829–836, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. S. Chen and D. Zhao, “Construction of multi-receiver multi-fold authentication codes from singular symplectic geometry over finite fields,” Algebra Colloquium, vol. 20, no. 4, pp. 701–710, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. L. Ruihu and L. Zunxian, “Construction of A2-codes from symplectic geometry,” Journal of Shanxi Normal University, vol. 26, no. 4, pp. 10–15, 1998. View at Google Scholar
  10. C. Xing, H. Wang, and K.-Y. Lam, “Constructions of authentication codes from algebraic curves over finite fields,” IEEE Transactions on Information Theory, vol. 46, no. 3, pp. 886–892, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. C. Carlet, C. Ding, and H. Niederreiter, “Authentication schemes from highly nonlinear functions,” Designs, Codes and Cryptography, vol. 40, no. 1, pp. 71–79, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. R. Safavi-Naini and H. Wang, “Multireceiver authentication codes: models, bounds, constructions, and extensions,” Information and Computation, vol. 151, no. 1-2, pp. 148–172, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. S. Chen and D. Zhao, “Construction of multi-receiver multi-fold authentication codes from singular symplectic geometry over finite fields,” Algebra Colloquium, vol. 20, no. 4, pp. 701–710, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. S. Chen and D. Zhao, “Two constructions of multireceiver authentication codes from symplectic geometry over finite fields,” Ars Combinatoria, vol. 99, pp. 193–203, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. Y. Desmedt, Y. Frankel, and M. Yung, “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, vol. 3, pp. 2045–2054, May 1992. View at Scopus
  16. Q. Yingchun and Z. Tong, “Multiple authentication Code with multi-transmitter and its constructions,” Journal of Zhongzhou University, vol. 20, no. 1, pp. 118–120, 2003. View at Google Scholar
  17. M. Wen-Ping and W. Xin-Mei, “Several new constructions on multitransmitters authentication codes,” Acta Electronica Sinica, vol. 28, no. 4, pp. 117–119, 2000. View at Google Scholar
  18. D. Qingling and L. Shuwang, “Bounds and construction for multi-sender authentication code,” Computer Engineering and Applications, vol. 10, pp. 9–10, 2004. View at Google Scholar
  19. S. Chen and C. Yang, “A new construction of multisender authentication codes from symplectic geometry over finite fields,” Ars Combinatoria, vol. 106, pp. 353–366, 2012. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. Z. Wan, Geometry of Classical Groups over Finite Fields, Science Press, Beijing, China, 2nd edition, 2002.