Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight
暂无分享,去创建一个
[1] Kefei Chen,et al. Some new characters on the wire-tap channel of type II , 2005, IEEE Transactions on Information Theory.
[2] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[3] Catherine A. Meadows,et al. Security of Ramp Schemes , 1985, CRYPTO.
[4] Hao Chen,et al. Secure Computation from Random Error Correcting Codes , 2007, EUROCRYPT.
[5] G. David Forney,et al. Dimension/length profiles and trellis complexity of linear block codes , 1994, IEEE Trans. Inf. Theory.
[6] I. G. Núñez,et al. Generalized Hamming Weights for Linear Codes , 2001 .
[7] Xian-Mo Zhang,et al. Ideal Threshold Schemes from MDS Codes , 2002, ICISC.
[8] Steven W. McLaughlin,et al. MDS codes on the erasure-erasure wiretap channel , 2009, ArXiv.
[9] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[10] Adi Shamir,et al. How to share a secret , 1979, CACM.
[11] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[12] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.
[13] Nishiara Mikihiko,et al. Strongly Secure Secret Sharing Scheme with Ramp Threshold based on Shamir's Polynomial Interpolation Scheme , 2009 .
[14] Tomohiko Uyematsu,et al. Strongly-secure secret sharing based on linear codes can be characterized by generalized hamming weight , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[15] JM Jeroen Doumen,et al. Some applications of coding theory in cryptography , 2003 .
[16] G. R. Blakley,et al. Secret Sharing Schemes , 2011, Encyclopedia of Cryptography and Security.
[17] Iwan M. Duursma,et al. Coset bounds for algebraic geometric codes , 2008, Finite Fields Their Appl..
[18] Hirosuke Yamamoto,et al. Secret sharing system using (k, L, n) threshold scheme , 1986 .