{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T04:30:28Z","timestamp":1742358628620,"version":"3.40.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642273742"},{"type":"electronic","value":"9783642273759"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27375-9_12","type":"book-chapter","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T06:54:43Z","timestamp":1326178483000},"page":"205-224","source":"Crossref","is-referenced-by-count":0,"title":["Soundness of Removing Cancellation Identities in Protocol Analysis under Exclusive-OR"],"prefix":"10.1007","author":[{"given":"Sreekanth","family":"Malladi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","first-page":"122","volume-title":"Proc. IEEE Symposium on Research in Security and Privacy","author":"M. Abadi","year":"1994","unstructured":"Abadi, M., Needham, R.: Prudent Engineering Practice for Cryptographic Protocols. In: Proc. IEEE Symposium on Research in Security and Privacy, pp. 122\u2013136. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"12_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/11591191_38","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Basin","year":"2005","unstructured":"Basin, D., M\u00f6dersheim, S., Vigan\u00f2, L.: Algebraic intruder deductions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 549\u2013564. Springer, Heidelberg (2005)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-32033-3_22","volume-title":"Term Rewriting and Applications","author":"H. Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: How to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 294\u2013307. Springer, Heidelberg (2005)"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JCS-2006-14101","volume":"14","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Delaune, S., Lafourcade, P.: A of algebraic properties used in cryptographic protocols. Journal of Computer Security\u00a014(1), 1\u201343 (2006)","journal-title":"Journal of Computer Security"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Guttman, J.D., Thayer, F.J.: Protocol Independence through Disjoint Encryption. In: 13th IEEE Computer Security Foundations Workshop, pp. 24\u201334 (July 2000)","DOI":"10.1109\/CSFW.2000.856923"},{"issue":"2","key":"12_CR6","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. Journal of Computer Security\u00a011(2), 217\u2013244 (2003)","journal-title":"Journal of Computer Security"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45853-0_10","volume-title":"Computer Security - ESORICS 2002","author":"J. Heather","year":"2002","unstructured":"Heather, J., Schneider, S.: Equal to the task? In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 162\u2013177. Springer, Heidelberg (2002)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T.: Reducing protocol analysis with xor to the xor-free case in the horn theory based approach. In: ACM Conference on Computer and Communications Security, pp. 129\u2013138 (2008)","DOI":"10.1145\/1455770.1455788"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2004.05.018","volume":"125","author":"C. Lynch","year":"2005","unstructured":"Lynch, C., Meadows, C.: On the relative soundness of the free algebra model for public key encryption. Electr. Notes Theor. Comput. Sci.\u00a0125(1), 43\u201354 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"2-3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.3233\/JCS-1999-72-302","volume":"7","author":"G. Lowe","year":"1999","unstructured":"Lowe, G.: Towards a completeness result for model checking of security protocols. Journal of Computer Security\u00a07(2-3), 89\u2013146 (1999)","journal-title":"Journal of Computer Security"},{"key":"12_CR11","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. Journal of Computer Security\u00a012, 83\u201398 (2004)","journal-title":"Journal of Computer Security"},{"key":"12_CR12","unstructured":"Malladi, S.: Protocol independence through disjoint encryption under exclusive-or. In: Workshop on Foundations of Computer Security and Privacy, FCSPrivMod (2010)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3233\/JCS-1992-1102","volume":"1","author":"C. Meadows","year":"1992","unstructured":"Meadows, C.: Applying formal methods to the analysis of a key management protocol. Journal of Computer Security\u00a01(1), 5\u201336 (1992)","journal-title":"Journal of Computer Security"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-61770-1_46","volume-title":"Computer Security - ESORICS 96","author":"C. Meadows","year":"1996","unstructured":"Meadows, C.: Analyzing the Needham-Schroeder public-key protocol: A comparison of two approaches. In: Bertino, E., Kurth, H., Martella, G., Montolivo, E. (eds.) ESORICS 1996. LNCS, vol.\u00a01146, pp. 351\u2013364. Springer, Heidelberg (1996)"},{"key":"12_CR15","volume-title":"FMSE 2003: Formal Methods in Security Engineering","author":"C. Meadows","year":"2003","unstructured":"Meadows, C.: Towards a hierarchy of cryptographic protocol specifications. In: FMSE 2003: Formal Methods in Security Engineering. ACM Press, New York (2003)"},{"issue":"6","key":"12_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0020-0190(03)00211-4","volume":"86","author":"J. Millen","year":"2003","unstructured":"Millen, J.: On the Freedom of Decryption. Information Processing Letters\u00a086(6), 329\u2013333 (2003)","journal-title":"Information Processing Letters"},{"key":"12_CR17","unstructured":"Malladi, S., Lafourcade, P.: How to prevent type-flaw attacks under algebraic properties. In: Workshop on Security and Rewriting Techniques, Affiliated to CSF 2009 (July 2009)"},{"key":"12_CR18","first-page":"166","volume-title":"Proc. ACM Conference on Computer and Communication Security","author":"J. Millen","year":"2001","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. ACM Conference on Computer and Communication Security, pp. 166\u2013175. ACM Press, New York (2001)"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(97)00180-4","volume":"65","author":"P.Y.A. Ryan","year":"1998","unstructured":"Ryan, P.Y.A., Schneider, S.A.: An attack on a recursive authentication protocol. a cautionary tale. Inf. Process. Lett.\u00a065(1), 7\u201310 (1998)","journal-title":"Inf. Process. Lett."},{"key":"12_CR20","doi-asserted-by":"publisher","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, 135\u2013165 (2005)","journal-title":"Journal of Computer Security"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Sasse, R., Escobar, S., Meadows, C., Meseguer, J.: Protocol analysis modulo combination of theories: A case study in maude-npa. To Appear, Sixth International Workshop on Security and Trust Management (STM). ERCIM (European Research Consortium in Informatics and Mathematics) (2010)","DOI":"10.1007\/978-3-642-22444-7_11"},{"key":"12_CR22","first-page":"160","volume-title":"Proc. IEEE Symposium on Research in Security and Privacy","author":"F.J. Thayer","year":"1998","unstructured":"Thayer, F.J., Herzog, J.C., Guttman, J.D.: Strand spaces: Why is a security protocol correct? In: Proc. IEEE Symposium on Research in Security and Privacy, pp. 160\u2013171. IEEE Computer Society Press, Los Alamitos (1998)"}],"container-title":["Lecture Notes in Computer Science","Theory of Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27375-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T17:26:53Z","timestamp":1742318813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27375-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642273742","9783642273759"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27375-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}