{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:26:49Z","timestamp":1767929209812,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540712084","type":"print"},{"value":"9783540712091","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71209-1_41","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T22:56:34Z","timestamp":1183589794000},"page":"523-537","source":"Crossref","is-referenced-by-count":42,"title":["Searching for Shapes in Cryptographic Protocols"],"prefix":"10.1007","author":[{"given":"Shaddin F.","family":"Doghmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joshua D.","family":"Guttman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. Javier","family":"Thayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"41_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/1044731.1044735","volume":"52","author":"M. Abadi","year":"2005","unstructured":"Abadi, M., Blanchet, B.: Analyzing security protocols with secrecy types and logic programs. Journal of the ACM\u00a052(1), 102\u2013146 (2005)","journal-title":"Journal of the ACM"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-44618-4_28","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R.M. Amadio","year":"2000","unstructured":"Amadio, R.M., Lugiez, D.: On the reachability problem in cryptographic protocols. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 380\u2013394. Springer, Heidelberg (2000)"},{"key":"41_CR3","unstructured":"Backes, M., Pfitzmann, B.: Relating cryptographic and symbolic key secrecy. In: Proceedings, 26th IEEE Symposium on Security and Privacy (May 2005), Extended version, \n                    \n                      http:\/\/eprint.iacr.org\/2004\/300"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-36576-1_9","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Blanchet","year":"2003","unstructured":"Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol.\u00a02620, pp. 136\u2013152. Springer, Heidelberg (2003)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11681878_20","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2006","unstructured":"Canetti, R., Herzog, J.C.: Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 380\u2013403. Springer, Heidelberg (2006)"},{"key":"41_CR6","unstructured":"Doghmi, S.F., Guttman, J.D., Thayer, F.J.: Searching for shapes in cryptographic protocols (extended version) (November 2006), \n                    \n                      http:\/\/eprint.iacr.org\/2006\/435"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Transactions on Information Theory\u00a029, 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"41_CR8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"N. Durgin","year":"2004","unstructured":"Durgin, N., et al.: Multiset rewriting and the complexity of bounded security protocols. Journal of Computer Security\u00a012(2), 247\u2013311 (2004)","journal-title":"Journal of Computer Security"},{"issue":"3-4","key":"41_CR9","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3233\/JCS-2004-123-406","volume":"12","author":"A.D. Gordon","year":"2003","unstructured":"Gordon, A.D., Jeffrey, A.: Types and effects for asymmetric cryptographic protocols. Journal of Computer Security\u00a012(3-4), 435\u2013484 (2003)","journal-title":"Journal of Computer Security"},{"issue":"2","key":"41_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0304-3975(01)00139-6","volume":"283","author":"J.D. Guttman","year":"2002","unstructured":"Guttman, J.D., Thayer, F.J.: Authentication tests and the structure of bundles. Theoretical Computer Science\u00a0283(2), 333\u2013380 (2002), Conference version appeared in IEEE Symposium on Security and Privacy (May 2000)","journal-title":"Theoretical Computer Science"},{"key":"41_CR11","first-page":"234","volume-title":"16th Computer Security Foundations Workshop","author":"J.C. Herzog","year":"2003","unstructured":"Herzog, J.C.: The Diffie-Hellman key-agreement scheme in the strand-space model. In: 16th Computer Security Foundations Workshop, Asilomar, CA, June 2003, pp. 234\u2013247. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"41_CR12","unstructured":"ITU. Message sequence chart (MSC). Recommendation Z.120 (1999)"},{"issue":"7","key":"41_CR13","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks and the ordering of events in a distributed system. CACM\u00a021(7), 558\u2013565 (1978)","journal-title":"CACM"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/501983.502007","volume-title":"8th ACM Conference on Computer and Communications Security (CCS \u201901)","author":"J.K. Millen","year":"2001","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: 8th ACM Conference on Computer and Communications Security (CCS \u201901), pp. 166\u2013175. ACM Press, New York (2001)"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM\u00a021(12) (1978)","DOI":"10.1145\/359657.359659"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Paulson, L.C.: Relations between secrets: Two formal analyses of the Yahalom protocol. Journal of Computer Security (2001)","DOI":"10.3233\/JCS-2001-9302"},{"key":"41_CR18","volume-title":"Proceedings of the 13th IEEE Computer Security Foundations Workshop","author":"A. Perrig","year":"2000","unstructured":"Perrig, A., Song, D.X.: Looking for diamonds in the desert: Extending automatic protocol generation to three-party authentication and key agreement protocols. In: Proceedings of the 13th IEEE Computer Security Foundations Workshop, July 2000, IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"1","key":"41_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/JCS-2005-13106","volume":"13","author":"R. Ramanujam","year":"2005","unstructured":"Ramanujam, R., Suresh, S.P.: Decidability of context-explicit security protocols. Journal of Computer Security\u00a013(1), 135\u2013166 (2005), Preliminary version appeared in WITS \u201903, Workshop on Issues in the Theory of Security, Warsaw (April 2003)","journal-title":"Journal of Computer Security"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:16:51Z","timestamp":1605763011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712084","9783540712091"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_41","relation":{},"subject":[]}}