{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:54:52Z","timestamp":1765486492294,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["714955"],"award-info":[{"award-number":["714955"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"FP7 Ideas: European Research Council","doi-asserted-by":"publisher","award":["645865"],"award-info":[{"award-number":["645865"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10817-020-09582-9","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T17:03:51Z","timestamp":1603299831000},"page":"479-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties"],"prefix":"10.1007","volume":"65","author":[{"given":"V\u00e9ronique","family":"Cortier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaishnavi","family":"Sundararajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Delignat-Lavaud, A., Fournet, C., Kohlweiss, M., Protzenko, J., Rastogi, A., Swamy, N., B\u00e9guelin, S.Z., Bhargavan, K., Pan, J., Zinzindohoue, J.K.: Implementing and proving the TLS 1.3 record layer. In: 2017 IEEE Symposium on Security and Privacy (S&P 2017), pp. 463\u2013482 (2017)","key":"9582_CR1","DOI":"10.1109\/SP.2017.58"},{"unstructured":"Exigences techniques et administratives applicables au vote \u00e9lectronique. Chancellerie f\u00e9d\u00e9rale ChF (2014). Swiss recommendation on e-voting","key":"9582_CR2"},{"unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: Proceedings of 14th Computer Security Foundations Workshop (CSFW\u201901). IEEE Computer Society Press (2001)","key":"9582_CR3"},{"doi-asserted-by":"crossref","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN Prover for the Symbolic Analysis of Security Protocols. In: Computer Aided Verification, 25th International Conference, CAV 2013, Princeton, USA, Proceeding. LNCS, vol. 8044, pp. 696\u2013701. Springer, Berlin (2013)","key":"9582_CR4","DOI":"10.1007\/978-3-642-39799-8_48"},{"key":"9582_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"17th International Conference on Computer Aided Verification, CAV\u20192005","author":"A Armando","year":"2005","unstructured":"Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, J., Hankes Drielsma, P., H\u00e9am, P.C., Kouchnarenko, O., Mantovani, J., M\u00f6dersheim, S., von Oheimb, D., Rusinowitch, M., Santiago, J., Turuani, M., Vigan\u00f2, L., Vigneron, L.: The AVISPA Tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S. (eds.) 17th International Conference on Computer Aided Verification, CAV\u20192005. Lecture Notes in Computer Science, vol. 3576, pp. 281\u2013285. Springer, Edinburgh (2005)"},{"issue":"1\u20132","key":"9582_CR6","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2006.08.035","volume":"367","author":"S Escobar","year":"2006","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties. Theor. Comput. Sci. 367(1\u20132), 162\u2013202 (2006)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Cremers, C.: The Scyther Tool: Verification, falsification, and analysis of security protocols. In: Proceedings 20th International Conference on Computer Aided Verification (CAV\u201908), Lecture Notes in Computer Science, pp. 414\u2013418. Springer, Berlin (2008)","key":"9582_CR7","DOI":"10.1007\/978-3-540-70545-1_38"},{"unstructured":"Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Undecidability of bounded security protocols. In: Workshop on Formal Methods and Security Protocols. Trento, Italia (1999)","key":"9582_CR8"},{"key":"9582_CR9","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. Theor. Comput. Sci. 299, 451\u2013475 (2003)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: Proceedings of 12th ACM Conference on Computer and Communications Security (CCS\u201905). ACM Press, Cambridge (2005)","key":"9582_CR10","DOI":"10.1145\/1102120.1102125"},{"doi-asserted-by":"crossref","unstructured":"Cheval, V., Kremer, S., Rakotonirina, I.: Deepsec: Deciding equivalence properties in security protocols\u2014theory and practice. In: Proceedings 39th IEEE Symposium on Security and Privacy (S&P\u201918), pp. 525\u2013542. IEEE Computer Society Press, San Francisco, CA, USA (2018)","key":"9582_CR11","DOI":"10.1109\/SP.2018.00033"},{"unstructured":"Dawson, J., Tiu, A.: Automating open bisimulation checking for the spi-calculus. In: IEEE Computer Security Foundations Symposium (CSF 2010) (2010)","key":"9582_CR12"},{"doi-asserted-by":"crossref","unstructured":"Cheval, V.: APTE: an algorithm for proving trace equivalence. In: Proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201914), LNCS, vol. 8413, pp. 587\u2013592 (2014)","key":"9582_CR13","DOI":"10.1007\/978-3-642-54862-8_50"},{"doi-asserted-by":"crossref","unstructured":"Chadha, R., Ciob\u00e2c\u0103, S., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. In: Programming Languages and Systems\u2014Proceedings of the 21th European Symposium on Programming (ESOP\u201912), LNCS, vol. 7211, pp. 108\u2013127. Springer, Berlin (2012)","key":"9582_CR14","DOI":"10.1007\/978-3-642-28869-2_6"},{"doi-asserted-by":"crossref","unstructured":"Cortier, V., Delaune, S., Dallon, A.: SAT-Equiv: an efficient tool for equivalence properties. In: Proceedings of 30th IEEE Computer Security Foundations Symposium (CSF\u201917), pp. 481\u2013494. IEEE Computer Society Press (2017)","key":"9582_CR15","DOI":"10.1109\/CSF.2017.15"},{"doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Cortier, V.: New decidability results for fragments of first-order logic and application to cryptographic protocols. In: Proceedings 14th International Conference on Rewriting Techniques and Applications (RTA\u20192003), LNCS, vol. 2706. Springer, Berlin (2003)","key":"9582_CR16","DOI":"10.1007\/3-540-44881-0_12"},{"doi-asserted-by":"crossref","unstructured":"Chr\u00e9tien, R., Cortier, V., Delaune, S.: From security protocols to pushdown automata. In: Proceedings of 40th International Colloquium on Automata, Languages and Programming (ICALP\u201913) (2013)","key":"9582_CR17","DOI":"10.1007\/978-3-642-39212-2_15"},{"doi-asserted-by":"crossref","unstructured":"Chr\u00e9tien, R., Cortier, V., Delaune, S.: Typing messages for free in security protocols: the case of equivalence properties. In: Proceedings of 25th International Conference on Concurrency Theory (CONCUR\u201914), Lecture Notes in Computer Science, vol. 8704, pp. 372\u2013386. Springer, Berlin (2014)","key":"9582_CR18","DOI":"10.1007\/978-3-662-44584-6_26"},{"doi-asserted-by":"crossref","unstructured":"Chr\u00e9tien, R., Cortier, V., Delaune, S.: Decidability of trace equivalence for protocols with nonces. In: Proceedings of 28th IEEE Computer Security Foundations Symposium (CSF\u201915), pp. 170\u2013184. IEEE Computer Society Press (2015)","key":"9582_CR19","DOI":"10.1109\/CSF.2015.19"},{"unstructured":"Lowe, G.: Towards a completeness result for model checking of security protocols. In: Proceedings of the 11th Computer Security Foundations Workshop (CSFW\u201998). IEEE Computer Society Press (1998)","key":"9582_CR20"},{"doi-asserted-by":"crossref","unstructured":"Ramanujam, R., Suresh, S.P.: Tagging makes secrecy decidable with unbounded nonces as well. In: Proceedings of 23rd Conference of Foundations of Software Technology and Theoretical Computer Science (FST&TCS\u201903), LNCS, pp. 363\u2013374. Springer, Berlin (2003)","key":"9582_CR21","DOI":"10.1007\/978-3-540-24597-1_31"},{"doi-asserted-by":"crossref","unstructured":"Dougherty, D.J., Guttman, J.D.: Decidability for lightweight Diffie\u2013Hellman protocols. In: Proceedings of 27th IEEE Symposium on Computer Security Foundations (CSF\u201914) (2014)","key":"9582_CR22","DOI":"10.1109\/CSF.2014.23"},{"doi-asserted-by":"crossref","unstructured":"Fr\u00f6schle, S.: Leakiness is decidable for well-founded protocols? In: Proceedings of 4th Conference on Principles of Security and Trust (POST\u201915), Lecture Notes in Computer Science. Springer (2015)","key":"9582_CR23","DOI":"10.1007\/978-3-662-46666-7_10"},{"issue":"1","key":"9582_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3343507","volume":"21","author":"R Chr\u00e9tien","year":"2019","unstructured":"Chr\u00e9tien, R., Cortier, V., Dallon, A., Delaune, S.: Typing messages for free in security protocols. ACM Trans Comput Log 21(1), 1 (2019)","journal-title":"ACM Trans Comput Log"},{"doi-asserted-by":"crossref","unstructured":"Cortier, V., Dallon, A., Delaune, S.: Efficiently deciding equivalence for standard primitives and phases. In: Proceedings 23rd European Symposium on Research in Computer Security (ESORICS\u201918), Lecture Notes in Computer Science. Springer, Barcelona (2018)","key":"9582_CR25","DOI":"10.1007\/978-3-319-99073-6_24"},{"doi-asserted-by":"publisher","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of 28th ACM Symposium on Principles of Programming Languages, POPL \u201901, pp. 104\u2013115. ACM (2001). https:\/\/doi.org\/10.1145\/360204.360213","key":"9582_CR26","DOI":"10.1145\/360204.360213"},{"unstructured":"Blanchet, B.: V\u00e9rification automatique de protocoles cryptographiques : mod\u00e8le formel et mod\u00e8le calculatoire. automatic verification of security protocols: formal model and computational model. M\u00e9moire d\u2019habilitation \u00e0 diriger des recherches, Universit\u00e9 Paris-Dauphine (2008). En fran\u00e7ais avec publications en anglais en annexe. In French with publications in English in appendix","key":"9582_CR27"},{"issue":"8","key":"9582_CR28","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/358722.358740","volume":"24","author":"DE Denning","year":"1981","unstructured":"Denning, D.E., Sacco, G.M.: Timestamps in key distribution protocols. Commun. ACM 24(8), 533\u2013536 (1981). https:\/\/doi.org\/10.1145\/358722.358740","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Chadha, R., Ciob\u00e2c\u0103, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. In: Proceedings of 21th European Symposium on Programming (ESOP\u201912), LNCS (2012)","key":"9582_CR29","DOI":"10.1007\/978-3-642-28869-2_6"},{"key":"9582_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the spi calculus. Inf. Comput. 148, 1\u201370 (1999)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Cortier, V., Dallon, A., Delaune, S.: Bounding the number of agents, for equivalence\u00a0too. In: Piessens, F., Vigan\u00f3, L. (eds.) Proceedings of the 5th International Conference on Principles of Security and Trust (POST\u201916), Lecture Notes in Computer Science, vol. 9635, pp. 211\u2013232. Springer, Eindhoven (2016)","key":"9582_CR31","DOI":"10.1007\/978-3-662-49635-0_11"},{"unstructured":"PKI for machine readable travel documents offering ICC read-only access. Technical report, International Civil Aviation Organization (2004)","key":"9582_CR32"},{"unstructured":"Hirschi, L., Delaune, S.: Description of some case studies. Deliverable VIP\u00a06.1, (ANR-11-JS02-0006) (2013), p. 14","key":"9582_CR33"},{"unstructured":"Cortier, V., Delaune, S., Sundararajan, V.: A decidable class of security protocols for both reachability and equivalence properties. Research report, Loria & Inria Grand Est ; Irisa (2020). https:\/\/hal.inria.fr\/hal-02446170. Supplementary material available at https:\/\/hal.inria.fr\/hal-02446170\/file\/protocol-files.zip (protocol specification and dependency graph)","key":"9582_CR34"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-020-09582-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10817-020-09582-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-020-09582-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T23:33:55Z","timestamp":1634772835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10817-020-09582-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,21]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9582"],"URL":"https:\/\/doi.org\/10.1007\/s10817-020-09582-9","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"type":"print","value":"0168-7433"},{"type":"electronic","value":"1573-0670"}],"subject":[],"published":{"date-parts":[[2020,10,21]]},"assertion":[{"value":"22 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}