By Topic

Dynamic Threshold Multi-secret Sharing Scheme Using Elliptic Curve and Bilinear Maps

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)
Shiuh-Jeng Wang ; Dept. of Inf. Manage., Central Police Univ., Taoyuan, Taiwan ; Yuh-Ren Tsai ; Jian-Jhih Shen

In this paper, we propose a dynamic threshold and verifiable multi-secret sharing scheme. Some secrets are protected by distributing them among many participants, whereby only an authorized group of participants can reconstruct the secrets. In our scheme, the secret will change periodically and the dealer will periodically publish some of the information, in addition, the participants can verify the information which they have received. Each participant holds only one permanent, private secret, and some of them use it during different time periods to reconstruct the corresponding shared secrets without revealing their own private information. Because some public information is renewed in our scheme, the old information has nothing to do with the next secret. We also compare our scheme to Chen et al.¿s scheme, and we will present some analyses which show that our scheme has smaller storage requirements than the previous scheme.

Published in:

Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on  (Volume:2 )

Date of Conference:

13-15 Dec. 2008