{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:33:38Z","timestamp":1761597218823},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_33","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"468-483","source":"Crossref","is-referenced-by-count":23,"title":["Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols"],"prefix":"10.1007","author":[{"given":"Ajith","family":"Ramanathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanessa","family":"Teague","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: 28th ACM Symposium on Principles of Programming Languages, pp. 104\u2013115 (2001)","DOI":"10.1145\/360204.360213"},{"key":"#cr-split#-33_CR2.1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the spi calculus. Information and Computation\u00a0143, 1\u201370 (1999);","DOI":"10.1006\/inco.1998.2740"},{"key":"#cr-split#-33_CR2.2","unstructured":"Expanded version available as SRC Research Report 149 (January 1998)"},{"key":"33_CR3","first-page":"19","volume-title":"Algorithms and Theory of Computation Handbook, ch. 24","year":"1999","unstructured":"Atallah, M.J. (ed.): Algorithms and Theory of Computation Handbook, ch. 24, pp. 19\u201328. CRC Press LLC, Boca Raton (1999)"},{"key":"33_CR4","unstructured":"Bellantoni, S.: Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto (1992)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D.: The decision Diffie-Hellman problem. In: Proceedings of the Third Algorithmic Number Theory Symposium, vol.\u00a01423, pp. 48\u201363 (1998)","DOI":"10.1007\/BFb0054851"},{"key":"#cr-split#-33_CR6.1","doi-asserted-by":"crossref","unstructured":"Burrows, M., Abadi, M., Needham, R.: A logic of authentication. Proceedings of the Royal Society, Series A\u00a0426, 1871, 233\u2013271 (1989);","DOI":"10.1145\/74850.74852"},{"key":"#cr-split#-33_CR6.2","doi-asserted-by":"crossref","unstructured":"Also appeared as SRC Research Report 39 and, in a shortened form, in ACM Transactions on Computer Systems 8(1), 18\u201336 (February 1990)","DOI":"10.1145\/77648.77649"},{"key":"33_CR7","doi-asserted-by":"crossref","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\/","DOI":"10.1109\/SFCS.2001.959888"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.C.-C.: On the security of public-key protocols. In: Proc. 22nd Annual IEEE Symp. Foundations of Computer Science, pp. 350\u2013357 (1981)","DOI":"10.1109\/SFCS.1981.32"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Durgin, N.A., Mitchell, J.C., Pavlovic, D.: A compositional logic for protocol correctness. In: 14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada (June 2001)","DOI":"10.1109\/CSFW.2001.930150"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a01. Cambridge University Press, Cambridge (June 2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"33_CR13","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol. 2 (June 2003), Manuscript under preparation; latest version available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/foc-vol2.html"},{"key":"33_CR14","unstructured":"Goldwasser, S., Bellare, M.: Lecture Notes on Cryptography (2003), Lecture notes for a class taught by the authors at MIT (1996\u20132001); available online at http:\/\/www.cs.nyu.edu\/courses\/fall01\/G22.3033-003\/"},{"issue":"2","key":"33_CR15","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984), Previous version in STOC 1982","journal-title":"Journal of Computer and System Sciences"},{"key":"33_CR16","unstructured":"Hofmann, M.: Type Systems for Polynomial-Time Computation. Habilitation Thesis, Darmstadt, see www.dcs.ed.ac.uk\/home\/mxh\/papers.html (1999)"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Huth, M., Kwiatkowska, M.Z.: Quantitative analysis and model checking. In: LICS 1997, pp. 111\u2013122 (1997)","DOI":"10.1109\/LICS.1997.614940"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/288090.288117","volume-title":"Proc. 5th ACM Conference on Computer and Communications Security","author":"P.D. Lincoln","year":"1998","unstructured":"Lincoln, P.D., Mitchell, J.C., Mitchell, M., Scedrov, A.: A probabilistic poly-time framework for protocol analysis. In: Reiter, M.K. (ed.) Proc. 5th ACM Conference on Computer and Communications Security, San Francisco, California, pp. 112\u2013121. ACM Press, New York (1998)"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-45187-7_22","volume-title":"CONCUR 2003 - Concurrency Theory","author":"P. Mateus","year":"2003","unstructured":"Mateus, P., Mitchell, J.C., Scedrov, A.: Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 327\u2013349. Springer, Heidelberg (2003)"},{"key":"33_CR20","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":"33_CR21","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":"33_CR22","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":"33_CR23","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"12","author":"R. Needham","year":"1978","unstructured":"Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM 21\u00a012, 993\u2013999 (1978)","journal-title":"Communications of the ACM 21"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Paulson, L.C.: Mechanized proofs for a recursive authentication protocol. In: 10th IEEE Computer Security Foundations Workshop, pp. 84\u201395 (1997)","DOI":"10.1109\/CSFW.1997.596790"},{"key":"33_CR25","doi-asserted-by":"crossref","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, Washington, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"33_CR26","unstructured":"Ramanathan, A., Mitchell, J.C., Scedrov, A., Teague, V.: A probabilistic polynomial-time calculus for the analysis of cryptographic protocols (2004), ftp:\/\/ftp.cis.upenn.edu\/pub\/papers\/scedrov\/ppc-2004-long.ps,pdf"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Schneider, S.: Security properties and CSP. In: IEEE Symposium on Security and Privacy, Oakland, California (1996)","DOI":"10.1109\/SECPRI.1996.502680"},{"key":"33_CR28","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\u00a0121(1) (August 1995)","DOI":"10.1006\/inco.1995.1123"},{"key":"33_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions. IEEE Foundations of Computer Science, 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:23:48Z","timestamp":1559345028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}