{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T08:04:11Z","timestamp":1791273851436,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725398","type":"print"},{"value":"9783540725404","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72540-4_17","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:59:46Z","timestamp":1182527986000},"page":"291-310","source":"Crossref","is-referenced-by-count":83,"title":["Secure Computation from Random Error Correcting Codes"],"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"}]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robbert","family":"de Haan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (1992)"},{"key":"17_CR2","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":"17_CR3","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of National Computer Conference \u201979. AFIPS Proceedings, vol.\u00a048, pp. 313\u2013317 (1979)"},{"key":"17_CR4","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 1984. LNCS, vol.\u00a0196, pp. 242\u2013268. Springer, Heidelberg (1985)"},{"key":"17_CR5","first-page":"11","volume-title":"Proceedings of STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgaard, I.: Multi-party unconditionally secure protocols. In: Proceedings of STOC 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H. Chen","year":"2006","unstructured":"Chen, H., Cramer, R.J.F.: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 521\u2013536. Springer, Heidelberg (2006)"},{"key":"17_CR7","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.J.F. Cramer","year":"2007","unstructured":"Cramer, R.J.F., Damg\u00e5rd, I.B., 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":"17_CR8","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":"17_CR9","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.J.F. Cramer","year":"1999","unstructured":"Cramer, R.J.F., 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, pp. 311\u2013326. Springer, Heidelberg (1999)"},{"key":"17_CR10","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.J.F. Cramer","year":"2000","unstructured":"Cramer, R.J.F., 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":"17_CR11","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.J.F. Cramer","year":"2005","unstructured":"Cramer, R.J.F., 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":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-44647-8_30","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.J.F. Cramer","year":"2001","unstructured":"Cramer, R.J.F., Damg\u00e5rd, I.B., Fehr, S.: On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 503\u2013523. Springer, Heidelberg (2001)"},{"key":"17_CR13","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":"17_CR14","unstructured":"Gaborit, P., Otmani, A.: Experimental constructions of self-dual codes. Manuscript (2002), Available from \n                  \n                    http:\/\/www.unilim.fr\/pages_perso\/philippe.gaborit\/SD\/"},{"key":"17_CR15","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":"17_CR16","first-page":"218","volume-title":"Proceedings of STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game. In: Proceedings of STOC 1987, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"17_CR17","first-page":"170","volume":"24","author":"V.D. Goppa","year":"1981","unstructured":"Goppa, V.D.: Codes on algebraic curves. Soviet Math. Dokl.\u00a024, 170\u2013172 (1981)","journal-title":"Soviet Math. Dokl."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/SCT.1993.336536","volume-title":"Proceedings of the Eight Annual Structure in Complexity Theory Conference","author":"M. Karchmer","year":"1993","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eight Annual Structure in Complexity Theory Conference, pp. 102\u2013111. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-48285-7_11","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"K. Kurosawa","year":"1994","unstructured":"Kurosawa, K., Okada, K., Sakano, K., Ogata, W., Tsujii, S.: Nonperfect Secret Sharing Schemes and Matroids. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 126\u2013141. Springer, Heidelberg (1994)"},{"key":"17_CR20","volume-title":"Algebra","author":"S. Lang","year":"1997","unstructured":"Lang, S.: Algebra. Addison-Wesley, Reading (1997)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0012-365X(72)90030-1","volume":"3","author":"F.J. MacWilliams","year":"1972","unstructured":"MacWilliams, F.J., Sloane, N.J.A., Thompson, J.G.: Good self-dual codes exist. Discrete Math.\u00a03, 153\u2013162 (1972)","journal-title":"Discrete Math."},{"key":"17_CR22","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":"17_CR23","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography. In: Codes and Ciphers: Cryptography and Coding IV, pp. 33\u201347 (1995)"},{"issue":"8","key":"17_CR24","first-page":"690","volume":"4","author":"W. Ogata","year":"1998","unstructured":"Ogata, W., Kurosawa, K.: Some Basic Properties of General Nonperfect Secret Sharing Schemes. J. UCS\u00a04(8), 690\u2013704 (1998)","journal-title":"J. UCS"},{"key":"17_CR25","doi-asserted-by":"crossref","first-page":"2135","DOI":"10.1002\/j.1538-7305.1984.tb00072.x","volume":"63","author":"L.H. Ozarow","year":"1984","unstructured":"Ozarow, L.H., Wyner, A.D.: Wire-tap-channel II. AT&T Bell Labs Tech. J.\u00a063, 2135\u20132157 (1984)","journal-title":"AT&T Bell Labs Tech. J."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of ACM STOC 1989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"17_CR27","unstructured":"Rains, E.M., Sloane, N.J.A.: Self-Dual Codes. A long survey article written for the Handbook of Coding Theory (1998), Available from \n                  \n                    http:\/\/www.research.att.com\/~njas\/"},{"issue":"11","key":"17_CR28","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":"17_CR29","first-page":"449","volume":"29","author":"J.G. Thompson","year":"1973","unstructured":"Thompson, J.G.: Weighted averages associated to some codes. Scripta Math.\u00a029, 449\u2013452 (1973)","journal-title":"Scripta Math."},{"key":"17_CR30","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","volume-title":"Introduction to Coding Theory","author":"J.H. Lint van","year":"1999","unstructured":"van Lint, J.H.: Introduction to Coding Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1999)"},{"issue":"5","key":"17_CR31","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"V.K. Wei","year":"1991","unstructured":"Wei, V.K.: Generalized Hamming Weights for Linear Codes. IEEE Transactions on Information Theory\u00a037(5), 1412\u20131418 (1991)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72540-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:37:58Z","timestamp":1550385478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72540-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725398","9783540725404"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72540-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}