{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T12:36:44Z","timestamp":1785242204852,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540374329","type":"print"},{"value":"9783540374336","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11818175_31","type":"book-chapter","created":{"date-parts":[[2006,9,23]],"date-time":"2006-09-23T06:21:52Z","timestamp":1158992512000},"page":"521-536","source":"Crossref","is-referenced-by-count":101,"title":["Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields"],"prefix":"10.1007","author":[{"given":"Hao","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronald","family":"Cramer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"31_CR1","first-page":"1","volume-title":"Proceedings of STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of STOC 1988, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1008226810363","volume":"11","author":"J. Bierbrauer","year":"1997","unstructured":"Bierbrauer, J.: Universal Hashing and Geometric Codes. Designs, Codes and Cryptography\u00a011, 207\u2013221 (1997)","journal-title":"Designs, Codes and Cryptography"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of National Computer Conference 1979. AFIPS Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"31_CR4","first-page":"11","volume-title":"Proceedings STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgaard, I.: Multi-party unconditionally secure protocols. In: Proceedings STOC 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"31_CR5","unstructured":"Chen, H.: Linear secret sharing from algebraic-geometric codes. Merged with [8]"},{"key":"31_CR6","unstructured":"Chen, H., Cramer, R., Ding, C., Xing, C.: Secret sharing and secure multi-party compuation from projective algebraic subsets. Work in progress"},{"key":"31_CR7","unstructured":"Chen, H., Cramer, R., Goldwasser, S., Vaikuntanathan, V., de Haan, R.: Threshold MPC in the Rabin-Ben Or broadcast model unconditionally secure against corrupt minorities based on general error correcting codes. Work in progress"},{"key":"31_CR8","unstructured":"Cramer, R.: Algebraic geometric secret sharing and secure computation over small fields. Merged with [5]"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/11535218_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Fehr, S., Stam, M.: Black-box secret sharing from primitive sets in algebraic number fields. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 344\u2013360. Springer, Heidelberg (2005)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/11535218_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Daza, V., Gracia, I., Urroz, J.J., Leander, G., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 327\u2013343. Springer, Heidelberg (2005)"},{"key":"31_CR11","unstructured":"Cramer, R., de Haan, R.: Atomic Secure Multi-Party Multiplication with Low Communication (manuscript, 2004)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-39200-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 596\u2013613. Springer, Heidelberg (2003)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45708-9_18","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Fehr, S.: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 272\u2013287. Springer, Heidelberg (2002)"},{"key":"31_CR14","first-page":"325","volume-title":"Proceedings of STOC 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damgaard, I., Dziembowski, S.: On the complexity of verifiable secret sharing and multi-party computation. In: Proceedings of STOC 2000, pp. 325\u2013334. ACM Press, New York (2000)"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 311. Springer, Heidelberg (1999)"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y., Frankel, Y.: Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM Journal of Discrete Mathematics\u00a07, 667\u2013679 (1994)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"11","key":"31_CR18","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"R.J. McEliece","year":"1979","unstructured":"McEliece, R.J., Sarvate, D.V.: On sharing secrets and Reed-Solomon codes. Comm.\u00a0of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm.\u00a0of the ACM"},{"key":"31_CR19","volume-title":"Proceedings of STOC 1992","author":"M. Franklin","year":"1992","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation. In: Proceedings of STOC 1992. ACM Press, New York (1992)"},{"key":"31_CR20","unstructured":"Fulton, W.: Algebraic Curves. Advanced Book Classics. Addission-Wesley"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A. Garc\u00eda","year":"1996","unstructured":"Garc\u00eda, A., Stichtenoth, H.: On the asymptotic behavior of some towers of function fields over finite fields. J.\u00a0Number Theory\u00a061, 248\u2013273 (1996)","journal-title":"J.\u00a0Number Theory"},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1090\/S0025-5718-99-01143-6","volume":"69","author":"G. Geer van der","year":"2000","unstructured":"van der Geer, G., van der Vlugt, M.: Tables of curves with many points. Mathematics of Computation\u00a069, 797\u2013810 (2000), See also, www.science.uva.nl\/~geer","journal-title":"Mathematics of Computation"},{"key":"31_CR23","first-page":"170","volume":"24","author":"V.D. Goppa","year":"1981","unstructured":"Goppa, V.D.: Codes on algebraic curves. Soviet Math.\u00a0Dokl.\u00a024, 170\u2013172 (1981)","journal-title":"Soviet Math.\u00a0Dokl."},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/SCT.1993.336536","volume-title":"Proceedings of the Eigth Annual Structure in Complexity Theory Conference","author":"M. Karchmer","year":"1993","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pp. 102\u2013111. IEEE, Los Alamitos (1993)"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/3-540-48405-1_38","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Rajagopalan, S., Sahai, A.: Coding constructions for blacklisting problems without computational assumptions. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 609\u2013623. Springer, Heidelberg (1999)"},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1109\/18.841168","volume":"46","author":"K.Y. Lam","year":"2000","unstructured":"Lam, K.Y., Wang, H.X., Xing, C.: Constructions of authentication codes from algebraic curves over finite fields. IEEE Transactions in Information Theory\u00a046, 886\u2013892 (2000)","journal-title":"IEEE Transactions in Information Theory"},{"key":"31_CR27","volume-title":"Algebra","author":"S. Lang","year":"1997","unstructured":"Lang, S.: Algebra. Addison-Wesley, Reading (1997)"},{"key":"31_CR28","unstructured":"van Lint, J.H.: Introduction to Coding Theory. GTM. Springer, Heidelberg"},{"key":"31_CR29","unstructured":"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\u2013279 (1993)"},{"key":"31_CR30","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography. In: Codes and Ciphers: Cryptography and Coding IV, pp. 33\u201347 (1995)"},{"key":"31_CR31","volume-title":"Topics in geometry, coding theory and cryptography","author":"H. Niederreiter","year":"2006","unstructured":"Niederreiter, H., Wang, H., Xing, C.: Function fields over finite fields and their application to cryptography. In: Garc\u00eda, A., Stichtenoth, H. (eds.) Topics in geometry, coding theory and cryptography. Springer, Heidelberg (2006)"},{"key":"31_CR32","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. ACM STOC 1989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"31_CR33","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm.\u00a0of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm.\u00a0of the ACM"},{"key":"31_CR34","unstructured":"Silverman, J.: The Arithmetic of Elliptic Curves. GTM. Springer, Heidelberg"},{"issue":"6","key":"31_CR35","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"K.W. Shum","year":"2001","unstructured":"Shum, K.W., Aleshnikov, I., Kumar, V.P., Stichtenoth, H., Deolaikar, V.: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. IT\u00a047(6), 2225\u20132241 (2001)","journal-title":"IEEE Trans. IT"},{"key":"31_CR36","volume-title":"Algebraic function fields and codes","author":"H. Stichtenoth","year":"1993","unstructured":"Stichtenoth, H.: Algebraic function fields and codes. Springer, Heidelberg (1993)"},{"key":"31_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3810-9","volume-title":"Algebraic-geometric codes","author":"M. Tsfasman","year":"1991","unstructured":"Tsfasman, M., Vladuts, S.: Algebraic-geometric codes. Kluwer Academic Publishers, Dordrecht (1991)"},{"issue":"3","key":"31_CR38","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1109\/18.669432","volume":"44","author":"S. Vladuts","year":"1998","unstructured":"Vladuts, S.: A note on authentication codes from algebraic geometry. IEEE Transactions in Information Theory\u00a044(3), 1342\u20131345 (1998)","journal-title":"IEEE Transactions in Information Theory"},{"key":"31_CR39","doi-asserted-by":"crossref","unstructured":"Xing, C.: Authentication codes and algebraic curves. In: Proceedings of the 3rd European Congress of Mathematics, Bikhauser, vol.\u00a02, pp. 239\u2013244 (2001)","DOI":"10.1007\/978-3-0348-8266-8_19"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11818175_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:12Z","timestamp":1605644172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11818175_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540374329","9783540374336"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/11818175_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}