{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:16:26Z","timestamp":1725639386104},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255779"},{"type":"electronic","value":"9783642255786"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25578-6_25","type":"book-chapter","created":{"date-parts":[[2011,12,5]],"date-time":"2011-12-05T21:36:57Z","timestamp":1323121017000},"page":"344-358","source":"Crossref","is-referenced-by-count":0,"title":["The Limits of Common Coins: Further Results"],"prefix":"10.1007","author":[{"given":"Hemanta K.","family":"Maji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO \u201999","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. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 80\u201397. Springer, Heidelberg (1999)"},{"key":"#cr-split#-25_CR2.2","unstructured":"2. Previous version \"A unified framework for analyzing security of protocols\" availabe at the ECCC archive TR01-016. Extended abstract in FOCS 2001"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-78524-8_23","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2008","unstructured":"Haitner, I.: Semi-Honest to Malicious Oblivious Transfer\u2014the Black-Box Way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 412\u2013426. Springer, Heidelberg (2008)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: Proc. 32th STOC, pp. 316\u2013324. ACM (2000)","DOI":"10.1145\/335305.335342"},{"key":"25_CR6","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.\u00a06597, pp. 364\u2013381. Springer, Heidelberg (2011)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-00457-5_15","volume-title":"Theory of Cryptography","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. LNCS, vol.\u00a05444, pp. 238\u2013255. Springer, Heidelberg (2009)"},{"key":"25_CR8","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":"H.K. 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.\u00a06597, pp. 486\u2013503. Springer, Heidelberg (2011)"},{"key":"25_CR9","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":"H.K. 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.\u00a05444, pp. 256\u2013273. Springer, Heidelberg (2009)"},{"key":"25_CR10","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Cryptographic complexity classes and computational intractability assumptions. In: Yao, A.C.-C. (ed.) ICS, pp. 266\u2013289. Tsinghua University Press (2010)"},{"key":"25_CR11","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":"H.K. 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.\u00a06223, pp. 595\u2013612. Springer, Heidelberg (2010)"},{"key":"25_CR12","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.\u00a05157, pp. 262\u2013279. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25578-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T06:24:56Z","timestamp":1561011896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25578-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255779","9783642255786"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25578-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}