{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:51:17Z","timestamp":1755838277989},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,17]],"date-time":"2012-08-17T00:00:00Z","timestamp":1345161600000},"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":[[2013,7]]},"DOI":"10.1007\/s00145-012-9127-4","type":"journal-article","created":{"date-parts":[[2012,8,16]],"date-time":"2012-08-16T13:02:45Z","timestamp":1345122165000},"page":"375-441","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Polynomial Runtime and Composability"],"prefix":"10.1007","volume":"26","author":[{"given":"Dennis","family":"Hofheinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,17]]},"reference":[{"key":"9127_CR1","unstructured":"M. Backes, Cryptographically sound analysis of security protocols. Ph.D. thesis, Universit\u00e4t des Saarlandes, 2002. Online available at \n                    http:\/\/www.infsec.cs.uni-sb.de\/~backes\/papers\/PhDthesis.ps.gz"},{"key":"9127_CR2","first-page":"220","volume-title":"10th ACM Conference on Computer and Communications Security, Proceedings of CCS 2003","author":"M. Backes","year":"2003","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, A composable cryptographic library with nested operations, in 10th ACM Conference on Computer and Communications Security, Proceedings of CCS 2003 (ACM, New York, 2003), pp.\u00a0220\u2013230. Extended abstract, extended version online available at \n                    http:\/\/eprint.iacr.org\/2003\/015.ps"},{"key":"9127_CR3","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":"Theory of Cryptography, Proceedings of TCC 2004","author":"M. Backes","year":"2004","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, A general composition theorem for secure reactive systems, in Theory of Cryptography, Proceedings of TCC 2004, ed. by M. Naor. Lecture Notes in Computer Science, vol.\u00a02951 (Springer, Berlin, 2004), pp.\u00a0336\u2013354. Online available at \n                    http:\/\/www.zurich.ibm.com\/security\/publications\/2004\/BaPfWa2004MoreGeneralComposition.pdf"},{"key":"9127_CR4","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, Secure asynchronous reactive systems. IACR ePrint Archive, March 2004. Online available at \n                    http:\/\/eprint.iacr.org\/2004\/082.ps"},{"key":"9127_CR5","first-page":"136","volume-title":"42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001 (IEEE Comput. Soc., Los Alamitos, 2001), pp.\u00a0136\u2013145. Full version online available at \n                    http:\/\/www.eccc.uni-trier.de\/eccc-reports\/2001\/TR01-016\/revisn01.ps"},{"key":"9127_CR6","unstructured":"R. Canetti, On universally composable signature, certification and authentication. IACR ePrint 2003\/239, June 2004. Version of 2004-06-26"},{"key":"9127_CR7","unstructured":"R. Canetti, On universally composable signature, certification and authentication. IACR ePrint 2003\/239, August 2004. Version of 2004-08-15"},{"key":"9127_CR8","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols. IACR ePrint 2000\/067, December 2005. Version of 2005-12-14"},{"key":"9127_CR9","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols. IACR ePrint 2000\/067, January 2005. Version of 2005-01-28"},{"key":"9127_CR10","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols. Manuscript (2008)"},{"key":"9127_CR11","unstructured":"R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, R. Segala, Task-structured probabilistic I\/O automata. Technical Report MIT-CSAIL-TR-2006-060, MIT CSAIL, September 2006. Online available at \n                    http:\/\/dspace.mit.edu\/handle\/1721.1\/33964"},{"key":"9127_CR12","first-page":"238","volume-title":"DISC","author":"R. Canetti","year":"2006","unstructured":"R. Canetti, L. Cheung, D.K. Kaynar, M. Liskov, N.A. Lynch, O. Pereira, R. Segala, Time-bounded task-PIOAs: A framework for analyzing security protocols, in DISC (2006), pp.\u00a0238\u2013253"},{"key":"9127_CR13","first-page":"570","volume-title":"33rd Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2001","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, J. Kilian, E. Petrank, A. Rosen, Concurrent zero-knowledge requires \n                    \n                      \n                    \n                    $\\tilde{\\varOmega}(\\log n)$\n                   rounds, in 33rd Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2001 (ACM, New York, 2001), pp.\u00a0570\u2013579"},{"key":"9127_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/978-3-540-30576-7_26","volume-title":"Theory of Cryptography, Proceedings of TCC 2005","author":"A. Datta","year":"2005","unstructured":"A. Datta, R. K\u00fcsters, J.C. Mitchell, A. Ramanathan, On the relationships between notions of simulation-based security, in Theory of Cryptography, Proceedings of TCC 2005, ed. by J. Kilian. Lecture Notes in Computer Science (Springer, Berlin, 2005), pp.\u00a0476\u2013494. Online available at \n                    http:\/\/www.ti.informatik.uni-kiel.de\/~kuesters\/publications_html\/DattaKuestersMitchellRamanathan-TCC-2005.ps.gz"},{"key":"9127_CR15","unstructured":"U. Feige, Alternative models for zero knowledge interactive proofs. Ph.D. thesis, Weizmann Institute of Science (1990)"},{"issue":"3","key":"9127_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, A. Kahan, How to construct constant-round zero-knowledge proof systems for NP. J.\u00a0Cryptol.\n                  9(3), 167\u2013190 (1996)","journal-title":"J.\u00a0Cryptol."},{"issue":"1","key":"9127_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems. SIAM J. Comput.\n                  18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"9127_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography, vol.\u00a01 (Basic Tools)","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Foundations of Cryptography, vol.\u00a01 (Basic Tools) (Cambridge University Press, Cambridge, 2001). Previous version online available at \n                    http:\/\/www.wisdom.weizmann.ac.il\/~oded\/frag.html"},{"key":"9127_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography, vol.\u00a02 (Basic Applications)","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of Cryptography, vol.\u00a02 (Basic Applications) (Cambridge University Press, Cambridge, 2004). Previous version online available at \n                    http:\/\/www.wisdom.weizmann.ac.il\/~oded\/frag.html"},{"key":"9127_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-70936-7_10","volume-title":"Theory of Cryptography, Proceedings of TCC 2007","author":"O. Goldreich","year":"2007","unstructured":"O. Goldreich, On expected probabilistic polynomial-time adversaries: A suggestion for restricted definitions and their benefits, in Theory of Cryptography, Proceedings of TCC 2007, ed. by S. Vadhan. Lecture Notes in Computer Science (Springer, Berlin, 2007), pp.\u00a0174\u2013193. Online available at \n                    http:\/\/eprint.iacr.org\/2006\/277.ps"},{"key":"9127_CR21","first-page":"156","volume-title":"18th IEEE Computer Security Foundations Workshop, Proceedings of CSFW 2005","author":"D. Hofheinz","year":"2005","unstructured":"D. Hofheinz, J. M\u00fcller-Quade, D. Unruh, Polynomial runtime in simulatability definitions, in 18th IEEE Computer Security Foundations Workshop, Proceedings of CSFW 2005 (IEEE Comput. Soc., Los Alamitos, 2005), pp. 156\u2013169. Online available at \n                    http:\/\/iaks-www.ira.uka.de\/home\/unruh\/publications\/hofheinz05polynomial.html"},{"key":"9127_CR22","unstructured":"D. Hofheinz, V. Shoup, GNUC: A new universal composability framework. IACR ePrint 2011\/303, June 2011"},{"key":"9127_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-540-30576-7_6","volume-title":"Theory of Cryptography, Proceedings of TCC 2005","author":"D. Hofheinz","year":"2005","unstructured":"D. Hofheinz, D. Unruh, Comparing two notions of simulatability, in Theory of Cryptography, Proceedings of TCC 2005, ed. by J. Kilian. Lecture Notes in Computer Science (Springer, Berlin, 2005), pp.\u00a086\u2013103. Online available at \n                    http:\/\/iaks-www.ira.uka.de\/home\/unruh\/publications\/hofheinz05comparing.html"},{"key":"9127_CR24","first-page":"169","volume-title":"IEEE Symposium on Security and Privacy, Proceedings of SSP\u00a0\u201906","author":"D. Hofheinz","year":"2006","unstructured":"D. Hofheinz, D. Unruh, Simulatable security and polynomially bounded concurrent composition, in IEEE Symposium on Security and Privacy, Proceedings of SSP\u00a0\u201906 (IEEE Comput. Soc., Los Alamitos, 2006), pp.\u00a0169\u2013182. Full version online available at \n                    http:\/\/eprint.iacr.org\/2006\/130.ps"},{"key":"9127_CR25","first-page":"61","volume-title":"Proc. 4th ACM Workshop on Privacy in the Electronic Society (WPES)","author":"A. Juels","year":"2005","unstructured":"A. Juels, D. Catalano, M. Jakobsson, Coercion-resistant electronic elections, in Proc. 4th ACM Workshop on Privacy in the Electronic Society (WPES) (ACM, New York, 2005), pp.\u00a061\u201370"},{"key":"9127_CR26","first-page":"309","volume-title":"CSFW 2006, Computer Security Foundations Workshop","author":"R. K\u00fcsters","year":"2006","unstructured":"R. K\u00fcsters, Simulation-based security with inexhaustible interactive Turing machines, in CSFW 2006, Computer Security Foundations Workshop (IEEE Comput. Soc., Los Alamitos, 2006), pp.\u00a0309\u2013320. Long version available as IACR eprint 2006\/151"},{"key":"9127_CR27","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/SFCS.2003.1238213","volume-title":"44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003","author":"Y. Lindell","year":"2003","unstructured":"Y. Lindell, General composition and universal composability in secure multi-party computation, in 44th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2003 (IEEE Comput. Soc., Los Alamitos, 2003), pp. 394\u2013403. Online available at \n                    http:\/\/eprint.iacr.org\/2003\/141"},{"key":"9127_CR28","first-page":"354","volume-title":"IEEE Symposium on Security and Privacy","author":"A.C. Myers","year":"2008","unstructured":"A.C. Myers, M. Clarkson, S. Chong, Civitas: Toward a secure voting system, in IEEE Symposium on Security and Privacy (IEEE Press, New York, 2008), pp. 354\u2013368"},{"key":"9127_CR29","first-page":"184","volume-title":"IEEE Symposium on Security and Privacy, Proceedings of SSP\u00a0\u201901","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, Proceedings of SSP\u00a0\u201901 (IEEE Comput. Soc., Los Alamitos, 2001), pp.\u00a0184\u2013200. Full version online available at \n                    http:\/\/eprint.iacr.org\/2000\/066.ps"},{"key":"9127_CR30","unstructured":"R.L. Rivest, A. Shamir, D.A. Wagner, Time-lock puzzles and timed-release crypto. Technical Report MIT\/LCS\/TR-684, Massachusetts Institute of Technology, February 1996. Online available at \n                    http:\/\/theory.lcs.mit.edu\/~rivest\/RivestShamirWagner-timelock.ps"},{"key":"9127_CR31","unstructured":"D. Unruh, Protokollkomposition und Komplexit\u00e4t. Ph.D. thesis, Universit\u00e4t Karlsruhe (TH) (2006). In German, online available at \n                    http:\/\/www.infsec.cs.uni-sb.de\/~unruh\/publications\/unruh06protokollkomposition.html"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9127-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-012-9127-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9127-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9127-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:08:59Z","timestamp":1586333339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-012-9127-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,17]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9127"],"URL":"https:\/\/doi.org\/10.1007\/s00145-012-9127-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,17]]},"assertion":[{"value":"14 January 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2012","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"}]}}