Toward security quantification of serverless computing
Serverless computing is one of the recent compelling paradigms in cloud computing. Serverless computing can quickly run user applications and services regardless of the underlying server architecture. Despite the availability of several commercial and open-source serverless platforms, there are still some open issues and challenges to address. One of the key concerns in serverless computing platforms is security. Therefore, in this paper, we present a multi-layer abstract model of serverless computing for an security investigation. We conduct a quantitative analysis of security risks for each layer. We observe that the Attack Tree and Attack-Defense Tree methodologies are viable approaches in this regard. Consequently, we make use of the Attack Tree and the Attack-Defense Tree to quantify the security risks and countermeasures of serverless computing. We also propose a novel measure called the Relative Risk Matrix (RRM) to quantify the probability of attack success. Stakeholders including application developers, researchers, and cloud providers can potentially apply these findings and implications to better understand and further enhance the security of serverless computing.
Authors
- Tian Tan
- H M Dipu Kabir (ORCID: https://orcid.org/0000-0002-3395-1772)
- Subrota Kumar Mondal
- Hong‐Ning Dai (ORCID: https://orcid.org/0000-0001-6165-4196)
- Kan Ni (ORCID: https://orcid.org/0000-0001-6477-1005)
Institutions
- Macau University of Science and Technology (MO)
- Hong Kong Baptist University (HK)
- Charles Sturt University (AU)
Publication Details
- Journal
- Journal of Cloud Computing Advances Systems and Applications
- Published
- 2024-09-17
- DOI
- https://doi.org/10.1186/s13677-024-00703-y
- Citations
- 9
- Primary Topic
- Security and Verification in Computing
- Type
- article
- Field-Weighted Citation Impact
- 3.13
Funders
- Macau University of Science and Technology