{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:03Z","timestamp":1763467923747,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029585"},{"type":"electronic","value":"9783642029592"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02959-2_27","type":"book-chapter","created":{"date-parts":[[2009,7,25]],"date-time":"2009-07-25T01:02:22Z","timestamp":1248483742000},"page":"355-370","source":"Crossref","is-referenced-by-count":14,"title":["Computing Knowledge in Security Protocols under Convergent Equational Theories"],"prefix":"10.1007","author":[{"given":"\u015etefan","family":"Ciob\u00e2c\u0103","sequence":"first","affiliation":[]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[]},{"given":"Steve","family":"Kremer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"387","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theoretical Computer Science\u00a0387(1-2), 2\u201332 (2006)","journal-title":"Theoretical Computer Science"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. 28th ACM Symp. on Principles of Programming Languages (2001)","DOI":"10.1145\/360204.360213"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-73449-9_4","volume-title":"Term Rewriting and Applications","author":"S. Anantharaman","year":"2007","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch, M.: Intruders with caps. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 20\u201335. Springer, Heidelberg (2007)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2005","unstructured":"Armando, A., et al.: The AVISPA Tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 281\u2013285. Springer, Heidelberg (2005)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Backes, M., Hritcu, C., Maffei, M.: Automated verification of remote electronic voting protocols in the applied pi-calculus. In: Proc. 21st IEEE Computer Security Foundations Symposium (CSF 2008) (2008)","DOI":"10.1109\/CSF.2008.26"},{"key":"27_CR6","volume-title":"IEEE Symposium on Security and Privacy (S&P 2008)","author":"M. Backes","year":"2008","unstructured":"Backes, M., Maffei, M., Unruh, D.: Zero-knowledge in the applied pi-calculus and automated verification of the direct anonymous attestation protocol. In: IEEE Symposium on Security and Privacy (S&P 2008). IEEE Comp. Soc. Press, Los Alamitos (2008)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: 12th ACM Conference on Computer and Communications Security (CCS 2005) (2005)","DOI":"10.1145\/1102120.1102125"},{"key":"27_CR8","unstructured":"Baudet, M.: YAPA (Yet Another Protocol Analyzer) (2008), \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~baudet\/yapa\/index.html"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009)","author":"M. Baudet","year":"2009","unstructured":"Baudet, M., Cortier, V., Delaune, S.: YAPA: A\u00a0generic tool for computing intruder knowledge. In: Treinen, R. (ed.) Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), Bras\u00edlia, Brazil, June-July 2009. LNCS. Springer, Heidelberg (to appear, 2009)"},{"key":"27_CR10","unstructured":"Chevalier, Y.: R\u00e9solution de probl\u00e8mes d\u2019accessibilit\u00e9 pour la compilation et la validation de protocoles cryptographiques. PhD thesis, Univ. Henri Poincar\u00e9 (2003)"},{"key":"27_CR11","unstructured":"Ciob\u00e2c\u0103, \u015e.: KiSs (2009), \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~ciobaca\/kiss"},{"key":"27_CR12","unstructured":"Ciob\u00e2c\u0103, \u015e., Delaune, S., Kremer, S.: Computing knowledge in security protocol under convergent equational theories. Research Report LSV-09-05, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, March 2009, 42 p. (2009)"},{"key":"27_CR13","unstructured":"Corin, R., Doumen, J., Etalle, S.: Analysing password protocol security against off-line dictionary attacks. In: Proc. 2nd International Workshop on Security Issues with Petri Nets and other Computational Models (WISP 2004). ENTCS (2004)"},{"key":"27_CR14","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-75560-9_16","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"V. Cortier","year":"2007","unstructured":"Cortier, V., Delaune, S.: Deciding knowledge in security protocols for monoidal equational theories. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 196\u2013210. Springer, Heidelberg (2007)"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JCS-2006-14101","volume":"14","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security\u00a014(1), 1\u201343 (2006)","journal-title":"Journal of Computer Security"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security (to appear, 2008)","DOI":"10.3233\/JCS-2009-0340"},{"issue":"4","key":"27_CR17","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":"27_CR18","doi-asserted-by":"crossref","unstructured":"Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: Proc. 8th ACM Conference on Computer and Communications Security (CCS 2001) (2001)","DOI":"10.1145\/501983.502007"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0030404","volume-title":"Security Protocols","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol.\u00a01361. Springer, Heidelberg (1998)"},{"key":"27_CR20","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. Theoretical Computer Science\u00a0299, 451\u2013475 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-22"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02959-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:26:47Z","timestamp":1558268807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02959-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029585","9783642029592"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02959-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}