Table 2.

Notations of Burrows–Abadi–Needham (BAN) logic.

Notation	Description
$X|\equiv Q$	Xbelieves statement Q
$X|\sim Q$	X once said Q
$X\Rightarrow Q$	Xcontrols statement Q
#Q	Statement Q is fresh
$X⊲Q$	Xsees statement Q
$<Q{>}_Z$	Formula Q is combined with formula Z
${\left\{Q\right\}}_K$	Q is encrypted under key K
$\stackrel{K}{{}_{⟶Y}}$	Y has K as a public key
$X\stackrel{K}{\leftrightarrow }Y$	X and Y may use shared key K to communicate
$SK$	Session key used in the current session