<?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-04265638v2</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-22T06:33:09+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding</title>
            <author role="aut">
              <persName>
                <forename type="first">Maxime</forename>
                <surname>Bombar</surname>
              </persName>
              <email type="md5">66e87d1401ee6fcc5c2ef68965c77607</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">mbombar</idno>
              <idno type="idhal" notation="numeric">1120461</idno>
              <idno type="halauthorid" notation="string">2226978-1120461</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9081-6094</idno>
              <affiliation ref="#struct-201313"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Geoffroy</forename>
                <surname>Couteau</surname>
              </persName>
              <email type="md5">4e7ceb5300fae31045a537db1d2e394c</email>
              <email type="domain">ens.fr</email>
              <idno type="idhal" notation="string">geoffroy-couteau</idno>
              <idno type="idhal" notation="numeric">749114</idno>
              <idno type="halauthorid" notation="string">54776-749114</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6645-0106</idno>
              <idno type="IDREF">https://www.idref.fr/228914434</idno>
              <affiliation ref="#struct-1005016"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Alain</forename>
                <surname>Couvreur</surname>
              </persName>
              <email type="md5">73d4a8724066ef70032639f5c2c4f835</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">alain-couvreur</idno>
              <idno type="idhal" notation="numeric">883306</idno>
              <idno type="halauthorid" notation="string">142996-883306</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4554-6720</idno>
              <affiliation ref="#struct-201313"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Clément</forename>
                <surname>Ducros</surname>
              </persName>
              <idno type="halauthorid">2701059-0</idno>
              <affiliation ref="#struct-1005016"/>
              <affiliation ref="#struct-201313"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Clément</forename>
                <surname>Ducros</surname>
              </persName>
              <email type="md5">a79a802130bd117cf8ebc045d3b41d61</email>
              <email type="domain">cispa.de</email>
            </editor>
            <funder ref="#projanr-69636"/>
            <funder ref="#projanr-51919"/>
            <funder ref="#projanr-57976"/>
            <funder ref="#projanr-55954"/>
            <funder ref="#projanr-57828"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2023-10-31 09:07:36</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2025-06-02 13:11:02</date>
              <date type="whenModified">2026-01-21 03:28:47</date>
              <date type="whenReleased">2025-06-02 13:47:16</date>
              <date type="whenProduced">2023-08-20</date>
              <date type="whenEndEmbargoed">2025-06-02</date>
              <ref type="file" target="https://hal.science/hal-04265638v2/document">
                <date notBefore="2025-06-02"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-04265638v2/file/main.pdf" id="file-5093205-4404911">
                <date notBefore="2025-06-02"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1375446">
                <persName>
                  <forename>Clément</forename>
                  <surname>Ducros</surname>
                </persName>
                <email type="md5">a79a802130bd117cf8ebc045d3b41d61</email>
                <email type="domain">cispa.de</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04265638</idno>
            <idno type="halUri">https://hal.science/hal-04265638</idno>
            <idno type="halBibtex">bombar:hal-04265638</idno>
            <idno type="halRefHtml">&lt;i&gt;CRYPTO 2023 - 43rd Annual International Cryptology Conference&lt;/i&gt;, Aug 2023, Santa Barbara, United States. pp.567-601, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-031-38551-3_18"&gt;&amp;#x27E8;10.1007/978-3-031-38551-3_18&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">CRYPTO 2023 - 43rd Annual International Cryptology Conference, Aug 2023, Santa Barbara, United States. pp.567-601, &amp;#x27E8;10.1007/978-3-031-38551-3_18&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-5093205-4404911"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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="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="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="IP_PARIS">Institut Polytechnique de Paris</idno>
            <idno type="stamp" n="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS" corresp="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UP-SCIENCES">Université Paris Cité - Faculté des Sciences</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="IRIF">Institut de Recherche en Informatique Fondamentale</idno>
            <idno type="stamp" n="CYBERSCURITE">PEPR Cybersécurité</idno>
            <idno type="stamp" n="SECURE_COMPUTE">SECURE_COMPUTE</idno>
            <idno type="stamp" n="IP-PARIS-DEPARTEMENT-MATHEMATIQUES">Département de Mathèmatiques</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATIQUE-DONNEES-ET-IA">IP Paris Département d'Informatique, de Données et d'IA</idno>
            <idno type="stamp" n="ANR_QUANTIQUE">ANR QUANTIQUE</idno>
            <idno type="stamp" n="ANR_QUANTIQUE_3" corresp="ANR_QUANTIQUE">ANR_QUANTIQUE_3</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">Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Maxime</forename>
                    <surname>Bombar</surname>
                  </persName>
                  <email type="md5">66e87d1401ee6fcc5c2ef68965c77607</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">mbombar</idno>
                  <idno type="idhal" notation="numeric">1120461</idno>
                  <idno type="halauthorid" notation="string">2226978-1120461</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9081-6094</idno>
                  <affiliation ref="#struct-201313"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Geoffroy</forename>
                    <surname>Couteau</surname>
                  </persName>
                  <email type="md5">4e7ceb5300fae31045a537db1d2e394c</email>
                  <email type="domain">ens.fr</email>
                  <idno type="idhal" notation="string">geoffroy-couteau</idno>
                  <idno type="idhal" notation="numeric">749114</idno>
                  <idno type="halauthorid" notation="string">54776-749114</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6645-0106</idno>
                  <idno type="IDREF">https://www.idref.fr/228914434</idno>
                  <affiliation ref="#struct-1005016"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Alain</forename>
                    <surname>Couvreur</surname>
                  </persName>
                  <email type="md5">73d4a8724066ef70032639f5c2c4f835</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">alain-couvreur</idno>
                  <idno type="idhal" notation="numeric">883306</idno>
                  <idno type="halauthorid" notation="string">142996-883306</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4554-6720</idno>
                  <affiliation ref="#struct-201313"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Clément</forename>
                    <surname>Ducros</surname>
                  </persName>
                  <idno type="halauthorid">2701059-0</idno>
                  <affiliation ref="#struct-1005016"/>
                  <affiliation ref="#struct-201313"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>CRYPTO 2023 - 43rd Annual International Cryptology Conference</title>
                  <date type="start">2023-08-20</date>
                  <date type="end">2023-08-20</date>
                  <settlement>Santa Barbara</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <publisher>Springer Nature Switzerland</publisher>
                  <pubPlace>Cham</pubPlace>
                  <biblScope unit="serie">Advances in Cryptology – CRYPTO 2023</biblScope>
                  <biblScope unit="volume">LNCS-14084</biblScope>
                  <biblScope unit="pp">567-601</biblScope>
                  <date type="datePub">2023-08-09</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-031-38551-3_18</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">silent secure computation</term>
                <term xml:lang="en">quasi-abelian codes</term>
                <term xml:lang="en">oblivious linear evaluation</term>
                <term xml:lang="en">Pseudorandom correlation generators</term>
              </keywords>
              <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>Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent paradigm put forth by Boyle et al. (CCS 2018, Crypto 2019) showed how pseudorandom correlation generators (PCG) can be used to generate large amounts of useful forms of correlated (pseudo)randomness, using minimal interactions followed solely by local computations, yielding silent secure two-party computation protocols (protocols where the preprocessing phase requires almost no communication). Furthermore, programmable PCG's can be used similarly to generate multiparty correlated randomness to be used in silent secure N-party protocols. Previous works constructed very efficient (non-programmable) PCG's for correlations such as random oblivious transfers. However, the situation is less satisfying for the case of random oblivious linear evaluation (OLE), which generalises oblivious transfers over large fields, and are a core resource for secure computation of arithmetic circuits. The state-of-the-art work of Boyle et al. (Crypto 2020) constructed programmable PCG's for OLE, but their work suffers from two important downsides: (1) it only generates OLE's over large fields, and (2) it relies on a relatively new "splittable" ring-LPN assumption, which lacks strong security foundations. In this work, we construct new programmable PCG's for the OLE correlation, that overcome both limitations. To this end, we introduce the quasi-abelian syndrome decoding problem (QA-SD), a family of assumptions which generalises the well-established quasi-cyclic syndrome decoding assumption. Building upon QA-SD, we construct new programmable PCG's for OLE's over any field Fq with q &amp;gt; 2. Our analysis also sheds light on the security of the ring-LPN assumption used in Boyle et al. (Crypto 2020). Using our new PCG's, we obtain the first efficient N-party silent secure computation protocols for computing general arithmetic circuit over Fq for any q &amp;gt; 2.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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="laboratory" xml:id="struct-1005016" status="VALID">
          <idno type="IdRef">193993007</idno>
          <idno type="RNSR">201621976X</idno>
          <idno type="ROR">https://ror.org/02krdtz55</idno>
          <idno type="Wikidata">Q51783269</idno>
          <orgName>Institut de Recherche en Informatique Fondamentale</orgName>
          <orgName type="acronym">IRIF (UMR_8243)</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Université Paris CitéBâtiment Sophie Germain, Case courrier 70148 Place Aurélie Nemours75205 Paris Cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.irif.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR8243" active="#struct-441569" type="direct"/>
            <relation name="UMR_8243" active="#struct-557826" type="direct"/>
          </listRelation>
        </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="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="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="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="institution" xml:id="struct-557826" status="VALID">
          <idno type="IdRef">236453505</idno>
          <idno type="ISNI">0000 0004 7885 7602</idno>
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris Cité</orgName>
          <orgName type="acronym">UPCité</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>85 boulevard Saint-Germain75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://u-paris.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-69636" status="VALID">
          <idno type="anr">ANR-22-PECY-0003</idno>
          <orgName>SecureCompute</orgName>
          <desc>Secure computations</desc>
          <date type="start">2022</date>
        </org>
        <org type="anrProject" xml:id="projanr-51919" status="VALID">
          <idno type="anr">ANR-20-CE39-0001</idno>
          <orgName>SCENE</orgName>
          <desc>Calcul Sécurisé sur des Réseaux Chiffrés</desc>
          <date type="start">2020</date>
        </org>
        <org type="anrProject" xml:id="projanr-57976" status="VALID">
          <idno type="anr">ANR-21-CMAQ-0001</idno>
          <orgName>FQPS (PC)</orgName>
          <desc>Soutien à la formation aux technologies quantiques - Paris Centre</desc>
          <date type="start">2021</date>
        </org>
        <org type="anrProject" xml:id="projanr-55954" status="VALID">
          <idno type="anr">ANR-21-CE39-0009</idno>
          <orgName>BARRACUDA</orgName>
          <desc>Algèbre, preuves, protocoles, algorithmes, courbes, et surfaces pour les codes et leurs applications</desc>
          <date type="start">2021</date>
        </org>
        <org type="anrProject" xml:id="projanr-57828" status="VALID">
          <idno type="anr">ANR-22-PETQ-0008</idno>
          <orgName>PQ-TLS</orgName>
          <desc>Post-quantum padlock for web browser</desc>
          <date type="start">2022</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>