Ideal access structures based on a class of minimal linear codes

Coding theory is one of ways to construct ideal access structures. However, in general, determining the ideal access structures of the secret sharing schemes based on linear codes is very hard. According to the concept of minimal liner codes we proposed, this paper concentrates on irreducible cyclic codes and constructs the ideal access structures of the schemes based on the duals of minimal irreducible cyclic codes. In order to study the conditions whether several types of irreducible cyclic codes are minimal, we investigate the weight enumerators of certain irreducible cyclic codes by means of cyclotomic classes and Gaussian periods. On the basis of our aforementioned studies, we obtain ideal access structures and show the corresponding examples through programming.

[1]  Qi Cheng,et al.  An ideal multi-secret sharing scheme based on MSP , 2011, Inf. Sci..

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

[3]  Leo Storme,et al.  Minimal codewords in Reed–Muller codes , 2010, Des. Codes Cryptogr..

[4]  Akinari Hoshi Explicit lifts of quintic Jacobi sums and period polynomials for $\mathbf {F}_{ {q}}$ , 2006 .

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

[6]  Cunsheng Ding,et al.  Complex Codebooks From Combinatorial Designs , 2006, IEEE Transactions on Information Theory.

[7]  Stanley Gurak Period polynomials for _{} of fixed small degree , 2004 .

[8]  Keqin Feng,et al.  Weight distribution of some reducible cyclic codes , 2008, Finite Fields Their Appl..

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

[10]  Tamir Tassa,et al.  Characterizing Ideal Weighted Threshold Secret Sharing , 2008, SIAM J. Discret. Math..

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

[12]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[13]  Nadia M. G. Al-Saidi,et al.  Perfect secret sharing scheme based on vertex domination set , 2015, Int. J. Comput. Math..

[14]  JM Jeroen Doumen,et al.  Some applications of coding theory in cryptography , 2003 .

[15]  Ernest F. Brickell,et al.  Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

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

[17]  Gerardo Vega,et al.  New classes of 2-weight cyclic codes , 2007, Des. Codes Cryptogr..

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

[19]  Cunsheng Ding,et al.  Hamming weights in irreducible cyclic codes , 2011, Discret. Math..

[20]  Ferucio Laurentiu Tiplea,et al.  A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme , 2014, Inf. Process. Lett..

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

[22]  Zhihui Li,et al.  A new multi-use multi-secret sharing scheme based on the duals of minimal linear codes , 2015, Secur. Commun. Networks.

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

[24]  Akinari Hoshi Explicit lifts of quintic Jacobi sums and period polynomials for Fq , 2006 .

[25]  G. Myerson Period polynomials and Gauss sums for finite fields , 1981 .