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

Xianyong Meng, Yangmin Li

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

10 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publication2012 IEEE International Conference on Information and Automation, ICIA 2012
Pages361-366
Number of pages6
DOIs
Publication statusPublished - 28 Sep 2012
Externally publishedYes
Event2012 IEEE International Conference on Information and Automation, ICIA 2012 - Shenyang, China
Duration: 6 Jun 20128 Jun 2012

Conference

Conference2012 IEEE International Conference on Information and Automation, ICIA 2012
Country/TerritoryChina
CityShenyang
Period6/06/128/06/12

Keywords

  • Bilinear Pairing
  • Mobile Ad Hoc Network
  • Threshold Signature
  • Without a Trusted Party

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering

Cite this