Comment on a Novel Non-interactive Verifiable Secret Sharing Scheme

In 2006, Jun et al presented a novel non-interactive verifiable secret sharing scheme constructed by Shamir's secret sharing scheme for secure multi-party communication protocol in distributed networks. In their scheme, the Dealer only publishes one commitment for verification. The efficiency of verification for each share doesn't fall as the augment of the threshold and the security of the verifiable secret sharing scheme is based on the intractability of computing discrete logarithm. So they demonstrated that their scheme can efficiently withstand not only the deceptive behavior between the Dealer and participants but among participants. In this paper, we analysis the security of their scheme and point out that their scheme couldn’t resist the deceptive behavior like they claimed.

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

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

[3]  Torben P. Pedersen.  Distributed Provers with Applications to Undeniable Signatures , 1991, EUROCRYPT.

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

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

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

[7]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  Indrajit Ray,et al.  An anonymous electronic voting protocol for voting over the Internet , 2001, Proceedings Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems. WECWIS 2001.

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

[10]  Jacques Stern,et al.  Sharing Decryption in the Context of Voting or Lotteries , 2000, Financial Cryptography.

[11]  Wei-Pang Yang,et al.  An improvement on the Lin-Wu (t, n) threshold verifiable multi-secret sharing scheme , 2005, Appl. Math. Comput..

[12]  Guisheng Liao,et al.  A Novel Non-interactive Verifiable Secret Sharing Scheme , 2006, 2006 International Conference on Communication Technology.

[13]  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).