Citation: | TANG Chunming, CHEN Yuenai, GAO Xuhong, “Monotone Span Program vs. Linear Code,” Chinese Journal of Electronics, vol. 25, no. 6, pp. 991-998, 2016, doi: 10.1049/cje.2016.10.025 |
G.R. Blakley, "Safeguarding cryptographic keys", Proc. of the National Computer Conference, America, pp.313-317, 1979.
|
A. Shamir, "How to share a secret", Communications of the ACM, Vol.22, No.1979, pp.612-613, 1979.
|
R.J. McEliece and D.V. Sarwate, "On sharing secrets and Reed-Solomon codes", Communications of the ACM, Vol.24, No.1981, pp.583-584, 1981.
|
J.L. Massey, "Minimal codewords and secret sharing", Proc. of the 6th Joint Swedish-Russian Workshop on Information Theory, pp.276-279, 1993.
|
J.L. Massey, "Some applications of coding theory", in Cryptography, Codes and Ciphers:Cryptography and Coding IV, Esses, England, pp.33-47, 1995.
|
J.L. Massey, "Three coding problems", Report in Trondhjemsgade 3, 2TH DK-2100 Copenhagen, Denmark, 2009.
|
C.M. Tang, S.H. Gao and C.L. Zhang, "The optimal linear secret sharing schemes for any given access structure", Journal of Systems Science & Complexity, Vol.26, No.4, pp.634-649, 2013.
|
M. Ito, A. Saito and T. Nishizeki, "Secret sharing scheme realizing any access structure", Proc. of IEEE Globecom 87, pp.99-102, 1987.
|
L. Csirmaz, "The dealer's random bits in perfect secret sharing schemes", Studia Scientiarum Mathematicarum Hungarica, Vol.32, No.3, pp.1-10, 1996.
|
M. Karchmer and A. Wigderson, "On span programes", Proc. of the 8-th Annual Structure in Complexity Theory Conference, San Diego, CA, USA, pp.102-111, 1993.
|
R. Cramer, I. Damgard and U. Maurer, "General secure multiparty computationfrom any linear secret-sharing scheme", Advances in Cryptology-EUROCRYPT 2000 Lecture Notes in Computer Science, Vol.1807, No.2000, pp.316-334, 2000.
|
A. Beimel, A. Gal and M. Paterson, "Lower bounds for monotone span programs", Computational Complexity, Vol.6, No.1, pp.29-45, 1996.
|
L. Babai, A. Gal and A. Wigderson, "Superpolynomial lower bounds for monotone span programs", Combinatorica, Vol.19, No.3, pp.301-319, 1999.
|
A. Gal, "Combinatorial methods in boolean functions complexity", Ph.D. Thesis, University of Illinois at Chicago, USA, 1995.
|
A. Gal, "A characterization of span program size an improved lower bounds for monotone span programs", Computational Complexity, Vol.10, No.4, pp.277-296, 2001.
|
V. Nikov, S. Nikova and B. Preneel, "On the size of monotone span programs", Security in Communication Networks, Lecture Notes in Computer Science Vol.3352, No.2005, pp.249-262, 2005.
|
R. Cramer and S. Fehr, "Optimal blach-box secret sharing over arbitrary abelian groups", Advances in Cryptology CRYPTO 2002, Lecture Notes in Computer Science, Vol.2442, No.2002, pp.272-287, 2002
|
M. Dijk, "Secret key sharing and secret key generation", Ph.D. Thesis, TU Eindhoven, Netherlands, 1997.
|