Secret sharing schemes from binary linear codes

In principle, every linear code can be used to construct a secret sharing scheme. However, in general, determining the access structure of the scheme is very hard. On the other hand, finding error correcting codes that produce secret sharing schemes with efficient access structures is also difficult. In this paper, we study a set of minimal codewords for certain classes of binary linear codes, and then determine the access structure of secret sharing schemes based on these codes. Furthermore, we prove that the secret sharing schemes obtained are democratic in the sense that every participant is involved in the same number of minimal access sets.

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

[2]  Cunsheng Ding,et al.  The access structure of some secret-sharing schemes , 1996, ACISP.

[3]  Cunsheng Ding,et al.  Linear codes from perfect nonlinear mappings and their secret sharing schemes , 2005, IEEE Transactions on Information Theory.

[4]  Alexander Barg,et al.  Minimal Vectors in Linear Codes , 1998, IEEE Trans. Inf. Theory.

[5]  Yen-Ping Chu,et al.  A multiple-level visual secret-sharing scheme without image size expansion , 2007, Inf. Sci..

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

[7]  Cunsheng Ding,et al.  Secret-sharing with a class of ternary codes , 2000, Theor. Comput. Sci..

[8]  R. Schoof.  Families of curves and weight distributions of codes , 1995, math/9504222.

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

[10]  G. Lachaud,et al.  The weights of the orthogonals of the extended quadratic binary Goppa codes , 1990, IEEE Trans. Inf. Theory.

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

[12]  Robert J. McEliece,et al.  Weights of Irreducible Cyclic Codes , 1972, Inf. Control..

[13]  Nikolai L. Manev,et al.  On the Non-minimal Codewords in Binary Reed-Muller Codes , 2003, Discret. Appl. Math..

[14]  Cunsheng Ding,et al.  Secret Sharing Schemes with Nice Access Structures , 2006, Fundam. Informaticae.

[15]  Gérard D. Cohen,et al.  Variations on Minimal Codewords in Linear Codes , 1995, AAECC.

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

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

[18]  Cunsheng Ding,et al.  How to Build Robust Shared Control Systems , 1998, Des. Codes Cryptogr..

[19]  Cunsheng Ding,et al.  The Weight Distribution of Some Irreducible Cyclic Codes , 2009, IEEE Transactions on Information Theory.

[20]  Ali Aydin Selçuk,et al.  Threshold cryptography based on Asmuth-Bloom secret sharing , 2007, Inf. Sci..