An ideal multi-secret sharing scheme based on minimal privileged coalitions

How to construct an ideal multi-secret sharing scheme for general access structures is difficult. In this paper, we solve an open problem proposed by Spiez et al.recently [Finite Fields and Their Application, 2011(17) 329-342], namely to design an algorithm of privileged coalitions of any length if such coalitions exist. Furthermore, in terms of privileged coalitions, we show that most of the existing multi-secret sharing schemes based on Shamir threshold secret sharing are not perfect by analyzing Yang et al.'s scheme and Pang et al.'s scheme. Finally, based on the algorithm mentioned above, we devise an ideal multi-secret sharing scheme for families of access structures, which possesses more vivid authorized sets than that of the threshold scheme.

[1]  Giovanni Di Crescenzo,et al.  Hypergraph Decomposition and Secret Sharing , 2003, ISAAC.

[2]  Xiaoqing Tan,et al.  A New (t, n) Multi-Secret Sharing Scheme , 2008 .

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

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

[5]  William H. Offenhauser,et al.  Wild Boars as Hosts of Human-Pathogenic Anaplasma phagocytophilum Variants , 2012, Emerging infectious diseases.

[6]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .

[7]  Stanislaw Spiez,et al.  Non-admissible tracks in Shamirʼs scheme , 2011, Finite Fields Their Appl..

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

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

[10]  Liangliang Xiao,et al.  Linear multi-secret sharing schemes based on multi-party computation , 2006, Finite Fields Their Appl..

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

[12]  Avishek Adhikari,et al.  An efficient multi-use multi-secret sharing scheme based on hash function , 2010, Appl. Math. Lett..

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

[14]  Yi Mu,et al.  Certificateless threshold signature scheme from bilinear maps , 2010, Inf. Sci..

[15]  Shuhong Gao,et al.  Leakproof secret sharing protocols with applications to group identification scheme , 2012, Science China Information Sciences.

[16]  Zhihui Li,et al.  Secret sharing schemes from binary linear codes , 2010, Inf. Sci..

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

[18]  Stanislaw Spiez,et al.  Admissible tracks in Shamir's scheme , 2010, Finite Fields Their Appl..

[19]  Keith M. Martin,et al.  Ideal secret sharing schemes with multiple secrets , 1996, Journal of Cryptology.

[20]  Subhash C. Kak,et al.  Space efficient secret sharing for implicit data security , 2011, Inf. Sci..

[21]  Carlo Blundo,et al.  * Multi-Secret Sharing Schemes EXTENDED ABSTRACT , 1994 .

[22]  Cunsheng Ding,et al.  Secret sharing schemes from three classes of linear codes , 2006, IEEE Transactions on Information Theory.