Formulating cyber-security as convex optimization problems

DOI10.1007/978-3-319-01159-2_5MaRDI QIDQ2925500zbMATH OpenOpenAlexFDO

Authors Kyriakos G. Vamvoudakis, Giovanni Vigna, J. P. Hespanha, Richard A. Kemmerer

Publication date 16 October 2014

Published in Control of Cyber-Physical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-01159-2_5

zbMATH Keywords

convex optimizationcyber-securityiCTFsystem identification

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic systems in control theory (general) (93E03) Estimation and detection in stochastic control theory (93E10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A supervisory control approach to dynamic cyber-security
• Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
• A strategy optimization approach for mission deployment in distributed systems
• Dynamic game theories in cyber security
• Quantifying cyber-security for networked control systems

Cited in

(4)

• A strategy optimization approach for mission deployment in distributed systems
• Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs
• A Review of Several Optimization Problems Related to Security in Networked System
• Multi-points cyber defense \((1+\epsilon )\) and \((1+\epsilon )^{k-k'}\)-approximation

This page was built for publication: Formulating cyber-security as convex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2925500)