Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 596868, 9 pages
http://dx.doi.org/10.1155/2013/596868
Research Article

An XTR-Based Constant Round Key Agreement Scheme

1School of Math, Wuhan University, Wuhan, Hubei 430072, China
2College of Science, Huazhong Agricultural University, Wuhan, Hubei 430070, China
3College of Science, Navy Engineering University, Wuhan, Hubei 430032, China

Received 15 May 2013; Revised 21 July 2013; Accepted 26 July 2013

Academic Editor: Kwok-Wo Wong

Copyright © 2013 Silan Zhang et al. 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. M. Steiner, G. Tsudik, and M. Waidner, “Diffie-Hellman key distribution extended to group communication,” in Proceedings of the 3rd ACM Conference on Computer and Communications Security, pp. 31–37, March 1996. View at Scopus
  2. M. Steiner, Secure group key agreement [Ph.D. thesis], Universitat des Saarlandes, 2002.
  3. Y. Kim, A. Perrig, and G. Tsudik, “Tree-based group key agreement,” ACM Transactions on Information and System Security, vol. 7, no. 1, pp. 60–96, 2004. View at Publisher · View at Google Scholar · View at Scopus
  4. R. Dutta and R. Barua, “Dynamic group key agreement in tree-based setting,” in Proceedings of the 10th Australasian Conference on Information Security and Privacy (ACISP '05), pp. 101–112, July 2005. View at Scopus
  5. J. Nam, J. Paik, U. M. Kim, and D. Won, “Constant-round authenticated group key exchange with logarithmic computation complexity,” Applied Cryptography and Network Security, Springer, Heidelberg, Germany, vol. 4521, pp. 158–176, 2007. View at Google Scholar · View at Scopus
  6. D. Augot, R. Bhaskar, V. Issarny, and D. Sacchetti, “A three round authenticated group key agreement protocol for ad hoc networks,” Pervasive and Mobile Computing, vol. 3, no. 1, pp. 36–52, 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. R. Tso, X. Yi, and E. Okamoto, “ID-based key agreement for dynamic peer groups in mobile computing environments,” in Proceedings of the 2nd IEEE Asia-Pacific Services Computing Conference (APSCC '07), pp. 103–108, December 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. X. Fu, Q. Xu, and H. Wang, “A provably-secure password-authenticated group key agreement in the standard model,” Journal of Networks, vol. 4, no. 8, pp. 763–770, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. G. Yao and D.-G. Feng, “Pairwise key agreement protocols based on the weil pairing,” Journal of Software, vol. 17, no. 4, pp. 907–914, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. A. Joux, “A one round protocol for tripartite Diffie-Hellman,” in Algorithmic Number Theory, vol. 1838 of Lecture Notes in Computer Science, pp. 385–394, 2001. View at Google Scholar
  11. X. Lv and H. Li, “ID-based authenticated group key agreement from bilinear maps,” Frontiers of Computer Science in China, vol. 4, no. 2, pp. 302–307, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. D. He, Y. Chen, J. Chen, R. Zhang, and W. Han, “A new two-round certificateless authenticated key agreement protocol without bilinear pairings,” Mathematical and Computer Modelling, vol. 54, no. 11-12, pp. 3143–3152, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. M.-H. Zheng, H.-H. Zhou, J. Li, and G.-H. Cui, “Efficient and provably secure password-based group key agreement protocol,” Computer Standards and Interfaces, vol. 31, no. 5, pp. 948–953, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. G. Yao, H. Wang, and Q. Jiang, “An authenticated 3-round identity-based group key agreement protocol,” in Proceedings of the 3rd International Conference on Availability, Security, and Reliability (ARES '08), pp. 538–543, March 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. T. Feng, Y. Wang, and J. Ma, “A secure and efficient group key agreement for ad hoc networks,” in Proceedings of the International Symposium on Computer Science and Computational Technology (ISCSCT '08), pp. 540–543, December 2008. View at Scopus
  16. E. Makri and E. Konstantinou, “Constant round group key agreement protocols: a comparative study,” Computers and Security, vol. 30, no. 8, pp. 643–678, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. E. Bresson, O. Chevassut, and D. Pointcheval, “Provably authenticated group Diffie-Hellman key exchange—the dynamic case,” in Advances in Cryptology—ASIACRYPT 2001, C. Boyded, Ed., vol. 2248 of Lecture Notes in Computer Science, pp. 290–309, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. K. K. Raymond Choo, C. Boyd, and Y. Hitchcock, “The importance of proofs of security for key establishment protocols: formal analysis of Jan-Chen, Yang-Shen-Shieh, Kim-Huh-Hwang-Lee, Lin-Sun-Hwang, and Yeh-Sun protocols,” Computer Communications, vol. 29, no. 15, pp. 2788–2797, 2006. View at Publisher · View at Google Scholar
  19. A. K. Lenstra and E. R. Verheul, “The XTR public key system,” in Advances in Cryptology, vol. 1880 of Lecture Notes in Computer Science, pp. 1–19, Springer, Berlin, Germany, 2000. View at Google Scholar
  20. A. K. Lenstra and E. R. Verheul, “An overview of the XTR public key system,” in Proceedings of the Conference on Public Key Cryptography and Computational Number Theory, pp. 151–180, Warsaw, Poland, 2000.
  21. M. Stam and A. K. Lenstra, “Speeding up XTR,” in Advances in Cryptology—ASIACRYPT 2001, vol. 2248 of Lecture Notes in Computer Science, pp. 125–143, Springer, Berlin, Germany, 2001. View at Google Scholar
  22. E. Verheul, “Evidence that XTR is more secure than supersingular ellipticcurve cryptosystems,” in Advances in Cryptology—EUROCRYPT 2001, B. Pfitzmann, Ed., vol. 2045 of Lecture Notes in Computer Science, pp. 195–210, Springer, Berlin, Germany, 2001. View at Google Scholar
  23. K.-A. Shim, “A round-optimal three-party ID-based authenticated key agreement protocol,” Information Sciences, vol. 186, no. 1, pp. 239–248, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  24. H. Xiong, Z. Chen, and F. Li, “New identity-based three-party authenticated key agreement protocol with provable security,” Journal of Network and Computer Applications, vol. 36, no. 2, pp. 927–932, 2013. View at Publisher · View at Google Scholar