Information Assurance

11.5. One-Crosstalk Attack Diagnosable Conditions

In this section, we establish the exact diagnosis conditions by using a set of lemmas and theorems.

Lemma 1. In any network, if this system is one-OAF diagnosable, then, |unidentified connection| ≤ 1.

Proof: Obvious.

Lemma 2. For an arbitrary connection c_i, if c_i is unidentified, then S(msc_i) = A for ∀ msc_i ϵ Γ^–1(c_i).

Proof: Suppose one msc_k ϵ Γ^–1(c_i) has S(msc_k) = Ā. Then, according to Table 11.1, S(c_i) = IF, and this contradicts the condition of the statement of Lemma 2.

Theorem 1 (Necessary and Sufficient Condition for One-Crosstalk Attack). In a network with at most one OAF existing at a time, ∀c_i, c_j ϵ C, c_i ≠ = c_j, if Γ^–1(c_i) ≠ Γ^–1 (c_j), then for this network with the connection set C, ...