{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:49:30Z","timestamp":1727063370954},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_11","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"102-113","source":"Crossref","is-referenced-by-count":6,"title":["A dexptime-Complete Dolev-Yao Theory with Distributive Encryption"],"prefix":"10.1007","author":[{"given":"A.","family":"Baskar","sequence":"first","affiliation":[]},{"given":"R.","family":"Ramanujam","sequence":"additional","affiliation":[]},{"given":"S. P.","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-77505-8_12","volume-title":"Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues","author":"V. Bernat","year":"2008","unstructured":"Bernat, V., Comon-Lundh, H.: Normal proofs in intruder theories. In: Okada, M., Satoh, I. (eds.) ASIAN 2006. LNCS, vol.\u00a04435, pp. 151\u2013166. Springer, Heidelberg (2008)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR 1997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: Knowledge-based modelling of voting protocols. In: Proc. of TARK XI, pp. 62\u201371 (2007)","DOI":"10.1145\/1324249.1324261"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: A dexptime-complete Dolev-Yao theory with distributive encryption. Technical report (May 2010) http:\/\/www.cmi.ac.in\/~spsuresh\/pdffiles\/mfcs2010-tr.pdf","DOI":"10.1007\/978-3-642-15155-2_11"},{"key":"11_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder Deductions, Constraint Solving and Insecurity Decisions in Presence of Exclusive or. In: Proc. LICS 18, June 2003, pp. 271\u2013280 (2003)","DOI":"10.1109\/LICS.2003.1210067"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Cortier, V., Rusinowitch, M., Zalinescu, E.: A resolution strategy for verifying cryptographic protocols with cbc encryption and blind signatures. In: PPDP, pp. 12\u201322 (2005)","DOI":"10.1145\/1069774.1069776"},{"issue":"4","key":"11_CR8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3233\/JCS-2009-0340","volume":"17","author":"S. Delaune","year":"2009","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security\u00a017(4), 435\u2013487 (2009)","journal-title":"Journal of Computer Security"},{"key":"11_CR9","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 Transactions on Information Theory\u00a029, 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: ASIACRYPT, pp. 244\u2013251 (1992)","DOI":"10.1007\/3-540-57220-1_66"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. Technical report, CNET-France Telecom (1999)","DOI":"10.1007\/10721959_21"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1007\/3-540-45591-4_134","volume-title":"Parallel and Distributed Processing","author":"J. Goubault-Larrecq","year":"2000","unstructured":"Goubault-Larrecq, J.: A method for automatic cryptographic protocol verification. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol.\u00a01800, pp. 977\u2013984. Springer, Heidelberg (2000)"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.ic.2006.10.008","volume":"205","author":"P. Lafourcade","year":"2007","unstructured":"Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for the equational theory of abelian groups with distributive encryption. Information and Computation\u00a0205(4), 581\u2013623 (2007)","journal-title":"Information and Computation"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-48294-6_10","volume-title":"Static Analysis","author":"D. Monniaux","year":"1999","unstructured":"Monniaux, D.: Abstracting cryptographic protocols with tree automata. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 149\u2013163. Springer, Heidelberg (1999)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"299","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol Insecurity with Finite Number of Sessions and Composed Keys is NP-complete. TCS\u00a0299, 451\u2013475 (2003)","journal-title":"TCS"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11901914_13","volume-title":"Automated Technology for Verification and Analysis","author":"D. Suwimonteerabuth","year":"2006","unstructured":"Suwimonteerabuth, D., Schwoon, S., Esparza, J.: Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 141\u2013153. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:32Z","timestamp":1606186892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}