Secure secret reconstruction and multi-secret sharing schemes with unconditional security

In Shamir's t, n secret sharing SS scheme, the secret s is divided into n shares by a dealer and is shared among n shareholders in such a way that any t or more than t shares can reconstruct this secret; but fewer than t shares cannot obtain any information about the secret s. In this paper, we will introduce the security problem that an adversary can obtain the secret when there are more than t participants in Shamir's secret reconstruction. A secure secret reconstruction scheme, which prevents the adversary from obtaining the secret is proposed. In our scheme, Lagrange components, which are linear combination of shares, are used to reconstruct the secret. Lagrange component can protect shares unconditionally. We show that this scheme can be extended to design a multi-secret sharing scheme. All existing multi-secret sharing schemes are based on some cryptographic assumptions, such as a secure one-way function or solving the discrete logarithm problem; but, our proposed multi-secret sharing scheme is unconditionally secure. Copyright © 2013 John Wiley & Sons, Ltd.

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

[2]  何源,et al.  A local joint fast handoff scheme in cognitive wireless mesh networks , 2014 .

[3]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

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

[5]  Jonathan Katz,et al.  Improving the round complexity of VSS in point-to-point networks , 2008, Inf. Comput..

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

[7]  L. Harn.  Efficient sharing (broadcasting) of multiple secrets , 1995 .

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

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

[10]  T.-C. Wu,et al.  (t,n) threshold verifiable multisecret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems , 1999 .

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

[12]  Martin Tompa,et al.  How to share a secret with cheaters , 1988, Journal of Cryptology.

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

[14]  Zheng Ming-hui,et al.  Improved Multi-secret Sharing Scheme Based on One-Way Function , 2014 .

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

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

[17]  Berry Schoenmakers.  Verifiable Secret Sharing , 2011, Encyclopedia of Cryptography and Security.

[18]  Y. Yeh,et al.  Dynamic Multi-Secret Sharing Scheme , 2008 .

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

[20]  Quan Zhang,et al.  A secret sharing shuffling scheme based on polynomial , 2008, 2008 International Conference on Information and Automation.

[21]  L. Harn,et al.  Comment on "Multistage secret sharing based on one-way function" , 1995 .

[22]  Chunming Tang,et al.  A New (t,n)-Threshold Secret Sharing Scheme , 2008, 2008 International Conference on Advanced Computer Theory and Engineering.

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