{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:38:24Z","timestamp":1725521904817},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418627"},{"type":"electronic","value":"9783540453093"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45309-1_2","type":"book-chapter","created":{"date-parts":[[2008,11,28]],"date-time":"2008-11-28T00:39:26Z","timestamp":1227832766000},"page":"23-29","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis"],"prefix":"10.1007","author":[{"given":"John C.","family":"Mitchell","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In 28th ACM Symposium on Principles of Programming Languages, pages 104\u2013115, 2001.","DOI":"10.1145\/360204.360213"},{"key":"2_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. ESOP\u201998","author":"M. Abadi","year":"1998","unstructured":"M. Abadi and A. Gordon. A bisimulation method for cryptographic protocol. In Proc. ESOP\u201998, Springer Lecture Notes in Computer Science, 1998."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"143","author":"M. Abadi","year":"1999","unstructured":"M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus. Information and Computation, 143:1\u201370, 1999. Expanded version available as SRC Research Report 149 (January 1998).","journal-title":"Information and Computation"},{"issue":"1871","key":"2_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1098\/rspa.1989.0125","volume":"426","author":"M. Burrows","year":"1989","unstructured":"M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society, Series A, 426(1871):233\u2013271, 1989. Also appeared as SRC Research Report 39 and, in a shortened form, in ACM Transactions on Computer Systems 8, 1 (February 1990), 18-36.","journal-title":"Proceedings of the Royal Society, Series A"},{"key":"2_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-CRYPTO\u2019 93","author":"M. Bellare","year":"1994","unstructured":"M. Bellare and P. Rogaway. Entity authentication and key distribution. In Advances in Cryptology-CRYPTO\u2019 93, Lecture Notes in Computer Science, Vol. 773, 1994."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"D. Dolev and A. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 2(29), 1983.","DOI":"10.1109\/TIT.1983.1056650"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31:469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR8","unstructured":"A. Freier, P. Karlton, and P. Kocher. The SSL protocol version 3.0. draft-ietf-tls-ssl-version3-00.txt, November 18 1996."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF00197942","volume":"7","author":"R. Kemmerer","year":"1994","unstructured":"R. Kemmerer, C. Meadows, and J. Millen. Three systems for cryptographic protocol analysis. J. Cryptology, 7(2):79\u2013130, 1994.","journal-title":"J. Cryptology"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"J.T. Kohl and B.C. Neuman. The Kerberos network authentication service (version 5). Internet Request For Comment RFC-1510, September 1993.","DOI":"10.17487\/rfc1510"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J.T. Kohl, B.C. Neuman, and T.Y. Ts\u2019o. The evolution of the Kerberos authentication service, pages 78\u201394. IEEE Computer Society Press, 1994.","DOI":"10.17487\/rfc1510"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"P.D. Lincoln, J.C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Conf. Computer and Communication Security, 1998.","DOI":"10.1145\/288090.288117"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"P.D. Lincoln, J.C. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security protocols. In FM\u201999 World Congress On Formal Methods in the Development of Computing Systems, 1999.","DOI":"10.1007\/3-540-48119-2_43"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR. In 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61042-1_43"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"M. Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes, Princeton University Press, 1996.","DOI":"10.1515\/9780691206844"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"C. Meadows. Analyzing the Needham-Schroeder public-key protocol: a comparison of two approaches. In Proc. European Symposium On Research In Computer Security. Springer Verlag, 1996.","DOI":"10.21236\/ADA465136"},{"key":"2_CR17","unstructured":"J.C. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols using Mur\u03d5. In Proc. IEEE Symp. Security and Privacy, pages 141\u2013151, 1997."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"J. Mitchell, M. Mitchell, and A. Scedrov. A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In IEEE Symp. Foundations of Computer Science, 1998.","DOI":"10.1109\/SFCS.1998.743523"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part i. Information and Computation, 100(1):1\u201340, 1992.","journal-title":"Information and Computation"},{"issue":"12","key":"2_CR20","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"R.M. Needham","year":"1978","unstructured":"R.M. Needham and M.D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993\u2013999, 1978.","journal-title":"Communications of the ACM"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"L.C. Paulson. Mechanized proofs for a recursive authentication protocol. In 10th IEEE Computer Security Foundations Workshop, pages 84\u201395, 1997.","DOI":"10.1109\/CSFW.1997.596790"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"L.C. Paulson. Proving properties of security protocols by induction. In 10th IEEE Computer Security Foundations Workshop, pages 70\u201383, 1997.","DOI":"10.1109\/CSFW.1997.596788"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"A. W. Roscoe. Modelling and verifying key-exchange protocols using CSP and FDR. In 8th IEEE Computer Security Foundations Workshop, pages 98\u2013107. IEEE Computer Soc Press, 1995.","DOI":"10.1109\/CSFW.1995.518556"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"S. Schneider. Security properties and CSP. In IEEE Symp. Security and Privacy, 1996.","DOI":"10.1109\/SECPRI.1996.502680"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"A. Yao. Theory and applications of trapdoor functions. In IEEE Foundations of Computer Science, pages 80\u201391, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45309-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T18:53:57Z","timestamp":1589223237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45309-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418627","9783540453093"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45309-1_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}