{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:46:51Z","timestamp":1743144411700,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443452"},{"type":"electronic","value":"9783540458531"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45853-0_10","type":"book-chapter","created":{"date-parts":[[2007,5,4]],"date-time":"2007-05-04T00:42:13Z","timestamp":1178239333000},"page":"162-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Equal To The Task?"],"prefix":"10.1007","author":[{"given":"James","family":"Heather","sequence":"first","affiliation":[]},{"given":"Steve","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,26]]},"reference":[{"key":"10_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201996: International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 1996, Proceedings","author":"D. Coppersmith","year":"1996","unstructured":"D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter. Low-exponent RSA with related messages. Lecture Notes in Computer Science, 1070, 1996."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Danny Dolev and Andrew C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2), 1983.","DOI":"10.1109\/TIT.1983.1056650"},{"key":"10_CR3","unstructured":"M. Franklin and M. Reiter. A linear protocol failure for RSA with exponent three. 1995. Presented at the Rump Session of Crypto\u2019 95, Santa Barbara, CA."},{"key":"10_CR4","unstructured":"Joshua D. Guttman and F. Javier Thayer F\u00e1brega. Authentication Tests. In Proceedings of the 2000 IEEE Symposium on Security and Privacy. IEEE Computer Security Press, May 2000."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Joshua D. Guttman and F. Javier Thayer F\u00e1brega. Protocol Independence through Disjoint Encryption. Proceedings of 13th IEEE Computer Security Foundations Workshop, pages 24\u201334, June 2000.","DOI":"10.1109\/CSFW.2000.856923"},{"key":"10_CR6","unstructured":"James A. Heather. Exploiting a weakness of RSA. Master\u2019s thesis, Oxford University Computing Laboratory, September 1997."},{"key":"10_CR7","unstructured":"James A. Heather. \u2018Oh!... Is it really you?\u2019\u2014Using rank functions to verify authentication protocols. Department of Computer Science, Royal Holloway, University of London, December 2000."},{"key":"10_CR8","unstructured":"James A. Heather, Gavin Lowe, and Steve A. Schneider. How to avoid type flaw attacks on security protocols. Proceedings of 13th IEEE Computer Security Foundations Workshop, June 2000."},{"key":"10_CR9","unstructured":"James A. Heather and Steve A. Schneider. Towards automatic verification of authentication protocols on an unbounded network. Proceedings of 13th IEEE Computer Security Foundations Workshop, June 2000."},{"key":"10_CR10","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985."},{"key":"10_CR11","unstructured":"Ranko S. Lazi\u0107. A semantic study of data-independence with applications to the mechanical verification of concurrent systems. PhD thesis, University of Oxford, 1997."},{"key":"10_CR12","unstructured":"Ranko S. Lazi\u0107. Theorems for Mechanical Verification of Data-Independent CSP. Technical report, Oxford University Computing Laboratory, 1997."},{"key":"10_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Proceedings of TACAS","author":"G. Lowe","year":"1996","unstructured":"Gavin Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR. In Proceedings of TACAS, volume 1055 of Lecture Notes in Computer Science, pages 147\u2013166. Springer-Verlag, 1996."},{"issue":"12","key":"10_CR14","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1145\/359657.359659","volume":"21","author":"M. Roger","year":"1978","unstructured":"Roger M. Needham and Michael D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993\u2013999, December 1978.","journal-title":"Communications of the ACM"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"Ron L. Rivest, Adi Shamir, and Leonard Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"key":"10_CR16","unstructured":"A.W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall International, 1998."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"A.W. Roscoe and Philippa J. Broadfoot. Proving security protocols with model checkers by data independence techniques. Journal of Computer Security, 1999.","DOI":"10.3233\/JCS-1999-72-303"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Steve A. Schneider. Verifying authentication protocols in CSP. IEEE TSE, 24(9), September 1998.","DOI":"10.1109\/32.713329"},{"key":"10_CR19","unstructured":"Steve A. Schneider. Concurrent and real-time systems: the CSP approach. John Wiley & Sons, 1999."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Scott D. Stoller. A bound on attacks on authentication protocols. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (TCS), Kluwer, 2002.","DOI":"10.1007\/978-0-387-35608-2_48"},{"key":"10_CR21","unstructured":"F. Javier Thayer F\u00e1brega, Jonathan C. Herzog, and Joshua D. Guttman. Honest ideals on strand spaces. Proceedings of 11th IEEE Computer Security Foundations Workshop, June 1998."},{"key":"10_CR22","unstructured":"F. Javier Thayer F\u00e1brega, Jonathan C. Herzog, and Joshua D. Guttman. Strand spaces: Why is a security protocol correct? Proceedings of the 1998 IEEE Symposium on Security and Privacy, May 1998."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"F. Javier Thayer F\u00e1brega, Jonathan C. Herzog, and Joshua D. Guttman. Mixed strand spaces. Proceedings of 12th IEEE Computer Security Foundations Workshop, pages 72\u201382, June 1999.","DOI":"10.1109\/CSFW.1999.779763"},{"issue":"23","key":"10_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/JCS-1999-72-304","volume":"7","author":"F. J. T. F\u00e1brega","year":"1999","unstructured":"F. Javier Thayer F\u00e1brega, Jonathan C. Herzog, and Joshua D. Guttman. Strand spaces: Proving security protocols correct. Journal of Computer Security, 7(2,3):191\u2013230, 1999.","journal-title":"Journal of Computer Security"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2014 ESORICS 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45853-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T01:55:30Z","timestamp":1736992530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45853-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443452","9783540458531"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45853-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"26 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}