Ideal access structures based on a class of minimal linear codes

References

• N.M.G. AL-Saidi, N.A. Rajab, M.R.Md. Said, and K.A. Kadhim, Perfect secret sharing scheme based on vertex domination set, Int. J. Comput. Math. 92(9) (2015), pp. 1755–1763. doi: 10.1080/00207160.2014.941360
   Web of Science ®Google Scholar
• A. Ashikhmin and A. Barg, Minimal vectors in linear codes, IEEE Trans. Inform. Theory 44(5) (1998), pp. 2010–2017. doi: 10.1109/18.705584
   Web of Science ®Google Scholar
• A. Beimel, T. Tassa, and E. Weinreb, Characterizing ideal weighted threshold secret sharing, SIAM J. Discrete Math. 22(1) (2008), pp. 360–397. doi: 10.1137/S0895480104445654
   Web of Science ®Google Scholar
• G.R. Blakley, Safeguarding cryptographic keys, Proceedings of AFIPS National Computer Conference, New York, AFIPS Press, 1979, pp. 313–317.
   Google Scholar
• E.F. Brickell, Some ideal secret sharing schemes, Combin. Math. Combin. Comput. 434(6) (1989), pp. 105–113.
   Google Scholar
• Q. Chen, D.Y. Pei, C.M. Tang, Q. Yue, and T.K. Ji, A note on ramp secret sharing schemes from error-correcting codes, Math. Comput. Modelling 57(11–12) (2013), pp. 2695–2702. doi: 10.1016/j.mcm.2011.07.024
   Web of Science ®Google Scholar
• R.D. Cruz and H.X. Wang, Cheating-immune secret sharing schemes from codes and cumulative arrays, Cryptogr. Commun. 5(1) (2013), pp. 67–83. doi: 10.1007/s12095-012-0076-4
   Google Scholar
• C.S. Ding, Complex codebooks from combinatorial designs, IEEE Trans. Inform. Theory 52(9) (2006), pp. 4229–4235. doi: 10.1109/TIT.2006.880058
   Web of Science ®Google Scholar
• C.S. Ding, The weight distribution of some irreducible cyclic codes, IEEE Trans. Inform. Theory 55(3) (2009), pp. 955–960. doi: 10.1109/TIT.2008.2011511
   Web of Science ®Google Scholar
• C.S. Ding and J. Yang, Hamming weights in irreducible cyclic codes, Discrete Math. 313(2013), pp. 434–446. doi: 10.1016/j.disc.2012.11.009
   Web of Science ®Google Scholar
• C.S. Ding and Y. Jin, Covering and secret sharing with linear codes, Discrete Mathematics and Theoretical Computer Science: Lecture Notes in Computer Science, Springer Verlag, 2003, pp. 11–25.
   Google Scholar
• K.Q. Feng and J.Q. Luo, Weight distribution of some reducible cyclic codes, Finite Fields Appl. 14(2) (2008), pp. 390–409. doi: 10.1016/j.ffa.2007.03.003
   Web of Science ®Google Scholar
• S. Gurak, Period polynomials for Fq of fixed small degree, Number Theory (2004), pp. 127–145.
   Google Scholar
• A. Hoshi, Explicit lifts of quintic Jacobi sums and period polynomials for Fq, Proc. Japan Acad. 82(7) (2006), pp. 87–92. doi: 10.3792/pjaa.82.87
   Google Scholar
• C.-F. Hsu, Q. Cheng, X.M. Tang, and B. Zeng, An ideal multi-secret sharing scheme based on MSP, Inform. Sci. 181(7) (2011), pp. 1403–1409. doi: 10.1016/j.ins.2010.11.032
   Web of Science ®Google Scholar
• M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing any access structure, Proc. IEEE Globecom'87, 1987, pp. 99–102.
   Google Scholar
• Z.H. Li, T. Xue, and H. Lai, Secret sharing schemes from binary linear codes, Inform. Sci. 181(22) (2010), pp. 4412–4419. doi: 10.1016/j.ins.2010.07.029
   Web of Science ®Google Scholar
• J.L. Massey, Minimal codewords and secret sharing, The 6th Joint Swedish-Russian Workshop on Information Theory, 1993, pp. 276–279.
   Google Scholar
• J.L. Massey, Some Applications of Coding Theory in Cryptography, Cryptography and Coding IV, Formara Ltd, England, 1995.
   Google Scholar
• G. Myerson, Period polynomials and Gauss sums for finite field, Acta Arith. 39(3) (1981), pp. 251–264.
   Web of Science ®Google Scholar
• J. Schillewaert, L. Storme, and J.A. Thas, Minimal codewords in Reed-Muller codes, Des. Codes Cryptogr. 54(3) (2010), pp. 273–286. doi: 10.1007/s10623-009-9323-x
   Web of Science ®Google Scholar
• A. Shamir, How to share a secret, Comm. ACM 22(11) (1979), pp. 612–613. doi: 10.1145/359168.359176
   Web of Science ®Google Scholar
• A. Sharma and G.K. Bakshi, The weight distribution of some irreducible cyclic codes, Finite Fields Appl. 18(1) (2012), pp. 144–159. doi: 10.1016/j.ffa.2011.07.002
   Web of Science ®Google Scholar
• Y. Song, Z.H. Li, Y.M. Li, and J. Li, A new multi-use multi-secret sharing scheme based on the duals of minimal linear codes, Secur. Comm. Networks 8 (2015), pp. 202–211. doi: 10.1002/sec.972
   Web of Science ®Google Scholar
• F.L. Tiplea and C.C. Drǎgan, A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme, Inform. Process. Lett. 114(6) (2014), pp. 299–303. doi: 10.1016/j.ipl.2014.01.008
   Web of Science ®Google Scholar
• G. Vega and J. Wolfmann, New classes of 2-weight cyclic codes, Des. Codes Cryptogr. 42(3) (2007), pp. 327–334. doi: 10.1007/s10623-007-9038-9
   Web of Science ®Google Scholar