{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:18Z","timestamp":1725564558295},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208037"},{"type":"electronic","value":"9783540246220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24622-0_3","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:33:53Z","timestamp":1283672033000},"page":"16-29","source":"Crossref","is-referenced-by-count":0,"title":["History-Dependent Scheduling for Cryptographic Processes"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Vanack\u00e8re","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-44618-4_28","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R. Amadio","year":"2000","unstructured":"Amadio, R., Lugiez, D.: On the reachability problem in cryptographic protocols. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, p. 380. Springer, Heidelberg (2000), Also RR-INRIA 3915"},{"key":"#cr-split#-3_CR2.1","unstructured":"Amadio, R., Lugiez, D., Vanack??re, V.: On the symbolic reduction of processes with cryptographic functions. RR-INRIA 4147 (March 2001);"},{"key":"#cr-split#-3_CR2.2","doi-asserted-by":"crossref","unstructured":"Revised version in Theoretical Computer Science 290(1), 695???740 (2003)","DOI":"10.1016\/S0304-3975(02)00090-7"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Basin, D., M\u00f6dersheim, S., Vigan\u00f2, L.: Constraint Differentiation: A New Reduction Technique for Constraint-Based Analysis of Security Protocols. Technical Report 405, Dep. of Computer Science, ETH Zurich (2003)","DOI":"10.1145\/948109.948154"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/3-540-48224-5_55","volume-title":"Automata, Languages and Programming","author":"M. Boreale","year":"2001","unstructured":"Boreale, M.: Symbolic Trace Analysis of Cryptographic Protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, p. 667. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. on Information Theory"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. LNCS, vol.\u00a01032. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-60761-7"},{"key":"3_CR7","unstructured":"Huima, A.: Efficient infinite-state analysis of security protocols. In: Proc. Formal methods and security protocols, FLOC Workshop, Trento (1999)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Lowe, G.: A hierarchy of authentication specifications. In: Proc. 10th IEEE Computer Security Foundations Workshop (1997)","DOI":"10.1109\/CSFW.1997.596782"},{"key":"3_CR9","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. RR INRIA 4134 (March 2001)"},{"key":"3_CR10","unstructured":"Vanack\u00e8re, V.: The TRUST protocol analyser, automatic and efficient verification of cryptographic protocols. In: VERIFY 2002 Workshop, Copenhagen (2002)"},{"key":"3_CR11","unstructured":"http:\/\/www.cmi.univ-mrs.fr\/~vvanacke\/trust\/"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24622-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T01:20:59Z","timestamp":1685755259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24622-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208037","9783540246220"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24622-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}