{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:34:52Z","timestamp":1742960092806,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319981123"},{"type":"electronic","value":"9783319981130"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98113-0_24","type":"book-chapter","created":{"date-parts":[[2018,8,2]],"date-time":"2018-08-02T12:13:46Z","timestamp":1533212026000},"page":"445-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secure Two-Party Computation over Unreliable Channels"],"prefix":"10.1007","author":[{"given":"Ran","family":"Gelles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,3]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"key":"24_CR2","unstructured":"Beaver, D.: Perfect privacy for two-party protocols. In: Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, vol. 2, pp. 65\u201377 (1991)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology \u2014 CRYPT0 95","author":"D Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97\u2013109. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_8"},{"issue":"6","key":"24_CR4","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1145\/2661628","volume":"61","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Kalai, Y.T., Naor, M.: Fast interactive coding against adversarial noise. J. ACM 61(6), 35:1\u201335:30 (2014)","journal-title":"J. ACM"},{"issue":"11","key":"24_CR5","doi-asserted-by":"publisher","first-page":"7248","DOI":"10.1109\/TIT.2014.2353994","volume":"60","author":"M Braverman","year":"2014","unstructured":"Braverman, M., Rao, A.: Toward coding for maximum errors in interactive communication. IEEE Trans. Inf. Theory 60(11), 7248\u20137255 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Pass, R., Telang, S.: Knowledge-preserving interactive coding. In: FOCS 2013, pp. 449\u2013458 (2013)","DOI":"10.1109\/FOCS.2013.55"},{"key":"24_CR9","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Hoboken (2006)","edition":"2"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: FOCS 1988, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-69053-0_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 97","author":"C Cr\u00e9peau","year":"1997","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 306\u2013317. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_21"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-24638-1_20","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2004","unstructured":"Damg\u00e5rd, I., Fehr, S., Morozov, K., Salvail, L.: Unfair noisy channels and oblivious transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 355\u2013373. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_20"},{"issue":"8","key":"24_CR13","doi-asserted-by":"publisher","first-page":"4575","DOI":"10.1109\/TIT.2016.2582176","volume":"62","author":"K Efremenko","year":"2016","unstructured":"Efremenko, K., Gelles, R., Haeupler, B.: Maximal noise in interactive communication over erasure channels and channels with feedback. IEEE Trans. Inf. Theory 62(8), 4575\u20134588 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"24_CR14","doi-asserted-by":"publisher","first-page":"6860","DOI":"10.1109\/TIT.2015.2483323","volume":"61","author":"R Gelles","year":"2015","unstructured":"Gelles, R., Sahai, A., Wadia, A.: Private interactive communication across an adversarial channel. IEEE Trans. Inf. Theory 61(12), 6860\u20136875 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132","key":"24_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000079","volume":"13","author":"R Gelles","year":"2017","unstructured":"Gelles, R.: Coding for interactive communication: a survey. Found. Trends Theor. Comput. Sci. 13(1\u20132), 1\u2013157 (2017)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/15M1052202","volume":"46","author":"R Gelles","year":"2017","unstructured":"Gelles, R., Haeupler, B.: Capacity of interactive communication over erasure channels and channels with feedback. SIAM J. Comput. 46(4), 1449\u20131472 (2017)","journal-title":"SIAM J. Comput."},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Gelles, R., Haeupler, B., Kol, G., Ron-Zewi, N., Wigderson, A.: Towards optimal deterministic coding for interactive communication. In: SODA 2016, pp. 1922\u20131936 (2016)","DOI":"10.1137\/1.9781611974331.ch135"},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1109\/TIT.2013.2294186","volume":"60","author":"R Gelles","year":"2014","unstructured":"Gelles, R., Moitra, A., Sahai, A.: Efficient coding for interactive communication. IEEE Trans. Inf. Theory 60(3), 1899\u20131913 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Gelles, R., Paskin-Cherniavsky, A., Zikas, V.: Secure two-party computation over unreliable channels. Cryptology ePrint Archive, Report 2018\/506 (2018). https:\/\/eprint.iacr.org\/2018\/506","DOI":"10.1007\/978-3-319-98113-0_24"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"24_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Volume 2, Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, New York (2004)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Interactive channel capacity revisited. In: FOCS 2014, pp. 226\u2013235 (2014)","DOI":"10.1109\/FOCS.2014.32"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-78524-8_22","volume-title":"Theory of Cryptography","author":"D Harnik","year":"2008","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393\u2013411. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_22"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Harnik","year":"2005","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On robust combiners for oblivious transfer and other primitives. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 96\u2013113. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_6"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-642-22792-9_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A., Wullschleger, J.: Constant-rate oblivious transfer from noisy channels. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 667\u2013684. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_38"},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-662-49896-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Khurana","year":"2016","unstructured":"Khurana, D., Maji, H.K., Sahai, A.: Secure computation from elastic noisy channels. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 184\u2013212. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_7"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding crytpography on oblivious transfer. In: STOC 1988, pp. 20\u201331. ACM. New York (1988)","DOI":"10.1145\/62212.62215"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Kol, G., Raz, R.: Interactive channel capacity. In: STOC 2013, pp. 715\u2013724 (2013)","DOI":"10.1145\/2488608.2488699"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E.: Privacy and communication complexity. In: FOCS 1989, pp. 416\u2013421. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63512"},{"key":"24_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-70936-7_22","volume-title":"Theory of Cryptography","author":"R Meier","year":"2007","unstructured":"Meier, R., Przydatek, B., Wullschleger, J.: Robuster combiners for oblivious transfer. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 404\u2013418. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_22"},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: STOC 2001, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"key":"24_CR33","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical report TR-81, Aiken Computation Lab, Harvard University (1981)"},{"key":"24_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"R Roth","year":"2006","unstructured":"Roth, R.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)"},{"key":"24_CR35","doi-asserted-by":"crossref","unstructured":"Schulman, L.J.: Communication on noisy channels: a coding theorem for computation. In: FOCS 1992, pp. 724\u2013733 (1992)","DOI":"10.1109\/SFCS.1992.267778"},{"issue":"6","key":"24_CR36","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/18.556671","volume":"42","author":"LJ Schulman","year":"1996","unstructured":"Schulman, L.J.: Coding for interactive communication. IEEE Trans. Inf. Theory 42(6), 1745\u20131756 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"379\u2013423","key":"24_CR37","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Tech. J. 27(379\u2013423), 623\u2013656 (1948)","journal-title":"Bell System Tech. J."},{"key":"24_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-00457-5_20","volume-title":"Theory of Cryptography","author":"J Wullschleger","year":"2009","unstructured":"Wullschleger, J.: Oblivious transfer from weak noisy channels. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 332\u2013349. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_20"},{"key":"24_CR39","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press, November 1982","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98113-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:46:46Z","timestamp":1710348406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98113-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319981123","9783319981130"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98113-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"3 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/scn.di.unisa.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}