Sam Jabbehdari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sam Jabbehdari has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Hamid Haj Seyyed Javadi
Department of Computer Engineering, Shahed University, Tehran, Iran
5 shared publications - Hamidreza Navidi
Department of Mathematics and Computer Sciences, Shahed University, Tehran 3319118651, Iran
4 shared publications - Mehrnoush Vaseghipanah
Department of Computer, Tehran North Branch, Islamic Azad University, Tehran, Iran, Iran
4 shared publications - Mohammad Faraji-Mehmandar
Department of Computer Engineering, Parand Branch, Islamic Azad University, Tehran, Iran
4 shared publications Hamid Haj Seyyed Javadi
Shahed University Tehran, Iran
3 shared publications- Amir Masoud Rahmani
Future Technology Research Center, National Yunlin University of Science and Technology, Yunlin, Taiwan
2 shared publications
Latest Publications
- Open Access
Auditing Inferential Blind Spots: A Framework for Evaluating Forensic Coverage in Network Telemetry Architectures
Network operators increasingly rely on abstracted telemetry (e.g., flow records and time-aggregated statistics) to achieve scalable monitoring of high-speed networks, but this abstraction fundamentally constrains the forensic and security inferences that can be supported from network data. We present a design-time audit framework that evaluates which threat hypotheses become non-supportable as network evidence is transformed from packet-level traces to flow records and time-aggregated statistics. Our methodology examines three evidence layers (L0: packet headers, L1: IP Flow Information Export (IPFIX) flow records, L2: time-aggregated flows), computes a catalog of 13 network-forensic artifacts (e.g., destination fan-out, inter-arrival time burstiness, SYN-dominant connection patterns) at each layer, and maps artifact availability to tactic support using literature-grounded associations with MITRE Adversarial Tactics, Techniques, and Common Knowledge (ATT&CK). Applied to backbone traffic from the MAWI Day-In-The-Life (DITL) archive, the audit reveals selectiveinference loss: Execution becomes non-supportable at L1 (due to loss of packet-level timing artifacts), while Lateral Movement and Persistence become non-supportable at L2 (due to loss of entity-linked structural artifacts). Inference coverage decreases from 9 to 7 out of 9 evaluated ATT&CK tactics, while coverage of defensive countermeasures (MITRE D3FEND) increases at L1 (7 → 8 technique categories) then decreases at L2 (8 → 7), reflecting a shift from behavioral monitoring to flow-based controls. The framework provides network architects with a practical tool for configuring telemetry systems (e.g., IPFIX exporters, P4 pipelines) to reason about and provision the minimum forensic coverage.
Open AccessAuditing Inferential Blind Spots: A Framework for Evaluating Forensic Coverage in Network Telemetry Architectures
Network operators increasingly rely on abstracted telemetry (e.g., flow records and time-aggregated statistics) to achieve scalable monitoring of high-speed networks, but this abstraction fundamentally constrains the forensic and security inferences that can be supported from network data. We present a design-time audit framework that evaluates which threat hypotheses become non-supportable as network evidence is transformed from packet-level traces to flow records and time-aggregated statistics. Our methodology examines three evidence layers (L0: packet headers, L1: IP Flow Information Export (IPFIX) flow records, L2: time-aggregated flows), computes a catalog of 13 network-forensic artifacts (e.g., destination fan-out, inter-arrival time burstiness, SYN-dominant connection patterns) at each layer, and maps artifact availability to tactic support using literature-grounded associations with MITRE Adversarial Tactics, Techniques, and Common Knowledge (ATT&CK). Applied to backbone traffic from the MAWI Day-In-The-Life (DITL) archive, the audit reveals selectiveinference loss: Execution becomes non-supportable at L1 (due to loss of packet-level timing artifacts), while Lateral Movement and Persistence become non-supportable at L2 (due to loss of entity-linked structural artifacts). Inference coverage decreases from 9 to 7 out of 9 evaluated ATT&CK tactics, while coverage of defensive countermeasures (MITRE D3FEND) increases at L1 (7 → 8 technique categories) then decreases at L2 (8 → 7), reflecting a shift from behavioral monitoring to flow-based controls. The framework provides network architects with a practical tool for configuring telemetry systems (e.g., IPFIX exporters, P4 pipelines) to reason about and provision the minimum forensic coverage.
- Open Access
- 6 January 2026
- Published by MDPI AG in Preprints.org
Auditing Inferential Blind Spots: A Framework for Evaluating Forensic Coverage in Network Telemetry Architectures
Network operators increasingly rely on abstracted telemetry (e.g., flow records and time-aggregated statistics) to achieve scalable monitoring of high-speed networks, but this abstraction fundamentally constrains the forensic and security inferences that can be supported from network data. We present a design-time audit framework that evaluates which threat hypotheses become non-supportable as network evidence is transformed from packet-level traces to flow records and time-aggregated statistics. Our methodology examines three evidence layers (L0: packet headers, L1: IP Flow Information Export (IPFIX) flow records, L2: time-aggregated flows), computes a catalog of 13 network-forensic artifacts (e.g., destination fan-out, inter-arrival time burstiness, SYN-dominant connection patterns) at each layer, and maps artifact availability to tactic support using literature-grounded associations with MITRE Adversarial Tactics, Techniques, and Common Knowledge (ATT&CK). Applied to backbone traffic from the MAWI Day-In-The-Life (DITL) archive, the audit reveals non-monotonic transformation: inference coverage decreases from 9 to 7 out of 9 evaluated ATT&CK tactics, while coverage of defensive countermeasures (MITRE D3FEND) increases at L1 (7→8 technique categories) then decreases at L2 (8→7), reflecting a shift from behavioral monitoring to flow-based controls. The framework provides network architects with a practical tool to configure telemetry systems (e.g., IPFIX exporters, P4 pipelines) to reason about and provision minimum forensic coverage.
- 6 January 2026
- Published by MDPI AG in Preprints.org
Open AccessAuditing Inferential Blind Spots: A Framework for Evaluating Forensic Coverage in Network Telemetry Architectures
Network operators increasingly rely on abstracted telemetry (e.g., flow records and time-aggregated statistics) to achieve scalable monitoring of high-speed networks, but this abstraction fundamentally constrains the forensic and security inferences that can be supported from network data. We present a design-time audit framework that evaluates which threat hypotheses become non-supportable as network evidence is transformed from packet-level traces to flow records and time-aggregated statistics. Our methodology examines three evidence layers (L0: packet headers, L1: IP Flow Information Export (IPFIX) flow records, L2: time-aggregated flows), computes a catalog of 13 network-forensic artifacts (e.g., destination fan-out, inter-arrival time burstiness, SYN-dominant connection patterns) at each layer, and maps artifact availability to tactic support using literature-grounded associations with MITRE Adversarial Tactics, Techniques, and Common Knowledge (ATT&CK). Applied to backbone traffic from the MAWI Day-In-The-Life (DITL) archive, the audit reveals non-monotonic transformation: inference coverage decreases from 9 to 7 out of 9 evaluated ATT&CK tactics, while coverage of defensive countermeasures (MITRE D3FEND) increases at L1 (7→8 technique categories) then decreases at L2 (8→7), reflecting a shift from behavioral monitoring to flow-based controls. The framework provides network architects with a practical tool to configure telemetry systems (e.g., IPFIX exporters, P4 pipelines) to reason about and provision minimum forensic coverage.
- Open Access
- 26 November 2025
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 5 (4) , 105
A Game-Theoretic Approach for Quantification of Strategic Behaviors in Digital Forensic Readiness
Small and Medium-sized Enterprises (SMEs) face disproportionately high risks from Advanced Persistent Threats (APTs), which often evade traditional cybersecurity measures. Existing frameworks catalogue adversary tactics and defensive solutions but provide limited quantitative guidance for allocating limited resources under uncertainty, a challenge amplified by the growing use of AI in both offensive operations and digital forensics. This paper proposes a game-theoretic model for improving digital forensic readiness (DFR) in SMEs. The approach integrates the MITRE ATT&CK and D3FEND frameworks to map APT behaviors to defensive countermeasures and defines 32 custom DFR metrics, weighted using the Analytic Hierarchy Process (AHP), to derive utility functions for both attackers and defenders. The main analysis considers a non-zero-sum attacker–defender bimatrix game and yields a single Nash equilibrium in which the attacker concentrates on Impact-oriented tactics and the defender on Detect-focused controls. In a synthetic calibration across ten organizational profiles, the framework achieves a median readiness improvement of 18.0% (95% confidence interval: 16.3% to 19.7%) relative to pre-framework baselines, with targeted improvements in logging and forensic preservation typically reducing key attacker utility components by around 15–30%. A zero-sum variant of the game is also analyzed as a robustness check and exhibits consistent tactical themes, but all policy conclusions are drawn from the empirical non-zero-sum model. Despite relying on expert-driven AHP weights and synthetic profiles, the framework offers SMEs actionable, equilibrium-informed guidance for strengthening forensic preparedness against advanced cyber threats.
- 26 November 2025
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 5 (4) , 105
Open AccessA Game-Theoretic Approach for Quantification of Strategic Behaviors in Digital Forensic Readiness
Small and Medium-sized Enterprises (SMEs) face disproportionately high risks from Advanced Persistent Threats (APTs), which often evade traditional cybersecurity measures. Existing frameworks catalogue adversary tactics and defensive solutions but provide limited quantitative guidance for allocating limited resources under uncertainty, a challenge amplified by the growing use of AI in both offensive operations and digital forensics. This paper proposes a game-theoretic model for improving digital forensic readiness (DFR) in SMEs. The approach integrates the MITRE ATT&CK and D3FEND frameworks to map APT behaviors to defensive countermeasures and defines 32 custom DFR metrics, weighted using the Analytic Hierarchy Process (AHP), to derive utility functions for both attackers and defenders. The main analysis considers a non-zero-sum attacker–defender bimatrix game and yields a single Nash equilibrium in which the attacker concentrates on Impact-oriented tactics and the defender on Detect-focused controls. In a synthetic calibration across ten organizational profiles, the framework achieves a median readiness improvement of 18.0% (95% confidence interval: 16.3% to 19.7%) relative to pre-framework baselines, with targeted improvements in logging and forensic preservation typically reducing key attacker utility components by around 15–30%. A zero-sum variant of the game is also analyzed as a robustness check and exhibits consistent tactical themes, but all policy conclusions are drawn from the empirical non-zero-sum model. Despite relying on expert-driven AHP weights and synthetic profiles, the framework offers SMEs actionable, equilibrium-informed guidance for strengthening forensic preparedness against advanced cyber threats.
- Open Access
- 11 November 2025
- Published by MDPI AG in Preprints.org
A Game-Theoretic Approach for Quantification of Strategic Behaviors in Digital Forensic Readiness
Small and Medium-sized Enterprises (SMEs) face disproportionately high risks from Advanced Persistent Threats (APTs), which often evade traditional cybersecurity measures. Existing frameworks catalogue adversary tactics and defensive solutions but provide limited quantitative guidance for allocating limited resources under uncertainty, a challenge amplified by the growing use of AI in both offensive operations and digital forensics. This paper proposes a game-theoretic model for improving Digital Forensic Readiness (DFR) in SMEs. The approach integrates the MITRE ATT&CK and D3FEND frameworks to map APT behaviours to defensive countermeasures and defines 32 custom DFR metrics, weighted using the Analytic Hierarchy Process (AHP), to derive utility functions for both attackers and defenders. The main analysis considers a non-zero-sum attacker–defender bimatrix game and yields a single Nash equilibrium in which the attacker concentrates on Impact-oriented tactics and the defender on Detect-focused controls. In a synthetic calibration across ten organisational profiles, the framework achieves a median readiness improvement of 18.0% (95% confidence interval: 16.3% to 19.7%) relative to pre framework baselines, with targeted improvements in logging and forensic preservation typically reducing key attacker utility components by around 15–30%. A zero-sum variant of the game is also analysed as a robustness check and exhibits consistent tactical themes, but all policy conclusions are drawn from the empirical non-zero-sum model. Despite relying on expert-driven AHP weights and synthetic profiles, the framework offers SMEs actionable, equilibrium-informed guidance for strengthening forensic preparedness against advanced cyber threats.
- 11 November 2025
- Published by MDPI AG in Preprints.org
Open AccessA Game-Theoretic Approach for Quantification of Strategic Behaviors in Digital Forensic Readiness
Small and Medium-sized Enterprises (SMEs) face disproportionately high risks from Advanced Persistent Threats (APTs), which often evade traditional cybersecurity measures. Existing frameworks catalogue adversary tactics and defensive solutions but provide limited quantitative guidance for allocating limited resources under uncertainty, a challenge amplified by the growing use of AI in both offensive operations and digital forensics. This paper proposes a game-theoretic model for improving Digital Forensic Readiness (DFR) in SMEs. The approach integrates the MITRE ATT&CK and D3FEND frameworks to map APT behaviours to defensive countermeasures and defines 32 custom DFR metrics, weighted using the Analytic Hierarchy Process (AHP), to derive utility functions for both attackers and defenders. The main analysis considers a non-zero-sum attacker–defender bimatrix game and yields a single Nash equilibrium in which the attacker concentrates on Impact-oriented tactics and the defender on Detect-focused controls. In a synthetic calibration across ten organisational profiles, the framework achieves a median readiness improvement of 18.0% (95% confidence interval: 16.3% to 19.7%) relative to pre framework baselines, with targeted improvements in logging and forensic preservation typically reducing key attacker utility components by around 15–30%. A zero-sum variant of the game is also analysed as a robustness check and exhibits consistent tactical themes, but all policy conclusions are drawn from the empirical non-zero-sum model. Despite relying on expert-driven AHP weights and synthetic profiles, the framework offers SMEs actionable, equilibrium-informed guidance for strengthening forensic preparedness against advanced cyber threats.
- 12 July 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 34 (18)
Logicmark: A Logical-Level Watermarking Approach for Secure Ownership Verification in Hardware Designs
Hardware designs that undergo commercialization are susceptible to various threats such as sabotage, theft, and counterfeiting. Consequently, malicious individuals can easily gain access to the circuits, make slight modifications, and claim the designs as their own. These actions have a detrimental impact on chip designers, leading to financial losses and market share reduction for manufacturers. The proposed method introduces a novel approach for embedding hardware watermarks within circuits to establish ownership and ensure integrity. Initially, a logo is created and assigned a unique code using a predefined algorithm. This code is then hashed using the SHA3 algorithm to produce SHA3-logo. To embed the watermark, various inputs are applied and their corresponding outputs are compared to the SHA3-logo code, with the input-output pair showing the least discrepancy chosen for embedding. XOR gates are introduced for bits differing from SHA3-logo, with the watermark activator facilitating alignment. The findings illustrate the effectiveness of the approach in ensuring ownership and integrity. To assess hardware overhead, standard benchmark circuits were employed, revealing a maximum delay overhead of 3.19% and a maximum area overhead of 4.67%. Importantly, the proposed method did not incur any additional power consumption overhead for the circuit in FPGA technology.
- 12 July 2025
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 34 (18)
Logicmark: A Logical-Level Watermarking Approach for Secure Ownership Verification in Hardware Designs
Hardware designs that undergo commercialization are susceptible to various threats such as sabotage, theft, and counterfeiting. Consequently, malicious individuals can easily gain access to the circuits, make slight modifications, and claim the designs as their own. These actions have a detrimental impact on chip designers, leading to financial losses and market share reduction for manufacturers. The proposed method introduces a novel approach for embedding hardware watermarks within circuits to establish ownership and ensure integrity. Initially, a logo is created and assigned a unique code using a predefined algorithm. This code is then hashed using the SHA3 algorithm to produce SHA3-logo. To embed the watermark, various inputs are applied and their corresponding outputs are compared to the SHA3-logo code, with the input-output pair showing the least discrepancy chosen for embedding. XOR gates are introduced for bits differing from SHA3-logo, with the watermark activator facilitating alignment. The findings illustrate the effectiveness of the approach in ensuring ownership and integrity. To assess hardware overhead, standard benchmark circuits were employed, revealing a maximum delay overhead of 3.19% and a maximum area overhead of 4.67%. Importantly, the proposed method did not incur any additional power consumption overhead for the circuit in FPGA technology.
- Open Access
- 1 February 2024
- Published by Apex Publishing in International Journal of Information and Communication Technology Research
- Vol. 16 (1) , 20-27
Reducing The Computational Complexity of Fuzzy Identity-Based Encryption from Lattice
—In order to provide access control on encrypted data, Attribute-based encryption (ABE) defines each user using a set of attributes. Fuzzy identity-based encryption (FIBE) is a variant of ABE that allows for a threshold access structure for users. To address the potential threat posed by future quantum computers, this paper presents a postquantum fuzzy ...
- 1 February 2024
- Published by Apex Publishing in International Journal of Information and Communication Technology Research
- Vol. 16 (1) , 20-27
Open AccessReducing The Computational Complexity of Fuzzy Identity-Based Encryption from Lattice
—In order to provide access control on encrypted data, Attribute-based encryption (ABE) defines each user using a set of attributes. Fuzzy identity-based encryption (FIBE) is a variant of ABE that allows for a threshold access structure for users. To address the potential threat posed by future quantum computers, this paper presents a postquantum fuzzy ...
- 11 November 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (6) , 7906-7930
An efficient optimization algorithm for nonlinear 2D fractional optimal control problems
- 11 November 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (6) , 7906-7930
An efficient optimization algorithm for nonlinear 2D fractional optimal control problems
- 26 May 2023
- Published by Springer Nature in Cluster Computing
- Vol. 27 (2) , 1503-1525
An efficient edge caching approach for SDN-based IoT environments utilizing the moth flame clustering algorithm
- 26 May 2023
- Published by Springer Nature in Cluster Computing
- Vol. 27 (2) , 1503-1525
An efficient edge caching approach for SDN-based IoT environments utilizing the moth flame clustering algorithm
- 19 February 2023
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 14 (4) , 4237-4255
Fuzzy Q-learning approach for autonomic resource provisioning of IoT applications in fog computing environments
- 19 February 2023
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 14 (4) , 4237-4255
Fuzzy Q-learning approach for autonomic resource provisioning of IoT applications in fog computing environments