Gabi Dreo Rodosek

Gabi Dreo Rodosek

Auto-generated profile, based on publicly available information

Gabi Dreo Rodosek

Department of Computer Science, University der Bundeswehr München, Neubiberg, Germany

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
6 February 2018 in IEEE Security & Privacy
Verified
Journal Article
Closed access
RHRick Hofstede
Rick Hofstede
APAiko Pras
Aiko Pras
ASAnna Sperotto
Anna Sperotto
GRGabi Dreo Rodosek
Gabi Dreo Rodosek
Although the aggregated nature of exported flow data provides many advantages in terms of privacy and scalability, flow data may contain artifacts that impair data analysis. In this article, we investigate the differences between flow data analysis in theory and practice—that is, in lab environments and production networks.

31 August 2023 in IACR Transactions on Cryptographic Hardware and Embedded Systems
Verified
Journal Article
Open access
PDF file
JHJulius Hermelink
Julius Hermelink
EMErik Mårtensson
Erik Mårtensson
Simona SamardjiskaSimona Samardjiska
Simona Samardjiska
PPPeter Pessl
Peter Pessl
GRGabi Dreo Rodosek
Gabi Dreo Rodosek
In LWE-based KEMs, observed decryption errors leak information about the secret key in the form of equations or inequalities. Several practical fault attacks have already exploited such leakage by either directly applying a fault or enabling a chosen-ciphertext attack using a fault. When the leaked information is in the form of inequalities, the recovery of the secret key is not trivial. Recent methods use either statistical or algebraic methods (but not both), with some being able to handle incorrect information. Having in mind that integration of the side-channel information is a crucial part of several classes of implementation attacks on LWEbased schemes, it is an important question whether statistically processed information can be successfully integrated in lattice reduction algorithms.We answer this question positively by proposing an error-tolerant combination of statistical and algebraic methods that make use of the advantages of both approaches. The combination enables us to improve upon existing methods – we use both fewer inequalities and are more resistant to errors. We further provide precise security estimates based on the number of available inequalities.Our recovery method applies to several types of implementation attacks in which decryption errors are used in a chosen-ciphertext attack. We practically demonstrate the improved performance of our approach in a key-recovery attack against Kyber with fault-induced decryption errors.

1 May 2014
Verified
Conference Paper
Closed access
CTChristos Tsiaras
Christos Tsiaras
ASAnuj Sehgal
Anuj Sehgal
SSSebastian Seeber
Sebastian Seeber
DDDaniel Donni
Daniel Donni
BSBurkhard Stiller
Burkhard Stiller
GRGabi Dreo Rodosek
Gabi Dreo Rodosek
Quality of Service (QoS) metrics have been traditionally used to evaluate the perceived quality of services delivered by network operators. However, these metrics are not suitable for evaluating the experience of an end-user. The experience of a user is quantified based upon activities such as speed of web page loading, quality of video streaming, or voice quality of Internet-telephony. Due to the temporal and geographical nature of mobile networks, the perceived experience of a user may change based on location and time. Mobile operators may prioritize certain services over others, leading to a service type dependent Quality of Experience (QoE). In this paper we present a mobile application developed to gather metrics necessary to evaluate QoE in a mobile environment. Our approach towards obtain not just a general, but service specific mean opinion score (MOS) to quantify QoE is also discussed. Initial experiments and measurement tests show that it is possible for the same operator to deliver different QoE based on service and even time-of-day.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
GRGabi Dreo Rodosek
Gabi Dreo Rodosek
MGMario Golling
Mario Golling

1 June 2019
Verified
Conference Paper
Closed access
LRLeonard Renners
Leonard Renners
FHFelix Heine
Felix Heine
CKCarsten Kleiner
Carsten Kleiner
GRGabi Dreo Rodosek
Gabi Dreo Rodosek
Network security tools like Security Information and Event Management systems detect and process incidents with respect to the network and environment they occur in. Part of the analysis is used to estimate a priority for the incident to effectively assign the limited workforce on the most important events. This process is referred to as incident prioritization and it is typically based on a set of static rules and calculations. Due to shifting concepts, new network entities, different attacks or changing guidelines, the rules may contain errors, which leads to incorrectly prioritized incidents. An explicit process to even identify those problems is often amiss, let alone assistance to adjust the model. In this paper, we present an approach to adapt an incident prioritization model to correct errors in the rating process. We developed concepts to collect feedback from an analyst and automatically generate and evaluate improvements to the prioritization model. The evaluation of our approach on real and synthetic data in a comparative experiment using further, regular learning algorithms shows promising results.

25 September 2008 in Journal of Grid Computing
Verified
Journal Article
Closed access
PDF file
MWMartin Waldburger
Martin Waldburger
MGMatthias Göhner
Matthias Göhner
HRHelmut Reiser
Helmut Reiser
GRGabi Dreo Rodosek
Gabi Dreo Rodosek
BSBurkhard Stiller
Burkhard Stiller