{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:19:44Z","timestamp":1762298384759,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":57,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662498958"},{"type":"electronic","value":"9783662498965"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-3-662-49896-5_7","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T04:45:32Z","timestamp":1461732332000},"page":"184-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Secure Computation from Elastic Noisy Channels"],"prefix":"10.1007","author":[{"given":"Dakshita","family":"Khurana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes. In: Kschischang, F.R., Yang, E. (eds.) 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 6\u201311 July 2008, pp. 1173\u20131177. IEEE (2008). http:\/\/dx.doi.org\/10.1109\/ISIT.2008.4595172","DOI":"10.1109\/ISIT.2008.4595172"},{"issue":"7","key":"7_CR2","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theor. 55(7), 3051\u20133073 (2009). http:\/\/dx.doi.org\/10.1109\/TIT.2009.2021379","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR3","unstructured":"Beaver, D.: Perfect privacy for two-party protocols. In: Feigenbaum, J., Merritt, M. (eds.) Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, vol. 2, pp. 65\u201377. American Mathematical Society (1989)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO 1999","author":"A Beimel","year":"1999","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M.J. (ed.) Advances in Cryptology - CRYPTO 1999. LNCS, vol. 1666, pp. 80\u201397. Springer, Heidelberg (1999)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM 15th Conference on Computer and Communications Security, CCS 2008, pp. 257\u2013266. ACM Press, Alexandria (27\u201331 October 2008)","DOI":"10.1145\/1455770.1455804"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM Press, Chicago (2\u20134 May 1988)","DOI":"10.1145\/62212.62213"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-002-0146-4","volume":"16","author":"G Brassard","year":"2003","unstructured":"Brassard, G., Cr\u00e9peau, C., Wolf, S.: Oblivious transfers and privacy amplification. J. Cryptol. 16(4), 219\u2013237 (2003). http:\/\/dx.doi.org\/10.1007\/s00145-002-0146-4","journal-title":"J. Cryptol."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0054139","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"C Cachin","year":"1998","unstructured":"Cachin, C.: On the foundations of oblivious transfer. In: Nyberg, K. (ed.) Advances in Cryptology - EUROCRYPT 1998. LNCS, vol. 1403, pp. 361\u2013374. Springer, Heidelberg (1998)"},{"key":"7_CR9","unstructured":"Calabro, C.: The exponential complexity of satisfiability problems. Ph.D. thesis (2009). http:\/\/www.escholarship.org\/uc\/item\/0pk5w64k"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing, pp. 494\u2013503. ACM Press, Montr\u00e9al (19\u201321 May 2002)","DOI":"10.1145\/509907.509980"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/978-3-540-78967-3_31","volume-title":"Advances in Cryptology - EUROCRYPPT","author":"N Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New constructions for UC secure computation using Tamper-proof hardware. In: Smart, N.P. (ed.) EUROCRYPPT 2008. LNCS, vol. 4965, pp. 545\u2013562. Springer, Heidelberg (2008)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, pp. 11\u201319. ACM Press, Chicago (2\u20134 May 1988)","DOI":"10.1145\/62212.62214"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(79)90084-0","volume":"25","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: The tail of the hypergeometric distribution. Discrete Math. 25(3), 285\u2013287 (1979). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X79900840","journal-title":"Discrete Math."},{"key":"7_CR15","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, New York (2006)","edition":"2"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-69053-0_21","volume-title":"Advances in Cryptology - EUROCRYPT 1997","author":"C Cr\u00e9peau","year":"1997","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) Advances in Cryptology - EUROCRYPT 1997. LNCS, vol. 1233, pp. 306\u2013317. Springer, Heidelberg (1997)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th Annual Symposium on Foundations of Computer Science, pp. 42\u201352. IEEE Computer Society Press, White Plains, New York (24\u201326 October 1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-85093-9_3","volume-title":"ICITS 08: 3rd International Conference on Information Theoretic Security","author":"C Cr\u00e9peau","year":"2008","unstructured":"Cr\u00e9peau, C., Kilian, J., Savvides, G.: Interactive hashing: an information theoretic tool (invited talk). In: Safavi-Naini, R. (ed.) ICITS 08: 3rd International Conference on Information Theoretic Security. LNCS, vol. 5155, pp. 14\u201328. Springer, Heidelberg (2008)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-30598-9_4","volume-title":"SCN 04: 4th International Conference on Security in Communication Networks","author":"C Cr\u00e9peau","year":"2005","unstructured":"Cr\u00e9peau, C., Morozov, K., Wolf, S.: Efficient unconditional oblivious transfer from almost any noisy channel. In: Blundo, C., Cimato, S. (eds.) SCN 04: 4th International Conference on Security in Communication Networks. LNCS, vol. 3352, pp. 47\u201359. Springer, Heidelberg (2005)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-540-24638-1_20","volume-title":"TCC 2004: 1st Theory of Cryptography Conference","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: 1st Theory of Cryptography Conference. LNCS, vol. 2951, pp. 355\u2013373. Springer, Heidelberg (2004)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) Advances in Cryptology - CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT 1999","author":"I Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) Advances in Cryptology - EUROCRYPT 1999. LNCS, vol. 1592, pp. 56\u201373. Springer, Heidelberg (1999)"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-540-78967-3_29","volume-title":"Advances in Cryptology - EUROCRYPT 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Wichs, D.: Isolated proofs of knowledge and isolated zero knowledge. In: Smart, N.P. (ed.) Advances in Cryptology - EUROCRYPT 2008. LNCS, vol. 4965, pp. 509\u2013526. Springer, Heidelberg (2008)"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008). http:\/\/dx.doi.org\/10.1137\/060651380","journal-title":"SIAM J. Comput."},{"key":"7_CR25","first-page":"205","volume-title":"Advances in Cryptology - CRYPTO 1982","author":"S Even","year":"1982","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology - CRYPTO 1982, pp. 205\u2013210. Plenum Press, New York (1982)"},{"key":"7_CR26","volume-title":"Information Theory and Reliable Communication","author":"R Gallager","year":"1968","unstructured":"Gallager, R.: Information Theory and Reliable Communication. Wiley, New York (1968)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. City, New York (25\u201327 May 1987)","DOI":"10.1145\/28395.28420"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-642-11799-2_19","volume-title":"TCC 2010: 7th Theory of Cryptography Conference","author":"V Goyal","year":"2010","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: Micciancio, D. (ed.) TCC 2010: 7th Theory of Cryptography Conference. LNCS, vol. 5978, pp. 308\u2013326. Springer, Heidelberg (2010)"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Xia, P.: Polar codes: speed of polarization and polynomial gap to capacity. In: 54th Annual Symposium on Foundations of Computer Science, pp. 310\u2013319. IEEE Computer Society Press, Berkeley (26\u201329 October 2013)","DOI":"10.1109\/FOCS.2013.41"},{"issue":"301","key":"7_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963). http:\/\/www.jstor.org\/stable\/2282952","journal-title":"J. Am. Stat. Assoc."},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, pp. 230\u2013235. IEEE Computer Society Press, Research Triangle Park (30 October\u20131 November 1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/978-3-642-22792-9_38","volume-title":"Advances in Cryptology - CRYPTO","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)"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Extracting correlations. In: 50th Annual Symposium on Foundations of Computer Science, pp. 261\u2013270. IEEE Computer Society Press, Atlanta (25\u201327 October 2009)","DOI":"10.1109\/FOCS.2009.56"},{"key":"7_CR34","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 - CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) Advances in Cryptology - CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-72540-4_7","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J Katz","year":"2007","unstructured":"Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) Advances in Cryptology - EUROCRYPT 2007. LNCS, vol. 4515, pp. 115\u2013128. Springer, Heidelberg (2007)"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th Annual ACM Symposium on Theory of Computing, pp. 20\u201331. ACM Press, Chicago (2\u20134 May 1988)","DOI":"10.1145\/62212.62215"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: 23rd Annual ACM Symposium on Theory of Computing, pp. 553\u2013560. ACM Press, New Orleans (6\u20138 May 1991)","DOI":"10.1145\/103418.103475"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: 32nd Annual ACM Symposium on Theory of Computing, pp. 316\u2013324. ACM Press, Portland (21\u201323 May 2000)","DOI":"10.1145\/335305.335342"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-45116-1_22","volume-title":"Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security","author":"V Korjik","year":"2001","unstructured":"Korjik, V., Morozov, K.: Generalized oblivious transfer protocols based on noisy channels. In: Gorodetski, V.I., Skormin, V.A., Popyack, L.J. (eds.) MMM-ACNS 2001. LNCS, vol. 2052, pp. 219\u2013229. Springer, Heidelberg (2001). http:\/\/dx.doi.org\/10.1007\/3-540-45116-1_22"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-642-55220-5_36","volume-title":"Advances in Cryptology - EUROCRYPT 2014","author":"D Kraschewski","year":"2014","unstructured":"Kraschewski, D., Maji, H.K., Prabhakaran, M., Sahai, A.: A full characterization of completeness for two-party randomized function evaluation. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 659\u2013676. Springer, Heidelberg (2014)"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-642-00457-5_15","volume-title":"TCC 2009: 6th Theory of Cryptography Conference","author":"R K\u00fcnzler","year":"2009","unstructured":"K\u00fcnzler, R., M\u00fcller-Quade, J., Raub, D.: Secure computability of functions in the IT setting with dishonest majority and applications to long-term security. In: Reingold, O. (ed.) TCC 2009: 6th Theory of Cryptography Conference. LNCS, vol. 5444, pp. 238\u2013255. Springer, Heidelberg (2009)"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E.: Privacy and communication complexity. In: 30th Annual Symposium on Foundations of Computer Science. pp. 416\u2013421. IEEE Computer Society Press, Research Triangle Park, North Carolina (30 October\u20131 November 1989)","DOI":"10.1109\/SFCS.1989.63512"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/978-3-642-00457-5_16","volume-title":"TCC 2009: 6th Theory of Cryptography Conference","author":"HK Maji","year":"2009","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation problems: the case of 2-party symmetric secure function evaluation. In: Reingold, O. (ed.) TCC 2009: 6th Theory of Cryptography Conference. LNCS, vol. 5444, pp. 256\u2013273. Springer, Heidelberg (2009)"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-34931-7_4","volume-title":"Progress in Cryptology INDOCRYPT 2012","author":"HK Maji","year":"2012","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: A unified characterization of completeness and triviality for secure function evaluation. In: Galbraith, S.D., Nandi, M. (eds.) Progress in Cryptology INDOCRYPT 2012. LNCS, vol. 7668, pp. 40\u201359. Springer, Heidelberg (2012)"},{"key":"7_CR45","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: Blaze, M. (ed.) Proceedings of the 13th USENIX Security Symposium, 9\u201313 August 2004, San Diego, CA, USA, pp. 287\u2013302. USENIX (2004). http:\/\/www.usenix.org\/publications\/library\/proceedings\/sec04\/tech\/malkhi.html"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-78967-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings","author":"T Moran","year":"2008","unstructured":"Moran, T., Segev, G.: David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware. In: Smart, N.P. (ed.) Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. LNCS, vol. 4965, pp. 527\u2013544. Springer, Heidelberg (2008). http:\/\/dx.doi.org\/10.1007\/978-3-540-78967-3_30"},{"issue":"6","key":"7_CR47","doi-asserted-by":"publisher","first-page":"2572","DOI":"10.1109\/TIT.2008.921856","volume":"54","author":"ACA Nascimento","year":"2008","unstructured":"Nascimento, A.C.A., Winter, A.J.: On the oblivious-transfer capacity of noisy resources. IEEE Trans. Inf. Theor. 54(6), 2572\u20132581 (2008). http:\/\/dx.doi.org\/10.1109\/TIT.2008.921856","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology - CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology - CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012)"},{"key":"7_CR49","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385. ACM Press, Seattle (15\u201317 May 1989)","DOI":"10.1145\/73007.73014"},{"key":"7_CR51","unstructured":"Savvides, G.: Interactive Hashing and Reductions Between Oblivious Transfer Variants. Ph.D. thesis, Montreal, Que., Canada, Canada, aAINR32237 (2007)"},{"issue":"4","key":"7_CR52","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"7_CR53","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15, 78\u201388 (1983). http:\/\/doi.acm.org\/10.1145\/1008908.1008920","journal-title":"SIGACT News"},{"key":"7_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/11761679_14","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S Wolf","year":"2006","unstructured":"Wolf, S., Wullschleger, J.: Oblivious transfer is symmetric. In: Vaudenay, S. (ed.) Advances in Cryptology - EUROCRYPT 2006. LNCS, vol. 4004, pp. 222\u2013232. Springer, Heidelberg (2006)"},{"key":"7_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) Advances in Cryptology - EUROCRYPT 2007. LNCS, vol. 4515, pp. 555\u2013572. Springer, Heidelberg (2007)"},{"key":"7_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/978-3-642-00457-5_20","volume-title":"TCC 2009: 6th Theory of Cryptography Conference","author":"J Wullschleger","year":"2009","unstructured":"Wullschleger, J.: Oblivious transfer from weak noisy channels. In: Reingold, O. (ed.) TCC 2009: 6th Theory of Cryptography Conference. LNCS, vol. 5444, pp. 332\u2013349. Springer, Heidelberg (2009)"},{"key":"7_CR57","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science. pp. 80\u201391. IEEE Computer Society Press, Chicago (3\u20135 November 1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49896-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T20:15:29Z","timestamp":1655583329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49896-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662498958","9783662498965"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49896-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}