<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-02961617</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-18T16:56:14+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The hitchhiker's guide to decidability and complexity of equivalence properties in security protocols</title>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>Cheval</surname>
              </persName>
              <email type="md5">1c9b4a98a937f47343e869ef4b39cf5c</email>
              <email type="domain">loria.fr</email>
              <idno type="idhal" notation="string">vincent-cheval</idno>
              <idno type="idhal" notation="numeric">15039</idno>
              <idno type="halauthorid" notation="string">18981-15039</idno>
              <idno type="IDREF">https://www.idref.fr/169363724</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3622-2129</idno>
              <idno type="ARXIV">https://arxiv.org/a/cheval_v_1</idno>
              <idno type="GOOGLE SCHOLAR">VOPOvoYAAAAJ</idno>
              <affiliation ref="#struct-445522"/>
              <affiliation ref="#struct-206040"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Steve</forename>
                <surname>Kremer</surname>
              </persName>
              <email type="md5">55a1c2b4f55635fa55fbf4e1fdc9f1e9</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">steve-kremer</idno>
              <idno type="idhal" notation="numeric">1307</idno>
              <idno type="halauthorid" notation="string">13407-1307</idno>
              <idno type="IDREF">https://www.idref.fr/153809027</idno>
              <idno type="ORCID">https://orcid.org/0009-0004-6946-0678</idno>
              <affiliation ref="#struct-445522"/>
              <affiliation ref="#struct-206040"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Itsaka</forename>
                <surname>Rakotonirina</surname>
              </persName>
              <email type="md5">cf0d9b7c2dc7fdc2133e4ee74a424182</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">itsaka-rakotonirina</idno>
              <idno type="idhal" notation="numeric">176923</idno>
              <idno type="halauthorid" notation="string">30431-176923</idno>
              <idno type="IDREF">https://www.idref.fr/253136326</idno>
              <affiliation ref="#struct-445522"/>
              <affiliation ref="#struct-206040"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Steve</forename>
                <surname>Kremer</surname>
              </persName>
              <email type="md5">55a1c2b4f55635fa55fbf4e1fdc9f1e9</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-43575"/>
            <funder ref="#projeurop-98976"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-10-08 15:41:09</date>
              <date type="whenWritten">2020</date>
              <date type="whenModified">2025-11-04 12:00:30</date>
              <date type="whenReleased">2020-10-12 15:47:52</date>
              <date type="whenProduced">2020</date>
              <date type="whenEndEmbargoed">2020-10-08</date>
              <ref type="file" target="https://inria.hal.science/hal-02961617v1/document">
                <date notBefore="2020-10-08"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02961617v1/file/main.pdf" id="file-2961617-2608606">
                <date notBefore="2020-10-08"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="165868">
                <persName>
                  <forename>Steve</forename>
                  <surname>Kremer</surname>
                </persName>
                <email type="md5">55a1c2b4f55635fa55fbf4e1fdc9f1e9</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02961617</idno>
            <idno type="halUri">https://inria.hal.science/hal-02961617</idno>
            <idno type="halBibtex">cheval:hal-02961617</idno>
            <idno type="halRefHtml">Nigam, V., Ban Kirigin, T., Talcott, C., Guttman, J., Kuznetsov, S., Thau Loo, B., Okada, M. &lt;i&gt;Logic, Language, and Security - Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday&lt;/i&gt;, LNCS-12300, Springer, 2020, Lecture Notes in Computer Science, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-62077-6_10"&gt;&amp;#x27E8;10.1007/978-3-030-62077-6_10&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Nigam, V., Ban Kirigin, T., Talcott, C., Guttman, J., Kuznetsov, S., Thau Loo, B., Okada, M. Logic, Language, and Security - Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday, LNCS-12300, Springer, 2020, Lecture Notes in Computer Science, &amp;#x27E8;10.1007/978-3-030-62077-6_10&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2961617-2608606"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="LORIA-FM" corresp="LORIA">Department of Formal methods</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The hitchhiker's guide to decidability and complexity of equivalence properties in security protocols</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>Cheval</surname>
                  </persName>
                  <email type="md5">1c9b4a98a937f47343e869ef4b39cf5c</email>
                  <email type="domain">loria.fr</email>
                  <idno type="idhal" notation="string">vincent-cheval</idno>
                  <idno type="idhal" notation="numeric">15039</idno>
                  <idno type="halauthorid" notation="string">18981-15039</idno>
                  <idno type="IDREF">https://www.idref.fr/169363724</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3622-2129</idno>
                  <idno type="ARXIV">https://arxiv.org/a/cheval_v_1</idno>
                  <idno type="GOOGLE SCHOLAR">VOPOvoYAAAAJ</idno>
                  <affiliation ref="#struct-445522"/>
                  <affiliation ref="#struct-206040"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Steve</forename>
                    <surname>Kremer</surname>
                  </persName>
                  <email type="md5">55a1c2b4f55635fa55fbf4e1fdc9f1e9</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">steve-kremer</idno>
                  <idno type="idhal" notation="numeric">1307</idno>
                  <idno type="halauthorid" notation="string">13407-1307</idno>
                  <idno type="IDREF">https://www.idref.fr/153809027</idno>
                  <idno type="ORCID">https://orcid.org/0009-0004-6946-0678</idno>
                  <affiliation ref="#struct-445522"/>
                  <affiliation ref="#struct-206040"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Itsaka</forename>
                    <surname>Rakotonirina</surname>
                  </persName>
                  <email type="md5">cf0d9b7c2dc7fdc2133e4ee74a424182</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">itsaka-rakotonirina</idno>
                  <idno type="idhal" notation="numeric">176923</idno>
                  <idno type="halauthorid" notation="string">30431-176923</idno>
                  <idno type="IDREF">https://www.idref.fr/253136326</idno>
                  <affiliation ref="#struct-445522"/>
                  <affiliation ref="#struct-206040"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Logic, Language, and Security - Essays Dedicated to Andre Scedrov on the Occasion of His 65th Birthday</title>
                <editor>Nigam</editor>
                <editor>V.</editor>
                <editor>Ban Kirigin</editor>
                <editor>T.</editor>
                <editor>Talcott</editor>
                <editor>C.</editor>
                <editor>Guttman</editor>
                <editor>J.</editor>
                <editor>Kuznetsov</editor>
                <editor>S.</editor>
                <editor>Thau Loo</editor>
                <editor>B.</editor>
                <editor>Okada</editor>
                <editor>M.</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">LNCS-12300</biblScope>
                  <date type="datePub">2020</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-62077-6_10</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</classCode>
              <classCode scheme="halTypology" n="COUV">Book sections</classCode>
              <classCode scheme="halOldTypology" n="COUV">Book sections</classCode>
              <classCode scheme="halTreeTypology" n="COUV">Book sections</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Privacy-preserving security properties in cryptographic protocols are typically modelled by observational equivalences in process calculi such as the applied pi-calulus. We survey decidability and complexity results for the automated verification of such equivalences, casting existing results in a common framework which allows for a precise comparison. This unified view, beyond providing a clearer insight on the current state of the art, allowed us to identify some variations in the statements of the decision problems-sometimes resulting in different complexity results. Additionally, we prove a couple of novel or strengthened results.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-445522" status="VALID">
          <idno type="RNSR">201622052E</idno>
          <idno type="ROR">https://ror.org/019yhsq25</idno>
          <orgName>Proof techniques for security protocols</orgName>
          <orgName type="acronym">PESTO</orgName>
          <date type="start">2016-01-01</date>
          <date type="end">2028-10-31</date>
          <desc>
            <address>
              <addrLine>615 Rue du Jardin-Botanique, 54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/pesto</ref>
          </desc>
          <listRelation>
            <relation active="#struct-129671" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-423084" type="direct"/>
            <relation active="#struct-206040" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-206040" status="VALID">
          <idno type="IdRef">067077927</idno>
          <idno type="ISNI">0000000121795429</idno>
          <idno type="RNSR">198912571S</idno>
          <idno type="IdUnivLorraine">[UL]RSI--</idno>
          <idno type="ROR">https://ror.org/02vnf0c38</idno>
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-413289" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-129671" status="VALID">
          <idno type="RNSR">198618246Y</idno>
          <idno type="ROR">https://ror.org/03fcjvn64</idno>
          <orgName>Centre Inria de l'Université de Lorraine</orgName>
          <desc>
            <address>
              <addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/nancy</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-423084" status="VALID">
          <orgName>Department of Formal Methods</orgName>
          <orgName type="acronym">LORIA - FM</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/en/research/departments/formal-methods/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-206040" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-43575" status="VALID">
          <idno type="anr">ANR-17-CE39-0004</idno>
          <orgName>TECAP</orgName>
          <desc>Analyse de protocoles - unir les outils existants</desc>
          <date type="start">2017</date>
        </org>
        <org type="europeanProject" xml:id="projeurop-98976" status="VALID">
          <idno type="number">645865</idno>
          <idno type="program">ERC-2014-CoG</idno>
          <idno type="call">ERC-2014-CoG</idno>
          <orgName>SPOOC</orgName>
          <desc>Automated Security Proofs of Cryptographic Protocols: Privacy, Untrusted Platforms and Applications to E-voting Protocols</desc>
          <date type="start">2015-09-01</date>
          <date type="end">2020-08-31</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>