{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:02:10Z","timestamp":1725544930269},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327318"},{"type":"electronic","value":"9783540327325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_19","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T02:41:35Z","timestamp":1141094495000},"page":"360-379","source":"Crossref","is-referenced-by-count":16,"title":["Games and the Impossibility of Realizable Ideal Functionality"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ante","family":"Derek","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"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: Security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"key":"19_CR2","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":"19_CR3","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, p. 136 (2001), Full version available at, http:\/\/eprint.iacr.org\/"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mitchell, J.C., Mitchell, M., Scedrov, A.: A probabilistic poly-time framework for protocol analysis. In: ACM Conference on Computer and Communications Security, pp. 112\u2013121 (1998)","DOI":"10.1145\/288090.288117"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: ACM Conference on Computer and Communications Security, pp. 245\u2013254 (2000)","DOI":"10.1145\/352600.352639"},{"key":"19_CR6","first-page":"220","volume-title":"CCS 2003: Proceedings of the 10th ACM conference on Computer and communications security","author":"M. Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: CCS 2003: Proceedings of the 10th ACM conference on Computer and communications security, pp. 220\u2013230. ACM Press, New York (2003)"},{"key":"19_CR7","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":"19_CR8","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332 (2004), http:\/\/eprint.iacr.org\/2004\/332"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-30144-8_6","volume-title":"Information Security","author":"M. Backes","year":"2004","unstructured":"Backes, M., Hofheinz, D.: How to break and repair a universally composable signature functionality. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol.\u00a03225, pp. 61\u201372. Springer, Heidelberg (2004)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/CSFW.2004.1310743","volume-title":"CSFW 2004: Proceedings of the 17th IEEE Computer Security Foundations Workshop","author":"R. Canetti","year":"2004","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: CSFW 2004: Proceedings of the 17th IEEE Computer Security Foundations Workshop, pp. 219\u2013233. IEEE Computer Society, Los Alamitos (2004)"},{"issue":"1","key":"19_CR11","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":"19_CR12","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2000)"},{"key":"19_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 - 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":"19_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 \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":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of key-exchange protocols and their use for building secure channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 453\u2013474. Springer, Heidelberg (2001)"},{"key":"19_CR16","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":"19_CR17","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. International Journal on Information and Computation 121(1) (1995)","DOI":"10.1006\/inco.1995.1123"},{"key":"19_CR18","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)"},{"key":"19_CR19","first-page":"725","volume-title":"FOCS 1998: Proceedings of the 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: FOCS 1998: Proceedings of the 39th Annual IEEE Symposium on the Foundations of Computer Science, pp. 725\u2013733. IEEE Computer Society, Los Alamitos (1998)"},{"key":"19_CR20","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 polynomialtime 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":"19_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: 17th Annual Conference on the Mathematical Foundations of Programming Semantics. Electronic notes in Theoretical Computer Science, vol.\u00a045 (2001)","DOI":"10.1016\/S1571-0661(04)80968-X"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Ramanathan, A., Mitchell, J.C., Scedrov, A., Teague, V.: Probabilistic bisimulation and equivalence for security analysis of network protocols (unpublished, 2003), http:\/\/www-cs-students.stanford.edu\/~ajith\/","DOI":"10.1007\/978-3-540-24727-2_33"},{"key":"19_CR23","unstructured":"Datta, A., K\u00fcsters, R., Mitchell, J.C., Ramanathan, A., Shmatikov, V.: Unifying equivalence-based definitions of protocol security. In: 2004 IFIP WG 1.7, ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security (WITS 2004) (2004)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-30576-7_26","volume-title":"Theory of Cryptography","author":"A. Datta","year":"2005","unstructured":"Datta, A., K\u00fcsters, R., Mitchell, J.C., Ramanathan, A.: On the relationships between notions of simulation-based security. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 476\u2013494. Springer, Heidelberg (2005)"},{"key":"19_CR25","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, vol.\u00a02332, pp. 337\u2013351. Springer, Heidelberg (2002)"},{"key":"19_CR26","first-page":"494","volume-title":"STOC 2002: Proceedings of the 34th annual ACM symposium on Theory of computing","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable twoparty and multi-party secure computation. In: STOC 2002: Proceedings of the 34th annual ACM symposium on Theory of computing, pp. 494\u2013503. ACM Press, New York (2002)"},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/CSFW.2004.1310742","volume-title":"CSFW 2004: Proceedings of the 17th IEEE Computer Security Foundations Workshop","author":"M. Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B.: Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In: CSFW 2004: Proceedings of the 17th IEEE Computer Security Foundations Workshop, pp. 204\u2013218. IEEE Computer Society, Los Alamitos (2004)"},{"key":"19_CR29","first-page":"196","volume-title":"CCS 2001: Proceedings of the 8th ACM Conference on Computer and Communications Security","author":"P. Rogaway","year":"2001","unstructured":"Rogaway, P., Bellare, M., Black, J., Krovetz, T.: OCB: A block-cipher mode of operation for efficient authenticated encryption. In: CCS 2001: Proceedings of the 8th ACM Conference on Computer and Communications Security, pp. 196\u2013205. ACM Press, New York (2001)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 614\u2013629. Springer, Heidelberg (2003)"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46035-7_8","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"U.M. Maurer","year":"2002","unstructured":"Maurer, U.M.: Indistinguishability of random systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 110\u2013132. Springer, Heidelberg (2002)"},{"key":"19_CR32","first-page":"242","volume-title":"STOC 2004: Proceedings of the 36th annual ACM symposium on Theory of computing","author":"M. Prabhakaran","year":"2004","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: Achieving universal composability without trusted setup. In: STOC 2004: Proceedings of the 36th annual ACM symposium on Theory of computing, pp. 242\u2013251. ACM Press, New York (2004)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-30576-7_7","volume-title":"Theory of Cryptography","author":"M. Prabhakaran","year":"2005","unstructured":"Prabhakaran, M., Sahai, A.: Relaxing environmental security: Monitored functionalities. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 104\u2013127. Springer, Heidelberg (2005)"},{"key":"19_CR34","doi-asserted-by":"publisher","first-page":"423","DOI":"10.3233\/JCS-2005-13304","volume":"13","author":"A. Datta","year":"2005","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: A derivation system and compositional logic for security protocols. Journal of Computer Security\u00a013, 423\u2013482 (2005)","journal-title":"Journal of Computer Security"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"He, C., Sundararajan, M., Datta, A., Derek, A., Mitchell, J.C.: A modular correctness proof of TLS and IEEE 802.11i. In: ACM Conference on Computer and Communications Security (2005)","DOI":"10.1145\/1102120.1102124"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:45Z","timestamp":1619493405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11681878_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}