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

Lukas Zimmermann

dblp:196/2337 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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.

Computer graphics and multimedia
1 paper
Rendering · 100%
Network and information security
1 paper
Hardware security and side channels · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

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

TopicWeightPapersLastEvidence papers
Rendering › volume rendering
empty space skipping
0.812024
Accelerating Transfer Function Update for Distance Map based Volume Rendering · IEEE VIS 2024
Rendering
volume rendering
0.812024
Accelerating Transfer Function Update for Distance Map based Volume Rendering · IEEE VIS 2024
Hardware security and side channels › hardware security primitives
physical unclonable function
0.812024
Output Positioning to Derive Maximum Entropy From Physical Unclonable Functions · IEEE Trans. Inf. Forensics Secur. 2024
Internet of things and sensor networks
iot security
0.212024
Output Positioning to Derive Maximum Entropy From Physical Unclonable Functions · IEEE Trans. Inf. Forensics Secur. 2024
Medical and health informatics › precision medicine
precision oncology
0.112020
ClinVAP: a reporting strategy from variants to therapeutic options · Bioinform. 2020

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

theoretical entropy analysis · 1.5security analysis · 1.5helper data · 1.5ray casting · 0.8distance map computation · 0.8GPU acceleration · 0.8variant filtering · 0.4driver gene status prediction · 0.4
YearPublicationVenuePosition
2025 A Novel PUF Key Generation Method via Variable-Length Subkeys: An Application with Inertial MEMS Sensors
abstract
In this work, a novel PUF key generation algorithm is introduced that leverages the inherent variability in sensor properties to produce highly entropic keys for security applications. The approach uses variable-length subkeys, which are encoded into a fixed-length final key. The encoding is specifically designed to preserve the subkey length information during key generation. Real-world measurements from high-fidelity inertial MEMS sensors (gyroscopes and accelerometers) were used to verify the proposed technology. Our experimental evaluation demonstrates strong uniqueness and reliability with stable performance under controlled conditions.
Wacime Hadrich, Lukas Zimmermann, Patrick Tritschler, Axel Sikora
CASES2
2024 Accelerating Transfer Function Update for Distance Map based Volume Rendering
abstract
Direct volume rendering using ray-casting is widely used in practice. By using GPUs and applying acceleration techniques as empty space skipping, high frame rates are possible on modern hardware. This enables performance-critical use-cases such as virtual reality volume rendering. The currently fastest known technique uses volumetric distance maps to skip empty sections of the volume during ray-casting but requires the distance map to be updated per transfer function change. In this paper, we demonstrate a technique for subdividing the volume intensity range into partitions and deriving what we call partitioned distance maps. These can be used to accelerate the distance map computation for a newly changed transfer function by a factor up to 30. This allows the currently fastest known empty space skipping approach to be used while maintaining high frame rates even when the transfer function is changed frequently.
Michael Rauter, Lukas Zimmermann, Markus Zeilinger
IEEE VIS2
2024 Output Positioning to Derive Maximum Entropy From Physical Unclonable Functions
abstract
Physical unclonable functions (PUFs) are increasingly generating attention in the field of hardware-based security for the Internet of Things (IoT). A PUF, as its name implies, is a physical element with a special and unique inherent characteristic and can act as the security anchor for authentication and cryptographic applications. Keeping in mind that the PUF outputs are prone to change in the presence of noise and environmental variations, it is critical to derive reliable keys from the PUF and to use the maximum entropy at the same time. In this work, the PUF output positioning (POP) method is proposed, which is a novel method for grouping the PUF outputs in order to maximize the extracted entropy. To achieve this, an offset data is introduced as helper data, which is used to relax the constraints considered for the grouping of PUF outputs, and deriving more entropy, while reducing the secret key error bits. To implement the method, the key enrollment and key generation algorithms are presented. Based on a theoretical analysis of the achieved entropy, it is proven that POP can maximize the achieved entropy, while respecting the constraints induced to guarantee the reliability of the secret key. Moreover, a detailed security analysis is presented, which shows the resilience of the method against cyber-security attacks. The findings of this work are evaluated by applying the method on a hybrid printed PUF, where it can be practically shown that the proposed method outperforms other existing group-based PUF key generation methods.
Saeed Abdolinezhad, Lukas Zimmermann, Axel Sikora
IEEE Trans. Inf. Forensics Secur.2
2020 ClinVAP: a reporting strategy from variants to therapeutic options
abstract
MOTIVATION: Next-generation sequencing has become routine in oncology and opens up new avenues of therapies, particularly in personalized oncology setting. An increasing number of cases also implies a need for a more robust, automated and reproducible processing of long lists of variants for cancer diagnosis and therapy. While solutions for the large-scale analysis of somatic variants have been implemented, existing solutions often have issues with reproducibility, scalability and interoperability. RESULTS: Clinical Variant Annotation Pipeline (ClinVAP) is an automated pipeline which annotates, filters and prioritizes somatic single nucleotide variants provided in variant call format. It augments the variant information with documented or predicted clinical effect. These annotated variants are prioritized based on driver gene status and druggability. ClinVAP is available as a fully containerized, self-contained pipeline maximizing reproducibility and scalability allowing the analysis of larger scale data. The resulting JSON-based report is suited for automated downstream processing, but ClinVAP can also automatically render the information into a user-defined template to yield a human-readable report. AVAILABILITY AND IMPLEMENTATION: ClinVAP is available at https://github.com/PersonalizedOncology/ClinVAP. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Bilge Sürün, Charlotta Schärfe, Mathew R. Divine, Julian Heinrich, Nora C. Toussaint, Lukas Zimmermann, Janina Beha, Oliver Kohlbacher
Bioinform.6
2019 Design and Evaluation of a Printed Analog-Based Differential Physical Unclonable Function
abstract
A physical unclonable function (PUF) is a hardware circuit that produces a random sequence based on its manufacturing-induced intrinsic characteristics. In the past decade, silicon-based PUFs have been extensively studied as a security primitive for identification and authentication. The emerging field of printed electronics (PE) enables novel application fields in the scope of the Internet of Things (IoT) and smart sensors. In this paper, we design and evaluate a printed differential circuit PUF (DiffC-PUF). The simulation data are verified by Monte Carlo analysis. Our design is highly scalable while consisting of a low number of printed transistors. Furthermore, we investigate the best operating point by varying the PUF challenge configuration and analyzing the PUF security metrics in order to achieve high robustness. At the best operating point, the results show areliability of 98.37% and a uniqueness of 50.02%, respectively. This analysis also provides useful and comprehensive insights into the design of hybrid or fully printed PUF circuits. In addition, the proposed printed DiffC-PUF core has been fabricated with electrolyte-gated field-effect transistor technology to verify our design in hardware.
Lukas Zimmermann, Alexander Scholz, Mehdi Baradaran Tahoori, Jasmin Aghassi-Hagmann, Axel Sikora
IEEE Trans. Very Large Scale Integr. Syst.1