<?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-01875522</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-21T02:43:07+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Examination of a New Defense Mechanism: Honeywords</title>
            <author role="aut">
              <persName>
                <forename type="first">Ziya</forename>
                <forename type="middle">Alper</forename>
                <surname>Genç</surname>
              </persName>
              <email type="md5">db63ccadd95c36e9dec6f4086b280859</email>
              <email type="domain">uni.lu</email>
              <idno type="idhal" notation="numeric">1036542</idno>
              <idno type="halauthorid" notation="string">1423348-1036542</idno>
              <affiliation ref="#struct-366875"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Süleyman</forename>
                <surname>Kardaş</surname>
              </persName>
              <idno type="halauthorid">1423349-0</idno>
              <affiliation ref="#struct-518945"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mehmet</forename>
                <forename type="middle">Sabir</forename>
                <surname>Kiraz</surname>
              </persName>
              <idno type="halauthorid">1423337-0</idno>
              <affiliation ref="#struct-345528"/>
            </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">2018-09-17 14:44:38</date>
              <date type="whenModified">2024-09-25 09:56:03</date>
              <date type="whenReleased">2018-09-17 14:47:38</date>
              <date type="whenProduced">2017-09-28</date>
              <date type="whenEndEmbargoed">2021-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01875522v1/document">
                <date notBefore="2021-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01875522v1/file/469589_1_En_8_Chapter.pdf" id="file-1875522-1903352">
                <date notBefore="2021-01-01"/>
              </ref>
              <ref type="externalLink" target="http://orbilu.uni.lu/bitstream/10993/33248/1/honeywords_wistp.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-01875522</idno>
            <idno type="halUri">https://inria.hal.science/hal-01875522</idno>
            <idno type="halBibtex">genc:hal-01875522</idno>
            <idno type="halRefHtml">&lt;i&gt;11th IFIP International Conference on Information Security Theory and Practice (WISTP)&lt;/i&gt;, Sep 2017, Heraklion, Greece. pp.130-139, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-93524-9_8"&gt;&amp;#x27E8;10.1007/978-3-319-93524-9_8&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">11th IFIP International Conference on Information Security Theory and Practice (WISTP), Sep 2017, Heraklion, Greece. pp.130-139, &amp;#x27E8;10.1007/978-3-319-93524-9_8&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1875522-1903352"/></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-TC11" corresp="IFIP-TC">IFIP TC11: Security and Privacy Protection in Information Processing Systems</idno>
            <idno type="stamp" n="IFIP-WISTP">IFIP-WISTP</idno>
            <idno type="stamp" n="IFIP-WG11-2">IFIP-WG11-2</idno>
            <idno type="stamp" n="IFIP-LNCS-10741" corresp="IFIP-LNCS">Information Security Theory and Practice</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 4: Defences and Evaluation</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">Examination of a New Defense Mechanism: Honeywords</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Ziya</forename>
                    <forename type="middle">Alper</forename>
                    <surname>Genç</surname>
                  </persName>
                  <email type="md5">db63ccadd95c36e9dec6f4086b280859</email>
                  <email type="domain">uni.lu</email>
                  <idno type="idhal" notation="numeric">1036542</idno>
                  <idno type="halauthorid" notation="string">1423348-1036542</idno>
                  <affiliation ref="#struct-366875"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Süleyman</forename>
                    <surname>Kardaş</surname>
                  </persName>
                  <idno type="halauthorid">1423349-0</idno>
                  <affiliation ref="#struct-518945"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mehmet</forename>
                    <forename type="middle">Sabir</forename>
                    <surname>Kiraz</surname>
                  </persName>
                  <idno type="halauthorid">1423337-0</idno>
                  <affiliation ref="#struct-345528"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>11th IFIP International Conference on Information Security Theory and Practice (WISTP)</title>
                  <date type="start">2017-09-28</date>
                  <date type="end">2017-09-29</date>
                  <settlement>Heraklion</settlement>
                  <country key="GR">Greece</country>
                </meeting>
                <editor>Gerhard P. Hancke</editor>
                <editor>Ernesto Damiani</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Information Security Theory and Practice</biblScope>
                  <biblScope unit="volume">LNCS-10741</biblScope>
                  <biblScope unit="pp">130-139</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-93524-9_8</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Code modification</term>
                <term xml:lang="en">Honeywords</term>
                <term xml:lang="en">Cracking</term>
                <term xml:lang="en">Passwords</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>Past experiences show us that password breach is still one of the main methods of attackers to obtain personal or sensitive user data. Basically, assuming they have access to list of hashed passwords, they apply guessing attacks, i.e., attempt to guess a password by trying a large number of possibilities. We certainly need to change our way of thinking and use a novel and creative approach in order to protect our passwords. In fact, there are already novel attempts to provide password protection. The Honeywords system of Juels and Rivest is one of them which provides a detection mechanism for password breaches. Roughly speaking, they propose a method for password-based authentication systems where fake passwords, i.e., “honeywords” are added into a password file, in order to detect impersonation. Their solution includes an auxiliary secure server called “honeychecker” which can distinguish a user’s real password among her honeywords and immediately sets off an alarm whenever a honeyword is used. However, they also pointed out that their system needs to be improved in various ways by highlighting some open problems. In this paper, after revisiting the security of their proposal, we specifically focus on and aim to solve a highlighted open problem, i.e., active attacks where the adversary modifies the code running on either the login server or the honeychecker.</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="institution" xml:id="struct-366875" status="VALID">
          <idno type="IdRef">124635016</idno>
          <idno type="ISNI">0000000122959843</idno>
          <idno type="ROR">https://ror.org/036x5ad56</idno>
          <idno type="Wikidata">Q59668</idno>
          <orgName>Université du Luxembourg = University of Luxembourg = Universität Luxemburg</orgName>
          <orgName type="acronym">uni.lu</orgName>
          <date type="start">2003-01-01</date>
          <desc>
            <address>
              <addrLine>Université du Luxembourg [Siège] – 2, place de l’Université – L-4365 Esch-sur-Alzette – Luxembourg</addrLine>
              <country key="LU"/>
            </address>
            <ref type="url">http://wwwfr.uni.lu/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-518945" status="VALID">
          <orgName>Batman University</orgName>
          <desc>
            <address>
              <country key="TR"/>
            </address>
            <ref type="url">http://www.batman.edu.tr/En</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-345528" status="VALID">
          <orgName>Tübitak Bilgem</orgName>
          <desc>
            <address>
              <country key="TR"/>
            </address>
            <ref type="url">http://bilgem.tubitak.gov.tr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>