By Topic

A Multiple Secrets Sharing Scheme with General Access Structure

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)
Sai-zhi Ye ; Inf. Sci. Technol. Coll., Jinan Univ., Guangzhou, China ; Guo-xiang Yao ; Quan-long Guan

A dynamic and verifiable multiple secrets sharing scheme with general access structure, is proposed in this paper. The scheme only needs to construct degree Lagrange interpolation polynomial and secrets can be shared in each sharing process without secure channel. That allows each participant to choose his secret shadow by himself and cheating is verifiable. In addition, it can dynamically change the participant set, the qualified subset and even the number of the shared secrets without refreshing any participantpsilas secret shadow. Furthermore because the scheme is based on general access structure, it will be more flexible and easier to implement than the threshold one. The security of the proposed scheme is based on the Shamirpsilas secret sharing scheme and the intractability of the discrete logarithm. In a word, the scheme is secure, efficient and could provide great capabilities for many applications, such as in multi-user work.

Published in:

Intelligent Ubiquitous Computing and Education, 2009 International Symposium on

Date of Conference:

15-16 May 2009