Dynamic and verifiable multi-secret sharing scheme based on Hermite interpolation and bilinear maps

(t, n) threshold secret sharing is a cryptographic mechanism to divide and disseminate information among n participants in a way that at least t(t ≤ n) of them should be present for the original data to be retrieved. This has practical applications in the protection of secure information against loss, destruction and theft. In this study, the authors propose a new multi-secret sharing scheme which is based on Hermite interpolation polynomials. Using the properties of discrete logarithm over elliptic curves and bilinear maps, they have created a verifiable scheme in which there is no need for a secure channel and every participant chooses their own share. This feature does not let the dealer cheat. The proposed method is dynamic to the changes in the number and value of the secrets as well as the threshold. In addition, it has the multi-use property which reduces the cost of secret distribution in multiple rounds of operation. The public values used in the proposed scheme are less than those of schemes providing similar features and the computations are also less complex. At the end of this study, they have compared the author's scheme with the similar ones against a comprehensive set of key features used in secret sharing.

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

[2]  Ernest F. Brickell,et al.  On the classification of ideal secret sharing schemes , 1989, Journal of Cryptology.

[3]  Wang Aimin,et al.  A multi-secret sharing scheme with general access structures based on elliptic curve , 2010, 2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE).

[4]  Hyang-Sook Lee.  A self-pairing map and its applications to cryptography , 2004, Appl. Math. Comput..

[5]  N. Koblitz.  Introduction to Elliptic Curves and Modular Forms , 1984 .

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

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

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

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

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

[11]  Chin-Ling Chen,et al.  The design of a secure anonymous Internet voting system , 2004, Comput. Secur..

[12]  Ziba Eslami,et al.  A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps , 2012, Wirel. Pers. Commun..

[13]  Shiuh-Jeng Wang,et al.  Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC , 2011, Wirel. Pers. Commun..

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

[15]  Yu-Min Wang,et al.  A New (t, n) Multi-Secret Sharing Scheme , 2005, 2008 International Conference on Computer and Electrical Engineering.

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

[17]  Jianzhong Zhang,et al.  A Secure and Efficient (t, n) Threshold Verifiable Multi-secret Sharing Scheme , 2005, CIS.

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

[19]  L. Washington.  Elliptic Curves: Number Theory and Cryptography , 2003 .

[20]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[21]  Massoud Hadian Dehkordi,et al.  An efficient threshold verifiable multi-secret sharing , 2008, Comput. Stand. Interfaces.

[22]  G. Szegő.  Zeros of orthogonal polynomials , 1939 .

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

[24]  Feng Wang,et al.  A secret sharing scheme based on Near-MDS codes , 2009, 2009 IEEE International Conference on Network Infrastructure and Digital Content.