<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Seen the villains: Detecting Social Engineering Attacks using Case-based Reasoning and Deep Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Merton Lansley</string-name>
          <email>M.Lansley@brighton.ac.uk</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nikolaos Polatidis</string-name>
          <email>N.Polatidis@brighton.ac.uk</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stelios Kapetanakis</string-name>
          <email>S.Kapetanakis@brighton.ac.uk</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kareem Amin</string-name>
          <email>kareem.amin@dfki.uni-kl.de</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>George Samakovitis</string-name>
          <email>g.samakovitis@gre.ac.uk</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Miltos Petridis</string-name>
          <email>m.petridis@mdx.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computing, University of Middlesex</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>German Research Center for Artificial Intelligence, Smart Data and Knowledge Services</institution>
          ,
          <addr-line>Trippstadter Strasse 122, 67663 Kaiserslautern</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>School of Computing &amp; Mathematical Sciences, University of Greenwich</institution>
          ,
          <addr-line>London</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>School of Computing, Engineering and Mathematics, University of Brighton</institution>
          ,
          <addr-line>BN2 4GJ, Brighton</addr-line>
          ,
          <country country="UK">U.K</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Social engineering attacks are frequent, well-known and easy-toapply attacks in the cyber domain. Historical evidence of such attacks has shown that the vast majority of malicious attempts against both physical and virtual IT systems were based or been initiated using social engineering methods. By identifying the importance of tackling efficiently cybersecurity threats and using the recent developments in machine learning, case-based reasoning and cybersecurity we propose and demonstrate a two-stage approach that detects social engineering attacks and is based on natural language processing, case-based reasoning and deep learning. Our approach can be applied in offline texts or real time environments and can identify whether a human, chatbot or offline conversation is a potential social engineering attack or not. Initially, the conversation text is parsed and checked for grammatical errors using natural language processing techniques and case-based reasoning and then deep learning is used to identify and isolate possible attacks. Our proposed method is being evaluated using both real and semi-synthetic conversation points with high accuracy results. Comparison benchmarks are also presented for comparisons in both datasets.</p>
      </abstract>
      <kwd-group>
        <kwd>Social Engineering</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Case-based Reasoning</kwd>
        <kwd>Natural Language Processing</kwd>
        <kwd>Attack Detection</kwd>
        <kwd>Cybersecurity</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Social Engineering (SE) is an umbrella term for a series of methods and techniques
where attackers are luring users into revealing sensitive, confidential and personal</p>
      <p>
        information to be used in committing fraud and other illegal activities. This challenge
is well acknowledged, however, there is no SE detection mechanism or methodology
that can dynamically detect and adapt to SE approaches and “patterns” being
developed constantly. Several research projects have been proposing the need for an
automated system to recognize SE attacks based most commonly on Natural Language
Processing (NLP) and Machine Learning (ML) techniques. Whilst these exist there
has been little of the rate of success [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1-4</xref>
        ]. SE is based on human psychology and the
method of persuasion relating to the 6 principles of Authority, Scarcity,
Liking/Similarity, Reciprocation, Social Proof and Commitment/Consistency. Work in
the area of Computer Science and SE is usually converting these principles to the
stages of: Data-Preprocessing, Feature Extraction, Feature Scoring and Aggregation.
To determine whether a dialog is a SE attack, certain criteria should be evaluated
against a number of features. We select these features prior the three stages and we
base them on the principles of persuasion, common SE tactics like malicious links and
the history of the attacker. Further feature classification generates a ‘score’ in term of
how possible the selected dialog is to match the SE criteria.
      </p>
      <p>This work is based on the concept that a dialogue is taking place in an online chat
environment where there are fair chances of SE taking place. Each implementation is
designed to detect features by using a variety of classification techniques, such as:
Case-based Reasoning, Fuzzy Logic, Topic Blacklists, Decision Trees, Random
Forest and Deep Neural Networks depending on what needs to be extracted. An
automated system requires the output of a clear decision, albeit a probabilistic decision. This
can be done by aggregating the outputs from the Feature Extraction process. The
results of each feature are weighted by importance, and at basic level can be averaged to
give a Fuzzy logic prediction. By using more advanced techniques such as decision
trees or neural networks, the weight of each feature can be calculated
programmatically to determine which features carry the most importance regarding whether or not a
social engineering attack is taking place.</p>
      <p>The following contributions are delivered:
