{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:36:36Z","timestamp":1773653796455,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642107719","type":"print"},{"value":"9783642107726","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10772-6_9","type":"book-chapter","created":{"date-parts":[[2009,11,13]],"date-time":"2009-11-13T07:37:49Z","timestamp":1258097869000},"page":"101-116","source":"Crossref","is-referenced-by-count":3,"title":["Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity"],"prefix":"10.1007","author":[{"given":"Zhiyao","family":"Liang","sequence":"first","affiliation":[]},{"given":"Rakesh M.","family":"Verma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"299","key":"9_CR1","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"1-3","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theor. Comput. Sci.\u00a01-3(299), 451\u2013475 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR2","unstructured":"Turuani, M.: Web page, http:\/\/www.loria.fr\/~turuani\/"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-89862-7_6","volume-title":"Information Systems Security","author":"Z. Liang","year":"2008","unstructured":"Liang, Z., Verma, R.M.: Complexity of checking freshness of cryptographic protocols. In: Sekar, R., Pujari, A.K. (eds.) ICISS 2008. LNCS, vol.\u00a05352, pp. 86\u2013101. Springer, Heidelberg (2008)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption. ACM Transactions on Computational Logic (TOCL)\u00a09(4) (2008)","DOI":"10.1145\/1380572.1380573"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0304-3975(02)00090-7","volume":"290","author":"R.M. Amadio","year":"2003","unstructured":"Amadio, R.M., Lugiez, D., Vanack\u00e8re, V.: On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci.\u00a0290(1), 695\u2013740 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: ACM Conference on Computer and Communications Security, pp. 166\u2013175 (2001)","DOI":"10.1145\/501983.502007"},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"N.A. Durgin","year":"2004","unstructured":"Durgin, N.A., Lincoln, P., Mitchell, J.C.: Multiset rewriting and the complexity of bounded security protocols. Journal of Computer Security\u00a012(2), 247\u2013311 (2004)","journal-title":"Journal of Computer Security"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Liang, Z., Verma, R.M.: Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity. Technical Report UH-CS-09-10, Computer Science Department, University of Houston (September 2009), http:\/\/www.cs.uh.edu\/preprint","DOI":"10.1007\/978-3-642-10772-6_9"},{"key":"9_CR9","first-page":"185","volume-title":"Verification of Infinite-State Systems with Applications to Security","author":"F.L. Tiplea","year":"2006","unstructured":"Tiplea, F.L., Enea, C., Birjoveanu, C.V.: Decidability and complexity results for security protocols. In: Verification of Infinite-State Systems with Applications to Security, pp. 185\u2013211. IOS Press, Amsterdam (2006)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-540-24597-1_11","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 124\u2013135. Springer, Heidelberg (2003)"},{"issue":"1-3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.tcs.2005.01.015","volume":"338","author":"Y. Chevalier","year":"2005","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. Theor. Comput. Sci.\u00a0338(1-3), 247\u2013274 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.entcs.2004.05.019","volume":"125","author":"Y. Chevalier","year":"2005","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: Deciding the security of protocols with commuting public key encryption. Electronic Notes in Theoretical Computer Science\u00a0125(1), 55\u201366 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"9_CR13","unstructured":"Liang, Z., Verma, R.M.: A note on an NP-completeness proof for cryptographic protocol insecurity. Technical Report UH-CS-08-15, Computer Science Department, University of Houston (October 2008), http:\/\/www.cs.uh.edu\/preprint"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/CSF.2007.32","volume-title":"IEEE Computer Security Foundations Symposium 2007","author":"S. Froschle","year":"2007","unstructured":"Froschle, S.: The insecurity problem: Tackling unbounded data. In: IEEE Computer Security Foundations Symposium 2007, pp. 370\u2013384. IEEE Computer Society, Los Alamitos (2007)"},{"key":"9_CR15","unstructured":"Liang, Z., Verma, R.M.: Secrecy checking of protocols: Solution of an open problem. In: Automated Reasoning for Security Protocol Analysis (ARSPA 2007), July 2007, pp. 95\u2013112 (2007)"},{"key":"9_CR16","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":"9_CR17","doi-asserted-by":"crossref","unstructured":"Thayer, F.J., Herzog, J.C., Guttman, J.D.: Strand spaces: Proving security protocols correct. Journal of Computer Security\u00a07(1) (1999)","DOI":"10.3233\/JCS-1999-72-304"},{"issue":"1-2","key":"9_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"L.C. Paulson","year":"1998","unstructured":"Paulson, L.C.: The inductive approach to verifying cryptographic protocols. Journal of Computer Security\u00a06(1-2), 85\u2013128 (1998)","journal-title":"Journal of Computer Security"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45789-5_24","volume-title":"Static Analysis","author":"R. Corin","year":"2002","unstructured":"Corin, R., Etalle, S.: An improved constraint-based system for the verification of security protocols. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 326\u2013341. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10772-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:34:43Z","timestamp":1606185283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10772-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642107719","9783642107726"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10772-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}