{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:58:34Z","timestamp":1777964314822,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,5]],"date-time":"2013-10-05T00:00:00Z","timestamp":1380931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00145-013-9160-y","type":"journal-article","created":{"date-parts":[[2013,10,4]],"date-time":"2013-10-04T16:04:39Z","timestamp":1380902679000},"page":"423-508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["GNUC: A New Universal Composability Framework"],"prefix":"10.1007","volume":"28","author":[{"given":"Dennis","family":"Hofheinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,5]]},"reference":[{"key":"9160_CR1","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1145\/948109.948140","volume-title":"ACM CCS 03: 10th Conference on Computer and Communications Security","author":"M. Backes","year":"2003","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, A composable cryptographic library with nested operations, in ACM CCS 03: 10th Conference on Computer and Communications Security, ed. by S. Jajodia, V. Atluri, T. Jaeger, Washington, DC, USA, October\u00a027\u201330, 2003 (ACM, New York, 2003), pp. 220\u2013230"},{"key":"9160_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"TCC 2004: 1st Theory of Cryptography Conference","author":"M. Backes","year":"2004","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, A general composition theorem for secure reactive systems, in TCC 2004: 1st Theory of Cryptography Conference, ed. by M. Naor, Cambridge, MA, USA, February\u00a019\u201321, 2004. Lecture Notes in Computer Science, vol.\u00a02951 (Springer, Berlin, 2004), pp. 336\u2013354"},{"issue":"12","key":"9160_CR3","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.ic.2007.05.002","volume":"205","author":"M. Backes","year":"2007","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, The reactive simulatability (RSIM) framework for asynchronous systems. Inf. Comput.\n                  205(12), 1685\u20131720 (2007)","journal-title":"Inf. Comput."},{"key":"9160_CR4","first-page":"543","volume-title":"46th Annual Symposium on Foundations of Computer Science","author":"B. Barak","year":"2005","unstructured":"B. Barak, How to play almost any mental game over the net\u2014concurrent composition via super-polynomial simulation, in 46th Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, USA, October 23\u201325, 2005 (IEEE Comput. Soc., Los Alamitos, 2005), pp. 543\u2013552"},{"key":"9160_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/11535218_22","volume-title":"Advances in Cryptology\u2014CRYPTO 2005","author":"B. Barak","year":"2005","unstructured":"B. Barak, R. Canetti, Y. Lindell, R. Pass, T. Rabin, Secure computation without authentication, in Advances in Cryptology\u2014CRYPTO 2005, ed. by V. Shoup, Santa Barbara, CA, USA, August\u00a014\u201318, 2005. Lecture Notes in Computer Science, vol.\u00a03621 (Springer, Berlin, 2005), pp. 361\u2013377"},{"key":"9160_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology\u2014CRYPTO\u201991","author":"D. Beaver","year":"1992","unstructured":"D. Beaver, Foundations of secure interactive computing, in Advances in Cryptology\u2014CRYPTO\u201991, ed. by J. Feigenbaum, Santa Barbara, CA, USA, August\u00a011\u201315, 1992. Lecture Notes in Computer Science, vol.\u00a0576 (Springer, Berlin, 1992), pp. 377\u2013391"},{"key":"9160_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"FC 2009: 13th International Conference on Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2009","unstructured":"P. Bogetoft, D.L. Christensen, I. Damg\u00e5rd, M. Geisler, T. Jakobsen, M. Kr\u00f8igaard, J.D. Nielsen, J.B. Nielsen, K. Nielsen, J. Pagter, M.I. Schwartzbach, T. Toft, Secure multiparty computation goes live, in FC 2009: 13th International Conference on Financial Cryptography and Data Security, ed. by R. Dingledine, P. Golle, Accra Beach, Barbados, February\u00a023\u201326, 2009. Lecture Notes in Computer Science, vol.\u00a05628 (Springer, Berlin, 2009), pp. 325\u2013343"},{"key":"9160_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-01001-9_25","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2009","author":"J. Camenisch","year":"2009","unstructured":"J. Camenisch, A. Kiayias, M. Yung, On the portability of generalized Schnorr proofs, in Advances in Cryptology\u2014EUROCRYPT 2009, ed. by A. Joux, Cologne, Germany, April\u00a026\u201330, 2009. Lecture Notes in Computer Science, vol.\u00a05479 (Springer, Berlin, 2009), pp. 425\u2013442"},{"key":"9160_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-14623-7_14","volume-title":"Advances in Cryptology\u2014CRYPTO 2010","author":"J. Camenisch","year":"2010","unstructured":"J. Camenisch, N. Casati, T. Gro\u00df, V. Shoup, Credential authenticated identification and key exchange, in Advances in Cryptology\u2014CRYPTO 2010, ed. by T. Rabin, Santa Barbara, CA, USA, August\u00a015\u201319, 2010. Lecture Notes in Computer Science, vol.\u00a06223 (Springer, Berlin, 2010), pp. 255\u2013276"},{"issue":"1","key":"9160_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol.\n                  13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9160_CR11","first-page":"136","volume-title":"42nd Annual Symposium on Foundations of Computer Science","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, NV, USA, October\u00a014\u201317, 2001 (IEEE Comput. Soc., Los Alamitos, 2001), pp. 136\u2013145"},{"key":"9160_CR12","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067, December 2005. Full and updated version of [11], \n                    http:\/\/eprint.iacr.org\/","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9160_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\u2014CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in Advances in Cryptology\u2014CRYPTO 2001, ed. by J. Kilian, Santa Barbara, CA, USA, August\u00a019\u201323, 2001. Lecture Notes in Computer Science, vol.\u00a02139 (Springer, Berlin, 2001), pp. 19\u201340"},{"key":"9160_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology\u2014CRYPTO 2003","author":"R. Canetti","year":"2003","unstructured":"R. Canetti, T. Rabin, Universal composition with joint state, in Advances in Cryptology\u2014CRYPTO 2003, ed. by D. Boneh, Santa Barbara, CA, USA, August\u00a017\u201321, 2003. Lecture Notes in Computer Science, vol.\u00a02729 (Springer, Berlin, 2003), pp. 265\u2013281"},{"key":"9160_CR15","first-page":"494","volume-title":"34th Annual ACM Symposium on Theory of Computing","author":"R. Canetti","year":"2002","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in 34th Annual ACM Symposium on Theory of Computing, Montr\u00e9al, Qu\u00e9bec, Canada, May\u00a019\u201321, 2002 (ACM, New York, 2002), pp. 494\u2013503"},{"key":"9160_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"TCC 2007: 4th Theory of Cryptography Conference","author":"R. Canetti","year":"2007","unstructured":"R. Canetti, Y. Dodis, R. Pass, S. Walfish, Universally composable security with global setup, in TCC 2007: 4th Theory of Cryptography Conference, ed. by S.P. Vadhan, Amsterdam, The Netherlands, February\u00a021\u201324, 2007. Lecture Notes in Computer Science, vol.\u00a04392 (Springer, Berlin, 2007), pp. 61\u201385"},{"key":"9160_CR17","first-page":"313","volume-title":"ProvSec","author":"S. Gajek","year":"2008","unstructured":"S. Gajek, M. Manulis, O. Pereira, A.-R. Sadeghi, J. Schwenk, Universally composable security analysis of TLS, in ProvSec (2008), pp. 313\u2013327"},{"issue":"1","key":"9160_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, H. Krawczyk, On the composition of zero-knowledge proof systems. SIAM J. Comput.\n                  25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"key":"9160_CR19","first-page":"174","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity and a methodology of cryptographic protocol design, in 27th Annual Symposium on Foundations of Computer Science, Toronto, Ontario, Canada, October\u00a027\u201329, 1986 (IEEE Comput. Soc., Los Alamitos, 1986), pp. 174\u2013187"},{"issue":"2","key":"9160_CR20","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. H\u00e5stad","year":"1988","unstructured":"J. H\u00e5stad, Solving simultaneous modular equations of low degree. SIAM J. Comput.\n                  17(2), 336\u2013341 (1988)","journal-title":"SIAM J. Comput."},{"key":"9160_CR21","first-page":"156","volume-title":"CSFW","author":"D. Hofheinz","year":"2005","unstructured":"D. Hofheinz, J. M\u00fcller-Quade, D. Unruh, Polynomial runtime in simulatability definitions, in CSFW (2005), pp. 156\u2013169"},{"issue":"3","key":"9160_CR22","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00145-012-9127-4","volume":"26","author":"D. Hofheinz","year":"2013","unstructured":"D. Hofheinz, D. Unruh, J. M\u00fcller-Quade, Polynomial runtime and composability. J. Cryptol.\n                  26(3), 375\u2013441 (2013)","journal-title":"J. Cryptol."},{"key":"9160_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2000","author":"S. Jarecki","year":"2000","unstructured":"S. Jarecki, A. Lysyanskaya, Adaptively secure threshold cryptography: introducing concurrency, removing erasures, in Advances in Cryptology\u2014EUROCRYPT 2000, ed. by B. Preneel, Bruges, Belgium, May\u00a014\u201318, 2000. Lecture Notes in Computer Science, vol.\u00a01807 (Springer, Berlin, 2000), pp. 221\u2013242"},{"key":"9160_CR24","first-page":"309","volume-title":"CSFW","author":"R. K\u00fcsters","year":"2006","unstructured":"R. K\u00fcsters, Simulation-based security with inexhaustible interactive Turing machines, in CSFW (IEEE Comput. Soc., Los Alamitos, 2006), pp. 309\u2013320"},{"key":"9160_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/1653662.1653674","volume-title":"ACM CCS 09: 16th Conference on Computer and Communications Security","author":"R. K\u00fcsters","year":"2009","unstructured":"R. K\u00fcsters, M. Tuengerthal, Computational soundness for key exchange protocols with symmetric encryption, in ACM CCS 09: 16th Conference on Computer and Communications Security, ed. by E.\u00a0Al-Shaer, S. Jha, A.D. Keromytis, Chicago, Illinois, USA, November\u00a09\u201313, 2009 (ACM, New York, 2009), pp. 91\u2013100"},{"key":"9160_CR26","unstructured":"R. K\u00fcsters, M. Tuengerthal, The IITM model: a simple and expressive model for universal composability. Cryptology ePrint Archive, Report 2013\/025, 2013. \n                    http:\/\/eprint.iacr.org\/"},{"key":"9160_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-24676-3_23","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2004","author":"P.D. MacKenzie","year":"2004","unstructured":"P.D. MacKenzie, K. Yang, On simulation-sound trapdoor commitments, in Advances in Cryptology\u2014EUROCRYPT 2004, ed. by C. Cachin, J. Camenisch, Interlaken, Switzerland, May\u00a02\u20136, 2004. Lecture Notes in Computer Science, vol.\u00a03027 (Springer, Berlin, 2004), pp. 382\u2013400"},{"key":"9160_CR28","first-page":"1","volume-title":"The Second Symposium in Innovations in Computer Science, ICS 2011","author":"U. Maurer","year":"2011","unstructured":"U. Maurer, R. Renner, Abstract cryptography, in The Second Symposium in Innovations in Computer Science, ICS 2011, ed. by B. Chazelle (Tsinghua University Press, Tsinghua, 2011), pp. 1\u201321"},{"key":"9160_CR29","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\u2014CRYPTO\u201991","author":"S. Micali","year":"1992","unstructured":"S. Micali, P. Rogaway, Secure computation (abstract), in Advances in Cryptology\u2014CRYPTO\u201991, ed. by J. Feigenbaum, Santa Barbara, CA, USA, August\u00a011\u201315, 1992. Lecture Notes in Computer Science, vol.\u00a0576 (Springer, Berlin, 1992), pp. 392\u2013404"},{"key":"9160_CR30","first-page":"184","volume-title":"IEEE Symposium on Security and Privacy","author":"B. Pfitzmann","year":"2001","unstructured":"B. Pfitzmann, M. Waidner, A model for asynchronous reactive systems and its application to secure message transmission, in IEEE Symposium on Security and Privacy (2001), pp. 184\u2013200"},{"key":"9160_CR31","unstructured":"M. Prabhakaran, New notions of security, PhD thesis, Princeton University, 2005"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9160-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9160-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9160-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9160-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:15:05Z","timestamp":1586333705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9160-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,5]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9160"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9160-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,5]]},"assertion":[{"value":"6 June 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}