By Topic

An efficient key-evolving signature scheme based on pairing

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
$33 $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)
Yuefei Zhu ; Network Eng. Dept., Inf. Eng. Univ., Zhengzhou, China ; Dan Xu

This paper proposes an efficient key-evolving paradigm to deal with the key exposure problem of digital signature schemes. In the paradigm the secret key evolves with time and it is computationally infeasible for an adversary to forge a signature for the periods before the time of the key exposure. The scheme we propose is based on pairing (bilinear maps) and is efficiently constructed. We associate time with all nodes of a binary tree rather than the leaves only for the first time in a signature scheme. The complexity is a log magnitude in terms of the number of the total time periods. Compared with other previous key-evolving signature schemes, the signing and key update algorithm are very efficient. Finally, we give a detailed security analysis for the scheme. The security proof is based on the computational Diffie-Hellman assumption.

Published in:

Distributed Computing Systems, 2004. FTDCS 2004. Proceedings. 10th IEEE International Workshop on Future Trends of

Date of Conference:

26-28 May 2004