1.
2.</p>
      <p>A method for detecting social engineering attack in online chat
environments is proposed using CBR and Deep Learning
The proposed method is evaluated using a real and a semi-synthetic
dataset with the results validating our approach.</p>
      <p>The rest of the paper is organized as follows: section 2 presents the related work,
section 3 delivers the proposed method, section 4 contains the experimental
evaluation and section 5 is the conclusions part.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Literature Survey</title>
      <p>
        An early implementation of SE detection in real-time telephone systems is SEDA
(Social Engineering Defense Architecture) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. The researchers mainly focused on
identifying repeat callers using their voice signatures. Later a proof of concept model
of SEDA [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] was produced being able to correctly identify all attacks in their dataset.
A method of detection used by [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is to identify the questions requesting private
information and commands requesting that the user perform tasks they are not
authorized to perform. This technique uses a manually derived topic blacklist of verb-noun
pairs for which they state should be built around security policies associated with a
system. This work is taken further in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] by identifying 4 main attack; the urgency of
the dialog, negative commands and questions, whether the message is likely
automated identified by a generic greeting. Finally, they use a reputable cyber security
service, Netcraft, to check the safety of a URL. Instead of manual blacklist creation, they
use a large corpus of phishing emails to generate a topic blacklist using a Naive Bayes
classier. Some approaches like SEADMv2 [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and MPMPA [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] use complex state
machines in order to map out the pathways that can be followed as a checklist-type
system to mitigate an attack. This proposal is suited where there are multiple
authorization layers that might prevent a request from being carried out. These two separate
machines provide some overlap, but the explicit state definition required could be
limiting to where these can be applied. The nature of SE attacks is unpredictable
meaning that new methods of attacks are always being introduced. The SEADM
versions state machines still rely on the user input for changing state, which means the
chance for user error and naivety is still present. The works of [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] covers an extensive
overview of the existing systems and provide a comprehensive recognition of
subsystems for their detection architecture; in influence, deception, personality, speech act
and past experiences. The work of [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] provides a semantic based approach of
dialogues to detect social engineering attacks. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] the authors show that the human
factor is the weakest link in social engineering attacks and based on a human study
the prove that. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] and [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] the authors provide a theoretical foundation that
potentially could be used in real systems to detect attacks., In the works of [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] it is
explained how social engineering attacks can potentially be detected, whereas in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
and [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] different examples of attacks with scenarios are presented. In addition to the
works mentioned, there are numerous other articles from relevant domains that can be
useful such as the one in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] where the authors performed an influence analysis of
the number of members on the quality of knowledge in a collective, the work in [18]
where a neural network is used along with harmony for searching, the one in [19]
where nature inspired optimization algorithms for fuzzy control servo systems are
discussed and the one found in [20] where an Island-based cuckoo search algorithm
with highly disruptive polynomial mutation is proposed
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>A CBR and Deep Learning approach for SE detection</title>
      <p>A dialog in a social media engine, chat or web forum can reveal whether we do have a
social engineering attempt or not. To evaluate our approach, we preprocess dialogs
and convert them into a dataset for classification. A python pipeline has been created
using SymSpellpy for spelling, a custom Case-based Reasoning system for link
checking, Scikit learn for baseline classifiers and Keras for deep learning models.
The score of each feature can be given by: Link score, !", Spelling score, !#$, and
Intent score, !%. Each score is then normalized and the value range resides between 0
and 1. After the pre-processing of the dialogues (steps 1 – 11), the classification
dataset has the following 4 labels: (1) Intent, (2) Spelling, (3) Link and (4) attack or no
attack. The final steps use these as inputs for the classification mechanisms of an
Convolutional Neural classifier.</p>
      <p>The methodology is presented below in a concise way:
