<?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-02294605v2</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-24T21:31:48+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk)</title>
            <author role="aut">
              <persName>
                <forename type="first">Damien</forename>
                <surname>Vergnaud</surname>
              </persName>
              <email type="md5">ae1068b096c967507303e141d7b7d90e</email>
              <email type="domain">math.unicaen.fr</email>
              <idno type="idhal" notation="numeric">829796</idno>
              <idno type="halauthorid" notation="string">102601-829796</idno>
              <idno type="IDREF">https://www.idref.fr/113500793</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2113-3967</idno>
              <idno type="ISNI">http://isni.org/isni/0000000357809268</idno>
              <idno type="VIAF">https://viaf.org/viaf/202186781</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/HCH-3869-2022</idno>
              <affiliation ref="#struct-56663"/>
              <affiliation ref="#struct-541721"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Damien</forename>
                <surname>Vergnaud</surname>
              </persName>
              <email type="md5">20c51844d10bb23bd7831e267c2240d1</email>
              <email type="domain">upmc.fr</email>
            </editor>
            <funder ref="#projanr-42105"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2019-09-23 15:49:48</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2020-05-10 12:52:24</date>
              <date type="whenModified">2024-10-30 13:33:31</date>
              <date type="whenReleased">2020-05-14 15:13:45</date>
              <date type="whenProduced">2018-12-10</date>
              <date type="whenEndEmbargoed">2020-05-10</date>
              <ref type="file" target="https://hal.science/hal-02294605v2/document">
                <date notBefore="2020-05-10"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-02294605v2/file/main.pdf" id="file-2568798-2433620">
                <date notBefore="2020-05-10"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-02294605v2/file/main.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="101856">
                <persName>
                  <forename>Damien</forename>
                  <surname>Vergnaud</surname>
                </persName>
                <email type="md5">20c51844d10bb23bd7831e267c2240d1</email>
                <email type="domain">upmc.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02294605</idno>
            <idno type="halUri">https://hal.science/hal-02294605</idno>
            <idno type="halBibtex">vergnaud:hal-02294605</idno>
            <idno type="halRefHtml">&lt;i&gt;12th IFIP International Conference on Information Security Theory and Practice (WISTP)&lt;/i&gt;, Dec 2018, Brussels, Belgium. pp.7-11, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-20074-9_2"&gt;&amp;#x27E8;10.1007/978-3-030-20074-9_2&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">12th IFIP International Conference on Information Security Theory and Practice (WISTP), Dec 2018, Brussels, Belgium. pp.7-11, &amp;#x27E8;10.1007/978-3-030-20074-9_2&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2568798-2433620"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 1: Invited Papers</note>
            <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">Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk)</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Damien</forename>
                    <surname>Vergnaud</surname>
                  </persName>
                  <email type="md5">ae1068b096c967507303e141d7b7d90e</email>
                  <email type="domain">math.unicaen.fr</email>
                  <idno type="idhal" notation="numeric">829796</idno>
                  <idno type="halauthorid" notation="string">102601-829796</idno>
                  <idno type="IDREF">https://www.idref.fr/113500793</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2113-3967</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000357809268</idno>
                  <idno type="VIAF">https://viaf.org/viaf/202186781</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/HCH-3869-2022</idno>
                  <affiliation ref="#struct-56663"/>
                  <affiliation ref="#struct-541721"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Information Security Theory and Practice</title>
                <meeting>
                  <title>12th IFIP International Conference on Information Security Theory and Practice (WISTP)</title>
                  <date type="start">2018-12-10</date>
                  <date type="end">2018-12-11</date>
                  <settlement>Brussels</settlement>
                  <country key="BE">Belgium</country>
                </meeting>
                <editor>Olivier Blazy</editor>
                <editor>Chan Yeob Yeun</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">11469</biblScope>
                  <biblScope unit="pp">7-11</biblScope>
                  <date type="datePub">2019</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-20074-9_2</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>Cryptographic operations are performed everywhere, from standard laptop to smart cards. Some devices computational resources can be very limited and it is natural to delegate costly operations to another device capable of carrying out cryptographic algorithms. In this setting, it is obviously important to ensure the limited device that the computation is carried out correctly and that the powerful device does not learn anything about what is actually computing (including the secret inputs and outputs). We briefly review the recent advances on secure outsourcing of group exponentiation (in groups of known prime order as well as in groups of unknown order) and pairing computation.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 11</org>
              <org type="consortium">WG 11.2</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-56663" status="VALID">
          <idno type="IdRef">03442945X</idno>
          <idno type="ISNI">0000000119314817</idno>
          <idno type="ROR">https://ror.org/055khg266</idno>
          <idno type="Wikidata">Q1665127</idno>
          <orgName>Institut universitaire de France</orgName>
          <orgName type="acronym">IUF</orgName>
          <desc>
            <address>
              <addrLine>Maison des Universités 103 Boulevard Saint-Michel 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://iuf.amue.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301855" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-541721" status="VALID">
          <orgName>ALgorithms for coMmunicAtion SecuriTY</orgName>
          <orgName type="acronym">ALMASTY</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-301855" status="VALID">
          <orgName>Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche</orgName>
          <orgName type="acronym">M.E.N.E.S.R.</orgName>
          <desc>
            <address>
              <addrLine>1 rue Descartes - 75231 Paris cedex 05</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.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-42105" status="VALID">
          <idno type="anr">ANR-16-CE39-0006</idno>
          <orgName>ALAMBIC</orgName>
          <desc>AppLicAtions de la MalléaBIlité en Cryptographie</desc>
          <date type="start">2016</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>