This website is automatically generated, my personal website can be found here.

Expertise

  • Computer Science

    • Attack
    • Differential Privacy
    • Utilities
    • Frequency Estimation
    • Algorithms
    • Robust Optimization
    • Integer-Linear Programming
    • Optimization Problem

Organisations

Publications

2024

How hard can it be? Quantifying MITRE attack campaigns with attack trees and cATM logic (experimental reproduction package) (2024)[Dataset Types › Dataset]. Zenodo. Nicoletti, S. M., Lopuhaä-Zwakenberg, M., Stoelinga, M., Massacci, F. & Budde, C. E.https://doi.org/10.5281/zenodo.14193935How hard can it be?: Quantifying MITRE attack campaigns with attack trees and cATM logic (2024)[Working paper › Preprint]. ArXiv.org. Nicoletti, S. M., Lopuhaä-Zwakenberg, M., Stoelinga, M., Massacci, F. & Budde, C. E.https://doi.org/10.48550/arXiv.2410.06692Safety-Security Analysis via Attack-Fault-Defense Trees: Semantics and Cut Set Metrics (2024)In Computer Safety, Reliability, and Security: 43rd International Conference, SAFECOMP 2024, Florence, Italy, September 18–20, 2024, Proceedings (pp. 218-232) ( Lecture Notes in Computer Science; Vol. 14988). Springer. Soltani, R., Lopuhaä-Zwakenberg, M. & Stoelinga, M.https://doi.org/10.1007/978-3-031-68606-1_14Quantitative Comparisons of MITRE ATT&CK Campaigns (2024)[Dataset Types › Dataset]. 4TU.Centre for Research Data. Nicoletti, S. M., Lopuhaä - Zwakenberg, M. A., Stoelinga, M., Massacci, F. & Budde, C.https://doi.org/10.4121/779a6a17-ed5e-4bfc-9068-6a16e3f7d10dFuzzy Fault Trees Formalized (2024)[Working paper › Preprint]. ArXiv.org. Dang, T. K. N., Lopuhaä-Zwakenberg, M. & Stoelinga, M.https://doi.org/10.48550/arXiv.2403.08843

Research profiles

In the press

Address

University of Twente

Zilverling (building no. 11), room 3078
Hallenweg 19
7522 NH Enschede
Netherlands

Navigate to location

Organisations

Scan the QR code or
Download vCard