<?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-04271645</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-14T01:50:35+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Dually Computable Cryptographic Accumulators and Their Application to Attribute Based Encryption</title>
            <author role="aut">
              <persName>
                <forename type="first">Anaïs</forename>
                <surname>Barthoulot</surname>
              </persName>
              <email type="md5">d3d7fd46152735bc0fd10f20aab9145f</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">anais-barthoulot</idno>
              <idno type="idhal" notation="numeric">1303478</idno>
              <idno type="halauthorid" notation="string">2644071-1303478</idno>
              <idno type="IDREF">https://www.idref.fr/275594815</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/1220386</idno>
              <affiliation ref="#struct-1079675"/>
              <affiliation ref="#struct-5928"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Olivier</forename>
                <surname>Blazy</surname>
              </persName>
              <email type="md5">ad0efb05bed319d0ada298c3bf19df76</email>
              <email type="domain">unilim.fr</email>
              <idno type="idhal" notation="string">oblazy</idno>
              <idno type="idhal" notation="numeric">5740</idno>
              <idno type="halauthorid" notation="string">27266-5740</idno>
              <idno type="IDREF">https://www.idref.fr/165479736</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6205-8249</idno>
              <affiliation ref="#struct-300340"/>
              <affiliation ref="#struct-201313"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sébastien</forename>
                <surname>Canard</surname>
              </persName>
              <email type="md5">e86dcae2720e9bfff575a2a8d7593f30</email>
              <email type="domain">orange.com</email>
              <idno type="idhal" notation="numeric">1091860</idno>
              <idno type="halauthorid" notation="string">308083-1091860</idno>
              <idno type="ORCID">https://orcid.org/0009-0006-9588-7418</idno>
              <idno type="IDREF">https://www.idref.fr/077314824</idno>
              <idno type="ISNI">http://isni.org/isni/0000000358059921</idno>
              <idno type="VIAF">https://viaf.org/viaf/203145036</idno>
              <affiliation ref="#struct-1081156"/>
              <affiliation ref="#struct-121818"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Sébastien</forename>
                <surname>Canard</surname>
              </persName>
              <email type="md5">1f83ca6713fe2efac8f18439c7846017</email>
              <email type="domain">telecom-paris.fr</email>
            </editor>
            <funder ref="#projanr-53395"/>
            <funder>Projet BPI VisioConfiance</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-11-06 11:31:29</date>
              <date type="whenModified">2026-02-07 05:26:28</date>
              <date type="whenReleased">2023-11-09 14:01:25</date>
              <date type="whenProduced">2023-10-31</date>
              <date type="whenEndEmbargoed">2023-11-06</date>
              <ref type="file" target="https://hal.science/hal-04271645v1/document">
                <date notBefore="2023-11-06"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-04271645v1/file/2023-1277.pdf" id="file-4271645-3727406">
                <date notBefore="2023-11-06"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1378043">
                <persName>
                  <forename>Sébastien</forename>
                  <surname>Canard</surname>
                </persName>
                <email type="md5">1f83ca6713fe2efac8f18439c7846017</email>
                <email type="domain">telecom-paris.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04271645</idno>
            <idno type="halUri">https://hal.science/hal-04271645</idno>
            <idno type="halBibtex">barthoulot:hal-04271645</idno>
            <idno type="halRefHtml">&lt;i&gt;CANS 2023 - Cryptology and Network Security&lt;/i&gt;, Oct 2023, Augusta, United States. pp.538-562, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-981-99-7563-1_24"&gt;&amp;#x27E8;10.1007/978-981-99-7563-1_24&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">CANS 2023 - Cryptology and Network Security, Oct 2023, Augusta, United States. pp.538-562, &amp;#x27E8;10.1007/978-981-99-7563-1_24&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by-nc-nd/4.0/">CC BY-NC-ND 4.0 - Attribution - Non-commercial use - No Derivative Works<ref corresp="#file-4271645-3727406"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNILIM">Université de Limoges</idno>
            <idno type="stamp" n="X">École polytechnique</idno>
            <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="ENST">Ecole Nationale Supérieure des Télécommunications</idno>
            <idno type="stamp" n="LIX" corresp="X">Laboratoire d'informatique de l'Ecole polytechnique</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</idno>
            <idno type="stamp" n="TELECOM-PARISTECH" corresp="PARISTECH">Télécom Paris</idno>
            <idno type="stamp" n="X-DEP-INFO">Département d'informatique de l’École polytechnique</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="GRACE">GRACE</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LTCI" corresp="TELECOM-PARISTECH">Laboratoire Traitement et Communication de l'Information</idno>
            <idno type="stamp" n="INFRES" corresp="TELECOM-PARISTECH">Département Informatique et Réseaux</idno>
            <idno type="stamp" n="IP_PARIS">Institut Polytechnique de Paris</idno>
            <idno type="stamp" n="INSTITUTS-TELECOM">composantes instituts telecom </idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="C2" corresp="TELECOM-PARISTECH">Equipe Cybersécurité et Cryptographie </idno>
            <idno type="stamp" n="INSTITUT-MINES-TELECOM">Institut Mines Telecom</idno>
            <idno type="stamp" n="IP-PARIS-DEPARTEMENT-MATHEMATIQUES">Département de Mathèmatiques</idno>
            <idno type="stamp" n="IP-PARIS-MATHEMATIQUES">IP Paris Département de Mathématiques</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATION-COMMUNICATION-ELECTRONIQUE">IP Paris Département d'Information, de Communication et d'Électronique</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATIQUE-DONNEES-ET-IA">IP Paris Département d'Informatique, de Données et d'IA</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Dually Computable Cryptographic Accumulators and Their Application to Attribute Based Encryption</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Anaïs</forename>
                    <surname>Barthoulot</surname>
                  </persName>
                  <email type="md5">d3d7fd46152735bc0fd10f20aab9145f</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">anais-barthoulot</idno>
                  <idno type="idhal" notation="numeric">1303478</idno>
                  <idno type="halauthorid" notation="string">2644071-1303478</idno>
                  <idno type="IDREF">https://www.idref.fr/275594815</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/1220386</idno>
                  <affiliation ref="#struct-1079675"/>
                  <affiliation ref="#struct-5928"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Olivier</forename>
                    <surname>Blazy</surname>
                  </persName>
                  <email type="md5">ad0efb05bed319d0ada298c3bf19df76</email>
                  <email type="domain">unilim.fr</email>
                  <idno type="idhal" notation="string">oblazy</idno>
                  <idno type="idhal" notation="numeric">5740</idno>
                  <idno type="halauthorid" notation="string">27266-5740</idno>
                  <idno type="IDREF">https://www.idref.fr/165479736</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6205-8249</idno>
                  <affiliation ref="#struct-300340"/>
                  <affiliation ref="#struct-201313"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sébastien</forename>
                    <surname>Canard</surname>
                  </persName>
                  <email type="md5">e86dcae2720e9bfff575a2a8d7593f30</email>
                  <email type="domain">orange.com</email>
                  <idno type="idhal" notation="numeric">1091860</idno>
                  <idno type="halauthorid" notation="string">308083-1091860</idno>
                  <idno type="ORCID">https://orcid.org/0009-0006-9588-7418</idno>
                  <idno type="IDREF">https://www.idref.fr/077314824</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000358059921</idno>
                  <idno type="VIAF">https://viaf.org/viaf/203145036</idno>
                  <affiliation ref="#struct-1081156"/>
                  <affiliation ref="#struct-121818"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>CANS 2023 - Cryptology and Network Security</title>
                  <date type="start">2023-10-31</date>
                  <date type="end">2023-11-02</date>
                  <settlement>Augusta</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <publisher>Springer Nature Singapore</publisher>
                  <pubPlace>Singapore</pubPlace>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">14342</biblScope>
                  <biblScope unit="pp">538-562</biblScope>
                  <date type="datePub">2023-10-31</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-981-99-7563-1_24</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Cryptographic accumulators</term>
                <term xml:lang="en">Attribute based encryption</term>
                <term xml:lang="en">Pairing</term>
                <term xml:lang="en">Dual pairing vector spaces</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cr">Computer Science [cs]/Cryptography and Security [cs.CR]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In 1993, Benaloh and De Mare introduced cryptographic accumulator, a primitive that allows the representation of a set of values by a short object (the accumulator) and offers the possibility to prove that some input values are in the accumulator. For this purpose, so-called asymmetric accumulators require the creation of an additional cryptographic object, called a witness. Through the years, several instantiations of accumulators were proposed either based on number theoretic assumptions, hash functions, bilinear pairings or more recently lattices. In this work, we present the first instantiation of an asymmetric cryptographic accumulator that allows private computation of the accumulator but public witness creation. This is obtained thanks to our unique combination of the pairing based accumulator of Nguyen with dual pairing vector spaces. We moreover introduce the new concept of dually computable cryptographic accumulators, in which we offer two ways to compute the representation of a set: either privately (using a dedicated secret key) or publicly (using only the scheme's public key), while there is a unique witness creation for both cases. All our constructions of accumulators have constant size accumulated value and witness, and satisfy the accumulator security property of collision resistance, meaning that it is not possible to forge a witness for an element that is not in the accumulated set. As a second contribution, we show how our new concept of dually computable cryptographic accumulator can be used to build a Ciphertext Policy Attribute Based Encryption (CP-ABE). Our resulting scheme permits policies expressed as disjunctions of conjunctions (without "NO" gates), and is adaptively secure in the standard model. This is the first CP-ABE scheme having both constant-size user secret keys and ciphertexts (i.e. independent of the number of attributes in the scheme, or the policy size). For the first time, we provide a way to use cryptographic accumulators for both key management and encryption process.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-1079675" status="VALID">
          <orgName>Orange Innovation</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-5928" status="VALID">
          <idno type="IdRef">026403315</idno>
          <idno type="ISNI">0000000121654861</idno>
          <idno type="ROR">https://ror.org/02cp04407</idno>
          <orgName>Université de Limoges</orgName>
          <orgName type="acronym">UNILIM</orgName>
          <date type="start">1968-10-01</date>
          <desc>
            <address>
              <addrLine>33 rue François Mitterrand BP23204 87032 Limoges</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.unilim.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300340" status="VALID">
          <idno type="IdRef">027309320</idno>
          <idno type="ISNI">0000000121581279</idno>
          <idno type="ROR">https://ror.org/05hy3tk52</idno>
          <idno type="Wikidata">Q273626</idno>
          <orgName>École polytechnique</orgName>
          <orgName type="acronym">X</orgName>
          <date type="start">1794-03-11</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.polytechnique.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-201313" status="VALID">
          <idno type="RNSR">201221041Y</idno>
          <idno type="ROR">https://ror.org/01vxs7536</idno>
          <orgName>Geometry, arithmetic, algorithms, codes and encryption</orgName>
          <orgName type="acronym">GRACE</orgName>
          <date type="start">2012-01-01</date>
          <date type="end">2026-06-30</date>
          <desc>
            <address>
              <addrLine>Inria Saclay Ile-de-France - Bât. Alan Turing ; LIX - 2e étage ; 1 rue Honoré d'Estienne d'Orves ; Campus de l'École Polytechnique ; 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/grace</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2071" type="direct"/>
            <relation active="#struct-300340" type="indirect"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7161" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1225635" type="direct"/>
            <relation active="#struct-118511" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-1081156" status="VALID">
          <orgName>Cybersécurité et Cryptographie</orgName>
          <orgName type="acronym">C2</orgName>
          <date type="start">2021-10-07</date>
          <desc>
            <address>
              <addrLine>Télécom Paris 19 Place Marguerite Perey 91120 PALAISEAU. Fusion de: CCN, Cybersecurity for Communication and Networking et de MC2, Mathématiques discrètes, Codage et Cryptographie</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr/fr/recherche/laboratoires/laboratoire-traitement-et-communication-de-linformation-ltci/les-equipes-de-recherche/cybersecurite-cryptographie-c2</ref>
          </desc>
          <listRelation>
            <relation name="484335" active="#struct-484335" type="direct"/>
            <relation active="#struct-302102" type="indirect"/>
            <relation active="#struct-1048346" type="indirect"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="department" xml:id="struct-121818" status="VALID">
          <orgName>Département Informatique et Réseaux</orgName>
          <orgName type="acronym">INFRES</orgName>
          <desc>
            <address>
              <addrLine>46, rue Barrault 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr/fr/recherche/laboratoires/laboratoire-traitement-et-communication-de-linformation-ltci/les-departements-denseignement-et-recherche</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300362" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-2071" status="VALID">
          <idno type="IdRef">196509955</idno>
          <idno type="ISNI">0000000403673665</idno>
          <idno type="RNSR">200519331V</idno>
          <idno type="ROR">https://ror.org/04afed728</idno>
          <idno type="Wikidata">Q16009025</idno>
          <orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
          <orgName type="acronym">LIX</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>1 Rue Honoré d’Estienne d’Orves, Bâtiment Alain Turing, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lix.polytechnique.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300340" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7161" active="#struct-441569" type="direct"/>
          </listRelation>
        </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>
        <org type="department" xml:id="struct-1225635" status="VALID">
          <idno type="ROR">https://ror.org/026839t73</idno>
          <orgName>Centre Inria de l'Institut Polytechnique de Paris</orgName>
          <date type="start">2022-11-01</date>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'Orves –Bâtiment Alan Turing –Campus de l'École Polytechnique –91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</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="laboratory" xml:id="struct-484335" status="VALID">
          <idno type="IdRef">162384270</idno>
          <idno type="ISNI">0000 0000 9194 9502</idno>
          <idno type="RNSR">200319327Z</idno>
          <idno type="ROR">https://ror.org/057er4c39</idno>
          <orgName>Laboratoire Traitement et Communication de l'Information</orgName>
          <orgName type="acronym">LTCI</orgName>
          <date type="start">2017-01-01</date>
          <desc>
            <address>
              <addrLine>Télécom Paris 19 Place Marguerite Perey 91120 PALAISEAU</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr/fr/recherche/laboratoires/laboratoire-traitement-et-communication-de-linformation-ltci</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
            <relation active="#struct-1048346" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-302102" status="VALID">
          <idno type="IdRef">192427156</idno>
          <idno type="ISNI">000000012202567X</idno>
          <idno type="ROR">https://ror.org/025vp2923</idno>
          <idno type="Wikidata">Q27962533</idno>
          <orgName>Institut Mines-Télécom [Paris]</orgName>
          <orgName type="acronym">IMT</orgName>
          <date type="start">2012-03-01</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-1048346" status="VALID">
          <idno type="IdRef">026375273</idno>
          <idno type="ISNI">0000 0001 2108 2779</idno>
          <idno type="ROR">https://ror.org/01naq7912</idno>
          <orgName>Télécom Paris</orgName>
          <date type="start">2019-06-12</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300362" status="VALID">
          <idno type="ROR">https://ror.org/01naq7912</idno>
          <orgName>Télécom ParisTech</orgName>
          <date type="start">2008-01-01</date>
          <date type="end">2019-06-11</date>
          <desc>
            <address>
              <addrLine>46 rue Barrault 75634 Paris Cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-53395" status="VALID">
          <idno type="anr">ANR-19-CE39-0011</idno>
          <orgName>PRESTO</orgName>
          <desc>Traitement des flux chiffré s pour la gestion du trafic</desc>
          <date type="start">2019</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>