A new multi-use multi-secret sharing scheme based on the duals of minimal linear codes

There are several methods to construct multi-secret sharing schemes, one of which is based on coding theory. Generally, however, it is very hard to determine the minimal access structures of the schemes based on linear codes. In this paper, we first propose the concept of minimal linear codes so as to make it easier to determine the access structures of the schemes based on the duals of minimal linear codes. It is proved that the shortening codes of minimal linear codes are also minimal ones. Then we present the algorithm to determine whether a class of linear codes are minimal. On the basis of our aforementioned studies, we further devise a new multi-use multi-secret sharing scheme based on the dual code of a minimal linear code, where each participant has to carry only one share. Furthermore, we study the minimal access structures of the multi-secret sharing scheme and present specific examples through programming. Copyright © 2014 John Wiley & Sons, Ltd.

[1]  Gábor Tardos,et al.  On-line secret sharing , 2012, Des. Codes Cryptogr..

[2]  Huaxiong Wang,et al.  Cheating-immune secret sharing schemes from codes and cumulative arrays , 2012, Cryptography and Communications.

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

[4]  Xiaofeng Liao,et al.  Verifiable multi-secret sharing based on LFSR sequences , 2012, Theor. Comput. Sci..

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

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

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

[8]  Cunsheng Ding,et al.  Covering and Secret Sharing with Linear Codes , 2003, DMTCS.

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

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

[11]  Chunming Tang,et al.  A note on ramp secret sharing schemes from error-correcting codes , 2013, Math. Comput. Model..

[12]  Giovanni Di Crescenzo,et al.  Multi-Secret Sharing Schemes , 1994, CRYPTO.

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

[14]  Rita Vincenti,et al.  Three-level secret sharing schemes from the twisted cubic , 2010, Discret. Math..

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

[16]  Lein Harn,et al.  Secure secret reconstruction and multi-secret sharing schemes with unconditional security , 2014, Secur. Commun. Networks.

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

[18]  J. Massey Some Applications of Coding Theory in Cryptography , 1999 .

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

[20]  Germán Sáez,et al.  New results and applications for multi-secret sharing schemes , 2014, Des. Codes Cryptogr..

[21]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

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