Roman Obermaisser
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Roman Obermaisser has a total of 106 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Onwuchekwa
Chair of Embedded Systems, University of Siegen, Hölderlinstraße 3, 57076 Siegen, Germany
14 shared publications - Rashed Al Amin
University of Siegen
9 shared publications - Ala Khalifeh
German Jordanian University, Amman, Jordan
4 shared publications - Ali Behravan
Department of Electrical Engineering and Computer Science, University of Siegen, 57076 Siegen, Germany
4 shared publications - Dhiah el Diehn I. Abou-Tair
German Jordanian university
4 shared publications - Pascal Muoka
University of Siegen
4 shared publications
Latest Publications
- Open Access
Investigating the Impact of Low-Rate Error-Correction Codes on Device-Cloning and Reverse-Engineering Attacks on Physical Unclonable Functions
Securing Internet of Things (IoT) devices is important due to the rapid growth of smart devices and increasing demand for artificial intelligence (AI)-enabled functionality. However, IoT devices are often resource-constrained, making robust security measures challenging to implement. To address this issue, physical unclonable functions (PUFs) can be implemented on chips to generate device-specific signatures. Due to their lightweight structure, PUFs are suitable for resource-constrained IoT devices. However, PUFs are sensitive to environmental and operational variations, which can cause bit errors in the generated signatures and affect security applications. These errors can be corrected using error-correction codes (ECCs), enabling reliable signatures under varying conditions. This paper quantitatively investigates potential security risks associated with low-rate low-density parity-check (LDPC) codes in PUF-based applications. Two attack scenarios are analyzed using a modeled PUF. Our model-based results show that low-rate LDPC codes can significantly improve PUF reliability but may also introduce security risks. For the evaluated device-cloning attack scenario, the WiMAX LDPC code with a code rate of and a soft-information length of resulted in a maximum success probability of for reconstructing the secret response at an ambient temperature of 10 °C, demonstrating a potential security vulnerability for this configuration.Open AccessInvestigating the Impact of Low-Rate Error-Correction Codes on Device-Cloning and Reverse-Engineering Attacks on Physical Unclonable Functions
Securing Internet of Things (IoT) devices is important due to the rapid growth of smart devices and increasing demand for artificial intelligence (AI)-enabled functionality. However, IoT devices are often resource-constrained, making robust security measures challenging to implement. To address this issue, physical unclonable functions (PUFs) can be implemented on chips to generate device-specific signatures. Due to their lightweight structure, PUFs are suitable for resource-constrained IoT devices. However, PUFs are sensitive to environmental and operational variations, which can cause bit errors in the generated signatures and affect security applications. These errors can be corrected using error-correction codes (ECCs), enabling reliable signatures under varying conditions. This paper quantitatively investigates potential security risks associated with low-rate low-density parity-check (LDPC) codes in PUF-based applications. Two attack scenarios are analyzed using a modeled PUF. Our model-based results show that low-rate LDPC codes can significantly improve PUF reliability but may also introduce security risks. For the evaluated device-cloning attack scenario, the WiMAX LDPC code with a code rate of and a soft-information length of resulted in a maximum success probability of for reconstructing the secret response at an ambient temperature of 10 °C, demonstrating a potential security vulnerability for this configuration. - 24 August 2026
- Published by Springer Nature
- p. 251-264
PUF Enabled Trojan Trigger Prevention in IoE Edge Devices
- 24 August 2026
- Published by Springer Nature
- p. 251-264
PUF Enabled Trojan Trigger Prevention in IoE Edge Devices
- 24 August 2026
- Published by Springer Nature
- p. 265-277
PUF Based Cybersecurity Architecture for Hardware Trojan Detection in IoT Enabled Cyber Physical Systems
- 24 August 2026
- Published by Springer Nature
- p. 265-277
PUF Based Cybersecurity Architecture for Hardware Trojan Detection in IoT Enabled Cyber Physical Systems
- Open Access
- 18 August 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (8) , 441
Hierarchical Scheduler with Adaptive Time-Budget Reallocation for Time-Triggered Edge-Fog-Cloud Architectures
The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, resource contention, and timing jitter, making standard schedulers unsuitable for hard-deadline workloads. Moreover, most approaches focus on computational placement, while communication is abstracted or treated as a secondary cost term. As a result, bounded-latency routing and deterministic task execution are rarely co-optimized under a unified timing model. This paper addresses these gaps by utilizing a managed Time-Triggered Edge–Fog–Cloud (TTEFC) architecture that supports safety-critical workloads, orchestrates IEEE Time-Sensitive Networking (TSN) for local intra-domain communication, and uses IETF Deterministic Networking (DetNet) for routed inter-domain paths. On this infrastructure, a hierarchical genetic algorithm (HGA) is proposed to jointly schedule partition-to-execution-location allocation, partition execution order, inter-partition route selection, and negotiated per-partition time budgets that act as temporal boundaries for parallel partition-level optimizers. An adaptive slack reallocation operator redistributes unused temporal slack from over-satisfied partitions to budget-violating partitions, improving feasibility convergence. Experiments on synthetic DAG workloads with 100–500 tasks compare the proposed HGA against HEFT and round-robin baselines. These baselines are included as scoped external references to contextualize the end-to-end scheduling performance of the proposed method. Ablation results show that slack reallocation improves partition-budget feasibility, reaches feasible budget assignments earlier, and produces tighter budget–makespan alignment than feedback-free and static-budget variants. An automotive-characteristic DAG case study further evaluates the method on an application-oriented workload under the same timing and communication assumptions.
- 18 August 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (8) , 441
Open AccessHierarchical Scheduler with Adaptive Time-Budget Reallocation for Time-Triggered Edge-Fog-Cloud Architectures
The lack of determinism restricts the integration of safety-critical applications into Edge–Fog–Cloud (EFC) architectures. Existing EFC schedulers are typically designed for dynamic, best-effort operation based on unmanaged resource allocation and elastic virtualization. This paradigm introduces unbounded queueing, resource contention, and timing jitter, making standard schedulers unsuitable for hard-deadline workloads. Moreover, most approaches focus on computational placement, while communication is abstracted or treated as a secondary cost term. As a result, bounded-latency routing and deterministic task execution are rarely co-optimized under a unified timing model. This paper addresses these gaps by utilizing a managed Time-Triggered Edge–Fog–Cloud (TTEFC) architecture that supports safety-critical workloads, orchestrates IEEE Time-Sensitive Networking (TSN) for local intra-domain communication, and uses IETF Deterministic Networking (DetNet) for routed inter-domain paths. On this infrastructure, a hierarchical genetic algorithm (HGA) is proposed to jointly schedule partition-to-execution-location allocation, partition execution order, inter-partition route selection, and negotiated per-partition time budgets that act as temporal boundaries for parallel partition-level optimizers. An adaptive slack reallocation operator redistributes unused temporal slack from over-satisfied partitions to budget-violating partitions, improving feasibility convergence. Experiments on synthetic DAG workloads with 100–500 tasks compare the proposed HGA against HEFT and round-robin baselines. These baselines are included as scoped external references to contextualize the end-to-end scheduling performance of the proposed method. Ablation results show that slack reallocation improves partition-budget feasibility, reaches feasible budget assignments earlier, and produces tighter budget–makespan alignment than feedback-free and static-budget variants. An automotive-characteristic DAG case study further evaluates the method on an application-oriented workload under the same timing and communication assumptions.
- 3 June 2026
- Published by Springer Nature
- p. 337-357
Maintenance-Oriented Test Generators and Test Teams Simulation for Demand-Controlled Ventilation and Heating Systems
- 3 June 2026
- Published by Springer Nature
- p. 337-357
Maintenance-Oriented Test Generators and Test Teams Simulation for Demand-Controlled Ventilation and Heating Systems
- 3 June 2026
- Published by Springer Nature
- p. 358-373
CASCADE: Engineering a Secure, Real-Time, and Collaborative Code Execution for Multi-tenant Learning Platforms
- 3 June 2026
- Published by Springer Nature
- p. 358-373
CASCADE: Engineering a Secure, Real-Time, and Collaborative Code Execution for Multi-tenant Learning Platforms
- 1 April 2026
- Published by Springer Nature
- p. 304-319
A Knowledge Graph-Based Approach for Personalized Course and Curriculum Path Recommendation
- 1 April 2026
- Published by Springer Nature
- p. 304-319
A Knowledge Graph-Based Approach for Personalized Course and Curriculum Path Recommendation
- Open Access
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
- Vol. 12, 45-55
LUT-Based Convolutional Tsetlin Machine Accelerator With Dynamic Clause Scaling for Resources-Constrained FPGAs
The rapid growth of machine learning (ML) workloads, particularly in computer vision applications, has significantly increased computational and energy demands in modern electronic systems, motivating the use of hardware accelerators to offload processing from general-purpose processors. Despite advances in computationally efficient ML models, achieving energy-efficient inference on resource-constrained edge devices remains a significant challenge. The Tsetlin Machine (TM) has emerged as an attractive alternative for image classification due to its high throughput and inherently energy-efficient learning paradigm. However, existing TM-based hardware accelerators struggle to balance classification accuracy and energy efficiency, limiting their practical deployment at the edge. This paper presents a resource- and energy-efficient Convolutional Tsetlin Machine (CTM) accelerator with dynamic clause scaling, optimized explicitly for edge Field-Programmable Gate Array (FPGA) platforms. The proposed architecture employs LUT-based pipelining and targeted resource-optimization techniques to minimize FPGA resource utilization while maintaining high energy efficiency and performance. The accelerator is implemented on a Xilinx Zybo-Z20 FPGA and evaluated using the MNIST, Fashion-MNIST (FMNIST), and Kuzushiji-MNIST (KMNIST) datasets, achieving classification accuracies of 97.78%, 85.53%, and 88.54%, respectively, with an energy consumption of up to 0.3 μJ per image classification. Compared with state-of-the-art CTM accelerators, the proposed design achieves up to 40× improvements in resource and energy efficiency, demonstrating its suitability for real-time image and pattern classification on edge FPGA-based systems.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
- Vol. 12, 45-55
Open AccessLUT-Based Convolutional Tsetlin Machine Accelerator With Dynamic Clause Scaling for Resources-Constrained FPGAs
The rapid growth of machine learning (ML) workloads, particularly in computer vision applications, has significantly increased computational and energy demands in modern electronic systems, motivating the use of hardware accelerators to offload processing from general-purpose processors. Despite advances in computationally efficient ML models, achieving energy-efficient inference on resource-constrained edge devices remains a significant challenge. The Tsetlin Machine (TM) has emerged as an attractive alternative for image classification due to its high throughput and inherently energy-efficient learning paradigm. However, existing TM-based hardware accelerators struggle to balance classification accuracy and energy efficiency, limiting their practical deployment at the edge. This paper presents a resource- and energy-efficient Convolutional Tsetlin Machine (CTM) accelerator with dynamic clause scaling, optimized explicitly for edge Field-Programmable Gate Array (FPGA) platforms. The proposed architecture employs LUT-based pipelining and targeted resource-optimization techniques to minimize FPGA resource utilization while maintaining high energy efficiency and performance. The accelerator is implemented on a Xilinx Zybo-Z20 FPGA and evaluated using the MNIST, Fashion-MNIST (FMNIST), and Kuzushiji-MNIST (KMNIST) datasets, achieving classification accuracies of 97.78%, 85.53%, and 88.54%, respectively, with an energy consumption of up to 0.3 μJ per image classification. Compared with state-of-the-art CTM accelerators, the proposed design achieves up to 40× improvements in resource and energy efficiency, demonstrating its suitability for real-time image and pattern classification on edge FPGA-based systems.
- Open Access
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 31012-31034
Modeling and Reliability Analysis of Delay-Based Physical Unclonable Functions Using Low-Density Parity-Check Codes for Dependable Security
Protecting lightweight networked devices against manipulation or cloning is an important aspect in critical infrastructure, especially when processing and transmitting sensitive data such as in industry, medical devices, or smart home systems. However, these devices often have a lightweight structure and limited resource capacity, which makes it difficult or impossible to implement complex security measures. Physical unclonable functions (PUFs) can be used as lightweight security primitives to generate unique signals for device identification within a network or for key generation without relying on memory components. However, internal and external factors can influence the behavior of PUFs, which can affect their performance and, consequently, their security. To reduce this problem, error-correction code (ECC) algorithms are used in addition to PUFs to correct bit errors. In this paper, we combine PUFs with standardized low-density parity-check (LDPC) codes to improve reliability. For this purpose, we present a statistical model based on our previously implemented double arbiter PUF (DAPUF) designs in order to simulate different conditions and test scenarios. Our experimental results show that under normal operating conditions, reliability can be improved to the ideal value of 100% using LDPC codes. However, under extreme conditions, by adding more instabilities and bit errors, reliability is compromised, making the PUF unsuitable for security applications. Our experiments show that in order to increase reliability, larger LDPC codes with low code rates must be used however, this increases the complexity, processing time, and resource requirements of the hardware.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 31012-31034
Open AccessModeling and Reliability Analysis of Delay-Based Physical Unclonable Functions Using Low-Density Parity-Check Codes for Dependable Security
Protecting lightweight networked devices against manipulation or cloning is an important aspect in critical infrastructure, especially when processing and transmitting sensitive data such as in industry, medical devices, or smart home systems. However, these devices often have a lightweight structure and limited resource capacity, which makes it difficult or impossible to implement complex security measures. Physical unclonable functions (PUFs) can be used as lightweight security primitives to generate unique signals for device identification within a network or for key generation without relying on memory components. However, internal and external factors can influence the behavior of PUFs, which can affect their performance and, consequently, their security. To reduce this problem, error-correction code (ECC) algorithms are used in addition to PUFs to correct bit errors. In this paper, we combine PUFs with standardized low-density parity-check (LDPC) codes to improve reliability. For this purpose, we present a statistical model based on our previously implemented double arbiter PUF (DAPUF) designs in order to simulate different conditions and test scenarios. Our experimental results show that under normal operating conditions, reliability can be improved to the ideal value of 100% using LDPC codes. However, under extreme conditions, by adding more instabilities and bit errors, reliability is compromised, making the PUF unsuitable for security applications. Our experiments show that in order to increase reliability, larger LDPC codes with low code rates must be used however, this increases the complexity, processing time, and resource requirements of the hardware.