Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Certificateless Threshold Signature for Data Report Authentication 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

3 Author(s)
Piyi Yang ; Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China ; Zhenfu Cao ; Xiaolei Dong

The focus of this paper is to design an efficient certificateless threshold signature scheme (CLTHS) for data report authentication in mobile ad-hoc network, by which relatively small subsets of very large groups can report data that is aggregated and ``certified" by means of a signature. Examples include vehicular networks where cars report traffic conditions, sensor networks that report aggregate data such as temperature or radiation levels, military devices transmitting information to be reported to various commands, and more. We first define the security notion for certificateless threshold signature. Different from the adversarial model defined by Wang et al., our definition considers Type I and Type II adversary separately. At the same time, we develop the simulatability and relationship between certificateless threshold signature and the underlying certificateless signature. We also propose the first CLTHS scheme which is proved existentially unforgeable against adaptively chosen message attack without random oracles. Compared with the previous scheme, our scheme is much more efficient.

Published in:

Network and System Security, 2009. NSS '09. Third International Conference on

Date of Conference:

19-21 Oct. 2009