{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:34:02Z","timestamp":1725496442213},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668565"},{"type":"electronic","value":"9783540466741"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46674-6_3","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T15:50:17Z","timestamp":1196351417000},"page":"15-26","source":"Crossref","is-referenced-by-count":7,"title":["The Game of the Name in Cryptographic Tables"],"prefix":"10.1007","author":[{"given":"Roberto M.","family":"Amadio","sequence":"first","affiliation":[]},{"given":"Sanjiva","family":"Prasad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus. In Proc. ACM Computer and Comm. Security, 1997.","DOI":"10.1145\/266420.266432"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"M. Abadi and A. Gordon. A bisimulation method for cryptographic protocols. In Proc. ESOP 98, Springer Lect. Notes in Comp. Sci. 1382, 1998.","DOI":"10.1007\/BFb0053560"},{"issue":"2","key":"3_CR3","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. On the security of public key protocols. IEEE Trans. on Information Theory, 29(2):198\u2013208, 1983.","journal-title":"IEEE Trans. on Information Theory"},{"key":"3_CR4","unstructured":"A. Huima. Efficient infinite-state analysis of security protocols. In Proc. Formal methods and security protocols, FLOC Workshop, Trento, 1999."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proc. TACAS, Springer Lect. Notes in Comp. Sci. 1996, 1996.","DOI":"10.1007\/3-540-61042-1_43"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"L. Paulson. Proving properties of security protocols by induction. In Proc. IEEE Computer Security Foundations Workshop, 1997.","DOI":"10.1109\/CSFW.1997.596788"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46674-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:25:04Z","timestamp":1551140704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46674-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668565","9783540466741"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-46674-6_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}