{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:40:52Z","timestamp":1725550852507},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008989"},{"type":"electronic","value":"9783540365778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36577-x_21","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:04Z","timestamp":1269897124000},"page":"284-298","source":"Crossref","is-referenced-by-count":4,"title":["A New Knowledge Representation Strategy for Cryptographic Protocol Analysis"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Cibrario B.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Durante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Sisto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriano","family":"Valenzano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, and A. D. Gordon, \u201cA Calculus for Cryptographic Protocols The Spi Calculus\u201d, Digital Research Report, vol. 149, January 1998, pp. 1\u2013110.","DOI":"10.1006\/inco.1998.2740"},{"key":"21_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/3-540-44618-4_28","volume-title":"On the Reachability Problem in Cryptographic Protocols","author":"R. Amadio","year":"2000","unstructured":"R. Amadio, and D. Lugiez, \u201cOn the Reachability Problem in Cryptographic Protocols\u201d, Proc. of CONCUR\u20192000, LNCS 1877, pp. 380\u2013394, Springer-Verlag, 2000."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"M. Boreale, R. De Nicola, and R. Pugliese, \u201cProof Techniques for Cryptographic Processes\u201d, Proc. of the 14th IEEE Symposium Logic In Computer Science (LICS\u201999), IEEE Computer Society Press, pp. 157\u2013166, 1999.","DOI":"10.1109\/LICS.1999.782608"},{"key":"21_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/3-540-48224-5_55","volume-title":"Symbolic Trace Analysis of Cryptographic Protocols","author":"M. Boreale","year":"2001","unstructured":"M. Boreale, \u201cSymbolic Trace Analysis of Cryptographic Protocols\u201d, In Proc. 28th ICALP, Vol. 2076 of Lecture Notes in Computer Science, Springer-Verlag, pp. 667\u2013681, 2001."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"E. M. Clarke, S. Jha, and W. Marrero, \u201cUsing state space exploration and a natural deduction style message derivation engine to verify security protocols\u201d, Proc. of IFIP PROCOMET, Chapman & Hall, London, 1998, pp. p.87\u2013106.","DOI":"10.1007\/978-0-387-35358-6_10"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1145\/363516.363528","volume":"9","author":"E. M. Clarke","year":"2000","unstructured":"E. M. Clarke, S. Jha, and W. Marrero, \u201cVerifying security protocols with Brutus\u201d, ACM Trans. on Software Engineering and Methodology Vol. 9, No. 4, October 2000, pp. 443\u2013487.","journal-title":"ACM Trans. on Software Engineering and Methodology"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"D. Dolev, and A. Yao, \u201cOn the security of public key protocols\u201d, IEEE Transactions on Information Theory, 29(2):198\u2013208, 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"L. Durante, R. Sisto, and A. Valenzano, \u201cA state-exploration technique for spicalculus testing equivalence verification\u201d, Proc. of FORTE\/PSTV 2000, Pisa, October 2000, pp. 155\u2013170.","DOI":"10.1007\/978-0-387-35533-7_10"},{"key":"21_CR9","unstructured":"L. Durante, R. Sisto, and A. Valenzano, \u201cAutomatic testing equivalence verification of spi-calculs specifications\u201d, Politecnico di Torino I.R. DAI\/ARC 1-02."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"M. Fiore, and M. Abadi, \u201cComputing Symbolic Models for Verifying Cryptographic Protocols\u201d, Proc. of 14th IEEE Computer Security Foundations Workshop, pp. 160\u2013173, June 2001.","DOI":"10.1109\/CSFW.2001.930144"},{"key":"21_CR11","unstructured":"A. Huima, \u201cEfficient Infinite-State Analysis of Security Protocols\u201d, Proc. of FLOC Workshop on Formal Methods and Security Protocols, 1999."},{"key":"21_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Breaking and fixing the Needham-Schroeder public-key protocol using FDR","author":"G. Lowe","year":"1996","unstructured":"G. Lowe, \u201cBreaking and fixing the Needham-Schroeder public-key protocol using FDR\u201d, Proc. of TACAS\u201997, Springer LNCS 1055, 1996."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/151261.151265","volume":"40","author":"D. A. McAllester","year":"1993","unstructured":"D. A. McAllester, \u201cAutomatic Recognition of Tractability in Inference Relations\u201d, Journal of the ACM, Vol. 40, No. 2, April 1993, pp. 284\u2013303.","journal-title":"Journal of the ACM"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"J. Millen, and V. Shmatikov, \u201cConstraint solving for Bounded-Process Cryptographic Protocol Analysis\u201d, 8th ACM Conference on Computer and Communication Security, pages 166\u2013175, November 2001.","DOI":"10.1145\/501983.502007"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner, J. Parrow, and D. Walker, \u201cA Calculus of mobile processes, parts I and II\u201d, Information and Computation, pages 1\u201340 and 41-77, September 1992.","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/JCS-1998-61-205","volume":"6","author":"L. C. Paulson","year":"1998","unstructured":"L. C. Paulson, \u201cThe inductive approach to verifying cryptographic protocols\u201d, Journal of Computer Security, Vol. 6, pp. 85\u2013128, 1998.","journal-title":"Journal of Computer Security"},{"key":"21_CR17","unstructured":"D. Prawitz, \u201cNatural Deduction: A Proof-Theoretical Study\u201d, Almqvist & Wiskell, 1965."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36577-X_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T18:49:48Z","timestamp":1558982988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36577-X_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008989","9783540365778"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36577-x_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}