The Research of Secret Sharing Scheme with Configurable Threshold

Almost all secret sharing schemes run with the classic (k, n) threshold, k shares can restore the original secret but less than k shares cannot rebuild any information of the secret. And which scheme can satisfy lots a lot of applications, but it is not flexible enough. In some certain applications, this (k, n) threshold structure is not well adapted. The paper proposes a new secret sharing scheme with configurable threshold. Under the new scheme, the access structure can be set up according to our actual demands, so access structure can become very flexible and rich.

[1]  Hugo Krawczyk,et al.  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.

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

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

[4]  Sorin Iftene,et al.  Weighted Threshold RSA Based on the Chinese Remainder Theorem , 2007, Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007).

[5]  Massoud Hadian Dehkordi,et al.  New efficient and practical verifiable multi-secret sharing schemes , 2008, Inf. Sci..

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

[7]  Ioana Boureanu,et al.  Weighted Threshold Secret Sharing Based on the Chinese Remainder Theorem , 2005, Sci. Ann. Cuza Univ..

[8]  Chin-Chen Chang,et al.  A scheme for threshold multi-secret sharing , 2005, Appl. Math. Comput..

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