Demo Data from EDBT 2026 / reviewers in the wild / expert
Sebastian Gabmeyer
dblp:23/11211
· DBLP profile ↗
7ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0002-4097-9917ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3Software engineering, systems software and programming languages · 3 · 2 first-authorSystems, architecture and hardware · 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.
| Network and information security
2 papers |
Hardware security and side channels · 72% Cryptographic protocols and secure computation · 22% Authentication and access control · 6% | |
| Software engineering, system software, and programming languages
1 paper |
Requirements engineering and software design · 67% Program verification · 33% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels › hardware security primitives › physical unclonable function
DRAM PUF |
0.6 | 2 | 2019 | Decay-Based DRAM PUFs in Commodity Devices · IEEE Trans. Dependable Secur. Comput. 2019 Run-Time Accessible DRAM PUFs in Commodity Devices · CHES 2016 |
Hardware security and side channels › hardware security primitives
physical unclonable function |
0.6 | 2 | 2019 | Decay-Based DRAM PUFs in Commodity Devices · IEEE Trans. Dependable Secur. Comput. 2019 Run-Time Accessible DRAM PUFs in Commodity Devices · CHES 2016 |
Cryptographic protocols and secure computation › key management
key storage |
0.4 | 1 | 2019 | Decay-Based DRAM PUFs in Commodity Devices · IEEE Trans. Dependable Secur. Comput. 2019 |
Requirements engineering and software design
model-driven engineering |
0.1 | 1 | 2012 | Formal verification techniques for model transformations specified by-demonstration · ASE 2012 |
Requirements engineering and software design › model-driven engineering
model transformation |
0.1 | 1 | 2012 | Formal verification techniques for model transformations specified by-demonstration · ASE 2012 |
Program verification
model transformation verification |
0.1 | 1 | 2012 | Formal verification techniques for model transformations specified by-demonstration · ASE 2012 |
Authentication and access control
mutual authentication |
0.1 | 1 | 2019 | Decay-Based DRAM PUFs in Commodity Devices · IEEE Trans. Dependable Secur. Comput. 2019 |
Memory systems
DRAM |
0.1 | 1 | 2016 | Run-Time Accessible DRAM PUFs in Commodity Devices · CHES 2016 |
Methods — techniques the papers use, named apart from their topics
physical unclonable function · 0.5helper data system · 0.4precondition/postcondition derivation · 0.1by-demonstration specification · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | A feature-based classification of formal verification techniques for software models
Sebastian Gabmeyer, Petra Kaufmann, Martina Seidl, Martin Gogolla, Gerti Kappel |
Softw. Syst. Model. | 1 |
| 2019 | Decay-Based DRAM PUFs in Commodity DevicesabstractA Physically Unclonable Function (PUF) is a unique and stable physical characteristic of a piece of hardware, which emerges due to variations in the hardware fabrication processes. Prior works have demonstrated that PUFs are a promising cryptographic primitive that can enable secure key storage, hardware-based device authentication and identification. So far, most PUF constructions have required an addition of new hardware or an FPGA implementation for their operation. Recently, intrinsic PUFs, which can be found in commodity devices, have been investigated. Unfortunately, most of them suffer from the drawback that they can only be accessed at boot time. This paper focuses on a new class of run-time accessible, decay-based, intrinsic DRAM PUFs in commercial off-the-shelf systems, which requires no additional hardware or FPGAs. In order to enable secure key storage using DRAM PUFs, this work presents a new Helper Data System (HDS) specifically tailored to the properties of the decay process inherent to DRAM cells. The decay-based DRAM PUF and the new HDS are evaluated on commodity off-the-shelf devices to demonstrate their practicality. Furthermore, a novel lightweight protocol is presented that allows for mutual authentication. André Schaller, Wenjie Xiong 0001, Nikolaos A. Anagnostopoulos, Muhammad Umair Saleem, Sebastian Gabmeyer, Boris Skoric, Stefan Katzenbeisser 0001, Jakub Szefer |
IEEE Trans. Dependable Secur. Comput. | 5 |
| 2018 | Low-Temperature Data Remanence Attacks Against Intrinsic SRAM PUFsabstractIn this work, we present the first systematic study of data remanence effects on an intrinsic Static Random Access Memory Physical Unclonable Function (SRAM PUF) implemented on a commercial off-the-shelf (COTS) device in the temperature range between –110 degrees Celsius and –40 degrees Celsius. Based on our experimental results, we propose a new type of attack against intrinsic SRAM PUFs, which takes advantage of data remanence effects exhibited due to low temperatures. We demonstrate that this attack is highly resistant to memory erasure techniques and can be used to manipulate the cryptographic keys produced by the SRAM PUF. Finally, we also discuss and assess potential countermeasures against the attack we propose. Nikolaos A. Anagnostopoulos, Tolga Arul, Markus Rosenstihl, André Schaller, Sebastian Gabmeyer, Stefan Katzenbeisser 0001 |
DSD | 5 |
| 2017 | SCAPI: a scalable attestation protocol to detect software and physical attacksabstractInterconnected embedded devices are increasingly used in various scenarios, including industrial control, building automation, or emergency communication. As these systems commonly process sensitive information or perform safety critical tasks, they become appealing targets for cyber attacks. A promising technique to remotely verify the safe and secure operation of networked embedded devices is remote attestation. However, existing attestation protocols only protect against software attacks, or show limited scalability and robustness. In this paper, we present the first scalable attestation protocol that detects physical attacks. Based on the assumption that physical attacks require an adversary to capture and disable devices for a noticeable amount of time, our protocol identifies devices with compromised hardware and software. Compared to existing solutions, our protocol reduces communication complexity and runtimes by orders of magnitude, precisely identifies compromised devices, and is robust against failures or network disruptions. We show the security of our protocol and evaluate its scalability and robustness. Our results demonstrate that our protocol is highly efficient in well-connected networks and operates robust in disruptive and very dynamic network topologies. Florian Kohnhäuser, Niklas Büscher, Sebastian Gabmeyer, Stefan Katzenbeisser 0001 |
WISEC | 3 |
| 2016 | Run-Time Accessible DRAM PUFs in Commodity Devices
Wenjie Xiong 0001, André Schaller, Nikolaos A. Anagnostopoulos, Muhammad Umair Saleem, Sebastian Gabmeyer, Stefan Katzenbeisser 0001, Jakub Szefer |
CHES | 5 |
| 2014 | Model Checking of CTL-Extended OCL Specifications
Robert Bill, Sebastian Gabmeyer, Petra Kaufmann, Martina Seidl |
SLE | 2 |
| 2012 | Formal verification techniques for model transformations specified by-demonstrationabstractModel transformations play an essential role in many aspects of model-driven development. By-demonstration approaches provide a user-friendly tool for specifying reusable model transformations. Here, a modeler performs the model transformation only once by hand and an executable transformation is automatically derived. Such a transformation is characterized by the set of pre- and postconditions that are required to be satisfied prior and after the execution of the transformation. However, the automatically derived conditions are usually too restrictive or incomplete and need to be refined manually to obtain the intended model transformation. Sebastian Gabmeyer |
ASE | 1 |