{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:13:29Z","timestamp":1743041609657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030038090"},{"type":"electronic","value":"9783030038106"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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-030-03810-6_4","type":"book-chapter","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T21:30:29Z","timestamp":1541626229000},"page":"98-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Structure of Unconditional UC Hybrid Protocols"],"prefix":"10.1007","author":[{"given":"Mike","family":"Rosulek","sequence":"first","affiliation":[]},{"given":"Morgan","family":"Shirley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,8]]},"reference":[{"key":"4_CR1","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":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-24638-1_14","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2004","unstructured":"Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 238\u2013257. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_14"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"key":"4_CR4","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":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-48910-X_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"Y Dodis","year":"1999","unstructured":"Dodis, Y., Micali, S.: Lower bounds for oblivious transfer reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 42\u201355. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_4"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 413\u2013422. ACM Press, May 2008","DOI":"10.1145\/1374376.1374436"},{"key":"4_CR7","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":"4_CR8","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th ACM STOC, pp. 20\u201331. ACM Press, May 1988","DOI":"10.1145\/62212.62215"},{"key":"4_CR9","unstructured":"Kilian, J.: Uses of randomness in algorithms and protocols. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1989)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: 23rd ACM STOC, pp. 553\u2013560. ACM Press, May 1991","DOI":"10.1145\/103418.103475"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: 32nd ACM STOC, pp. 316\u2013324. ACM Press, May 2000","DOI":"10.1145\/335305.335342"},{"key":"4_CR12","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 \u2013 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). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_36"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-19571-6_22","volume-title":"Theory of Cryptography","author":"D Kraschewski","year":"2011","unstructured":"Kraschewski, D., M\u00fcller-Quade, J.: Completeness theorems with constructive proofs for finite deterministic 2-party functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 364\u2013381. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_22"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E.: Privacy and communication complexity. In: 30th FOCS, pp. 416\u2013421. IEEE Computer Society Press, October\/November 1989","DOI":"10.1109\/SFCS.1989.63512"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-70500-2_19","volume-title":"Theory of Cryptography","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y., Rabin, T.: Secure two-party computation with fairness - a necessary design principle. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 565\u2013580. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_19"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-19571-6_29","volume-title":"Theory of Cryptography","author":"HK Maji","year":"2011","unstructured":"Maji, H.K., Ouppaphan, P., Prabhakaran, M., Rosulek, M.: Exploring the limits of common coins using frontier analysis of protocols. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 486\u2013503. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_29"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-00457-5_16","volume-title":"Theory of Cryptography","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. LNCS, vol. 5444, pp. 256\u2013273. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_16"},{"key":"4_CR18","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Cryptographic complexity classes and computational intractability assumptions. In: Yao, A.C.-C. (ed.) ICS 2010, pp. 266\u2013289. Tsinghua University Press, Beijing (2010)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-14623-7_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"HK Maji","year":"2010","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: A zero-one law for cryptographic complexity with respect to computational UC security. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 595\u2013612. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_32"},{"key":"4_CR20","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., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 40\u201359. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_4"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-85174-5_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M Prabhakaran","year":"2008","unstructured":"Prabhakaran, M., Rosulek, M.: Cryptographic complexity of multi-party computation problems: classifications and separations. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 262\u2013279. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_15"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03810-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T01:02:32Z","timestamp":1636246952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03810-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038090","9783030038106"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03810-6_4","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":"8 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Panaji","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"11 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}