A Unified Framework for the Analysis of Availability, Reliability and Security, With Applications to Quantum Networks

On the Practical Feasibility of Secure Multipath Communication

“…Common to all these references are their strong hypotheses on the underlying network graph topology, which gave rise to the game-theoretic treatment in [9] attempting to apply these ideas in general rather than only strongly connected networks. Ever since then, the picture has been extended in various ways, such as by looking for lower bounds on the graph connectivity [8], [10]- [14] implications of synchrony and asynchrony in the transmission [15], [16] impossibility results [17], [18] or applications of MPT in ad hoc and wireless networks [19]- [23].…”

“…Put differently, if the advantage is computed as the Nash-equilibrium solution , then this value lower-bounds the success-rate of the MPTprotocol regardless of what the attacker actually does (see [9] and [32] for formal proofs), conditional on the only hypothesis that no attack outside is mounted (in which case, however, any security analysis would fail). www.ijacsa.thesai.org…”

Quantum Key Management

“…At this point, we can invoke game-theory to provide us with the best way of choosing among our options (paths). A full discussion of this idea is given by Rass & Schartner (2010b), and we will use a simple example to illustrate the idea here.…”

“…In case that the adversary does not play a zero-sum regime, the equality changes into a lower-bound to the probability (this can be proven by twice-exploitation of the saddle-point property of the Nash-equilibrium; cf. Rass & Schartner (2010b)). …”

“…Repeating this reduction, we end up with a 5 × 6-matrix and corresponding strategies as shown in Figure 7. The core concept introduced by Rass & Schartner (2010b) is the vulnerability, defined as the difference between the maximum possible outcome and the average outcome. Formally, the vulnerability ρ(A) := 1 − v(A) for a (zeros-sum) game-matrix A ∈ {0, 1} n×m .…”