<?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-01531977</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-21T15:09:32+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Secure Client Puzzles Based on Random Beacons</title>
            <author role="aut">
              <persName>
                <forename type="first">Yves</forename>
                <forename type="middle">Igor</forename>
                <surname>Jerschow</surname>
              </persName>
              <email type="md5">28f9368731c8707216e48ba0750de2f9</email>
              <email type="domain">cs.uni-duesseldorf.de</email>
              <idno type="idhal" notation="numeric">1009406</idno>
              <idno type="halauthorid" notation="string">1176273-1009406</idno>
              <affiliation ref="#struct-496543"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Martin</forename>
                <surname>Mauve</surname>
              </persName>
              <email type="md5">00c333143c2d8773f90ac687ec46f103</email>
              <email type="domain">cs.uni-duesseldorf.de</email>
              <idno type="idhal" notation="numeric">1009407</idno>
              <idno type="halauthorid" notation="string">1176274-1009407</idno>
              <affiliation ref="#struct-496543"/>
            </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-06-02 11:23:34</date>
              <date type="whenModified">2021-10-29 09:42:03</date>
              <date type="whenReleased">2017-06-02 11:25:00</date>
              <date type="whenProduced">2012-05-21</date>
              <date type="whenEndEmbargoed">2015-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01531977v1/document">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01531977v1/file/978-3-642-30054-7_15_Chapter.pdf" id="file-1531977-1592675">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-30054-7_15.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-01531977</idno>
            <idno type="halUri">https://inria.hal.science/hal-01531977</idno>
            <idno type="halBibtex">jerschow:hal-01531977</idno>
            <idno type="halRefHtml">&lt;i&gt;11th International Networking Conference (NETWORKING)&lt;/i&gt;, May 2012, Prague, Czech Republic. pp.184-197, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-30054-7_15"&gt;&amp;#x27E8;10.1007/978-3-642-30054-7_15&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.184-197, &amp;#x27E8;10.1007/978-3-642-30054-7_15&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1531977-1592675"/></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-LNCS-7290" corresp="IFIP-LNCS">NETWORKING 2012</idno>
            <idno type="stamp" n="IFIP-NETWORKING"> IFIP Networking Conference</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 4: 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">Secure Client Puzzles Based on Random Beacons</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Yves</forename>
                    <forename type="middle">Igor</forename>
                    <surname>Jerschow</surname>
                  </persName>
                  <email type="md5">28f9368731c8707216e48ba0750de2f9</email>
                  <email type="domain">cs.uni-duesseldorf.de</email>
                  <idno type="idhal" notation="numeric">1009406</idno>
                  <idno type="halauthorid" notation="string">1176273-1009406</idno>
                  <affiliation ref="#struct-496543"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Martin</forename>
                    <surname>Mauve</surname>
                  </persName>
                  <email type="md5">00c333143c2d8773f90ac687ec46f103</email>
                  <email type="domain">cs.uni-duesseldorf.de</email>
                  <idno type="idhal" notation="numeric">1009407</idno>
                  <idno type="halauthorid" notation="string">1176274-1009407</idno>
                  <affiliation ref="#struct-496543"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>11th International Networking Conference (NETWORKING)</title>
                  <date type="start">2012-05-21</date>
                  <date type="end">2012-05-25</date>
                  <settlement>Prague</settlement>
                  <country key="CZ">Czech Republic</country>
                </meeting>
                <editor>Robert Bestak</editor>
                <editor>Lukas Kencl</editor>
                <editor>Li Erran Li</editor>
                <editor>Joerg Widmer</editor>
                <editor>Hao Yin</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">NETWORKING 2012</biblScope>
                  <biblScope unit="volume">LNCS-7290</biblScope>
                  <biblScope unit="issue">Part II</biblScope>
                  <biblScope unit="pp">184-197</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-30054-7_15</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">public key cryptography</term>
                <term xml:lang="en">authentication</term>
                <term xml:lang="en">client puzzles</term>
                <term xml:lang="en">Denial of Service (DoS)</term>
                <term xml:lang="en">network security</term>
              </keywords>
              <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>Denial of Service (DoS) attacks pose a fast-growing threat to network services in the Internet, but also corporate Intranets and public local area networks like Wi-Fi hotspots may be affected. Especially protocols that perform authentication and key exchange relying on expensive public key cryptography are likely to be preferred targets. A well-known countermeasure against resource depletion attacks are client puzzles.Most existing client puzzle schemes are interactive. Upon receiving a request the server constructs a puzzle and asks the client to solve this challenge before processing its request. But the packet with the puzzle parameters sent from server to client lacks authentication. The attacker might mount a counterattack on the clients by injecting faked packets with bogus puzzle parameters bearing the server’s sender address. A client receiving a plethora of bogus challenges may become overloaded and probably will not be able to solve the genuine challenge issued by the authentic server. Thus, its request remains unanswered. In this paper we introduce a secure client puzzle architecture that overcomes the described authentication issue. In our scheme client puzzles are employed noninteractively and constructed by the client from a periodically changing, secure random beacon. A special beacon server broadcasts beacon messages which can be easily verified by matching their hash values against a list of beacon fingerprints that has been obtained in advance. We develop sophisticated techniques to provide a robust beacon service. This involves synchronization aspects and especially the secure deployment of beacon fingerprints.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="department" xml:id="struct-496543" status="VALID">
          <orgName>Computer Science [Heinrich Heine University]</orgName>
          <date type="start">2017-06-02</date>
          <desc>
            <address>
              <country key="DE"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-335120" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-335120" status="VALID">
          <orgName>Heinrich Heine Universität Düsseldorf = Heinrich Heine University [Düsseldorf]</orgName>
          <date type="start">1965-01-01</date>
          <desc>
            <address>
              <addrLine>Universitätsstr. 140225 Düsseldorf</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.uni-duesseldorf.de</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>