Interrogator (Millen); Brutus (Marrero) SPIN (Hollzmann) theorem prover based methods (NRL, Meadows) methods based on state machine model and theorem prover (Athena, Dawn) Type checking
X ⊑ Y∧ B ⊦ Y)∧ (b: b ∈ B : Y ⊑ b)∧ (Z, k: Z ∈ Msg ∧ k ∈ Key : Y = {Z}k ∧ B ⊬ k-1) Lemma 4. (k, b: k ∈ Key ∧ b ∈ B : k ⊑ b ∧ A ⊬ k ∧ A∪B ⊦ k)∨ (z: z ∈ sub-msgs(x) : a ⊑ z ∧ A ⊦ z)∨ (b: b ∈ B: a ⊑ b∧ A ⊬ a)
Submessage: sub-msgs(m) ≜ {m’ ∈ Msg | m’ ⊑ m }
18.10.2020
.
6
Notation
(3) Derivation (⊦, Dolev-Yao model)
m∈B ⇒B⊦m B ⊦ m ∧ B ⊦ m’ ⇒ B ⊦ m• m’ (pairing) B ⊦ m• m’ ⇒ B ⊦ m ∧ B ⊦ m’ (projection) B ⊦ m ∧ B ⊦ k ⇒ B ⊦ {m}k (encryption) B ⊦ {m}k ∧ B ⊦ k-1 ⇒ B ⊦ m (decryption)
18.10.2020
.
4
Related Work
Techniques of verifying security properties of the cryptographic protocols can be broadly categorized: