A verifiable secret sharing scheme without dealer in vector space

Based on the (+, +) homomorphism property of shamir's (t, n) secret sharing scheme, Harn and Lin proposed a (n, t, n) secret sharing scheme, in which each shareholder also acts as a dealer and the master secret was decided by the sub-secret of each shareholder. But this scheme is only suited to the threshold access structure. In this paper, we firstly define the (+, +) homomorphism property of secret sharing scheme in vector space. Then we extend the idea of (n, t, n) secret sharing scheme to vector space access structure, and define the secret sharing scheme without dealer in vector space and propose a verifiable secret sharing scheme without dealer in vector space based on the intractability of discrete logarithm. Compared with Harn and Lin's (n, t, n) secret sharing scheme, the proposed scheme is more general and is applied more widely since it is suited to vector space access structure.

[1]  Torben P. Pedersen.  A Threshold Cryptosystem without a Trusted Party (Extended Abstract) , 1991, EUROCRYPT.

[2]  Hung-Yu Chien,et al.  A Practical ( t , n ) Multi-Secret Sharing Scheme , 2000 .

[3]  Carles Padró.  Robust Vector Space Secret Sharing Schemes , 1998, Inf. Process. Lett..

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

[5]  Xiaoqing Tan,et al.  A New (t, n) Multi-Secret Sharing Scheme , 2008 .

[6]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Josh Benaloh,et al.  Secret sharing homomorphisms: keeping shares of a secret secret , 1987, CRYPTO 1987.

[8]  Zhenfu Cao,et al.  A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme , 2005, Appl. Math. Comput..

[9]  Min-Shiang Hwang,et al.  A (t, n) multi-secret sharing scheme , 2004, Appl. Math. Comput..

[10]  Gustavus J. Simmons,et al.  A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutualy Trusted Party , 1991, EUROCRYPT.

[11]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

[12]  Chi-Sung Laih,et al.  Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space , 1989, CRYPTO.

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

[14]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[15]  Lein Harn,et al.  Strong (n, t, n) verifiable secret sharing scheme , 2010, Inf. Sci..