Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5677 LNCS, Issue , 2009, Pages 466-486

  Cascudo, Ignacio ^a   Chen, Hao ^b   Cramer, Ronald ^c,d   Xing, Chaoping ^e  

^a UNIVERSITY OF OVIEDO   (Spain)

^b EAST CHINA NORMAL UNIVERSITY   (China)

^c CWI   (Netherlands)

^d LEIDEN UNIVERSITY   (Netherlands)

^e NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC GEOMETRY; DESCENT METHOD; FINITE FIELDS; IDEAL SCHEMES; LOWER BOUNDS; MATHEMATICAL PRIMITIVE; SECRET SHARING; SECRET SHARING SCHEMES; SECURE MULTI-PARTY COMPUTATION; SPECIAL CLASS; UPPER BOUND;

ALGEBRA; CONTROL THEORY; CRYPTOGRAPHY; GEOMETRY; MODEL PREDICTIVE CONTROL; PREDICTIVE CONTROL SYSTEMS;

ASYMPTOTIC ANALYSIS;

EID: 70350343371     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03356-8_28     Document Type: Conference Paper

References (29)

1. Bassa, A., Garcia, A., Stichtenoth, H.: A new tower over cubic finite fields. Moscow Mathematical Journal 8(3), 401-418 (2008)
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: Proceedings of STOC 1988, pp. 1-10. ACM Press, New York (1988)
3. Chaum, D., Crépeau, C., Damgaard, I.: Multi-party unconditionally secure protocols. In: Proceedings of STOC 1988, pp. 11-19. ACM Press, New York (1988)
4. Chudnovsky, D.V., Chudnovsky, G.V.: Algebraic complexities and algebraic curves over finite fields. Proceedings of the National Academy of Sciences of the United States of America 84(7), 1739-1743 (1987)
5. Cascudo, I., Cramer, R., Xing, C.: Ongoing work (2009)
6. Chen, H., Cramer, R., de Haan, R., Cascudo Pueyo, I.: Strongly multiplicative ramp schemes from high degree rational points on curves. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 451-470. Springer, Heidelberg (2008)
7. Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure Computation from Random Error Correcting Codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291-310. Springer, Heidelberg (2007)
8. Chen, H., Cramer, R.: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computation over Small Fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521-536. Springer, Heidelberg (2006)
9. Cramer, R., Daza, V., Gracia, I., Jimenez Urroz, J., Leander, G., Martí-Farré, J., Padró, C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 327-343. Springer, Heidelberg (2005)
10. Cramer, R., Fehr, S., Stam, M.: Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. In: Shoup, V. (ed.) CRYPTO 2005, vol. 3621, pp. 344-360. Springer, Heidelberg (2005)
11. Cramer, R., Fehr, S.: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 272-287. Springer, Heidelberg (2002)
12. Cramer, R., Damgaard, I., Dziembowski, S.: On the complexity of verifiable secret sharing and multi-party computation. In: Proceedings of STOC 2000, pp. 325-334. ACM Press, New York (2000)
13. Cramer, R., Damgaard, I., Maurer, U.: General secure multi-party computation from any linear secret sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316-334. Springer, Heidelberg (2000)
14. Damgaard, I., Buus Nielsen, J., Wichs, D.: Isolated Proofs of Knowledge and Isolated Zero Knowledge. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 509-526. Springer, Heidelberg (2008)
15. García, A., Stichtenoth, H.: On the asymptotic behavior of some towers of function fields over finite fields. J. Number Theory 61, 248-273 (1996)
16. Goppa, V.D.: Codes on algebraic curves. Soviet Math. Dokl. 24, 170-172 (1981)
17. Huffman, W.G., Pless, V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003)
18. Ihara, Y.: Some remarks on the number of rational points of algebraic curves over finite fields. J. Fac. Sci. Tokyo 28(3), 721-724 (1981)
19. Ishai, Y., Prabhakaran, M., Sahai, A.: Founding Cryptography on Oblivious Transfer-Efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572-591. Springer, Heidelberg (2008)
20. Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of 39th STOC, San Diego, Ca, USA, pp. 21-30 (2007)
21. Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pp. 102-111. IEEE, Los Alamitos (1993)
22. van Lint, J.H.: Introduction to Coding Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1999)
23. Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6-th Joint Swedish-Russian Workshop on Information Theory, Molle, Sweden, August 1993, pp. 269-279 (1993)
24. Massey, J.L.: Some applications of coding theory in cryptography. In: Codes and Ciphers: Cryptography and Coding IV, pp. 33-47 (1995)
25. Serre, J.-P.: Rational points on curves over finite fields notes of lectures at Harvard University (1985)
26. Shamir, A.: How to share a secret. Comm. of the ACM 22(11), 612-613 (1979)
27. Stichtenoth, H.: Algebraic function fields and codes. Springer, Heidelberg (1993)
28. Shparlinski, I., Tsfasman, M., Vladuts, S.: Curves with many points and multiplication in finite fields. In: Coding Theory and Algebraic Geometry, pp. 145-169. Springer, Heidelberg (1992)
29. Tsfasman, M., Vladuts, S., Nogin, D.: Algebraic-geometric codes: Basic Notions. AMS, Mathematical Surveys and Monographs, vol. 139 (2007)