Multiplicative secret sharing schemes from Reed-Muller type codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 264-268

  Duursma, Iwan ^a   Shen, Jiashun ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Linear secret sharing scheme; Reed Muller code

Indexed keywords

ADDITIONAL STRUCTURES; ALGEBRAIC STRUCTURES; BINARY FIELDS; BUILDING BLOCKES; EFFICIENT IMPLEMENTATION; GENERAL CLASS; LINEAR CODES; MULTI-PARTY COMPUTATION PROTOCOLS; MULTIPARTY COMPUTATION; PARITY CHECK MATRICES; REED-MULLER; REED-MULLER CODES; SECRET SHARING; SECRET SHARING SCHEMES;

FORWARD ERROR CORRECTION; MATRIX ALGEBRA;

INFORMATION THEORY;

EID: 84867553732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283999     Document Type: Conference Paper

References (9)

1. A. Shamir, "How to share a secret," Comm. ACM, vol. 22, no. 11, pp. 612-613, 1979.
2. R. Cramer, V. Daza, I. Gracia, J. Jiménez Urroz, G. Leander, J. Martí-Farré, and C. Padró, "On codes, matroids, and secure multiparty computation from linear secret-sharing schemes," IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2644-2657, 2008.
3. I. Cascudo, H. Chen, R. Cramer, and C. Xing, "Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field," in Advances in cryptology - CRYPTO 2009, ser. Lecture Notes in Comput. Sci. Berlin: Springer, 2009, vol. 5677, pp. 466-486.
4. R. Cramer, "The arithmetic codex: Theory and applications," in Advances in Cryptology EUROCRYPT 2011, ser. Lecture Notes in Computer Science, K. Paterson, Ed. Springer Berlin / Heidelberg, 2011, vol. 6632, pp. 1-1.
5. H. Chen and R. Cramer, "Algebraic geometric secret sharing schemes and secure multi-party computations over small fields," in Advances in cryptology - CRYPTO 2006, ser. Lecture Notes in Comput. Sci. Berlin: Springer, 2006, vol. 4117, pp. 521-536.
6. I. M. Duursma and R. Pellikaan, "A symmetric Roos bound for linear codes," J. Combin. Theory Ser. A, vol. 113, no. 8, pp. 1677-1688, 2006.
7. E. Arikan, "Channel polarization: a method for constructing capacityachieving codes for symmetric binary-input memoryless channels," IEEE Trans. Inform. Theory, vol. 55, no. 7, pp. 3051-3073, 2009.
8. S. B. Korada, E. Şaşoǧlu, and R. Urbanke, "Polar codes: characterization of exponent, bounds, and constructions," IEEE Trans. Inform. Theory, vol. 56, no. 12, pp. 6253-6264, 2010.
9. I. M. Duursma, "Algebraic geometry codes: general theory," in Advances in Algebraic Geometry Codes, ser. Series on Coding Theory and Cryptography, C. M. E. Martinez-Moro and D. Ruano, Eds. World Scientific, 2008.