Rüdiger Kapitza

Rüdiger Kapitza

Auto-generated profile, based on publicly available information

Rüdiger Kapitza

Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 April 2020 in PLOS Biology
Verified
Journal Article
Open access
PDF file
SRSimon Ripperger
Simon Ripperger
GCGerald G. Carter
Gerald G. Carter
RPRachel A. Page
Rachel A. Page
NDNiklas Duda
Niklas Duda
AKAlexander Kölpin
Alexander Kölpin
FMFrieder Mayer
Frieder Mayer
Recent advances in animal tracking technology have ushered in a new era in biologging. However, the considerable size of many sophisticated biologging devices restricts their application to larger animals, whereas older techniques often still represent the state-of-the-art for studying small vertebrates. In industrial applications, low-power wireless sensor networks (WSNs) fulfill requirements similar to those needed to monitor animal behavior at high resolution and at low tag mass. We developed a wireless biologging network (WBN), which enables simultaneous direct proximity sensing, high-resolution tracking, and long-range remote data download at tag masses of 1 to 2 g. Deployments to study wild bats created social networks and flight trajectories of unprecedented quality. Our developments highlight the vast capabilities of WBNs and their potential to close an important gap in biologging: fully automated tracking and proximity sensing of small animals, even in closed habitats, at high spatial and temporal resolution.

27 November 2023
Verified
Conference Paper
Open access
AGAnna Galanou
Anna Galanou
KBKhushboo Bindlish
Khushboo Bindlish
LPLuca Preibsch
Luca Preibsch
YPYvonne-Anne Pignolet
Yvonne-Anne Pignolet
CFChristof Fetzer
Christof Fetzer
RKRüdiger Kapitza
Rüdiger Kapitza
Confidential computing alleviates the concerns of distrustful customers by removing the cloud provider from their trusted computing base and resolves their disincentive to migrate their workloads to the cloud. This is facilitated by new hardware extensions, like AMD's SEV Secure Nested Paging (SEV-SNP), which can run a whole virtual machine with confidentiality and integrity protection against a potentially malicious hypervisor owned by an untrusted cloud provider. However, the assurance of such protection to either the service providers deploying sensitive workloads or the end-users passing sensitive data to services requires sending proof to the interested parties. Service providers can retrieve such proof by performing remote attestation while end-users have typically no means to acquire this proof or validate its correctness and therefore have to rely on the trustworthiness of the service providers. In this paper, we present Revelio, an approach that features two main contributions: i) it allows confidential virtual machine (VM)-based workloads to be designed and deployed in a way that disallows any tampering even by the service providers and ii) it empowers users to easily validate their integrity. In particular, we focus on web-facing workloads, protect them leveraging SEV-SNP, and enable end-users to remotely attest them seamlessly each time a new web session is established. To highlight the benefits of Revelio, we discuss how a standalone stateful VM that hosts an open-source collaboration office suite can be secured and present a replicated protocol proxy that enables commodity users to securely access the Internet Computer, a decentralized blockchain infrastructure.

1 June 2018
Verified
Conference Paper
Open access
SRSigne Rusch
Signe Rusch
IMInes Messadi
Ines Messadi
RKRudiger Kapitza
Rudiger Kapitza
Byzantine fault tolerance (BFT) protocols can mitigate attacks and errors and are increasingly investigated as consensus protocols in blockchains. However, they are traditionally considered costly in terms of message complexity and latency due to the required multiple rounds of message exchanges. With the availability of Remote Direct Memory Access (RDMA) in data centers, message exchange latency can be reduced compared to TCP, as RDMA enables kernel bypassing and thereby avoids intermediate data copying. Retaining the performance benefits for RDMA during its integration, however, is non-trivial and error-prone. While the use of RDMA has previously been explored for key/value stores, databases and distributed file systems, agreement protocols especially for BFT have so far been neglected. We investigate the usage of RDMA in the Reptor BFT protocol for low-latency agreement and show first steps towards an RDMA-enabled consensus protocol. For this, we present Rubin, a framework offering similar functionality to the Java NIO selector, which can handle multiple network connections efficiently with a single thread and is employed in several BFT protocol implementations such as BFT-SMaRt and UpRight.

16 June 2009
Verified
Conference Paper
Open access
PDF file
HSHolger Schmidt
Holger Schmidt
JEJan-Patrick Elsholz
Jan-Patrick Elsholz
VNVladimir Nikolov
Vladimir Nikolov
FHFranz J. Hauck
Franz J. Hauck
RKRüdiger Kapitza
Rüdiger Kapitza

9 December 2019
Verified
Conference Paper
Open access
PDF file
SRSigne Rüsch
Signe Rüsch
KBKai Bleeke
Kai Bleeke
RKRüdiger Kapitza
Rüdiger Kapitza

30 September 2024
Verified
Conference Paper
Open access
LGLuis Gerhorst
Luis Gerhorst
HHHenriette Herzog
Henriette Herzog
PWPeter Wägemann
Peter Wägemann
MOMaximilian Ott
Maximilian Ott
RKRüdiger Kapitza
Rüdiger Kapitza
THTimo Hönig
Timo Hönig
High-performance IO demands low-overhead communication between user- and kernel space. This demand can no longer be fulfilled by traditional system calls. Linux’s extended Berkeley Packet Filter (BPF) avoids user-/kernel transitions by just-in-time compiling user-provided bytecode and executing it in kernel mode with near-native speed. To still isolate BPF programs from the kernel, they are statically analyzed for memory- and type-safety, which imposes some restrictions but allows for good expressiveness and high performance. However, to mitigate the Spectre vulnerabilities disclosed in 2018, defenses which reject potentially-dangerous programs had to be deployed. We find that this affects Math 1 to Math 2 of programs in a dataset with 844 real-world BPF programs from popular open-source projects. To solve this, users are forced to disable the defenses to continue using the programs, which puts the entire system at risk. To enable secure and expressive untrusted Linux kernel extensions, we propose VeriFence, an enhancement to the kernel’s Spectre defenses that reduces the number of BPF application programs rejected from Math 3 to zero. We measure VeriFence’s overhead for all mainstream performance-sensitive applications of BPF (i.e., event tracing, profiling, and packet processing) and find that it improves significantly upon the status-quo where affected BPF programs are either unusable or enable transient execution attacks on the kernel.