Authentication Proof Sample Clauses

Authentication Proof. Using BAN-logic In this section, we will conduct security analysis by using the Xxxxxxx-Xxxxx-Xxxxxxx Logic (generally called BAN-logic) [34]. The detailed analysis will demonstrate that the proposed DBAKA scheme allows MU to agree on session key with VLR. The well- popular BAN-logic uses a set of postulates to analyze the security of authentication and key agreement protocols [39-40]. The logical formal model analysis method can reason the beliefs of participants in an authentication protocol. The three elementary items of BAN logic are formulas/statements, principals and keys. Let X and Y be symbols for statements, P and Q be symbols for principals, K be a symbol for a ‧Goal (2): VLR |≡ MU|≡ (MU ←⎯SK → VLR), ‧Goal (3): MU|≡ VLR |≡ (MU ←⎯→ VLR), ‧Goal (4): MU|≡ (MU ←⎯SK → VLR). For space limitation, we only demonstrate that the offline authentication part of the proposed protocol must satisfy the following goals. ‧Goal (5): VLR |≡ (MU ←⎯SKi⎯→ VLR), ‧Goal (6): VLR |≡ MU |≡ (MU ←⎯SKi⎯→ VLR), ‧Goal (7): MU |≡ VLR |≡ (MU ←⎯SKi⎯→ VLR), ‧Goal (8): MU |≡ (MU ←⎯SKi⎯→ VLR). First, we analyze the idealized form of the offline authentication part of the proposed protocol as follows. ‧ Message M1: MU → VLR: cryptographic encryption/decryption key. More details can be found in [34, 39]. Some primary BAN-logic postulates are given below: ‧The message-meaning rule: {< Ni >N , Ai ,< Ni , A >h (n )}SK