Preventing advanced persistent threats in complex control networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 10493 LNCS, Issue , 2017, Pages 402-418

  Rubio, Juan E ^a   Alcaraz, Cristina ^a   Lopez, Javier ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Advanced; Attack; Consensus; Detection; Dynamics; Opinion; Persistent; Redundant; Response; Secret; Sharing; Threat; Topology

Indexed keywords

AUTOMATION; COMPLEX NETWORKS; DYNAMICS; ERROR DETECTION; GRAPH THEORY; SECURITY OF DATA; SECURITY SYSTEMS;

ADVANCED; ATTACK; CONSENSUS; OPINION; PERSISTENT; REDUNDANT; RESPONSE; SECRET; SHARING; THREAT;

TOPOLOGY;

EID: 85029509042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-66399-9_22     Document Type: Conference Paper

References (15)

1. Chen, P., Desmet, L., Huygens, C.: A study on advanced persistent threats. In: Decker, B., Zúquete, A. (eds.) CMS 2014. LNCS, vol. 8735, pp. 63–72. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44885-4 5
2. Virvilis, N., Gritzalis, D., Apostolopoulos, T.: Trusted computing vs. advanced persistent threats: can a defender win this game? In: Ubiquitous Intelligence and Computing, 2013 IEEE 10th International Conference on and 10th International Conference on Autonomic and Trusted Computing (UIC/ATC), pp. 396–403. IEEE (2013)
3. Pagani, G.A., Aiello, M.: The power grid as a complex network: a survey. Phys. A: Stat. Mech. Appl. 392(11), 2688–2700 (2013)
4. Lin, C.-T.: Structural controllability. IEEE Trans. Autom. Control 19(3), 201–208 (1974)
5. Nie, S., Wang, X., Zhang, H., Li, Q., Wang, B.: Robustness of controllability for networks based on edge-attack. PLoS ONE 9(2), e89066 (2014)
6. Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15(4), 519–529 (2002)
7. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Parameterized power domination complexity. Inf. Process. Lett. 98(4), 145–149 (2006)
8. Blondel, V.D., Hendrickx, J.M., Olshevsky, A., Tsitsiklis, J.N.: Convergence in multiagent coordination, consensus, and flocking. In: 44th IEEE Conference on 2005 and 2005 European Control Conference Decision and Control, CDC-ECC 2005, pp. 2996–3000. IEEE (2005)
9. Hegselmann, R., Krause, U., et al.: Opinion dynamics and bounded confidence models, analysis, and simulation. J. Artif. Soc. Soc. Simul. 5(3) (2002). http://jasss.soc.surrey.ac.uk/5/3/contents.html
10. Alcaraz, C., Lopez, J.: Safeguarding structural controllability in cyber-physical control systems. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9879, pp. 471–489. Springer, Cham (2016). doi:10. 1007/978-3-319-45741-3 24
11. Alcaraz, C., Wolthusen, S.: Recovery of structural controllability for control systems. In: Butts, J., Shenoi, S. (eds.) ICCIP 2014. IAICT, vol. 441, pp. 47–63. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45355-1 4
12. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
13. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
14. Lee, C.Y.: An algorithm for path connections and its applications. IRE Trans. Electron. Comput. 3, 346–365 (1961)
15. Ek, B., VerSchneider, C., Narayan, D.A.: Global efficiency of graphs. AKCE Int. J. Graphs Comb. 12(1), 1–13 (2015)