{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:21:44Z","timestamp":1738387304426,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_1","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"1-13","source":"Crossref","is-referenced-by-count":3,"title":["Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. In: 4th ACM Conference on Computer and Communications Security, pp. 36\u201347 (1997), http:\/\/www.research.digital.com\/SRC\/abadi","DOI":"10.1145\/266420.266432"},{"issue":"2","key":"1_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"J. Cryptology"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-540-30108-0_6","volume-title":"Computer Security \u2013 ESORICS 2004","author":"M. Backes","year":"2004","unstructured":"Backes, M.: A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 89\u2013108. Springer, Heidelberg (2004)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.entcs.2005.11.054","volume":"155","author":"M. Backes","year":"2006","unstructured":"Backes, M.: Real-or-random key secrecy of the Otway-Rees protocol via a symbolic security proof. Electr. Notes Theor. Comput. Sci.\u00a0155, 111\u2013145 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"#cr-split#-1_CR5.1","doi-asserted-by":"crossref","unstructured":"Burrows, M., Abadi, M., Needham, R.: A logic for authentication. DEC Systems Research Center Technical Report 39 (February 1990);","DOI":"10.1145\/74850.74852"},{"key":"#cr-split#-1_CR5.2","unstructured":"Earlier versions in the Second Conference on Theoretical Aspects of Reasoning about Knowledge, 1988, and the Twelfth ACM Symposium on Operating Systems Principles (1989)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/11863908_23","volume-title":"Computer Security \u2013 ESORICS 2006","author":"M. Backes","year":"2006","unstructured":"Backes, M., Cervesato, I., Jaggard, A.D., Scedrov, A., Tsay, J.-K.: Cryptographically sound security proofs for basic and public-key Kerberos. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol.\u00a04189, pp. 362\u2013383. Springer, Heidelberg (2006)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Backes, M., D\u00fcrmuth, M.: A cryptographically sound Dolev-Yao style security proof of an electronic payment system. CSFW, 78\u201393 (2005)","DOI":"10.1109\/CSFW.2005.5"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576. Springer, Heidelberg (1992)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: Automatic proof of strong secrecy for security protocols. In: IEEE Security and Privacy Conference, pp. 86\u2013102 (2003)","DOI":"10.1109\/SECPRI.2004.1301317"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"issue":"10","key":"1_CR11","doi-asserted-by":"publisher","first-page":"2075","DOI":"10.1109\/JSAC.2004.836016","volume":"22","author":"M. Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B.: A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol. IEEE Journal on Selected Areas in Communications\u00a022(10), 2075\u20132086 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: On the cryptographic key secrecy of the strengthened Yahalom protocol. SEC, 233\u2013245 (2006)","DOI":"10.1007\/0-387-33406-8_20"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: 10th ACM CCS (2003), http:\/\/eprint.iacr.org\/2003\/015\/","DOI":"10.1145\/948138.948140"},{"key":"1_CR14","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","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":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994), http:\/\/www-cse.ucsd.edu\/users\/mihir\/"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Security and composition of multi-party cryptographic protocols. J. Cryptology\u00a013(1) (2000)","DOI":"10.1007\/s001459910006"},{"key":"#cr-split#-1_CR17.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136???145 (2001);","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-1_CR17.2","unstructured":"Long version at IACR Eprint Archive entry 2000\/067"},{"key":"1_CR18","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. CSFW. Long version at eprint.iacr.org\/2003\/239 (2004)"},{"key":"#cr-split#-1_CR19.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Security and composition of cryptographic protocols: A tutorial. SIGACT News??37(3&4) (2006);","DOI":"10.1145\/1165555.1165570"},{"key":"#cr-split#-1_CR19.2","unstructured":"Available also at the Cryptology ePrint Archive, Report 2006\/465"},{"key":"1_CR20","unstructured":"Canetti, R., Herzog, J.: Universally composable symbolic analysis of cryptographic protocols (the case of encryption-based mutual authentication and key-exchange). In: 3rd TCC, 2006. Full version at Cryptology ePrint Archive, Report 2004\/334 (2004)"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. SIAM Journal on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR22","unstructured":"Durgin, N.A., Lincoln, P.D., Mitchell, J.C., Scedrov, A.: Undecidability of bounded security protocols. In: Workshop on Formal Methods and Security Protocols (FMSP) (1999)"},{"key":"1_CR23","unstructured":"Dodis, Y., Micali, S.: Secure computation. In: CRYPTO 2000 (2000)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Durgin, N.A., Mitchell, J.C., Pavlovic, D.: A compositional logic for protocol correctness. SCFW (2001)","DOI":"10.1109\/CSFW.2001.930150"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory\u00a02(29) (1983)","DOI":"10.1109\/TIT.1983.1056650"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O.: On the security of multi-party ping-pong protocols. In: 24th FOCS, pp. 34\u201339 (1983)","DOI":"10.1109\/SFCS.1983.42"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Fabrega, F.J.T., Herzog, J.C., Guttman, J.D.: Strand spaces: Why is a security protocol correct? In: IEEE Symposium on Security and Privacy (1998)","DOI":"10.21236\/ADA459060"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"S. Goldwasser","year":"1991","unstructured":"Goldwasser, S., Levin, L.: Fair computation of general functions in presence of immoral majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"issue":"2","key":"1_CR29","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"issue":"1","key":"1_CR30","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 Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Comput."},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: 19th Symposium on Theory of Computing (STOC), pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation. J. Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"J. Cryptology"},{"key":"1_CR33","unstructured":"K\u00fcsters, R.: Simulation based security with inexhaustible interactive Turing machines. In: 19th CSFW (2006)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Lowe, G.: Breaking and fixing the Needham-Schr\u00f6der public-key protocol using CSP and FDR. In: 2nd International Workshop on Tools and Algorithms for the construction and analysis of systems (1996)","DOI":"10.1007\/3-540-61042-1_43"},{"issue":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0743-1066(95)00095-X","volume":"26","author":"C. Meadows","year":"1996","unstructured":"Meadows, C.: The NRL protocol analyzer: An overview. J. Log. Program.\u00a026(2), 113\u2013131 (1996)","journal-title":"J. Log. Program."},{"key":"1_CR36","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"1_CR37","unstructured":"Mitchell, J.C., Mitchell, M., Stern, U.: Automated analysis of cryptographic protocols using Mur\u03d5. In: Proceedings, 1997 IEEE Symposium on Security and Privacy, pp. 141\u2013153 (1997)"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","first-page":"392","volume-title":"Advances in Cryptology 1981 - 1997","author":"S. Micali","year":"1999","unstructured":"Micali, S., Rogaway, P.: Secure computation (abstract). In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol.\u00a01440, pp. 392\u2013404. Springer, Heidelberg (1999)"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: ACM Conference on Computer and Communications Security (CCS) (2001)","DOI":"10.1145\/501983.502007"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Warinschi, B.: Soundness of formal encryption in the presence of active adversaries. In: 1st TCC, pp. 133\u2013151 (2004)","DOI":"10.1007\/978-3-540-24638-1_8"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/BFb0012891","volume-title":"9th International Conf. on Automated Deduction","author":"L.C. Paulson","year":"1988","unstructured":"Paulson, L.C.: Isabelle: the next seven hundred theorem provers (system abstract). In: 9th International Conf. on Automated Deduction. LNCS, vol.\u00a0310, pp. 772\u2013773. Springer, Heidelberg (1988), http:\/\/www.cl.cam.ac.uk\/Research\/HVG\/Isabelle\/"},{"key":"1_CR42","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"L.C. Paulson","year":"1998","unstructured":"Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security\u00a06, 85\u2013128 (1998)","journal-title":"Journal of Computer Security"},{"key":"1_CR43","unstructured":"Mitchell, J.C., Mateus, P., Scedrov, A.: Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In: 14th CONCUR, pp. 323\u2013345 (2003)"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: 7th ACM Conf. on Computer and Communication Security (CCS), pp. 245\u2013254 (2000)","DOI":"10.1145\/352600.352639"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576. Springer, Heidelberg (1992)"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Sprenger, C., Backes, M., Basin, D.A., Pfitzmann, B., Waidner, M.: Cryptographically sound theorem proving. CSFW, 153\u2013166 (2006)","DOI":"10.1109\/CSFW.2006.10"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:13:40Z","timestamp":1738325620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}