Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 596868, 9 pages
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.


A new XTR-based key agreement scheme with constant rounds is presented. Three theorems are formulated to reveal the logarithmic computational complexity of this scheme. Furthermore, the computation framework of XTR-based key agreement scheme is introduced, and security of the scheme is proven under the formal model.