{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:55:32Z","timestamp":1773158132368,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319121598","type":"print"},{"value":"9783319121604","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12160-4_3","type":"book-chapter","created":{"date-parts":[[2014,10,18]],"date-time":"2014-10-18T11:14:47Z","timestamp":1413630887000},"page":"34-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Towards Secure Two-Party Computation from the Wire-Tap Channel"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Chabanne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Patey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,19]]},"reference":[{"issue":"5","key":"3_CR1","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"AE Ashikhmin","year":"1998","unstructured":"Ashikhmin, A.E., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR2","first-page":"181","volume":"18","author":"A Bonisoli","year":"1984","unstructured":"Bonisoli, A.: Every equidistant linear code is a sequence of dual hamming codes. Ars Comb. 18, 181\u2013186 (1984)","journal-title":"Ars Comb."},{"issue":"6","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1109\/18.556673","volume":"42","author":"G Brassard","year":"1996","unstructured":"Brassard, G., Cr\u00e9peau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Trans. Inf. Theory 42(6), 1769\u20131780 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Patey, A.: SHADE: Secure HAmming DistancE computation from oblivious transfer. In: Workshop on Applied Homomorphic Cryptography (WAHC) (2013)","DOI":"10.1007\/978-3-642-41320-9_11"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-45239-0_6","volume-title":"Cryptography and Coding","author":"GD Cohen","year":"2013","unstructured":"Cohen, G.D., Mesnager, S., Patey, A.: On minimal and quasi-minimal linear codes. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 85\u201398. Springer, Heidelberg (2013)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(85)90190-6","volume":"56","author":"GD Cohen","year":"1985","unstructured":"Cohen, G.D., Lempel, A.: Linear intersecting codes. Discret. Math. 56(1), 35\u201343 (1985)","journal-title":"Discret. Math."},{"issue":"6","key":"3_CR7","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1109\/18.340487","volume":"40","author":"GD Cohen","year":"1994","unstructured":"Cohen, G.D., Litsyn, S., Z\u00e9mor, G.: Upper bounds on generalized distances. IEEE Trans. Inf. Theory 40(6), 2090\u20132092 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/18.340462","volume":"40","author":"GD Cohen","year":"1994","unstructured":"Cohen, G.D., Z\u00e9mor, G.: Intersecting codes and independent families. IEEE Trans. Inf. Theory 40(6), 1872\u20131881 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR9","unstructured":"Cramer, R., Damgard, I., Nielsen, J.B.: Secure multiparty computation and secret sharing - an information theoretic approach, Book Draft (2012)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45066-1_2","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"C Ding","year":"2003","unstructured":"Ding, C., Yuan, J.: Covering and secret sharing with linear codes. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 11\u201325. Springer, Heidelberg (2003)"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1109\/18.761275","volume":"45","author":"SB Encheva","year":"1999","unstructured":"Encheva, S.B., Cohen, G.D.: Constructions of intersecting codes. IEEE Trans. Inf. Theory 45(4), 1234\u20131237 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR12","unstructured":"Goldreich, O.: The Foundations of Cryptography - vol. 2, Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"3_CR13","unstructured":"Guo, Y., Li, Z., Lai, H.: A novel dynamic and verifiable secret sharing scheme based on linear codes. J. Shaanxi Normal Univ. (Nat. Sci. Ed.), 4, 013 (2010)"},{"key":"3_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols. Springer, Heidelberg (2010)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of Yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"3_CR16","unstructured":"Lipmaa, H.: Oblivious transfer or private information retrieval. http:\/\/www.cs.ut.ee\/~lipmaa\/crypto\/link\/protocols\/oblivious.php"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-39757-4_5","volume-title":"Advances in Cryptology","author":"LH Ozarow","year":"1985","unstructured":"Ozarow, L.H., Wyner, A.D.: Wire-tap channel II. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 33\u201350. Springer, Heidelberg (1985)"},{"key":"3_CR18","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical report TR-81, Aiken Computation Lab, Harvard University (1981)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-14423-3_16","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"A-R Sadeghi","year":"2010","unstructured":"Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: Efficient privacy-preserving face recognition. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 229\u2013244. Springer, Heidelberg (2010)"},{"key":"3_CR20","volume-title":"Engineering Secure Two-Party Computation Protocols - Design, Optimization, and Applications of Efficient Secure Function Evaluation","author":"T Schneider","year":"2012","unstructured":"Schneider, T.: Engineering Secure Two-Party Computation Protocols - Design, Optimization, and Applications of Efficient Secure Function Evaluation. Springer, Heidelberg (2012)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jcd.3180010106","volume":"1","author":"NJA Sloane","year":"1993","unstructured":"Sloane, N.J.A.: Covering arrays and intersecting codes. J. Comb. Des. 1, 51\u201363 (1993)","journal-title":"J. Comb. Des."},{"key":"3_CR22","unstructured":"Song, Y., Li, Z.: Secret sharing with a class of minimal linear codes. CoRR, abs\/1202.4058 (2012)"},{"issue":"5","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"VK-W Wei","year":"1991","unstructured":"Wei, V.K.-W.: Generalized hamming weights for linear codes. IEEE Trans. Inf. Theory 37(5), 1412\u20131418 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355\u20131387 (1975)","journal-title":"Bell Syst. Tech. J."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology -- ICISC 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12160-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T14:44:43Z","timestamp":1676904283000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12160-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319121598","9783319121604"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12160-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"19 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}