{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:27Z","timestamp":1725575247580},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642181771"},{"type":"electronic","value":"9783642181788"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18178-8_35","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T11:09:47Z","timestamp":1295089787000},"page":"416-429","source":"Crossref","is-referenced-by-count":1,"title":["Deciding Recognizability under Dolev-Yao Intruder Model"],"prefix":"10.1007","author":[{"given":"Zhiwei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weichao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci.\u00a0367(1), 2\u201332 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"35_CR2","first-page":"16","volume-title":"CCS 2005","author":"M. Baudet","year":"2005","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: CCS 2005, pp. 16\u201325. ACM, New York (2005)"},{"issue":"04","key":"35_CR3","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G. Birkhoff","year":"1935","unstructured":"Birkhoff, G.: On the structure of abstract algebras. Mathematical Proceedings of the Cambridge Philosophical Society\u00a031(04), 433\u2013454 (1935)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ipl.2009.11.004","volume":"110","author":"Y. Chevalier","year":"2010","unstructured":"Chevalier, Y., Rusinowitch, M.: Compiling and securing cryptographic protocols. Inf. Process. Lett.\u00a0110(3), 116\u2013122 (2010)","journal-title":"Inf. Process. Lett."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: LICS 2003, pp. 271\u2013280 (June 2003)","DOI":"10.1109\/LICS.2003.1210067"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1656242.1656244","volume":"11","author":"H. Comon-Lundh","year":"2010","unstructured":"Comon-Lundh, H., Cortier, V., Z\u0103linescu, E.: Deciding security properties for cryptographic protocols. application to key cycles. ACM Trans. Comput. Logic\u00a011(2), 1\u201342 (2010)","journal-title":"ACM Trans. Comput. Logic"},{"key":"35_CR7","first-page":"278","volume-title":"CCS 2004","author":"S. Delaune","year":"2004","unstructured":"Delaune, S., Jacquemard, F.: A decision procedure for the verification of security protocols with explicit destructors. In: CCS 2004, pp. 278\u2013287. ACM, New York (2004)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Plaisted, D.A.: Rewriting. In: Handbook of Automated Reasoning, pp. 535\u2013610 (2001)","DOI":"10.1016\/B978-044450813-3\/50011-4"},{"issue":"2","key":"35_CR9","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(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Gong, L., Needham, R., Yahalom, R.: Reasoning about belief in cryptographic protocols. In: Proc. of IEEE Symposium on Security and Privacy, pp. 238\u2013248 (1990)","DOI":"10.1109\/RISP.1990.63854"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.3233\/JCS-2003-11204","volume":"11","author":"J. Heather","year":"2003","unstructured":"Heather, J., Lowe, G., Schneider, S.: How to prevent type flaw attacks on security protocols. J. Comput. Secur.\u00a011(2), 217\u2013244 (2003)","journal-title":"J. Comput. Secur."},{"key":"35_CR12","volume-title":"Global Telecommunications Conference, . GLOBECOM 2010","author":"Z. Li","year":"2010","unstructured":"Li, Z., Wang, W.: Rethinking about type-flaw attacks. In: Global Telecommunications Conference, GLOBECOM 2010. IEEE, Los Alamitos (2010) (to appear)"},{"key":"35_CR13","unstructured":"Long, B., Fidge, C., Carrington, D.: Cross-layer verification of type flaw attacks on security protocols. In: Thirtieth Australasian Computer Science Conference, vol.\u00a062, pp. 171\u2013180 (2007)"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Long, B.W.: Formal verification of type flaw attacks in security protocols. In: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conf., p. 415 (2003)","DOI":"10.1109\/APSEC.2003.1254397"},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.3233\/JCS-2004-12104","volume":"12","author":"G. Lowe","year":"2004","unstructured":"Lowe, G.: Analysing protocols subject to guessing attacks. J. Comput. Secur.\u00a012(1), 83\u201397 (2004)","journal-title":"J. Comput. Secur."},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Meadows, C.: Identifying potential type confusion in authenticated messages. In: Proceedings of Foundations of Computer Security 2002, pp. 75\u201384 (2002)","DOI":"10.21236\/ADA465134"},{"key":"35_CR18","first-page":"62","volume-title":"CSFW 2003","author":"C. Meadows","year":"2003","unstructured":"Meadows, C.: A procedure for verifying security against type confusion attacks. In: CSFW 2003, pp. 62\u201372. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: CCS 2001, pp. 166\u2013175 (2001)","DOI":"10.1145\/501983.502007"},{"issue":"4","key":"35_CR20","doi-asserted-by":"publisher","first-page":"695","DOI":"10.3233\/JCS-2005-13404","volume":"13","author":"J. Millen","year":"2005","unstructured":"Millen, J., Shmatikov, V.: Symbolic protocol analysis with an abelian group operator or diffie\u2013hellman exponentiation. J. Comput. Secur.\u00a013(4), 695 (2005)","journal-title":"J. Comput. Secur."},{"issue":"1","key":"35_CR21","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/24592.24594","volume":"21","author":"D. Otway","year":"1987","unstructured":"Otway, D., Rees, O.: Efficient and timely mutual authentication. SIGOPS Oper. Syst. Rev.\u00a021(1), 8\u201310 (1987)","journal-title":"SIGOPS Oper. Syst. Rev."},{"issue":"1-2","key":"35_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.3233\/JCS-2001-91-203","volume":"9","author":"D.X. Song","year":"2001","unstructured":"Song, D.X., Berezin, S., Perrig, A.: Athena: a novel approach to efficient automatic security protocol analysis. J. Comput. Secur.\u00a09(1-2), 47\u201374 (2001)","journal-title":"J. Comput. Secur."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18178-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:11:21Z","timestamp":1559931081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18178-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642181771","9783642181788"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18178-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}