<?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-03220840</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-18T21:19:57+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="fr">Bloquer efficacement les "fake news" sans connaître leurs réseaux de propagation</title>
            <author role="aut">
              <persName>
                <forename type="first">Silvia</forename>
                <surname>Bonomi</surname>
              </persName>
              <email type="md5">b657713325584a0069407130853bb227</email>
              <email type="domain">diag.uniroma1.it</email>
              <idno type="idhal" notation="numeric">1028480</idno>
              <idno type="halauthorid" notation="string">365839-1028480</idno>
              <orgName ref="#struct-229915"/>
              <affiliation ref="#struct-244844"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Giovanni</forename>
                <surname>Farina</surname>
              </persName>
              <idno type="halauthorid">39107-0</idno>
              <affiliation ref="#struct-244844"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sébastien</forename>
                <surname>Tixeuil</surname>
              </persName>
              <idno type="halauthorid">5657-0</idno>
              <affiliation ref="#struct-541705"/>
              <affiliation ref="#struct-541966"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Giovanni</forename>
                <surname>Farina</surname>
              </persName>
              <email type="md5">22fa759a43349ffd9d324748899c90e2</email>
              <email type="domain">unicusano.it</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2021-05-07 14:59:14</date>
              <date type="whenModified">2026-01-19 16:46:20</date>
              <date type="whenReleased">2021-05-07 15:53:43</date>
              <date type="whenProduced">2021-06-01</date>
              <date type="whenEndEmbargoed">2021-05-07</date>
              <ref type="file" target="https://hal.science/hal-03220840v1/document">
                <date notBefore="2021-05-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03220840v1/file/29_Algotel2021.pdf" id="file-3220840-2828124">
                <date notBefore="2021-05-07"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="568054">
                <persName>
                  <forename>Giovanni</forename>
                  <surname>Farina</surname>
                </persName>
                <email type="md5">22fa759a43349ffd9d324748899c90e2</email>
                <email type="domain">unicusano.it</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03220840</idno>
            <idno type="halUri">https://hal.science/hal-03220840</idno>
            <idno type="halBibtex">bonomi:hal-03220840</idno>
            <idno type="halRefHtml">&lt;i&gt;ALGOTEL 2021 — 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications&lt;/i&gt;, Jun 2021, La Rochelle, France</idno>
            <idno type="halRef">ALGOTEL 2021 — 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2021, La Rochelle, France</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3220840-2828124"/></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="INSTITUTS-TELECOM">composantes instituts telecom </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="ALGOTEL2021" corresp="ALGOTEL">ALGOTEL 2021 — 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SPRES">Séminaires Parisiens en Réseaux</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
            <idno type="stamp" n="ALGOTEL">Rencontre Francophone sur les Aspects Algorithmiques des Télécommunications</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="3">National</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="fr">Bloquer efficacement les "fake news" sans connaître leurs réseaux de propagation</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Silvia</forename>
                    <surname>Bonomi</surname>
                  </persName>
                  <email type="md5">b657713325584a0069407130853bb227</email>
                  <email type="domain">diag.uniroma1.it</email>
                  <idno type="idhal" notation="numeric">1028480</idno>
                  <idno type="halauthorid" notation="string">365839-1028480</idno>
                  <orgName ref="#struct-229915"/>
                  <affiliation ref="#struct-244844"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Giovanni</forename>
                    <surname>Farina</surname>
                  </persName>
                  <idno type="halauthorid">39107-0</idno>
                  <affiliation ref="#struct-244844"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sébastien</forename>
                    <surname>Tixeuil</surname>
                  </persName>
                  <idno type="halauthorid">5657-0</idno>
                  <affiliation ref="#struct-541705"/>
                  <affiliation ref="#struct-541966"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ALGOTEL 2021 — 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications</title>
                  <date type="start">2021-06-01</date>
                  <date type="end">2021-06-04</date>
                  <settlement>La Rochelle</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="fr">French</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">réseau multi-sauts</term>
                <term xml:lang="fr">pannes Byzantines</term>
                <term xml:lang="fr">communication fiable</term>
                <term xml:lang="fr">Fake news</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</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="fr">
              <p>Nous considérons un réseau utilisé pour propager des informations. Ce réseau (modélisé à travers un graphe) n'est pas complet et certains nœuds doivent s'appuyer sur des intermédiaires pour communiquer. Cependant, la topologie du réseau est inconnue et un nombre limité de participants malveillants tentent de miner la crédibilité des sources d'information en envoyant de faux messages qui semblent provenir des mêmes sources : des "fake news". Les solutions existantes qui contrecarrent la diffusion de fake news dans ce scénario sont basées sur l'analyse des chemins parcourus par les informations dans le réseau, mais celles-ci peuvent disséminer un nombre factoriel de messages (en la taille du réseau) et nécessiter des calculs complexes aux nœuds pour vérifier l'authenticité de chaque information diffusée. Nous identifions des ensembles de conditions qui permettent une communication fiable entre les nœuds et de complexité optimale, en exploitant une reconstruction partielle de la topologie du réseau.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-244844" status="VALID">
          <orgName>Dipartimento di Ingegneria informatica automatica e gestionale [Roma]</orgName>
          <orgName type="acronym">DIAG UNIROMA</orgName>
          <desc>
            <address>
              <addrLine>Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma / Department of Computer, Control, and Management Engineering Antonio Ruberti</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">https://www.diag.uniroma1.it/</ref>
          </desc>
          <listRelation>
            <relation name="Università degli Studi di Roma &quot;La Sapienza&quot; " active="#struct-229915" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-541705" status="VALID">
          <orgName>Networks and Performance Analysis</orgName>
          <orgName type="acronym">NPA</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="laboratory" xml:id="struct-541966" status="VALID">
          <orgName>Laboratory of Information, Network and Communication Sciences</orgName>
          <orgName type="acronym">LINCS</orgName>
          <desc>
            <address>
              <addrLine>23 avenue d'Italie 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lincs.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-302102" type="direct"/>
            <relation active="#struct-413221" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-229915" status="VALID">
          <idno type="IdRef">026430711</idno>
          <idno type="ROR">https://ror.org/02be6w209</idno>
          <orgName>Università degli Studi di Roma "La Sapienza" = Sapienza University [Rome]</orgName>
          <orgName type="acronym">UNIROMA</orgName>
          <date type="start">1303-01-01</date>
          <desc>
            <address>
              <addrLine>Piazzale Aldo Moro 5, 00185 Roma</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">https://www.uniroma1.it/</ref>
          </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>
        <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="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>
      </listOrg>
    </back>
  </text>
</TEI>