Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current attack graph displays are complex and difficult to relate to the underlying physical networks. We have developed a new interactive tool intended to provide a simplified and more intuitive understanding of key weaknesses discove...

The existing social network privacy protection method mostly aims at the individuals of the social network, which cannot protect effectively the sensitive relations in the social network. Therefore, this paper proposes a new personalized K_L model. This model requires each sensitive relation with the sensitive relational point have l at least, and also the point with the same requirement has k ...

Cache based side-channel attacks have recently been attracted significant attention due to the new developments in the field. In this paper, we present an efficient trace-driven cache attack on a widely used implementation of the AES cryptosystem. We also evaluate the cost of the proposed attack in detail under the assumption of a noiseless environment. We develop an accurate mathematical model...

Existing coordinated cyber-attack detection methods have low accuracy and efficiency poor generalization ability due to difficulties dealing with unbalanced attack data samples, high dimensionality, noisy sets. This paper proposes a model for cyber physical fusion using link detecting attacks on Cyber–Physical Power System (CPPS). The two-step principal component analysis (PCA) is used classify...

Finding the optimal policy in the attack graph is known to be an NP-hard problem. Correlated Stackelberg Equilibrium (CSE) approximates Strong Stackelberg Equilibrium (SSE), which finds the optimal policy profile for two players, a defender and an attacker. This thesis investigates the application of iterative algorithms to reduce the computation time of CSE algorithm. Iterative algorithms allo...

We investigate generalizations of pebbling numbers and of Graham’s pebbling conjecture that π(G × H) ≤ π(G)π(H), where π(G) is the pebbling number of the graph G. We develop new machinery to attack the conjecture, which is now twenty years old. We show that certain conjectures imply others that initially appear stronger. We also find counterexamples that show that Sjöstrand’s theorem on cover p...

Mining large graphs for information is becoming an increasingly important workload due to the plethora of graph structured data becoming available. An aspect of graph algorithms that has hitherto not received much interest is the effect of memory hierarchy on accesses. A typical system today has multiple levels in the memory hierarchy with differing units of locality; ranging across cache lines...

The paper introduces a concept of attributed context-sensitive graph grammars. The graph grammars are a graphical generalization of the textual grammars and can thus be used to specify the syntax of graphical programming or modeling languages. The attributed graph grammars extend the basic graph grammars with definitions of attributes and the associated attribute evaluation rules. By analogy to...

Traditional model checking produces one counterexample to illustrate a violation of a property by a model of the system. Some applications benefit from having all counterexamples, not just one. We call this set of counterexamples a scenario graph. In this chapter we present two different algorithms for producing scenario graphs and explain how scenario graphs are a natural representation for at...