{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:38:19Z","timestamp":1760297899338,"version":"3.33.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T00:00:00Z","timestamp":1201651200000},"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":[[2008,10]]},"DOI":"10.1007\/s00145-008-9019-9","type":"journal-article","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T16:45:58Z","timestamp":1201625158000},"page":"492-546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["On the Relationships between Notions of\u00a0Simulation-Based Security"],"prefix":"10.1007","volume":"21","author":[{"given":"Ralf","family":"K\u00fcsters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajith","family":"Ramanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,30]]},"reference":[{"key":"9019_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, C. Fournet, Mobile values, new names, and secure communication, in 28th ACM Symposium on Principles of Programming Languages, 2001, pp. 104\u2013115","DOI":"10.1145\/373243.360213"},{"key":"9019_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BFb0053560","volume-title":"Proc. ESOP\u201998","author":"M. Abadi","year":"1998","unstructured":"M. Abadi, A.D. Gordon, A bisimulation method for cryptographic protocol, in Proc. ESOP\u201998. Lecture Notes in Computer Science, vol. 1381 (Springer, Berlin, 1998), pp. 12\u201326"},{"key":"9019_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"143","author":"M. Abadi","year":"1999","unstructured":"M. Abadi, A.D. Gordon, A calculus for cryptographic protocols: the spi calculus, Inf. Comput. 143, 1\u201370 (1999). Expanded version available as SRC research report 149, January 1998","journal-title":"Inf. Comput."},{"key":"9019_CR4","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":"Proceedings of the 1st Theory of Cryptography Conference (TCC 2004)","author":"M. Backes","year":"2004","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, A general composition theorem for secure reactive systems, in Proceedings of the 1st Theory of Cryptography Conference (TCC 2004). Lecture Notes in Computer Science, vol. 2951 (Springer, Berlin, 2004), pp. 336\u2013354"},{"key":"9019_CR5","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, Secure asynchronous reactive systems. Technical report 082, Eprint, 2004"},{"key":"9019_CR6","doi-asserted-by":"crossref","unstructured":"M. Backes, B. Pfitzmann, M. Steiner, M. Waidner, Polynomial fairness and liveness, in Proceedings of 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, 2002, pp.\u00a0160\u2013174","DOI":"10.1109\/CSFW.2002.1021814"},{"key":"9019_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/10958513_7","volume-title":"Proceedings of 6th Information Security Conference","author":"M. Backes","year":"2003","unstructured":"M. Backes, B. Pfitzmann, M. Waidner, Reactively secure signature schemes, in Proceedings of 6th Information Security Conference. Lecture Notes in Computer Science, vol. 2851 (Springer, Berlin, 2003), pp. 84\u201395"},{"key":"9019_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols. Technical report, Cryptology ePrint Archive, December 2005. Online available at http:\/\/eprint.iacr.org\/2000\/067.ps","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9019_CR9","volume-title":"Proc. 42nd IEEE Symp. on the Foundations of Computer Science","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in Proc. 42nd IEEE Symp. on the Foundations of Computer Science (IEEE, New York, 2001)"},{"key":"9019_CR10","unstructured":"R. Canetti, Personal communication, 2004"},{"key":"9019_CR11","doi-asserted-by":"crossref","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. 238\u2013253","DOI":"10.1007\/11864219_17"},{"key":"9019_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Proc. CRYPTO 2001, Santa Barbara, California","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, M. Fischlin, Universally composable commitments, in Proc. CRYPTO 2001, Santa Barbara, California. Lecture Notes in Computer Science, vol. 2139 (Springer, Berlin, 2001), pp. 19\u201340"},{"key":"9019_CR13","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\u2014EUROCRYPT 2002","author":"R. Canetti","year":"2002","unstructured":"R. Canetti, H. Krawczyk, Universally composable notions of key exchange and secure channels, in Advances in Cryptology\u2014EUROCRYPT 2002. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 337\u2013351"},{"key":"9019_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-39200-9_5","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2003","author":"R. Canetti","year":"2003","unstructured":"R. Canetti, E. Kushilevitz, Y. Lindell, On the limitations of universally composable two-party computation without set-up assumptions, in Advances in Cryptology\u2014EUROCRYPT 2003. Lecture Notes in Computer Science, vol. 2656 (Springer, Berlin, 2003), pp. 68\u201386"},{"key":"9019_CR15","doi-asserted-by":"crossref","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in Proc. ACM Symp. on the Theory of Computing, 2002, pp. 494\u2013503","DOI":"10.1145\/509907.509980"},{"key":"9019_CR16","unstructured":"A. Datta, R. K\u00fcsters, J. Mitchell, A. Ramanathan, On the relationships between notions of simulation-based security. Technical report 2006\/153, Cryptology ePrint Archive, 2006"},{"key":"9019_CR17","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":"Proceedings of the 2nd Theory of Cryptography Conference (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 Proceedings of the 2nd Theory of Cryptography Conference (TCC 2005), ed. by J.\u00a0Kilian. Lecture Notes in Computer Science, vol. 3378 (Springer, Berlin, 2005), pp. 476\u2013494"},{"key":"9019_CR18","unstructured":"A. Datta, R. K\u00fcsters, J.C. Mitchell, A. Ramanathan, V. Shmatikov, Unifying equivalence-based definitions of protocol security, in ACM SIGPLAN and IFIP WG 1.7, 4th Workshop on Issues in the Theory of Security, 2004. No formal proceedings"},{"key":"9019_CR19","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"C.A.R. Hoare, Communicating Sequential Processes (Prentice Hall, New York, 1985)"},{"key":"9019_CR20","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/CSFW.2005.22","volume-title":"18th IEEE Computer Security Foundations Workshop (CSFW-18 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 (CSFW-18 2005) (IEEE Computer Society, Los Alamitos, 2005), pp. 156\u2013169"},{"key":"9019_CR21","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, vol. 3378 (Springer, Berlin, 2005), pp. 86\u2013103"},{"key":"9019_CR22","first-page":"169","volume-title":"Proceedings of the 2006 IEEE Symposium on Security and Privacy","author":"D. Hofheinz","year":"2006","unstructured":"D. Hofheinz, D. Unruh, Simulatable security and concurrent composition, in Proceedings of the 2006 IEEE Symposium on Security and Privacy (IEEE Computer Society, Los Alamitos, 2006), pp. 169\u2013183"},{"key":"9019_CR23","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/CSFW.2006.30","volume-title":"Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19 2006)","author":"R. K\u00fcsters","year":"2006","unstructured":"R. K\u00fcsters, Simulation-based security with inexhaustible interactive Turing machines, in Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19 2006) (IEEE Computer Society, Los Alamitos, 2006), pp. 309\u2013320"},{"key":"9019_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1007\/3-540-48119-2_43","volume-title":"Formal Methods World Congress, vol.\u00a0I","author":"P.D. Lincoln","year":"1999","unstructured":"P.D. Lincoln, J.C. Mitchell, M. Mitchell, A. Scedrov, Probabilistic polynomial-time equivalence and security protocols, in Formal Methods World Congress, vol.\u00a0I, Toulouse, France, ed. by J.M.\u00a0Wing, J.\u00a0Woodcock. Lecture Notes in Computer Science, vol. 1708 (Springer, Berlin, 1999), pp. 776\u2013793"},{"key":"9019_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"R. Milner, A Calculus of Communicating Systems (Springer, Berlin, 1980)"},{"key":"9019_CR26","volume-title":"Communication and Concurrency. International Series in Computer Science","author":"R. Milner","year":"1989","unstructured":"R. Milner, Communication and Concurrency. International Series in Computer Science (Prentice Hall, New York, 1989)"},{"key":"9019_CR27","first-page":"725","volume-title":"Proc. 39th Annual IEEE Symposium on the Foundations of Computer Science","author":"J.C. Mitchell","year":"1998","unstructured":"J.C. Mitchell, M. Mitchell, A. Scedrov, A linguistic characterization of bounded oracle computation and probabilistic polynomial time, in Proc. 39th Annual IEEE Symposium on the Foundations of Computer Science, Palo Alto, California (IEEE, New York, 1998), pp. 725\u2013733"},{"key":"9019_CR28","doi-asserted-by":"crossref","unstructured":"J.C. Mitchell, A. Ramanathan, A. Scedrov, V. Teague, A probabilistic polynomial-time calculus for the analysis of cryptographic protocols (preliminary report), in 17th Annual Conference on the Mathematical Foundations of Programming Semantics, Arhus, Denmark, May, 2001, ed. by S. Brookes, M. Mislove. Electronic Notes in Theoretical Computer Science, vol.\u00a045, 2001","DOI":"10.1016\/S1571-0661(04)80968-X"},{"issue":"1\u20133","key":"9019_CR29","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2005.10.044","volume":"353","author":"J.C. Mitchell","year":"2006","unstructured":"J.C. Mitchell, A. Ramanathan, A. Scedrov, V. Teague, A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Theor. Comput. Sci. 353(1\u20133), 118\u2013164 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9019_CR30","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/SECPRI.2001.924298","volume-title":"IEEE Symposium on Security and Privacy (S&P 2001)","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 (S&P 2001) (IEEE Computer Society Press, Los Alamitos, 2001), pp. 184\u2013200"},{"key":"9019_CR31","doi-asserted-by":"crossref","unstructured":"A. Ramanathan, J.C. Mitchell, A. Scedrov, V. Teague, Probabilistic bisimulation and equivalence for security analysis of network protocols. Unpublished, see http:\/\/www-cs-students.stanford.edu\/~ajith\/ , 2004","DOI":"10.1007\/978-3-540-24727-2_33"},{"key":"9019_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/978-3-540-24727-2_33","volume-title":"FOSSACS 2004\u2014Foundations of Software Science and Computation Structures","author":"A. Ramanathan","year":"2004","unstructured":"A. Ramanathan, J.C. Mitchell, A. Scedrov, V. Teague, Probabilistic bisimulation and equivalence for security analysis of network protocols, in FOSSACS 2004\u2014Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science, vol. 2987 (Springer, Berlin, 2004), pp. 468\u2013483. Summarizes results in [31]"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9019-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-008-9019-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9019-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9019-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T10:57:05Z","timestamp":1737889025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-008-9019-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,30]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["9019"],"URL":"https:\/\/doi.org\/10.1007\/s00145-008-9019-9","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2008,1,30]]},"assertion":[{"value":"2 May 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2007","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2008","order":3,"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"}]}}