By Topic

A novel verifiable threshold signature scheme based on bilinear pairing in mobile Ad Hoc Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xianyong Meng ; Dept. of Electromech. Eng., Univ. of Macau, Taipa, China ; Yangmin Li

In this paper, a (t, n) threshold signature scheme is constructed without a trusted party, which has provable security in Mobile Ad Hoc Network, and its security fits with terminal device with limited resource. Any participant can compute the system public key, but can not recover the system secret key without any other t-1 participants' help. In this proposed scheme, ECC-based threshold polynomial is intrinsically safer and easier to realize than the presented schemes' based on prime-field. A verifiable threshold signature scheme is proposed such that all participants must provide confidential and verifiable information λj each other. We design a new bilinear pairing-based threshold signature scheme which is efficient in terms of both the communication overhead and the computational requirement. So the new threshold signature scheme is more secure, verifiable, and efficient compared with the presented schemes for Mobile Ad Hoc Network.

Published in:

Information and Automation (ICIA), 2012 International Conference on

Date of Conference:

6-8 June 2012