1. URLs are extracted from a dialog text using a URL regular expression pattern
finder</p>
      <p>2. If the text contains URLs, the URLs are send to a custom Case-based Reasoning
system (CB-Ranker) to evaluate whether the web link is malicious or not
3. CB-Ranker classifies a link based in a set of features related both to its static
structural attributes and attributes that pertain to its actual web content. Its features
were inspired from Marchal et al. (2014) [21] and the concept of intra-URL
relatedness that find “connections” between an investigated URL and text related to this
URL. Table 1 shows the features that were considered:
The final outcome of CB-Ranker is a “reputation score” for the website that scales
between 0-10 followed by a Master Classification Tag (MCT). The MCT has 4
classes which can be Negative (the website is definitely malicious), Questionable (the
website has elements of potentially malicious content e.g. ads/ popups), Neutral
(various content but not necessarily malicious) and Positive (this pertains to reliable,
nonmalicious websites)
4. If the returned category is of group Negative or Questionable, then SL=1.
5. Otherwise, divide the reputation by 100 and take it away from 1 as shown in
equation 1.</p>
      <p>!" = 1 −
*+,-./.0123/4-+
100
(1)
6. Check for spelling using the SymSpellpy library.</p>
      <p>7. Using the best suggested spelling correction, determine the number of
misspelled words, given by x. A score between 0 and 1 is then calculated based on
Equation 2. The value of SSP represents the spelling quality, where higher values represents
!67 = 1 − +89:
8. Correct dialog spelling is then compared to a set of blacklisted words, derived
from 48 security policy style words. This can be easily populated with company or
environment related words such as: credentials, passwords, database etc. The number
of blacklist matched words is given by MB.</p>
      <p>9. The algorithm at this step checks for intent verbs and adjectives such as need,
must, urgent etc. This value is given by MI</p>
      <p>10. To tune the results, values MB and MI are multiplied by the weights WB and WI,
weighted at values of 2 and 1 retrospectively. This step has been added as an equation
in case someone wants to change the weight of this step, if it is considered more
important. The value x can hence be given by equation 3.</p>
      <p>Then, the value of x is normalized in equation 4, using the same exponential
function as equation 2. Where a=0.4 to give the best output. A higher value of SI
indicates a higher concentration of blacklisted words in the text.</p>
      <p>!% = 1 − +89: (4)
11. At this step the original dialogue dataset is being checked to identify which
dialogue was indeed an attack and assign the true (1) or false (0) value to the new
dataset used for classification.</p>
      <p>The dataset is populated and a Convolutional Neural Network (CNN) network is
applied. If the output is high, then it is considered an attack otherwise it is not
considered an attack. The CNN network has been trained over a corpus of dialog cases that
have been tagged as SE attacks or not. For its training 3 datasets were used as its base
including the targetedemailattacks from tumbler11 , ADFA2 dataset, and a
customcases one prepared for the purpose of this work. The network was trained using Keras
python library.
poor spelling. Equation 2 applies an exponential function to be able to penalize errors
in more harsh way compared to a linear function
4</p>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <p>
        For the evaluation purposes two datasets were used. The first was based on real cyber
social engineering attacks whereas a second one was created to test the robustness of
1 https://targetedemailattacks.tumblr.com/
2 https://www.unsw.adfa.edu.au/
(2)
(3)
our proposed model classification as presented in section 3. Both datasets where
relevant to specific SE patterns out of a population of 147 real entities. CBR was used
to preprocess and classify our cases. The classification had four labels relating to
(a) intent (b) spelling (c) link (d) is attack. The real dataset cases were obtained from
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], whereas the synthetic dataset was based on [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] plus 1200 entries from human
support-based cases from the Twitter. All the extra cases were not classified as
attacks from a human expert. In both datasets the corpus has been converted to
embedding representation and it was associated with its classification labe with four entries
each. Three labels for the respective data and one with a yes or no (1 or 0) value of a
conversation being a social engineering attack or not. To both datasets a small number
of links to websites have been added, with some being malicious.
      </p>
      <p>The accuracy metric has been used for the evaluating the classification models.
