{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:38:48Z","timestamp":1742387928974},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407539"},{"type":"electronic","value":"9783540451877"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45187-7_22","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T18:38:49Z","timestamp":1277491129000},"page":"327-349","source":"Crossref","is-referenced-by-count":20,"title":["Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus"],"prefix":"10.1007","author":[{"given":"P.","family":"Mateus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","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.: A calculus for cryptographic protocols: the spi-calculus. Information and Computation\u00a0143, 1\u201370 (1999)","journal-title":"Information and Computation"},{"issue":"2","key":"22_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). Journal of Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"Journal of Cryptology"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-45614-7_18","volume-title":"Formal Methods Europe","author":"M. Backes","year":"2002","unstructured":"Backes, M., Jacobi, C., Pfitzmann, B.: Deriving cryptographically sound implementations using composition and formally verified bisimulation. In: Formal Methods Europe. LNCS, vol.\u00a02931, pp. 310\u2013329. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Universally composable cryptographic library. Manuscript available on \n                    \n                      eprint.iacr.org\n                    \n                    \n                   as 2003\/015 (2003)","key":"22_CR4","DOI":"10.1145\/948109.948140"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","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, pp. 377\u2013391. Springer, Heidelberg (1992)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"Beaver, D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology\u00a04, 75\u2013122 (1991)","journal-title":"Journal of Cryptology"},{"key":"22_CR7","first-page":"136","volume-title":"42-nd Annual Symposium on Foundations of Computer Science (FOCS)","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42-nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013145. IEEE Press, Los Alamitos (2001), Full paper available at \n                    \n                      eprint.iacr.org\n                    \n                    \n                   as 2000\/067"},{"key":"22_CR8","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)"},{"unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable twoparty and multi-party secure computation. In: 34-th ACM Symposium on Theory of Computing, pp. 484\u2013503 (2002), Full paper available at \n                    \n                      eprint.iacr.org\n                    \n                    \n                   as 2002\/140","key":"22_CR9"},{"doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. In: Proc. 22-nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 350\u2013357 (1981)","key":"22_CR10","DOI":"10.1109\/SFCS.1981.32"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a0IT-31, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"key":"22_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge Univ. Press, Cambridge (2001)"},{"unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Vol. 2. Working Draft of Ch. 7 (2003), Available at \n                    \n                      www.wisdom.weizmann.ac.il\/~oded","key":"22_CR14"},{"key":"22_CR15","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)"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/288090.288117","volume-title":"5-th ACM Conferece on Computer and Communication Security","author":"P. Lincoln","year":"1998","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: Probabilistic polynomialtime framework for protocol analysis. In: Reiter, M. (ed.) 5-th ACM Conferece on Computer and Communication Security, pp. 112\u2013121. ACM Press, New York (1998)"},{"key":"22_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. Lincoln","year":"1999","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: Probabilistic polynomialtime equivalence and security analysis. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol.\u00a01708, pp. 776\u2013793. Springer, Heidelberg (1999)"},{"key":"22_CR18","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufman, San Francisco (1996)"},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1023\/A:1016738205696","volume":"32","author":"P. Mateus","year":"2001","unstructured":"Mateus, P., Pacheco, A., Pinto, J., Sernadas, A., Sernadas, C.: Probabilistic situation calculus. Annals of Mathematics and Artificial Intelligence\u00a032(1), 393\u2013431 (2001)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"22_CR21","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"22_CR22","first-page":"725","volume-title":"39-th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"J. Mitchell","year":"1998","unstructured":"Mitchell, J., Mitchell, M., Scedrov, A.: A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In: 39-th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 725\u2013733. IEEE Computer Society Press, Los Alamitos (1998)"},{"doi-asserted-by":"crossref","unstructured":"Mitchell, J., Ramanathan, A., Scedrov, A., Teague, V.: A probabilistic polynomial-time calculus for analysis of cryptographic protocols. Electronic Notes in Theoretical Computer Science\u00a045 (2001)","key":"22_CR23","DOI":"10.1016\/S1571-0661(04)80968-X"},{"issue":"12","key":"22_CR24","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"R. Needham","year":"1978","unstructured":"Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM\u00a021(12), 993\u2013999 (1978)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Schunter, M., Waidner, M.: Cryptographic security of reactive systems. Electronic Notes in Theoretical Computer Science\u00a032 (2000)","key":"22_CR25","DOI":"10.1016\/S1571-0661(04)00095-7"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/352600.352639","volume-title":"7-th ACM Conference on Computer and Communications Security","author":"B. Pfitzmann","year":"2000","unstructured":"Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: 7-th ACM Conference on Computer and Communications Security, pp. 245\u2013254. ACM Press, New York (2000)"},{"unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Tech. memo TR-81, Aiken Computation Laboratory, Harvard U (1981)","key":"22_CR27"},{"key":"22_CR28","volume-title":"8-th IEEE Computer Security Foundations Workshop (CSFW)","author":"A.W. Roscoe","year":"1995","unstructured":"Roscoe, A.W.: Modelling and verifying key-exchange protocols using CSP and FDR. In: 8-th IEEE Computer Security Foundations Workshop (CSFW). IEEE Computer Society Press, Los Alamitos (1995)"},{"unstructured":"Schneider, S.: Security properties and CSP. In: IEEE Symposium Security and Privacy (1996)","key":"22_CR29"},{"key":"22_CR30","first-page":"80","volume-title":"23-rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Yao","year":"1982","unstructured":"Yao, A.: Theory and applications of trapdoor functions. In: 23-rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 80\u201391. IEEE Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2003 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45187-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:15:22Z","timestamp":1558278922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45187-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407539","9783540451877"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45187-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}