{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:32:05Z","timestamp":1725460325848},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642365935"},{"type":"electronic","value":"9783642365942"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-36594-2_15","type":"book-chapter","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T21:43:27Z","timestamp":1360187007000},"page":"263-280","source":"Crossref","is-referenced-by-count":2,"title":["Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities"],"prefix":"10.1007","author":[{"given":"R. Amzi","family":"Jeffs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Rosulek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_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.\u00a02, pp. 65\u201377. American Mathematical Society (1989)"},{"key":"#cr-split#-15_CR2.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Naor, M. (ed.) FOCS, pp. 136-145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-15_CR2.2","unstructured":"Revised version (2005) on Cryptology ePrint Archive,     http:\/\/eprint.iacr.org\/2000\/067"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM J. Discrete Math.\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR5","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: STOC, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: STOC, pp. 553\u2013560. ACM (1991)","DOI":"10.1145\/103418.103475"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC, pp. 316\u2013324. ACM (2000)","DOI":"10.1145\/335305.335342"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/S0097539797321742","volume":"29","author":"J. Kilian","year":"2000","unstructured":"Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. Comput.\u00a029(4), 1189\u20131208 (2000)","journal-title":"SIAM J. Comput."},{"key":"15_CR9","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":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-19571-6_23","volume-title":"Theory of Cryptography","author":"G. Kreitz","year":"2011","unstructured":"Kreitz, G.: A Zero-One Law for Secure Multi-party Computation with Ternary Outputs. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 382\u2013399. Springer, Heidelberg (2011)"},{"key":"15_CR11","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":"15_CR12","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E.: Privacy and communication complexity. In: FOCS, pp. 416\u2013421. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63512"},{"key":"15_CR13","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":"15_CR14","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":"15_CR15","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)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-642-32009-5_24","volume-title":"CRYPTO","author":"M. Rosulek","year":"2012","unstructured":"Rosulek, M.: Universal Composability from Essentially Any Trusted Setup. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 406\u2013423. Springer, Heidelberg (2012)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36594-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T23:21:34Z","timestamp":1557530494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}