The metric calculates the fraction of the prediction that each model got right.
Equation 10 represents the accuracy where TP stands for true positives, TN for true
negatives, FP for false positives and FN for false negatives.</p>
      <p>CDD-*/DE =</p>
      <p>FG + FH
FG + FH + IG + IH
(5)
The results of the evaluation as shown in tables 1, 2, 3, 4, 5, 6, and 7 are based on the
standard and compound datasets respectively and a 5-fold cross-validation approach
has been used. In tables 1 to 6 the MAX and MIN values represent the maximum and
minimum values of the 5-fold returned after each time the algorithm ran and the
MEAN is the median value. Each algorithm was executed 10 times and at the end of
each table the value is the mean value of 10 iterations for each of the three table
labels. Table 7 however, presents the average mean results for the standard and
compound datasets respectively.</p>
      <p>Two algorithms from the SciKit and one from Keras libraries have been used for
comparison purposes: Decision Tree, Random Forest and Convolutional Neural
Network.
This paper presents a novel approach for SE attack detection in a web environment
based on a combination of deep learning and case-based reasoning working at
complementary levels of understanding natural language processing. Our approach
processes dialogues, comprising our core for further classification purposes. We have
presented an evaluation using both real and a semi-synthetic human dialog
conversation whilst getting very high accuracy in social engineering attack detection. We have
presented several baseline classification methods for comparison to show the
effectiveness of our method. This work presents results of high accuracy; however, we
believe that there is still room for improvement. In future work we will investigate
adding more features to the dataset as well as applying more sophisticated deep neural
network architectures for the classification process. We do aim to improve further the
software performance as well as investigate the opportunity to use it at real time as a
cybersecurity classification toolkit.
18. Javad, S., Moallem, P., Koofigar, Η. (2017) "Training echo state neural network using
harmony search algorithm." Int. J. Artif. Intell 15.1 (2017): 163-179.
19. Precup, R. E., and Radu-Codrut D. (2019) Nature-Inspired Optimization Algorithms for</p>
      <p>Fuzzy Controlled Servo Systems. Butterworth-Heinemann
