A Dynamic Secret Sharing Scheme Based on Factorization

Dan Wang, Yufei Zhang

Abstract


A dynamic (t, n)-threshold secret sharing scheme based on factorization is proposed in this paper. It has following properties: (1) the dealer can renew the secret key of the system without renewing the shadows of the participants; (2) when some participants’ shadows are revealed, they can be renewed without any effect on the others; (3) a new shadow can be generated for a new participant without any effect on others; (4) the shadows can be reused for many times; (5) the secret key of the system can be recovered in a parallel process.


Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Computer and Information Science   ISSN 1913-8989 (Print)   ISSN 1913-8997 (Online)
Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.