IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-031-57927-1_10.html
   My bibliography  Save this book chapter

Supply Chain Cybersecurity: Security Controls with Maximum Cybersecurity Value

In: Stochastic Programming in Supply Chain Risk Management

Author

Listed:
  • Tadeusz Sawik

    (University of Kraków
    Reykjavik University
    Indian Institute of Management)

Abstract

This chapter deals with optimization of cybersecurity investment in supply chains using stochastic programming approach. A classical exponential function of breach probability and the intuitive idea of the expected net benefits were applied to introduce the concept of cybersecurity value. The cybersecurity value of a security control is defined as the value gained by implementing a single control to secure a subset of components. The cybersecurity value of a control can be seen as a measure of its efficiency in reducing vulnerability of a secured system or component. A mixed binary optimization problem, next transformed into an unconstrained binary program, is developed to maximize total cybersecurity value of security control portfolio. The optimal solution to the binary program provides a simple formula to immediately obtain the portfolio of security controls with maximum total cybersecurity value and determine a rough-cut cybersecurity investment. This study also shows that portfolio of security controls with maximum total cybersecurity value reduces the losses from security breaches and mitigates the impact of cyber risk. The major decision-making insights are summarized at the end of this chapter.

Suggested Citation

  • Tadeusz Sawik, 2024. "Supply Chain Cybersecurity: Security Controls with Maximum Cybersecurity Value," International Series in Operations Research & Management Science, in: Stochastic Programming in Supply Chain Risk Management, chapter 0, pages 323-346, Springer.
  • Handle: RePEc:spr:isochp:978-3-031-57927-1_10
    DOI: 10.1007/978-3-031-57927-1_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-3-031-57927-1_10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.