{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T05:08:08Z","timestamp":1750136888422},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245735"},{"type":"electronic","value":"9783540305767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30576-7_26","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:03:26Z","timestamp":1278270206000},"page":"476-494","source":"Crossref","is-referenced-by-count":20,"title":["On the Relationships Between Notions of Simulation-Based Security"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Datta","sequence":"first","affiliation":[]},{"given":"Ralf","family":"K\u00fcsters","sequence":"additional","affiliation":[]},{"given":"John C.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Ajith","family":"Ramanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL 2001, pp. 104\u2013115 (2001)","DOI":"10.1145\/360204.360213"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BFb0053560","volume-title":"Programming Languages and Systems","author":"M. Abadi","year":"1998","unstructured":"Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, p. 12. Springer, Heidelberg (1998)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"143","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the spi calculus. Information and Computation\u00a0143, 1\u201370 (1999); Expanded version available as SRC Research Report 149 (January 1998)","journal-title":"Information and Computation"},{"key":"26_CR4","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":"26_CR5","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: ecure asynchronous reactive systems. Technical Report 082, Eprint (2004)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Steiner, M., Waidner, M.: Polynomial fairness and liveness. In: Proceedings of 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, pp. 160\u2013174 (2002)","DOI":"10.1109\/CSFW.2002.1021814"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/10958513_7","volume-title":"Information Security","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Reactively secure signature schemes. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol.\u00a02851, pp. 84\u201395. Springer, Heidelberg (2003)"},{"key":"26_CR8","volume-title":"Proc. 42nd IEEE Symp. on the Foundations of Computer Science","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd IEEE Symp. on the Foundations of Computer Science. IEEE, Los Alamitos (2001); Full version available at http:\/\/eprint.iacr.org\/2000\/067\/"},{"key":"26_CR9","unstructured":"Canetti, R.: Personal communication (2004)"},{"key":"26_CR10","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":"26_CR11","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":"26_CR12","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 \u2013 EUROCRPYT 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 68\u201386. Springer, Heidelberg (2003)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: Proc. ACM Symp. on the Theory of Computing, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"26_CR14","unstructured":"Datta, A., K\u00fcsters, R., Mitchell, J.C., Ramanathan, A.: Sequential probabilisitic process calculus and simulation-based security (2004), Unpublished technical report at http:\/\/www.ti.informatik.uni-kiel.de\/~kuesters\/publications_html\/DattaKuestersMitchellRamanathan-TR-SPPC-2004.ps.gz"},{"key":"26_CR15","unstructured":"Datta, A., K\u00fcsters, R., Mitchell, J.C., Ramanathan, A., Shmatikov, V.: 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)"},{"key":"26_CR16","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/3-540-48119-2_43","volume-title":"FM\u201999 - Formal Methods","author":"P.D. Lincoln","year":"1999","unstructured":"Lincoln, P.D., Mitchell, J.C., Mitchell, M., Scedrov, A.: Probabilistic polynomial-time equivalence and security protocols. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol.\u00a01708, pp. 776\u2013793. Springer, Heidelberg (1999)"},{"key":"26_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)"},{"key":"26_CR19","series-title":"International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)"},{"key":"26_CR20","first-page":"725","volume-title":"Proc. 39th Annual IEEE Symposium on the Foundations of Computer Science","author":"J.C. Mitchell","year":"1998","unstructured":"Mitchell, J.C., Mitchell, M., Scedrov, A.: 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, pp. 725\u2013733. IEEE, Los Alamitos (1998)"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C., Ramanathan, A., Scedrov, A., Teague, V.: A probabilistic polynomial-time calculus for the analysis of cryptographic protocols (preliminary report). In: Brookes, S., Mislove, M. (eds.) 17th Annual Conference on the Mathematical Foundations of Programming Semantics, Arhus, Denmark, May, 2001. Electronic notes in Theoretical Computer Science, vol.\u00a045 (2001)","DOI":"10.1016\/S1571-0661(04)80968-X"},{"key":"26_CR22","first-page":"184","volume-title":"IEEE Symposium on Security and Privacy","author":"B. Pfitzmann","year":"2001","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. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Ramanathan, A., Mitchell, J.C., Scedrov, A., Teague, V.: Probabilistic bisimulation and equivalence for security analysis of network protocols (2004) (unpublished), See http:\/\/www-cs-students.stanford.edu\/~ajith\/","DOI":"10.1007\/978-3-540-24727-2_33"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-24727-2_33","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Ramanathan","year":"2004","unstructured":"Ramanathan, A., Mitchell, J.C., Scedrov, A., Teague, V.: Probabilistic bisimulation and equivalence for security analysis of network protocols. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 468\u2013483. Springer, Heidelberg (2004); Summarizes results in [23]"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30576-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:52Z","timestamp":1605759832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30576-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245735","9783540305767"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30576-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}