论文信息 - Security analysis and improvement of two verifiable multi-secret sharing schemes

Security analysis and improvement of two verifiable multi-secret sharing schemes

Recently, some schemes about verifiable multi-secret sharing based on two-variable one-way function have been proposed. In this paper, we analyse the security of two schemes and draw a conclusion that the both schemes cannot verify whether the dealer is honest or not. We also improve these schemes to make them have the fully verifiable property.

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

[2] Ed Dawson,et al. Multistage secret sharing based on one-way function , 1994 .

[3] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[4] Keith M. Martin,et al. On Sharing Many Secrets (Extended Abstract) , 1994, ASIACRYPT.

[5] J. He,et al. Multisecret-sharing scheme based on one-way function , 1995 .

[6] Taher ElGamal,et al. A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

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

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

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

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

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

[12] Ziba Eslami,et al. A verifiable multi-secret sharing scheme based on cellular automata , 2010, Inf. Sci..