Improved Chebyshev Polynomials-Based Authentication Scheme in Client-Server Environment

Table 1

The assumptions in BAN-logic.

---

Assumptions

---

A₁: U ∣≡(US) – U believes U can share ID with S

A₂: U ∣≡(US) – U believes U can share K with S

A₃: U ∣≡(S⇒(US)) – U believes S controls the sharing of sk between U and S

A₄: S ∣≡(U⇒(US)) – S believes U controlsthe sharing of ID between U and S

A₅: S ∣≡(U⇒(US)) –S believes U controls the sharing of sk between U and S

A₆: S ∣≡(SU) – S believes S can share K with U

A₇: U ∣≡ #(r⊗ K) – U believes the challenge messages from S is fresh

A₈: S ∣≡ #(r⊗ K) – S believes the challenge messages from U is fresh

---