20. Bilal H., Abedalguni. (2019) “Island-based Cuckoo Search with Highly Disruptive
Polynomial Mutation”. Int. J. Artif. Intell 17.1 (2019): 57-82
21. Marchal, S., Franc Ãßois, J. State, R. , Engel, T. (2014), "Phishstorm: Detecting phishing
with streaming analytics," IEEE Transactions on Network and Service Management, vol.
11, no. 4, pp. 458-471</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Sawa</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhakta</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harris</surname>
            ,
            <given-names>I. G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hadnagy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2016</year>
          )
          <article-title>"Detection of social engineering attacks through natural language processing of conversations."</article-title>
          <source>In 2016 IEEE Tenth International Conference on Semantic Computing (ICSC)</source>
          , pp.
          <fpage>262</fpage>
          -
          <lpage>265</lpage>
          . IEEE,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Peng</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harris</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sawa</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>"Detecting phishing attacks using natural language processing and machine learning</article-title>
          .
          <source>" 2018 IEEE 12th International Conference on Semantic Computing (ICSC)</source>
          . IEEE,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Mouton</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nottingham</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leenen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Venter</surname>
            ,
            <given-names>H. S.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>"Finite state machine for the social engineering attack detection model: SEADM."</article-title>
          <source>SAIEE Africa Research Journal</source>
          <volume>109</volume>
          , no.
          <issue>2</issue>
          (
          <year>2018</year>
          ):
          <fpage>133</fpage>
          -
          <lpage>148</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Tsinganos</surname>
          </string-name>
          , N.,,
          <string-name>
            <surname>Sakellariou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fouliras</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mavridis</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>"Towards an Automated Recognition System for Chat-based Social Engineering Attacks in Enterprise Environments."</article-title>
          <source>In Proceedings of the 13th International Conference on Availability, Reliability and Security</source>
          , p.
          <fpage>53</fpage>
          . ACM,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Cialdini</surname>
            ,
            <given-names>R. B.</given-names>
          </string-name>
          "
          <source>The science of persuasion." Scientific American</source>
          <volume>284</volume>
          , no.
          <issue>2</issue>
          (
          <year>2001</year>
          ):
          <fpage>76</fpage>
          -
          <lpage>81</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Surdeanu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bauer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Finkel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bethard</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McClosky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2014</year>
          )
          <article-title>"The Stanford CoreNLP natural language processing toolkit." In Proceedings of 52nd annual meeting of the association for computational linguistics: system demonstrations</article-title>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>60</lpage>
          .
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hoeschele</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rogers</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2005</year>
          )
          <article-title>"Detecting social engineering</article-title>
          .
          <source>" IFIP International Conference on Digital Forensics</source>
          . Springer, Boston, MA,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Hoeschele</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2006</year>
          )
          <article-title>"</article-title>
          <source>CERIAS Tech Report 2006-15 DETECTING SOCIAL ENGINEERING."</source>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Abid</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Asif</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghulam</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nazir</surname>
            ,
            <given-names>M.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alam</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ashraf</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>"MPMPA: A Mitigation and Prevention Model for Social Engineering Based Phishing attacks on Facebook."</article-title>
          <source>In 2018 IEEE International Conference on Big Data (Big Data)</source>
          , pp.
          <fpage>5040</fpage>
          -
          <lpage>5048</lpage>
          . IEEE,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Bhakta</surname>
            ,
            <given-names>R</given-names>
          </string-name>
          , Harris,
          <string-name>
            <surname>I.G.</surname>
          </string-name>
          (
          <year>2015</year>
          )
          <article-title>"Semantic analysis of dialogs to detect social engineering attacks</article-title>
          .
          <source>" Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC</source>
          <year>2015</year>
          ). IEEE,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Heartfield</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loukas</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>"Detecting semantic social engineering attacks with the weakest link: Implementation and empirical evaluation of a human-as-a-security-sensor framework</article-title>
          .
          <source>" Computers &amp; Security</source>
          <volume>76</volume>
          (
          <year>2018</year>
          ):
          <fpage>101</fpage>
          -
          <lpage>127</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Bezuidenhout</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mouton</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Venter</surname>
            ,
            <given-names>H.S.</given-names>
          </string-name>
          (
          <year>2010</year>
          )
          <article-title>"Social engineering attack detection model: Seadm." 2010 Information Security for South Africa</article-title>
          . IEEE,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Mouton</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leenen</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Venter</surname>
            ,
            <given-names>H. S.</given-names>
          </string-name>
          (
          <year>2015</year>
          )
          <article-title>"Social engineering attack detection model: Seadmv2." 2015 International Conference on Cyberworlds (CW)</article-title>
          . IEEE
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Nicholson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coventry</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Briggs</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>"Can we fight social engineering attacks by social means? Assessing social salience as a means to improve phish detection." Thirteenth Symposium on Usable Privacy and Security ({SOUPS}</article-title>
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Krombholz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hobel</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huber</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weippl</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>"Advanced social engineering attacks</article-title>
          .
          <source>" Journal of Information Security and applications 22</source>
          (
          <year>2015</year>
          ):
          <fpage>113</fpage>
          -
          <lpage>122</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Mouton</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leenen</surname>
          </string-name>
          , Λ.,
          <string-name>
            <surname>Venter</surname>
            ,
            <given-names>H. S.</given-names>
          </string-name>
          (
          <year>2016</year>
          )
          <article-title>"Social engineering attack examples, templates and scenarios</article-title>
          .
          <source>" Computers &amp; Security</source>
          <volume>59</volume>
          (
          <year>2016</year>
          ):
          <fpage>186</fpage>
          -
          <lpage>209</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Thanh</surname>
            ,
            <given-names>N. N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>V. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hwang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>"An influence analysis of the number of members on the quality of knowledge in a collective</article-title>
          .
          <source>" Journal of Intelligent &amp; Fuzzy Systems</source>
          <volume>32</volume>
          .2 pp.
          <fpage>1217</fpage>
          -
          <lpage>1228</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>