<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.2 20190208//EN" "JATS-archivearticle1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="1.2" article-type="other">
<front>
<journal-meta>
<journal-title-group>
</journal-title-group>
<publisher>
<publisher-name/>
</publisher>
</journal-meta>
<article-meta>
</article-meta>
</front>


<body id="body">
    <p id="_paragraph-2">
      <bold id="_bold-1">Security Analysis and Improvement of Lighweight VANETAuthentication Protocol (Case Study : Zhao et al. LVAP)</bold>
    </p>
    <p id="_paragraph-3">
      <bold id="_bold-2">Sepha Siswantyo<sup id="_superscript-1">1)</sup></bold>
    </p>
    <p id="_paragraph-4"><sup id="_superscript-2">1)</sup> Politeknik Siber dan Sandi Negara, Indonesia</p>
    <p id="_paragraph-5">
      <sup id="_superscript-3">1)</sup>
      <email>sepha.siswantyo@poltekssn.ac.id</email>
    </p>
    <table id="_table-1">
      <tbody>
        <tr id="table-row-04e0c3aad074830f60d946d6d473e59b">
          <td id="a29b7c2e6dc8d24c8e39904b69ce0f18"/>
        </tr>
        <tr id="table-row-7f6a26d75afc9b7ed08729d6083413aa">
          <td id="1f27e6ead8c83fa8ed032d57231c67f1">
            <p>
              <bold>ABSTRACT</bold>
            </p>
            <p>VANET is an ad-hoc network implemented on vehicle communication
      to ensure traffic safety and traffic management efficiency. VANET
      security is a concern because of various vulnerabilities,
      especially from authentication criteria that the attacker can
      exploit. VANET is vulnerable to Sybil attack, entity
      impersonation, message modification, and identity falsification.
      Several mechanisms and protocols have been developed to address
      these vulnerabilities. The design of the VANET authentication
      protocol also needs to be proven using formal methods to ensure
      that the protocol meets the required security criteria. In this
      research, the security of VANET authentication protocol developed
      by Zhao et al. was analyzed using the Datta et al. security
      protocol analysis method. Instead of BAN Logic, the Scyther tool
      was used to verify security claims and find possible attacks. Our
      Security analysis results show that Zhao et al.'s protocol does
      not meet confidentiality and entity authentication criteria.
      Scyther tool can find attacks on nonce confidentiality and
      man-in-the-middle attack. Therefore, we modify Zhao et al.
      protocol by adding signature and session key confirmation to
      improve its security. Based on analysis results, our modified Zhao
      et al. authentication protocol met confidentiality and entity
      authentication criteria. The use of signature and session key
      confirmation prevents man-in-the-middle attack and protects nonce
      confidentiality. Therefore, our research concludes that modified
      Zhao et al. authentication protocol more secure than the original
      protocol in terms of nonce and session key confidentiality,
      aliveness, weak agreement, non-injective agreement, and
      non-injective synchronization.</p>
            <p><bold>Keywords:</bold> VANET; authentication; formal methods;
      Scyther; confidentiality, man-in-the-middle</p>
          </td>
        </tr>
      </tbody>
    </table>
    <sec id="introduction">
      <title>
        <bold id="_bold-3">INTRODUCTION</bold>
      </title>
      <p id="_paragraph-6">Vehicular ad hoc network (VANET) combines wireless communication  with data sharing capabilities on vehicles to connect to the network  and provide or use network services such as use in offices and  residences (Rasheed et al., 2017). The primary purpose of implementing  VANET is to provide information related to traffic safety and improve  traffic management efficiency (Abdellah et al., 2019). VANET has  several characteristics, including high mobility, dynamic network  topology, depending on computing and storage capabilities, time  criticality, and limited transmission power (Sheikh &amp; Liang,  2019). Security is one of the crucial aspects of VANET implementation.  VANET is vulnerable to attack because of its unique characteristics.  Therefore, VANET must meet several security criteria, including  confidentiality, data integrity, availability, authentication,  non-denial, privacy and anonymity, access control, data verification,  traceability, and the ability to revoke identity (Hasrouny et al.,  2017). Authentication in VANET plays a very vital role, especially  authentication of entities and messages. Some of the attacks that  exploit weaknesses in VANET include Sybil attacks, impersonation of  actual entities (acting like entities), replay attacks, key and  certificate replication, message modification, and masquerade attacks  (identity forgeries) (Sheikh &amp; Liang, 2019).</p>
      <p id="_paragraph-7">Several cryptographic protocols have been developed for  authentication on VANET. Some protocol designed with formal analysis  to prove its security. Liu et al. lightweight VANET authentication  protocol (LVAP) and Zhao et al. LVAP used BAN Logic as manual formal  analysis tool (Liu et al., 2017; Zhao et al., 2018). while NERA and  LPPA used the game theory tool (Bayat et al., 2020; Zhou et al.,  2020). Combination of manual and automated method also can be used to  analyze designed protocol. NECPPA protocol analyzed with game theory  and Proferif (Pournaghi et al., 2018). BAN Logic and AVISPA used to  analyze SAPSC protocol (Kanchan et al., 2019). AVISPA also used to  analyze RSEAP protocol, combined with game theory method (Kumar et  al., 2020). One of the methods mentioned above, BAN Logic, has some  weaknesses, such as lack of assumptions, message, and differents  protocol runs considerations, and subjectivity problem (Agustina et  al., 2019; Patel et al., 2010). In this research, we analyze the  security criteria of Zhao et al. LVAP with Datta et al. methodology  and Scyther tool. We analyze Zhao et al. LVAP with new tool to find  protocol vulnerabilities and possible attacks that BAN Logic cannot  find. We also propose a modification of Zhao et al. protocol based on  security analysis finding from the original protocol and prove that  the modified protocol fulfilled security criteria for VANET  authentication protocol.</p>
    </sec>
    <sec id="literature-review">
      <title>
        <bold id="_bold-4">LITERATURE REVIEW</bold>
      </title>
      <p id="_paragraph-8">The development of authentication protocol of VANET has been  published and offers many different mechanisms to secure VANET  communication. In 2017, Liu et al. lightweight V2I authentication  protocol using secret sharing method and analyze with BAN Logic (Liu  et al., 2017). Liu et al. LVAP achieve message authentication,  confidentiality, and practical anonymity. Zhao et al. also propose a  lightweight authentication protocol for VANET based on public key This  protocol was analyzed with BAN Logic and achieve authentication goal.  Zhao et al. also claim that the designed LVAP resist password guessing  attack, man-in-the-middle (MITM) attack, and replay attack. Bayat et  al. develop NERA protocol that embeds master key in tamper-proof  device (TPD) at roadside infrastructure unit (RSU) (Bayat et al.,  2020). Formal analysis based on game theory conducted to NERA and  prove that NERA achieves message integrity, authentication, and  identity privacy. Game theory-based analysis is also used to analyze  LPPA protocol (Zhou et al., 2020). LPPA was designed as a lightweight  authentication protocol for location-based services in VANET. LPPA  claimed achieves vehicle location privacy, interest and interest  pattern privacy. Pournaghi et al. also integrate TPD and RSU scheme to  design NECPPA protocol (Pournaghi et al., 2018). NECPPA combines  Proverif and game theory methods for formal analysis. Proverif proves  that NECPPA achieves authentication and observational equivalence,  while game theory method proves achievement of message integrity and  authentication and identity privacy. Another combination is BAN Logic  and AVISPA, which are used to analyze SAPSC protocol (Kanchan et al.,  2019). SAPSC protocol implements signcryption mechanism to secure  VANET group communication. Formal analysis of SAPSC shows that secrecy  and mutual authentication are fulfilled. Kumar et al., in 2020,  proposed RSEAP, an authentication protocol based on RFID (Kumar et  al., 2020). RSEAP analyzed with game theory and AVISPA and gave the  result that RSEAP secure against MITM and replay attack. Scyther tool  that we used in this research was also used to analyze RSEAP2, an  improvement of RSEAP. Scyther's result shows that RSEAP2 satisfies  confidentiality and authentication (Safkhani et al., 2021).</p>
    </sec>
    <sec id="method">
      <title>
        <bold id="_bold-5">METHOD</bold>
      </title>
      <p id="_paragraph-9">The method used in this research is security protocol analysis  method consisting of protocol and attacker modeling, specifying  security criteria, and checking or proving security criteria (Datta et  al., 2010). We use Scyther tool for checking security criteria.  Scyther is an automated security protocol verification tool developed  based on symbolic model (Cremers, 2014). Scyther takes security  protocol model that includes security claims as input and evaluates  these. Zhao et al. LVAP consists of a three-way authentication message  between vehicle client <inline-formula id="_inline-formula-1" content-type="math/tex"/> as vehicle security gateway and cloud server <inline-formula id="_inline-formula-2" content-type="math/tex"/> as VANET infrastructure. The protocol step is as follow:</p>
      <p id="_paragraph-10">Message 1 <inline-formula id="_inline-formula-3" content-type="math/tex"/> : <inline-formula id="_inline-formula-4" content-type="math/tex"/></p>
      <p id="_paragraph-11">Message 2 <inline-formula id="_inline-formula-5" content-type="math/tex"/> : <inline-formula id="_inline-formula-6" content-type="math/tex"/></p>
      <p id="_paragraph-12">Message 3 <inline-formula id="_inline-formula-7" content-type="math/tex"/> : <inline-formula id="_inline-formula-8" content-type="math/tex"/></p>
      <p id="_paragraph-13">Zhao et al. LVAP steps are modeled with Security Protocol  Description Language (SPDL). Table 1 shows protocol model in  Scyther.</p>
      <p id="_paragraph-14">In this research, the attacker is modeled under the Dolev-Yao  model. Dolev-Yao model is integrated with Scyther tools by default. In  the Dolev-Yao attacker model, an attacker can intercept all  communications on the network, initiate a connection, and send data to  other entities on the network. This capability allows attackers to act  as man-in-the-middle (MITM) (Do et al., 2019).</p>
      <p id="_paragraph-15">After modeling the protocol and attacker, the next step is  specifying security criteria. The security criteria of the protocol to  be verified include confidentiality and entity authentication.  “Secret” claim syntax indicates criteria for the confidentiality of  nonce Nc and Ns and the confidentiality of the session key Kcs for  each role. Meanwhile, entity authentication criteria are verified  based on different authentication levels, such as “Alive” (aliveness),  “Weakagree” (weak agreement), “Niagree” (non-injective agreement), and  “Nisynch” (non-injective synchronization). Complete explanation of the  differences in each authentication level can be seen in (Lauser et  al., 2020) and (Cremers &amp; Mauw, 2012).</p>
      <p id="_paragraph-16">Table 1</p>
      <p id="_paragraph-17">Zhao et al. LVAP Protocol Model</p>
      <table id="_table-2">
        <tbody>
          <tr id="table-row-ad59c1c5ac5b3a4785ac439934b4af99">
            <th id="cb9001a239868ceaa5226dd46349c6e6">Protocol Model</th>
            <th id="41ca57fd6dbd4d8fa34fed53da08de59"/>
          </tr>
          <tr id="table-row-7725114a604d5f184db8ae354d84f302">
            <td id="753c6172a69f85eb335e4fc8a35bec0e">
              <p>
                <bold>#Light_VANET</bold>
              </p>
              <p>
                <bold>usertype SessionKey;</bold>
              </p>
              <p>
                <bold>protocol lightvanet(C,S){</bold>
              </p>
              <p>
                <bold>role C{</bold>
              </p>
              <p>
                <bold>fresh Nc: Nonce;</bold>
              </p>
              <p>
                <bold>var Ns: Nonce;</bold>
              </p>
              <p>
                <bold>var Kcs: SessionKey;</bold>
              </p>
              <p>
                <bold>send_1(C,S, {C,Nc}pk(S) );</bold>
              </p>
              <p>
                <bold>recv_2(S,C, {Nc,Ns,Kcs}pk(C));</bold>
              </p>
              <p>
                <bold>send_3(C,S, Ns);</bold>
              </p>
              <p>
                <bold>claim_C1(C,Secret,Nc);</bold>
              </p>
              <p>
                <bold>claim_C2(C,Secret,Ns);</bold>
              </p>
              <p>
                <bold>claim_C3(C,Secret,Kcs);</bold>
              </p>
              <p>
                <bold>claim_C4(C,Alive);</bold>
              </p>
              <p>
                <bold>claim_C5(C,Weakagree);</bold>
              </p>
              <p>
                <bold>claim_C6(C,Niagree);</bold>
              </p>
              <p>
                <bold>claim_C7(C,Nisynch); }</bold>
              </p>
            </td>
            <td id="0c8bd0adf3e91ac779166b5d431c52a2">
              <p>
                <bold>role S{</bold>
              </p>
              <p>
                <bold>fresh Ns: Nonce;</bold>
              </p>
              <p>
                <bold>fresh Kcs: SessionKey;</bold>
              </p>
              <p>
                <bold>var Nc: Nonce;</bold>
              </p>
              <p>
                <bold>recv_1(C,S, {C,Nc}pk(S) );</bold>
              </p>
              <p>
                <bold>send_2(S,C, {Nc,Ns,Kcs}pk(C));</bold>
              </p>
              <p>
                <bold>recv_3(C,S, Ns);</bold>
              </p>
              <p>
                <bold>claim_S1(S,Secret,Nc);</bold>
              </p>
              <p>
                <bold>claim_S2(S,Secret,Nc);</bold>
              </p>
              <p>
                <bold>claim_S3(S,Secret,Kcs);</bold>
              </p>
              <p>
                <bold>claim_S4(S,Alive);</bold>
              </p>
              <p>
                <bold>claim_S5(S,Weakagree);</bold>
              </p>
              <p>
                <bold>claim_S6(S,Niagree);</bold>
              </p>
              <p>
                <bold>claim_S7(S,Nisynch); }}</bold>
              </p>
            </td>
          </tr>
        </tbody>
      </table>
      <p id="_paragraph-18"><inline-graphic id="_inline-graphic-1" mimetype="image" mime-subtype="png" xlink:href="media/image1.png"/>The  next stage of security protocol analysis method is checking or proving  the security criteria using the Scyther verification tool. Before  doing the verification, Scyther first checked the protocol modeling  based on the syntax and message order. Scyther then verifies the  security criteria based on the claims already included in the  modeling. Scyther have command-line tool and graphical user interface  (GUI) tool. GUI tool adds usability features and interact with  command-line tool automatically as the backend. Figure 1 shows how GUI  tool works and interacts with command-line tool. We use GUI tool of  Scyther in this research to directly check patterns from each claim if  an attack exists. In the background process, Scyther uses semantic  analysis to check all possibilities of iterations and find possible  attacks on protocol with heuristic method. If one of the claims is  met, an "OK" statement will appear in the status column in  the same row. If the claim is not fulfilled, a "FAIL"  statement will appear, and the option to display an attack graph will  be available.</p>
      <fig id="figure-panel-eaeba6e0665ae67ed91c98c3ebafb131">
        <label>Figure 1</label>
        <caption>
          <p id="paragraph-fcca9380ddbff7be7a1b2e47dea9ddea"/>
        </caption>
        <graphic id="graphic-5321591e0fa6d87402edf0cb8560a9e3" mimetype="image" mime-subtype="png" xlink:href="01.png"/>
      </fig>
      <p id="_paragraph-19">Fig. 1 Scyther GUI and Command-line Interaction (Alharbi et al.,  2015)</p>
    </sec>
    <sec id="result">
      <title>
        <bold id="_bold-6">RESULT</bold>
      </title>
      <p id="_paragraph-20">Security criteria checking was conducted by verifying protocol  model on Scyther. The verification results as shown in Figure 2 show  several failed or unfulfilled claims from both roles. On the <inline-formula id="_inline-formula-9" content-type="math/tex"/> side, one claim failed out of seven claims. While on the <inline-formula id="_inline-formula-10" content-type="math/tex"/> side, five claims were failed. For each failed claim, there must be at  least one attack.</p>
      <fig id="figure-panel-357d5be0cde36fbead890ca25887fe77">
        <label>Figure 2</label>
        <caption>
          <p id="paragraph-ebef578e1be7a7a5b45f62772ad98d3d"/>
        </caption>
        <graphic id="graphic-fb5aa5a7e03aad70709a4bd0cdd2b2c4" mimetype="image" mime-subtype="png" xlink:href="02.png"/>
      </fig>
      <p id="_paragraph-21">Fig. 2 Zhao et al. LVAP Verification  Results</p>
      <p id="paragraph-61c253e94e848457f16eed7c81166753">
        <inline-graphic id="_inline-graphic-2" mimetype="image" mime-subtype="png" xlink:href="media/image3.png"/>
        <inline-graphic id="_inline-graphic-3" mimetype="image" mime-subtype="png" xlink:href="media/image4.png"/>
      </p>
      <fig id="figure-panel-3138ba0f8b6167d1c3cb07516edf8c49">
        <label>Figure 3</label>
        <caption>
          <p id="paragraph-65326e78e82950cae02d14e9f8d6cdf1"/>
        </caption>
        <graphic id="graphic-dc28e4d228079d7f256a5024ccb7e2dd" mimetype="image" mime-subtype="png" xlink:href="03.png"/>
      </fig>
      <p id="paragraph-8ae157c69b53003fbbe7700e21185096">Fig. 3 Attacks on <inline-formula id="_inline-formula-11" content-type="math/tex"/> Secret <inline-formula id="_inline-formula-12" content-type="math/tex"/> Claim</p>
      <fig id="figure-panel-cddfbde581a4cf091b749f4e2a1f6cb5">
        <label>Figure 4</label>
        <caption>
          <p id="paragraph-8febf261b3468d0fdb5212651343ad20"/>
        </caption>
        <graphic id="graphic-9561baf4ac9db362f8447e6de0d1e24f" mimetype="image" mime-subtype="png" xlink:href="04.png"/>
      </fig>
      <p id="paragraph-d00cc1f50535ca53fff2836a99ca997a"> Fig. 4 Attacks on <inline-formula id="_inline-formula-13" content-type="math/tex"/> Secret <inline-formula id="_inline-formula-14" content-type="math/tex"/> Claim</p>
      <p id="_paragraph-23">Verification of the <inline-formula id="_inline-formula-15" content-type="math/tex"/> confidentiality claim on role <inline-formula id="_inline-formula-16" content-type="math/tex"/> (<inline-formula id="_inline-formula-17" content-type="math/tex"/> Secret <inline-formula id="_inline-formula-18" content-type="math/tex"/>)  results in one attack, as shown in Figure 3. Nonce <inline-formula id="_inline-formula-19" content-type="math/tex"/> value can be directly obtained by the attacker when intercepting  Message-3 from <inline-formula id="_inline-formula-20" content-type="math/tex"/> because <inline-formula id="_inline-formula-21" content-type="math/tex"/> value is not encrypted. Figure 4 shows the attack graph on <inline-formula id="_inline-formula-22" content-type="math/tex"/> confidentiality (from <inline-formula id="_inline-formula-23" content-type="math/tex"/> Secret <inline-formula id="_inline-formula-24" content-type="math/tex"/> claim). The attacker (Eve) can impersonate server <inline-formula id="_inline-formula-25" content-type="math/tex"/>.  Client <inline-formula id="_inline-formula-26" content-type="math/tex"/> assume communicating with legitimate <inline-formula id="_inline-formula-27" content-type="math/tex"/>.  Then, <inline-formula id="_inline-formula-28" content-type="math/tex"/> creates Message-1 by encrypting identity <inline-formula id="_inline-formula-29" content-type="math/tex"/> and nonce <inline-formula id="_inline-formula-30" content-type="math/tex"/> with the attacker’s public key. The attacker receives and decrypts  Message-1 with his private key and obtains the nonce <inline-formula id="_inline-formula-31" content-type="math/tex"/>.  Figure 5 shows results of the verification of claim <inline-formula id="_inline-formula-32" content-type="math/tex"/> Secret <inline-formula id="_inline-formula-33" content-type="math/tex"/>.  The attacker can impersonate <inline-formula id="_inline-formula-34" content-type="math/tex"/> and receive the unencrypted nonce <inline-formula id="_inline-formula-35" content-type="math/tex"/> directly. Based on the Dolev-Yao model, the attacker can also  immediately find out the contents of the Message-3 sent in plaintext  because it can intercept every message from each entity.</p>
      <p id="_paragraph-24">Three authentication claims, namely (<inline-formula id="_inline-formula-36" content-type="math/tex"/> Weakagree), (<inline-formula id="_inline-formula-37" content-type="math/tex"/> Niagree), and (<inline-formula id="_inline-formula-38" content-type="math/tex"/> Nisynch), were not fulfilled. The verification results of the three  claims also produce the same attack graph, as can be seen in Figure 6.  The “Weakagree” claim is not fulfilled because when  S<inline-formula id="_inline-formula-39" content-type="math/tex"/>completes  the protocol (on recv_3), it does not communicate with the original <inline-formula id="_inline-formula-40" content-type="math/tex"/> in the previous message sequence, specifically when sending Message-1  (send_1) and receives Message-2 (recv_2). The attacker can impersonate <inline-formula id="_inline-formula-41" content-type="math/tex"/> to receive Message-1 and send Message-2 to <inline-formula id="_inline-formula-42" content-type="math/tex"/>.  So <inline-formula id="_inline-formula-43" content-type="math/tex"/> does not communicate with the real <inline-formula id="_inline-formula-44" content-type="math/tex"/> even though <inline-formula id="_inline-formula-45" content-type="math/tex"/> has completed a protocol session. The claims of “Niagree” and  “Nisynch” are also not fulfilled because both claims require the same  basic conditions as “Weakagree”.</p>
      <fig id="figure-panel-508f58cab22205660d7223a7b048a803">
        <label>Figure 5</label>
        <caption>
          <p id="paragraph-406b0dca71f0bbe203b200c91544baab"/>
        </caption>
        <graphic id="graphic-cf64114a89dc04802074a76ea87f271c" mimetype="image" mime-subtype="png" xlink:href="05.png"/>
      </fig>
      <p id="_paragraph-26">Fig. 5 Attacks on <inline-formula id="_inline-formula-46" content-type="math/tex"/> Secret <inline-formula id="_inline-formula-47" content-type="math/tex"/> Claim </p>
      <fig id="figure-panel-ab06560d56d956bb09a68e585b23b137">
        <label>Figure 6</label>
        <caption>
          <p id="paragraph-f54a8854bae3db1b6aca25e57b0bc73d"/>
        </caption>
        <graphic id="graphic-96ec181d358bfc468dfac282fd215228" mimetype="image" mime-subtype="png" xlink:href="06.png"/>
      </fig>
      <p id="paragraph-f9604d53da8706dde320d2e2f47774b5">Fig. 6 Attacks on <inline-formula id="_inline-formula-48" content-type="math/tex"/> Weakagree Claim</p>
      <p id="_paragraph-27">We propose a protocol modification to improve Zhao et al.’s  protocol security. Modifications are made by adding a digital  signature mechanism in second message and encryption to the last  message as key confirmation. The modified protocol step is as  follow:</p>
      <p id="_paragraph-28">Message 1 <inline-formula id="_inline-formula-49" content-type="math/tex"/> : <inline-formula id="_inline-formula-50" content-type="math/tex"/></p>
      <p id="_paragraph-29">Message 2 <inline-formula id="_inline-formula-51" content-type="math/tex"/> : <inline-formula id="_inline-formula-52" content-type="math/tex"/></p>
      <p id="_paragraph-30">Message 3 <inline-formula id="_inline-formula-53" content-type="math/tex"/> : <inline-formula id="_inline-formula-54" content-type="math/tex"/></p>
      <p id="_paragraph-31">Table 2 shows modified protocol model in Scyther. We also analyze  the security of modified protocol using the same method with some  changes in protocol model. The attacker model and security criteria to  be verified still the same as used in previous original protocol  analysis.</p>
      <p id="_paragraph-32">Table 2</p>
      <p id="_paragraph-33">Modified Zhao et al. LVAP Protocol Model</p>
      <table id="_table-3">
        <tbody>
          <tr id="table-row-e4fdae3fe81eddbdf44b743f828418e2">
            <th id="4c28bdbb3747c8880e939010c6af3a31">Protocol Model</th>
            <th id="c5930af88fe9ebb0d28c0dd0534e2484"/>
          </tr>
          <tr id="table-row-1c4c9ab0623a975e2dd6b9f92e7d3122">
            <td id="79f32d4bc865d81fcf4baa26690e7166">
              <p>
                <bold>#Modified_Light_VANET</bold>
              </p>
              <p>
                <bold>usertype SessionKey;</bold>
              </p>
              <p>
                <bold>protocol lightvanet(C,S){</bold>
              </p>
              <p>
                <bold>role C{</bold>
              </p>
              <p>
                <bold>fresh Nc: Nonce;</bold>
              </p>
              <p>
                <bold>var Ns: Nonce;</bold>
              </p>
              <p>
                <bold>var Kcs: SessionKey;</bold>
              </p>
              <p>
                <bold>send_1(C,S, {C,Nc}pk(S) );</bold>
              </p>
              <p>
                <bold>recv_2(S,C, {Nc,Ns,Kcs,
        {Nc,Ns,Kcs}sk(S)}pk(C));</bold>
              </p>
              <p>
                <bold>send_3(C,S, {Ns}Kcs);</bold>
              </p>
              <p>
                <bold>claim_C1(C,Secret,Nc);</bold>
              </p>
              <p>
                <bold>claim_C2(C,Secret,Ns);</bold>
              </p>
              <p>
                <bold>claim_C3(C,Secret,Kcs);</bold>
              </p>
              <p>
                <bold>claim_C4(C,Alive);</bold>
              </p>
              <p>
                <bold>claim_C5(C,Weakagree);</bold>
              </p>
              <p>
                <bold>claim_C6(C,Niagree);</bold>
              </p>
              <p>
                <bold>claim_C7(C,Nisynch); }</bold>
              </p>
            </td>
            <td id="6994011c4d55a94570e383f7cdfe294c">
              <p>
                <bold>role S{</bold>
              </p>
              <p>
                <bold>fresh Ns: Nonce;</bold>
              </p>
              <p>
                <bold>fresh Kcs: SessionKey;</bold>
              </p>
              <p>
                <bold>var Nc: Nonce;</bold>
              </p>
              <p>
                <bold>recv_1(C,S, {C,Nc}pk(S) );</bold>
              </p>
              <p>
                <bold>send_2(S,C, {Nc,Ns,Kcs,
        {Nc,Ns,Kcs}sk(S)}pk(C));</bold>
              </p>
              <p>
                <bold>recv_3(C,S, {Ns}Kcs);</bold>
              </p>
              <p>
                <bold>claim_S1(S,Secret,Nc);</bold>
              </p>
              <p>
                <bold>claim_S2(S,Secret,Nc);</bold>
              </p>
              <p>
                <bold>claim_S3(S,Secret,Kcs);</bold>
              </p>
              <p>
                <bold>claim_S4(S,Alive);</bold>
              </p>
              <p>
                <bold>claim_S5(S,Weakagree);</bold>
              </p>
              <p>
                <bold>claim_S6(S,Niagree);</bold>
              </p>
              <p>
                <bold>claim_S7(S,Nisynch); }}</bold>
              </p>
            </td>
          </tr>
        </tbody>
      </table>
      <p id="_paragraph-34">The results of the verification of the modified VANET Zhao et al.  authentication protocol are shown in Figure 7.</p>
      <fig id="figure-panel-33f72295f1dd5750cc001eb56c2839c8">
        <label>Figure 7</label>
        <caption>
          <p id="paragraph-71b6294eb62a6c4b8e068a51e3f37f7d"/>
        </caption>
        <graphic id="graphic-310099e7d29c97f5a0ccca4f5b333ee8" mimetype="image" mime-subtype="png" xlink:href="07.png"/>
      </fig>
      <p id="_paragraph-35">Fig. 7 Modified Zhao et al. LVAP Verification Results</p>
    </sec>
    <sec id="discussions">
      <title>
        <bold id="_bold-7">DISCUSSIONS</bold>
      </title>
      <p id="_paragraph-36">Based on the results from Scyther, five security criteria are  failed to achieve for original Zhao et al. LVAP. Zhao et al. LVAP also  vulnerable to MITM attack. This is contradiction with security claimed  by Zhao et al. We propose modification of Zhao et al. protocol and  analyze with Scyther. Based on the results, all security claims were  successfully fulfilled, and no attacks were found from our proposed  protocol. Our implementation of signature and key confirmation improve  security of Zhao et al. protocol. The attacker is assumed to be unable  to compute an entity's private key even though the public key is known  in Dolev-Yao model. The attacker cannot impersonate <inline-formula id="_inline-formula-55" content-type="math/tex"/> completely because he must also know the private key value of <inline-formula id="_inline-formula-56" content-type="math/tex"/> to continue the communication (as a man-in-the-middle). Suppose the  attacker is still trying to use a fake private key and create  Message-2 with his signature. In that case, <inline-formula id="_inline-formula-57" content-type="math/tex"/> will detect message forgery if there is a difference between the  digital signature value of the calculated <inline-formula id="_inline-formula-58" content-type="math/tex"/> parameter and that received from <inline-formula id="_inline-formula-59" content-type="math/tex"/>.  The authenticity of <inline-formula id="_inline-formula-60" content-type="math/tex"/> sent back by <inline-formula id="_inline-formula-61" content-type="math/tex"/> is guaranteed through a digital signature. This condition leads to the  following successful security claim.</p>
      <p id="_paragraph-37">Table 3</p>
      <p id="_paragraph-38">Comparison of Security Claim</p>
      <table id="_table-4">
        <tbody>
          <tr id="table-row-89f66cac9a81b6fdf92726bb4ec8b562">
            <th id="fd2f903ba8b5d312142f27ac07cf6603">Security claim</th>
            <th id="7d0be8add804413d5d9f50faab714319">Zhao et al. LVAP</th>
            <th id="2ee832a9c87196ab40b7557c9f3f5e57"/>
          </tr>
          <tr id="table-row-d813c1c540b38869b605606e7bff4b24">
            <td id="bfa1d57b1913c33e850a2c143d726528"/>
            <td id="e54d0c0672ea9bf4c50eb346e7879cf2">Original</td>
            <td id="35d8d88828d1869bdf9eaa701eac2d0a">Modified</td>
          </tr>
          <tr id="table-row-ac698007dde45c629a379239713baea3">
            <td id="09ae723e3aee228929be7490932ffacb"><inline-formula id="_inline-formula-62" content-type="math/tex"/> Confidentiality</td>
            <td id="a102e1ca6b2c9a1560b1eb1d05b677aa">×</td>
            <td id="355632eb02517ded2d77e98bfee8cea6">
              <bold id="_bold-8">√</bold>
            </td>
          </tr>
          <tr id="table-row-4e7073da0bb4402409354f8514ea194e">
            <td id="54af1e60a7792d39ee2e10e0f21fb667"><inline-formula id="_inline-formula-63" content-type="math/tex"/> Confidentiality</td>
            <td id="16a16ae984195dd52f32656268e1d17f">×</td>
            <td id="3cff69de276b7d0ba99e169c5b37b332">
              <bold id="_bold-9">√</bold>
            </td>
          </tr>
          <tr id="table-row-20e893883159e4f08c98c0bc08e5c074">
            <td id="50128d547519e87321823fd15435e52d"><inline-formula id="_inline-formula-64" content-type="math/tex"/> Confidentiality</td>
            <td id="822dd4de58ac61b0a1d3abb2a351b945">
              <bold id="_bold-10">√</bold>
            </td>
            <td id="c0081046fed462f38db33d459fb924d1">
              <bold id="_bold-11">√</bold>
            </td>
          </tr>
          <tr id="table-row-2a5c42e35c8f6cee6bfdcaee2efeca21">
            <td id="26a97093492ed2aff8957ee18e6776a4">
              <bold id="_bold-12">Aliveness</bold>
            </td>
            <td id="b141fb5910872f3c4f4cf61d498973fe">
              <bold id="_bold-13">√</bold>
            </td>
            <td id="d7e75e27d658b0ae86a738e5a95d7fd3">
              <bold id="_bold-14">√</bold>
            </td>
          </tr>
          <tr id="table-row-9a1a97980f18d822922948ac6864b7d5">
            <td id="49c3a093db98b0555c8992fe4d9c15dc">
              <bold id="_bold-15">Weak Agreement</bold>
            </td>
            <td id="82ed65d51f593e1ca14a50325dd3694b">×</td>
            <td id="d4bcc7f67c7cba95d854a5f3d78ebced">
              <bold id="_bold-16">√</bold>
            </td>
          </tr>
          <tr id="table-row-47d4ff1668d16d6a545f2863fd85d3fc">
            <td id="15587ef9ef7cb93ae646e9e2b87314e7">
              <bold id="_bold-17">Ni-Agreement</bold>
            </td>
            <td id="deb98d19a101e32893114a1df31659d7">×</td>
            <td id="7460ed4055f0228d6acb8c01bf9fe668">
              <bold id="_bold-18">√</bold>
            </td>
          </tr>
          <tr id="table-row-a6339f7eeaf183dfee3ba951c8776dd8">
            <td id="fb24dbef45e44311f38190c8f2540748">
              <bold id="_bold-19">Ni-Synchronization</bold>
            </td>
            <td id="dc498d19df3ce0150b42fd639f812e34">×</td>
            <td id="d10c7dc8723eaab47e077ffdf91bc74f">
              <bold id="_bold-20">√</bold>
            </td>
          </tr>
        </tbody>
      </table>
      <p id="_paragraph-39">Note: <bold id="_bold-21">√</bold> (achieved), ×(not achieved)</p>
      <p id="_paragraph-40">The attacker cannot obtain <inline-formula id="_inline-formula-65" content-type="math/tex"/> by decrypting Message-1 because he unable to impersonate <inline-formula id="_inline-formula-66" content-type="math/tex"/> and get involved in the following message. <inline-formula id="_inline-formula-67" content-type="math/tex"/> confidentiality is also maintained through the encryption mechanism  performed by <inline-formula id="_inline-formula-68" content-type="math/tex"/> on Message-3 using the session key. The message can only be opened by  the original <inline-formula id="_inline-formula-69" content-type="math/tex"/> whose generated the session key previously. Weakagree's claim is  fulfilled on <inline-formula id="_inline-formula-70" content-type="math/tex"/>'s  side because <inline-formula id="_inline-formula-71" content-type="math/tex"/> completed a session with <inline-formula id="_inline-formula-72" content-type="math/tex"/>,  who also previously communicated with the original <inline-formula id="_inline-formula-73" content-type="math/tex"/>.  Niagree's claim is fulfilled because when <inline-formula id="_inline-formula-74" content-type="math/tex"/> completed a session with <inline-formula id="_inline-formula-75" content-type="math/tex"/>,  who had also previously communicated with the original <inline-formula id="_inline-formula-76" content-type="math/tex"/>,  the data exchanged, i.e., <inline-formula id="_inline-formula-77" content-type="math/tex"/> and <inline-formula id="_inline-formula-78" content-type="math/tex"/>,  correspond and do not change. Nisynch's claim is fulfilled because  when <inline-formula id="_inline-formula-79" content-type="math/tex"/> completed a session with <inline-formula id="_inline-formula-80" content-type="math/tex"/>,  who also previously communicated with the original <inline-formula id="_inline-formula-81" content-type="math/tex"/>,  then the data exchanged (<inline-formula id="_inline-formula-82" content-type="math/tex"/> and <inline-formula id="_inline-formula-83" content-type="math/tex"/>)  matched and did not change, and according to the order of messages  that should be. Additionally, Message-3 also serves as a session key  confirmation to ensure that <inline-formula id="_inline-formula-84" content-type="math/tex"/> and <inline-formula id="_inline-formula-85" content-type="math/tex"/> already have the same session key to encrypt the following  communication session. Table 3 shows comparison of security claim  achieved between original and modified Zhao et al. LVAP. However, our  security claims comparison limited to properties defined by Scyther.  Scyther can not verify injective agreement and injective  synchronization, which leads to security against replay attacks.</p>
    </sec>
    <sec id="conclusion">
      <title>
        <bold id="_bold-22">CONCLUSION</bold>
      </title>
      <p id="_paragraph-41">Based on security analysis with the Datta et al. method and Scyther  tool, Zhao et al. LVAP does not meet the confidentiality and  authentication criteria. However, our modification with signature and  session key confirmation gives improvements to the original protocol  security. Furthermore, Scyther results show that our modified Zhao et  al. LVAP achieve confidentiality and authentication criteria.</p>
    </sec>
    <sec id="references">
      <title>
        <bold id="_bold-23">REFERENCES</bold>
      </title>
      <p id="_paragraph-42">Abdellah, A. R., Muthanna, A., &amp; Koucheryavy, A. (2019). Robust  Estimation of VANET Performance-Based Robust Neural Networks Learning.  In O. Galinina, S. Andreev, S. Balandin, &amp; Y. </p>
      <p id="paragraph-31b6f0d282cb5534c680ab84945824fa">Koucheryavy (Eds.), <italic id="_italic-1">Internet of Things, Smart Spaces, and Next Generation Networks  and Systems</italic> (Vol. 11660, pp. 402–414). Springer International  Publishing. https://doi.org/10.1007/978-3-030-30859-9_34</p>
      <p id="paragraph-842f362a2edc36090a2f6165173083da">Agustina, E.  R., Christine, M., &amp; Fitriani, I. (2019). Analisis Protokol  CryptO-0N2 dengan Menggunakan Scyther Tool. <italic id="_italic-2">Jurnal Teknologi  Informasi dan Ilmu Komputer</italic>, <italic id="_italic-3">6</italic>(1), 107.  https://doi.org/10.25126/jtiik.2019611303</p>
      <p id="paragraph-f75ab857976b57de4989f0c42e9eb180">Alharbi, E., Alsulami, N.,  &amp; Batarfi, O. (2015). An Enhanced Dragonfly Key Exchange Protocol  against Offline Dictionary Attack. <italic id="_italic-4">Journal of Information  Security</italic>, <italic id="_italic-5">06</italic>(02), 69–81.  https://doi.org/10.4236/jis.2015.62008</p>
      <p id="paragraph-7228e341f482a7060cef24d4cdf96a86">Bayat, M., Pournaghi, M.,  Rahimi, M., &amp; Barmshoory, M. (2020). NERA: A new and efficient RSU  based authentication scheme for VANETs. <italic id="_italic-6">Wireless  Networks</italic>, <italic id="_italic-7">26</italic>(5), 3083–3098.  https://doi.org/10.1007/s11276-019-02039-xCremers, C. (2014). <italic id="_italic-8">Scyther User Manual</italic>.  https://github.com/cascremers/scyther/blob/master/gui/scyther-manual.pdf</p>
      <p id="paragraph-53498c5f4b71e18d9e92b6108296b89a">Cremers,  C., &amp; Mauw, S. (2012). <italic id="_italic-9">Operational Semantics and  Verification of Security Protocols</italic>. Springer Berlin  Heidelberg. http://link.springer.com/10.1007/978-3-540-78636-8</p>
      <p id="paragraph-77cd4ceea5951c7e2028499584aa723d">Datta,  A., Jha, S., Li, N., Melski, D., &amp; Reps, T. (2010). Analysis  Techniques for Information Security. <italic id="_italic-10">Synthesis Lectures on  Information Security, Privacy, and Trust</italic>, <italic id="_italic-11">2</italic>(1), 1–164.  https://doi.org/10.2200/S00260ED1V01Y201003SPT002</p>
      <p id="paragraph-e79213912c3a6c5a94d3ca08b19fe391">Do, Q., Martini, B.,  &amp; Choo, K.-K. R. (2019). The role of the adversary model in  applied security research. <italic id="_italic-12">Computers &amp; Security</italic>, <italic id="_italic-13">81</italic>, 156–181.  https://doi.org/10.1016/j.cose.2018.12.002</p>
      <p id="paragraph-ccca80d1c98e5846c434ddd6c27bda04">Hasrouny, H., Samhat, A. E.,  Bassil, C., &amp; Laouiti, A. (2017). VANet security challenges and  solutions: A survey. <italic id="_italic-14">Vehicular Communications</italic>, <italic id="_italic-15">7</italic>, 7–20.  https://doi.org/10.1016/j.vehcom.2017.01.002</p>
      <p id="paragraph-a4a07bb768f4751b59b909514e768f8f">Kanchan, S., Singh, G.,  &amp; Chaudhari, N. S. (2019). SAPSC: SignRecrypting authentication  protocol using shareable clouds in VANET groups. <italic id="_italic-16">IET  Intelligent Transport Systems</italic>, <italic id="_italic-17">13</italic>(9),  1447–1460. https://doi.org/10.1049/iet-its.2018.5474</p>
      <p id="paragraph-4c5bdd8d556cedd5855f82a7f3503f5d">Kumar, V., Ahmad,  M., Mishra, D., Kumari, S., &amp; Khan, M. K. (2020). RSEAP: RFID  based secure and efficient authentication protocol for vehicular cloud  computing. <italic id="_italic-18">Vehicular Communications</italic>, <italic id="_italic-19">22</italic>, 100213.  https://doi.org/10.1016/j.vehcom.2019.100213</p>
      <p id="paragraph-3e3c5f01ca6cf7091f26eb67783493ae">Lauser, T., Zelle, D.,  &amp; Krauß, C. (2020). Security Analysis of Automotive Protocols. <italic id="_italic-20">Computer Science in Cars Symposium</italic>, 1–12.  https://doi.org/10.1145/3385958.3430482</p>
      <p id="paragraph-5bdb12c577fcf74b00e9b96d1b0275c5">Liu, Y., Guo, W., Zhong, Q.,  &amp; Yao, G. (2017). LVAP: Lightweight V2I authentication protocol  using group communication in VANETs. <italic id="_italic-21">International Journal of  Communication Systems</italic>, <italic id="_italic-22">30</italic>(16), e3317.  https://doi.org/10.1002/dac.3317</p>
      <p id="paragraph-bfd8870451664224f0f9e4db4661d176">Patel, R., Borisaniya, B., Patel, A.,  Patel, D., Rajarajan, M., &amp; Zisman, A. (2010). Comparative  Analysis of Formal Model Checking Tools for Security Protocol  Verification. </p>
      <p id="paragraph-5a7dad718cf3d78acfe0a5ceab81f400">In N. Meghanathan, S. Boumerdassi, N. Chaki, &amp; D.  Nagamalai (Eds.), <italic id="_italic-23">Recent Trends in Network Security and  Applications</italic> (Vol. 89, pp. 152–163). Springer Berlin  Heidelberg. https://doi.org/10.1007/978-3-642-14478-3_16</p>
      <p id="paragraph-0f4e3c1c846269332e8c2c1312c89309">Pournaghi, S.  M., Zahednejad, B., Bayat, M., &amp; Farjami, Y. (2018). NECPPA: A  novel and efficient conditional privacy-preserving authentication  scheme for VANET. <italic id="_italic-24">Computer Networks</italic>, <italic id="_italic-25">134</italic>, 78–92.  https://doi.org/10.1016/j.comnet.2018.01.015</p>
      <p id="paragraph-6b21420272b9557e64ff3da5d7ef3cba">Rasheed, A., Gillani, S.,  Ajmal, S., &amp; Qayyum, A. (2017). Vehicular Ad Hoc Network (VANET):  A Survey, Challenges, and Applications. In A. </p>
      <p id="paragraph-1c8ed1a9c219fa223d2e201ec3d0bcf6">Laouiti, A. Qayyum,  &amp; M. N. Mohamad Saad (Eds.), <italic id="_italic-26">Vehicular Ad-Hoc Networks for  Smart Cities</italic> (Vol. 548, pp. 39–51). Springer Singapore.  https://doi.org/10.1007/978-981-10-3503-6_4</p>
      <p id="paragraph-334bd11f2b347dd389dc399cd216e650">Safkhani, M., Camara, C.,  Peris-Lopez, P., &amp; Bagheri, N. (2021). RSEAP2: An enhanced version  of RSEAP, an RFID based authentication protocol for vehicular cloud  computing. <italic id="_italic-27">Vehicular Communications</italic>, <italic id="_italic-28">28</italic>, 100311.  https://doi.org/10.1016/j.vehcom.2020.100311</p>
      <p id="paragraph-bad3e7d086bbd758ab83dd2a734e2931">Sheikh, M. S., &amp;  Liang, J. (2019). A Comprehensive Survey on VANET Security Services in  Traffic Management System. <italic id="_italic-29">Wireless Communications and Mobile  Computing</italic>, <italic id="_italic-30">2019</italic>, 1–23.  https://doi.org/10.1155/2019/2423915</p>
      <p id="paragraph-f12a3302c570e33969392af34355f9c7">Zhao, G., Wang, R., Wang, X.,  &amp; Zhu, X. (2018). Design and Formal Verification of a VANET  Lightweight Authentication Protocol. <italic id="_italic-31">2018 IEEE 18th  International Conference on Communication Technology (ICCT)</italic>,  513–517. https://doi.org/10.1109/ICCT.2018.8600064</p>
      <p id="paragraph-820fecfcb4b13db94653229f95b90f5c">Zhou, J., Cao, Z.,  Qin, Z., Dong, X., &amp; Ren, K. (2020). LPPA: Lightweight  Privacy-Preserving Authentication From Efficient Multi-Key Secure  Outsourced Computation for Location-Based Services in VANETs. <italic id="_italic-32">IEEE Transactions on Information Forensics and  Security</italic>, <italic id="_italic-33">15</italic>, 420–434.  https://doi.org/10.1109/TIFS.2019.2923156</p>
    </sec>
  </body><back/></article>
