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

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.