<?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-01529779</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-18T09:05:10+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">SPRT for SPIT: Using the Sequential Probability Ratio Test for Spam in VoIP Prevention</title>
            <author role="aut">
              <persName>
                <forename type="first">Tobias</forename>
                <surname>Jung</surname>
              </persName>
              <email type="md5">0fdd3d5d5fd642d4eca39fea161deb00</email>
              <email type="domain">ulg.ac.be</email>
              <idno type="idhal" notation="numeric">1009095</idno>
              <idno type="halauthorid" notation="string">1174668-1009095</idno>
              <affiliation ref="#struct-165350"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sylvain</forename>
                <surname>Martin</surname>
              </persName>
              <email type="md5">395c1083b67c470a8e58f54efbb78568</email>
              <email type="domain">ulg.ac.be</email>
              <idno type="idhal" notation="numeric">1009096</idno>
              <idno type="halauthorid" notation="string">28193-1009096</idno>
              <affiliation ref="#struct-165350"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Damien</forename>
                <surname>Ernst</surname>
              </persName>
              <email type="md5">dcd1752312f3c74b48437d29d07fc5d8</email>
              <email type="domain">montefiore.ulg.ac.be</email>
              <idno type="idhal" notation="numeric">856022</idno>
              <idno type="halauthorid" notation="string">185271-856022</idno>
              <affiliation ref="#struct-165350"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Guy</forename>
                <surname>Leduc</surname>
              </persName>
              <email type="md5">9583f68f6c43460410fd6c9334f7ee72</email>
              <email type="domain">ulg.ac.be</email>
              <idno type="idhal" notation="numeric">846714</idno>
              <idno type="halauthorid" notation="string">175066-846714</idno>
              <affiliation ref="#struct-165350"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-05-31 13:17:42</date>
              <date type="whenModified">2025-03-04 12:32:05</date>
              <date type="whenReleased">2017-05-31 13:19:36</date>
              <date type="whenProduced">2012-06-04</date>
              <date type="whenEndEmbargoed">2015-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01529779v1/document">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01529779v1/file/978-3-642-30633-4_10_Chapter.pdf" id="file-1529779-1591236">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-30633-4_10.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01529779</idno>
            <idno type="halUri">https://inria.hal.science/hal-01529779</idno>
            <idno type="halBibtex">jung:hal-01529779</idno>
            <idno type="halRefHtml">&lt;i&gt;6th International Conference on Autonomous Infrastructure (AIMS)&lt;/i&gt;, Jun 2012, Luxembourg, Luxembourg. pp.74-85, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-30633-4_10"&gt;&amp;#x27E8;10.1007/978-3-642-30633-4_10&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">6th International Conference on Autonomous Infrastructure (AIMS), Jun 2012, Luxembourg, Luxembourg. pp.74-85, &amp;#x27E8;10.1007/978-3-642-30633-4_10&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1529779-1591236"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="IFIP-AIMS">IFIP-AIMS</idno>
            <idno type="stamp" n="IFIP-WG6-6">Management of Networks and Distributed Systems</idno>
            <idno type="stamp" n="IFIP-LNCS-7279" corresp="IFIP-LNCS">Dependable Networks and Services</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 5: Network Security</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">SPRT for SPIT: Using the Sequential Probability Ratio Test for Spam in VoIP Prevention</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Tobias</forename>
                    <surname>Jung</surname>
                  </persName>
                  <email type="md5">0fdd3d5d5fd642d4eca39fea161deb00</email>
                  <email type="domain">ulg.ac.be</email>
                  <idno type="idhal" notation="numeric">1009095</idno>
                  <idno type="halauthorid" notation="string">1174668-1009095</idno>
                  <affiliation ref="#struct-165350"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sylvain</forename>
                    <surname>Martin</surname>
                  </persName>
                  <email type="md5">395c1083b67c470a8e58f54efbb78568</email>
                  <email type="domain">ulg.ac.be</email>
                  <idno type="idhal" notation="numeric">1009096</idno>
                  <idno type="halauthorid" notation="string">28193-1009096</idno>
                  <affiliation ref="#struct-165350"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Damien</forename>
                    <surname>Ernst</surname>
                  </persName>
                  <email type="md5">dcd1752312f3c74b48437d29d07fc5d8</email>
                  <email type="domain">montefiore.ulg.ac.be</email>
                  <idno type="idhal" notation="numeric">856022</idno>
                  <idno type="halauthorid" notation="string">185271-856022</idno>
                  <affiliation ref="#struct-165350"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Guy</forename>
                    <surname>Leduc</surname>
                  </persName>
                  <email type="md5">9583f68f6c43460410fd6c9334f7ee72</email>
                  <email type="domain">ulg.ac.be</email>
                  <idno type="idhal" notation="numeric">846714</idno>
                  <idno type="halauthorid" notation="string">175066-846714</idno>
                  <affiliation ref="#struct-165350"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>6th International Conference on Autonomous Infrastructure (AIMS)</title>
                  <date type="start">2012-06-04</date>
                  <date type="end">2013-06-08</date>
                  <settlement>Luxembourg</settlement>
                  <country key="LU">Luxembourg</country>
                </meeting>
                <editor>Ramin Sadre</editor>
                <editor>Jiří Novotný</editor>
                <editor>Pavel Čeleda</editor>
                <editor>Martin Waldburger</editor>
                <editor>Burkhard Stiller</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Dependable Networks and Services</biblScope>
                  <biblScope unit="volume">LNCS-7279</biblScope>
                  <biblScope unit="pp">74-85</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-30633-4_10</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</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>This paper presents the first formal framework for identifying and filtering SPIT calls (SPam in Internet Telephony) in an outbound scenario with provable optimal performance. In so doing, our work deviates from related earlier work where this problem is only addressed by ad-hoc solutions. Our goal is to rigorously formalize the problem in terms of mathematical decision theory, find the optimal solution to the problem, and derive concrete bounds for its expected loss (number of mistakes the SPIT filter will make in the worst case). This goal is achieved by considering a scenario amenable to theoretical analysis, namely SPIT detection in an outbound scenario with pure sources. Our methodology is to first define the cost of making an error, apply Wald’s sequential probability ratio test, and then determine analytically error probabilities such that the resulting expected loss is minimized. The benefits of our approach are: (1) the method is optimal (in a sense defined in the paper); (2) the method does not rely on manual tuning and tweaking of parameters but is completely self-contained and mathematically justified; (3) the method is computationally simple and scalable. These are desirable features that would make our method a component of choice in larger, autonomic frameworks.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
              <org type="consortium">WG 6.6</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-165350" status="INCOMING">
          <orgName>Systems and Modeling Unit, Montefiore Institute</orgName>
          <desc>
            <address>
              <addrLine>Grande Traverse 10;4000;Liège</addrLine>
              <country key="BE"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-93075" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93075" status="VALID">
          <idno type="IdRef">026431416</idno>
          <idno type="ISNI">0000000108057253</idno>
          <idno type="ROR">https://ror.org/00afp2z80</idno>
          <idno type="Wikidata">Q1334582</idno>
          <orgName>Université de Liège = University of Liège = Universiteit van Luik = Universität Lüttich</orgName>
          <orgName type="acronym">ULiège</orgName>
          <date type="start">1817-01-01</date>
          <desc>
            <address>
              <addrLine>Place du 20-Août, 7 4000 Liège</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">http://www.ulg.ac.be/cms/c_5000/accueil</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>