{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T04:04:51Z","timestamp":1743998691930,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332715"},{"type":"electronic","value":"9783642332722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33272-2_8","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T13:45:33Z","timestamp":1345643133000},"page":"104-124","source":"Crossref","is-referenced-by-count":1,"title":["On the (Non-)Equivalence of UC Security Notions"],"prefix":"10.1007","author":[{"given":"Oana","family":"Ciobotaru","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: 25th Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 53\u201362 (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"Theory of Cryptography","author":"M. Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A General Composition Theorem for Secure Reactive Systems. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 336\u2013354. Springer, Heidelberg (2004)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. J. Cryptology\u00a04(2) (1991)","DOI":"10.1007\/BF00196771"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 136\u2013145 (2001), full version on Cryptology ePrint Archive, Report 2000\/067","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR5","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":"8_CR6","unstructured":"Ciobotaru, O.: On the (non-)equivalence of uc security notions. Cryptology ePrint Archive, Report 2011\/355 (2011), http:\/\/eprint.iacr.org\/"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A Cryptographic Solution to a Game Theoretic Problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/950620.950623","volume":"50","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. J. ACM\u00a050(6), 852\u2013921 (2003)","journal-title":"J. ACM"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: recent results and future directions. In: 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), pp. 1\u201313 (2002)","DOI":"10.1145\/570811.570812"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-11799-2_25","volume-title":"Theory of Cryptography","author":"G. Fuchsbauer","year":"2010","unstructured":"Fuchsbauer, G., Katz, J., Naccache, D.: Efficient Rational Secret Sharing in Standard Communication Networks. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 419\u2013436. Springer, Heidelberg (2010)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In: FOCS, pp. 174\u2013187 (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"8_CR12","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 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. Journal of Cryptology\u00a07(1), 1\u201332 (1994)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11832072_16","volume-title":"Security and Cryptography for Networks","author":"S.D. Gordon","year":"2006","unstructured":"Gordon, S.D., Katz, J.: Rational Secret Sharing, Revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 229\u2013241. Springer, Heidelberg (2006)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: STOC 2004, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"8_CR17","unstructured":"Halpern, J.Y., Pass, R.: A computational game-theoretic framework for cryptography (2010) (unpublished manuscript)"},{"key":"8_CR18","unstructured":"Halpern, J.Y., Pass, R.: Game theory with costly computation: Formulation and application to protocol security. In: Innovations in Computer Science (ICS 2010), pp. 120\u2013142 (2010)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1997, pp. 25\u201334 (1997)","DOI":"10.1145\/259380.259412"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-30576-7_6","volume-title":"Theory of Cryptography","author":"D. Hofheinz","year":"2005","unstructured":"Hofheinz, D., Unruh, D.: Comparing Two Notions of Simulatability. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 86\u2013103. Springer, Heidelberg (2005)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-78524-8_15","volume-title":"Theory of Cryptography","author":"J. Katz","year":"2008","unstructured":"Katz, J.: Bridging Game Theory and Cryptography: Recent Results and Future Directions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 251\u2013272. Springer, Heidelberg (2008)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-78524-8_18","volume-title":"Theory of Cryptography","author":"G. Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Cryptography and Game Theory: Designing Protocols for Exchanging Information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 320\u2013339. Springer, Heidelberg (2008)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: General composition and universal composability in secure multi-party computation. In: FOCS, pp. 394\u2013403 (2003)","DOI":"10.1109\/SFCS.2003.1238213"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: STOC, pp. 306\u2013315 (2006)","DOI":"10.1145\/1132516.1132561"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure Computation (abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Schunter, M., Waidner, M.: Cryptographic security of reactive systems. Electr. Notes Theor. Comput. Sci.\u00a032 (2000)","DOI":"10.1016\/S1571-0661(04)00095-7"},{"key":"8_CR27","unstructured":"Pfitzmann, B., Waidner, M.: A general framework for formal notions of secure systems (1994), http:\/\/www.semper.org\/sirene\/lit"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: CCS 2000: Proceedings of the 7th ACM Conference on Computer and Communications Security, pp. 245\u2013254. ACM (2000)","DOI":"10.1145\/352600.352639"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE Symposium on Security and Privacy, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"8_CR30","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock puzzles and timed-release crypto. Tech. rep., Massachusetts Institute of Technology (1996)"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33272-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T02:44:00Z","timestamp":1743993840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33272-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332715","9783642332722"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33272-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}