Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jukka Soikkeli

dblp:239/4073 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0002-1628-9238ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security
attack resilience
0.712023
Redundancy Planning for Cost Efficient Resilience to Cyber Attacks · IEEE Trans. Dependable Secur. Comput. 2023
Performance modeling and evaluation › queueing models
queueing network analysis
0.212023
Redundancy Planning for Cost Efficient Resilience to Cyber Attacks · IEEE Trans. Dependable Secur. Comput. 2023

Methods — techniques the papers use, named apart from their topics

analytical modeling · 1.3queueing networks · 0.7queueing network · 0.7attack graphs · 0.7attack graph · 0.7
YearPublicationVenuePosition
2023 Redundancy Planning for Cost Efficient Resilience to Cyber Attacks
abstract
We investigate the extent to which redundancy (including with diversity) can help mitigate the impact of cyber attacks that aim to reduce system performance. Using analytical techniques, we estimate impacts, in terms of monetary costs, of penalties from breaching Service Level Agreements (SLAs), and find optimal resource allocations to minimize the overall costs arising from attacks. Our approach combines attack impact analysis, based on performance modeling using queueing networks, with an attack model based on attack graphs. We evaluate our approach using a case study of a website, and show how resource redundancy and diversity can improve the resilience of a system by reducing the likelihood of a fully disruptive attack. We find that the cost-effectiveness of redundancy depends on the SLA terms, the probability of attack detection, the time to recover, and the cost of maintenance. In our case study, redundancy with diversity achieved a saving of up to around 50 percent in expected attack costs relative to no redundancy. The overall benefit over time depends on how the saving during attacks compares to the added maintenance costs due to redundancy.
Jukka Soikkeli, Giuliano Casale, Luis Muñoz-González, Emil C. Lupu
IEEE Trans. Dependable Secur. Comput.1
2019 Efficient Attack Countermeasure Selection Accounting for Recovery and Action Costs
abstract
The losses arising from a system being hit by cyber attacks can be staggeringly high, but defending against such attacks can also be costly. This work proposes an attack countermeasure selection approach based on cost impact analysis that takes into account the impacts of actions by both the attacker and the defender.
Jukka Soikkeli, Luis Muñoz-González, Emil C. Lupu
ARES1