{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:30Z","timestamp":1772283690959,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540789666","type":"print"},{"value":"9783540789673","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78967-3_26","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T00:11:30Z","timestamp":1207267890000},"page":"451-470","source":"Crossref","is-referenced-by-count":17,"title":["Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves"],"prefix":"10.1007","author":[{"given":"Hao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Cramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robbert","family":"de Haan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio Cascudo","family":"Pueyo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Advances in Cryptology","author":"G.R. Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1985. LNCS, vol.\u00a0196, pp. 242\u2013268. Springer, Heidelberg (1985)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H. Chen","year":"2006","unstructured":"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.\u00a04117, pp. 516\u2013531. Springer, Heidelberg (2006)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H. Chen","year":"2007","unstructured":"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.\u00a04515, pp. 291\u2013310. Springer, Heidelberg (2007)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-72540-4_19","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R. Cramer","year":"2007","unstructured":"Cramer, R., Damgaard, I., de Haan, R.: Atomic secure multi-party multiplication with low communication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 329\u2013346. Springer, Heidelberg (2007)"},{"key":"26_CR5","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., Damgaard, I., Maurer, U.: 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":"26_CR6","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., Jim\u00e9nez Urroz, 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":"26_CR7","first-page":"699","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, pp. 699\u2013710. ACM Press, New York (1992)"},{"key":"26_CR8","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. Number Theory\u00a061, 248\u2013273 (1996)","journal-title":"J. Number Theory"},{"key":"26_CR9","first-page":"21","volume-title":"Proceedings of STOC 2007","author":"Y. Ishai","year":"2007","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of STOC 2007, pp. 21\u201330. ACM Press, New York (2007)"},{"issue":"11","key":"26_CR10","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. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"26_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3810-9","volume-title":"Algebraic-Geometric Codes","author":"M.A. Tsfasman","year":"1991","unstructured":"Tsfasman, M.A., Vl\u01cedu\u0163, S.G.: Algebraic-Geometric Codes. Kluwer, Dordrecht (1991)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78967-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T11:55:26Z","timestamp":1551441326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78967-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540789666","9783540789673"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78967-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}