<?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-01393755</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-21T10:21:38+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Using Fraud Trees to Analyze Internet Credit Card Fraud</title>
            <author role="aut">
              <persName>
                <forename type="first">Clive</forename>
                <surname>Blackwell</surname>
              </persName>
              <idno type="halauthorid">1078341-0</idno>
              <affiliation ref="#struct-25844"/>
            </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">2016-11-08 10:45:44</date>
              <date type="whenModified">2020-03-05 16:46:28</date>
              <date type="whenReleased">2016-11-08 10:57:49</date>
              <date type="whenProduced">2014-01-08</date>
              <date type="whenEndEmbargoed">2017-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01393755v1/document">
                <date notBefore="2017-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01393755v1/file/978-3-662-44952-3_2_Chapter.pdf" id="file-1393755-1475709">
                <date notBefore="2017-01-01"/>
              </ref>
            </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-01393755</idno>
            <idno type="halUri">https://inria.hal.science/hal-01393755</idno>
            <idno type="halBibtex">blackwell:hal-01393755</idno>
            <idno type="halRefHtml">&lt;i&gt;10th IFIP International Conference on Digital Forensics (DF)&lt;/i&gt;, Jan 2014, Vienna, Austria. pp.17-29, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-662-44952-3_2"&gt;&amp;#x27E8;10.1007/978-3-662-44952-3_2&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">10th IFIP International Conference on Digital Forensics (DF), Jan 2014, Vienna, Austria. pp.17-29, &amp;#x27E8;10.1007/978-3-662-44952-3_2&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1393755-1475709"/></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-AICT" corresp="IFIP">IFIP Advances in Information and Communication Technology</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</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-DF" corresp="IFIP-LNCS">IFIP-DF</idno>
            <idno type="stamp" n="IFIP-WG11-9" corresp="IFIP-WG">IFIP-WG11-9</idno>
            <idno type="stamp" n="IFIP-AICT-433" corresp="IFIP-AICT">Advances in Digital Forensics X</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 1: Internet Crime Investigations</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">Using Fraud Trees to Analyze Internet Credit Card Fraud</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Clive</forename>
                    <surname>Blackwell</surname>
                  </persName>
                  <idno type="halauthorid">1078341-0</idno>
                  <affiliation ref="#struct-25844"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">IFIP Advances in Information and Communication Technology</title>
                <meeting>
                  <title>10th IFIP International Conference on Digital Forensics (DF)</title>
                  <date type="start">2014-01-08</date>
                  <date type="end">2014-01-10</date>
                  <settlement>Vienna</settlement>
                  <country key="AT">Austria</country>
                </meeting>
                <editor>Gilbert Peterson</editor>
                <editor>Sujeet Shenoi</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Advances in Digital Forensics X</biblScope>
                  <biblScope unit="volume">AICT-433</biblScope>
                  <biblScope unit="pp">17-29</biblScope>
                  <date type="datePub">2014</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-662-44952-3_2</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">card-not-present transactions</term>
                <term xml:lang="en">obstacles</term>
                <term xml:lang="en">fraud tree</term>
                <term xml:lang="en">Credit card fraud</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>Because of the difficulties inherent in accurately identifying individuals on the Internet, online merchants reduce the risk of credit card fraud by increasing restrictions on consumers. The restrictions are often overly burdensome on consumers and may result in lost sales. This paper uses the concept of a fraud tree, an extension of an attack tree, to comprehensively model online fraud techniques and to suggest defensive obstacles for merchants to counter threats. The fraud tree model can advise merchants about the checks to be performed to reduce risk even in the presence of incomplete knowledge of the circumstances of the transactions. Since fraud cannot be completely avoided, the paper also describes auditing that can be performed to assist merchants in identifying the responsible parties and potentially limiting, if not avoiding, liability due to fraud.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 11</org>
              <org type="consortium">WG 11.9</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-25844" status="VALID">
          <idno type="ROR">https://ror.org/04v2twj65</idno>
          <orgName>Oxford Brookes University</orgName>
          <desc>
            <address>
              <addrLine>Headington Campus, Gipsy Lane, Oxford OX3 0BP, UK</addrLine>
              <country key="GB"/>
            </address>
            <ref type="url">http://www.brookes.ac.uk/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>