A Dynamic Secret Sharing Scheme Based on Factorization | Zendy

Dan Wang | Zendy; Yufei Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Dynamic Secret Sharing Scheme Based on Factorization

Author(s) -

Dan Wang,

Yufei Zhang

Publication year - 2011

Publication title -

computer and information science

Language(s) - English

Resource type - Journals

eISSN - 1913-8997

pISSN - 1913-8989

DOI - 10.5539/cis.v4n1p160

Subject(s) - computer science , secret sharing , key (lock) , scheme (mathematics) , factorization , shadow (psychology) , process (computing) , shamir's secret sharing , theoretical computer science , homomorphic secret sharing , computer security , algorithm , cryptography , operating system , mathematics , psychology , mathematical analysis , psychotherapist

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research