Table 4 The notations of BAN logic
From: SD2PA: a fully safe driving and privacy-preserving authentication scheme for VANETs
The notations | Meaning |
|---|---|
\( \rho , \varrho \) | The main participants in the model |
\( X_{m} \) | Messages |
\( K \) | A secret key |
\( \rho | \equiv \varrho \) | \( \rho \) believes \( \varrho \) |
\( \rho \triangleleft X_{m} \) | \( \rho \) sees \( X_{m} \) |
\( \rho |\sim X_{m} \) | \( \rho \) sent \( X_{m} \) |
\( \# \left( {X_{m} } \right) \) | The message \( X_{m} \) is fresh |
\( \rho \mathop \leftrightarrow \limits^{K} \varrho \) | \( \rho \) and \( \varrho \) communicate by \( K \) |
\( \rho \Rightarrow \varrho \) | \( \rho \) is able to control \( \varrho \) |
\( \left( {X_{m} } \right)_{K} \) | The message \( X_{m} \) is hashed by \( K \) |