A fully dynamic secret sharing scheme

Abstract Based on the homogeneous linear recursive equation and the Elliptic curve cryptography (ECC), a fully dynamic secret sharing scheme is proposed for the general access structure of the participants. The participants choose their own shadows by themselves. When the shared secrets are updated, the access structure is changed, and other participants are added to or deleted from the existed group, but the shadow of each participant remains unchanged. Each participant should only maintain a shadow to share the multiple secrets. Compared with the existing popular dynamic schemes, the key construction of the proposed scheme is simpler and the proposed scheme has a completely dynamic characteristic, so that it has the potential to extend its practical application scenarios. That is, the proposed scheme can improve the performances of the key management and the distributed system. The security of the scheme is based on the Shamir threshold scheme, the computational Diffie–Hellman problem (CDHP) and the discrete logarithm problem (DLP).

[1]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[2]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[3]  Geng Yang,et al.  Pairing-Based Dynamic Threshold Secret Sharing Scheme , 2010, 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).

[4]  Guang Gong,et al.  The GH Public-Key Cryptosystem , 2001, Selected Areas in Cryptography.

[5]  Massoud Hadian Dehkordi,et al.  Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves , 2008, Comput. Commun..

[6]  Massoud Hadian Dehkordi,et al.  Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem , 2015, Inf. Sci..

[7]  Massoud Hadian Dehkordi,et al.  New efficient and practical verifiable multi-secret sharing schemes , 2008, Inf. Sci..

[8]  Guang Gong,et al.  Public-key cryptosystems based on cubic finite field extensions , 1999, IEEE Trans. Inf. Theory.

[9]  Wang Yu-min,et al.  A Multi-Secret Sharing Scheme Based on the General Access Structure , 2006 .

[10]  Mohammad Sayad Haghighi,et al.  Dynamic and verifiable multi-secret sharing scheme based on Hermite interpolation and bilinear maps , 2015, IET Inf. Secur..

[11]  Christian Cachin.  On-Line Secret Sharing , 1995, IMACC.

[12]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[13]  Juan Qu,et al.  A practical dynamic multi-secret sharing scheme , 2010, 2010 IEEE International Conference on Information Theory and Information Security.

[14]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[15]  Xiaofeng Liao,et al.  Verifiable multi-secret sharing based on LFSR sequences , 2012, Theor. Comput. Sci..

[16]  Chen Wei,et al.  A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps , 2007, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007).

[17]  V. P. Binu,et al.  Secure and Efficient Secret Sharing Scheme with General Access Structures Based on Elliptic Curve and Pairing , 2017, Wirel. Pers. Commun..

[18]  Rong Zhao,et al.  A practical verifiable multi-secret sharing scheme , 2007, Comput. Stand. Interfaces.

[19]  Chin-Chen Chang,et al.  An on-line secret sharing scheme for multi-secrets , 1998, Comput. Commun..

[20]  R.G.E. Pinch,et al.  On-line multiple secret sharing , 1996 .