Table 2.

BAN Logic.

Symbol	Description
$P|\equiv X$	P trusts X or P is qualified to trust X
$P⊲X$	P received a message containing X
$P|\sim X$	P has sent a message containing X
$P|\Rightarrow X$	P has jurisdiction over X
$\#(X)$	X is the latest
$P\stackrel{K}{\leftrightarrow }Q$	The shared key K is used for communication by P and Q.
$\stackrel{K}{\to }P$	P has X as a public key
${\left\{X\right\}}_K$	The message X is encrypted by K
$<X{>}_Y$	This indicates that X combined with Y