{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:46:22Z","timestamp":1778499982355,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642365935","type":"print"},{"value":"9783642365942","type":"electronic"}],"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_27","type":"book-chapter","created":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T02:43:27Z","timestamp":1360205007000},"page":"477-498","source":"Crossref","is-referenced-by-count":135,"title":["Universally Composable Synchronous Computation"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Tackmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-22792-9_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G. Asharov","year":"2011","unstructured":"Asharov, G., Lindell, Y., Rabin, T.: Perfectly-Secure Multiplication for Any t < n\/3. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 240\u2013258. Springer, Heidelberg (2011)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of Network Synchronization. Journal of the ACM\u00a032, 804\u2013823 (1985)","journal-title":"Journal of the ACM"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-45187-7_23","volume-title":"CONCUR 2003 - Concurrency Theory","author":"M. Backes","year":"2003","unstructured":"Backes, M.: Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 350\u2013365. Springer, Heidelberg (2003)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Backes, M., Hofheinz, D., M\u00fcller-Quade, J., Unruh, D.: On Fairness in Simulatability-based Cryptographic Systems. In: Proceedings of FMSE, pp. 13\u201322. ACM (2005)","DOI":"10.1145\/1103576.1103579"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Steiner, M., Waidner, M.: Polynomial Fairness and Liveness. In: Proceedings of the 15th Annual IEEE Computer Security Foundations Workshop, pp. 160\u2013174. IEEE (2002)","DOI":"10.1109\/CSFW.2002.1021814"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.ic.2007.05.002","volume":"205","author":"M. Backes","year":"2007","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: The Reactive Simulatability (RSIM) Framework for Asynchronous Systems. Information and Computation\u00a0205, 1685\u20131720 (2007)","journal-title":"Information and Computation"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous Secure Computation. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 52\u201361. ACM (1993)","DOI":"10.1145\/167088.167109"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Widgerson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"27_CR9","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, The Weizmann Institute of Science (1996)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: Cryptology ePrint Archive, Report 2000\/067 (2005)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"27_CR11","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. Journal of Cryptology\u00a013, 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"27_CR13","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)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-46035-7_22","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Krawczyk, H.: Universally Composable Notions of Key Exchange and Secure Channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 337\u2013351. Springer, Heidelberg (2002)"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-Party Secure Computation. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 494\u2013503. ACM (2002)","DOI":"10.1145\/509978.509980"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty Unconditionally Secure Protocols. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 11\u201319. ACM (1988)","DOI":"10.1145\/62212.62214"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Chor, B., Moscovici, L.: Solvability in Asynchronous Environments. In: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 422\u2013427. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63513"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-44598-6_5","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Dodis","year":"2000","unstructured":"Dodis, Y., Micali, S.: Parallel Reducibility for Information-Theoretically Secure Computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 74\u201392. Springer, Heidelberg (2000)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Dolev, D., Strong, H.R.: Polynomial Algorithms for Multiple Processor Agreement. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 401\u2013407. ACM (1982)","DOI":"10.1145\/800070.802215"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 409\u2013418. ACM (1998)","DOI":"10.1145\/276698.276853"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Kumersan, R., Zhou, H.-S.: Adaptively Secure Broadcast, Revisited. In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, pp. 179\u2013186. ACM (2011)","DOI":"10.1145\/1993806.1993832"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Widgerson, A.: How to Play any Mental Game\u2014A Completeness Theorem for Protocols with Honest Majority. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Concurrent Zero-Knowledge with Timing, Revisited. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 332\u2013340. ACM (2002)","DOI":"10.1145\/509957.509959"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-13190-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Hirt","year":"2010","unstructured":"Hirt, M., Zikas, V.: Adaptively Secure Broadcast. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 466\u2013485. Springer, Heidelberg (2010)"},{"key":"27_CR25","unstructured":"Hofheinz, D., M\u00fcller-Quade, J.: A Synchronous Model for Multi-Party Computation and the Incompleteness of Oblivious Transfer. In: Proceedings of Foundations of Computer Security \u2014 FCS 2004, pp. 117\u2013130 (2004)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Lindell, Y., Prabhakaran, M.: Concurrent General Composition of Secure Protocols in the Timing Model. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 644\u2013653. ACM (2005)","DOI":"10.1145\/1060590.1060687"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally Composable Synchronous Computation. In: Cryptology ePrint Archive, Report 2011\/310 (2012)","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"27_CR28","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":"27_CR29","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically Secure Protocols and Security under Composition. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 109\u2013118. ACM (2006)","DOI":"10.1145\/1132516.1132532"},{"key":"27_CR30","unstructured":"Maji, H., Prabhakaran, M., Rosulek, M.: Cryptographic Complexity Classes and Computational Intractability Assumptions. In: Innovations in Computer Science. Tsinghua University Press (2010)"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27375-9_3","volume-title":"Theory of Security and Applications","author":"U. Maurer","year":"2012","unstructured":"Maurer, U.: Constructive Cryptography \u2013 A New Paradigm for Security Definitions and Proofs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol.\u00a06993, pp. 33\u201356. Springer, Heidelberg (2012)"},{"key":"27_CR32","unstructured":"Maurer, U., Renner, R.: Abstract Cryptography. In: Innovations in Computer Science. Tsinghua University Press (2011)"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Maurer, U., Tackmann, B.: Synchrony Amplification. In: International Symposium on Information Theory Proceedings, pp. 1583\u20131587. IEEE (2012)","DOI":"10.1109\/ISIT.2012.6283540"},{"key":"27_CR34","unstructured":"Nielsen, J.B.: On Protocol Security in the Cryptographic Model. PhD thesis, University of Aarhus (2003)"},{"key":"27_CR35","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T20:11:22Z","timestamp":1745957482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}