Jörg Keller

Prof. Dr. Jörg Keller

orcid

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

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

Representative Publications

View All Publications
27 April 2014 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
JJJan-Oliver Janda
Jan-Oliver Janda
APAjmal Popal
Ajmal Popal
JBJochen Bauer
Jochen Bauer
MBMarkus Busch
Markus Busch
MKMichael Klocke
Michael Klocke
RMRainer Merkl
Rainer Merkl
The identification of functionally important residue positions is an important task of computational biology. Methods of correlation analysis allow for the identification of pairs of residue positions, whose occupancy is mutually dependent due to constraints imposed by protein structure or function. A common measure assessing these dependencies is the mutual information, which is based on Shannon’s information theory that utilizes probabilities only. Consequently, such approaches do not consider the similarity of residue pairs, which may degrade the algorithm’s performance. One typical algorithm is H2r, which characterizes each individual residue position k by the conn(k)-value, which is the number of significantly correlated pairs it belongs to. To improve specificity of H2r, we developed a revised algorithm, named H2rs, which is based on the von Neumann entropy (vNE). To compute the corresponding mutual information, a matrix A is required, which assesses the similarity of residue pairs. We determined A by deducing substitution frequencies from contacting residue pairs observed in the homologs of 35 809 proteins, whose structure is known. In analogy to H2r, the enhanced algorithm computes a normalized conn(k)-value. Within the framework of H2rs, only statistically significant vNE values were considered. To decide on significance, the algorithm calculates a p-value by performing a randomization test for each individual pair of residue positions. The analysis of a large in silico testbed demonstrated that specificity and precision were higher for H2rs than for H2r and two other methods of correlation analysis. The gain in prediction quality is further confirmed by a detailed assessment of five well-studied enzymes. The outcome of H2rs and of a method that predicts contacting residue positions (PSICOV) overlapped only marginally. H2rs can be downloaded from http://www-bioinf.uni-regensburg.de . Considering substitution frequencies for residue pairs by means of the von Neumann entropy and a p-value improved the success rate in identifying important residue positions. The integration of proven statistical concepts and normalization allows for an easier comparison of results obtained with different proteins. Comparing the outcome of the local method H2rs and of the global method PSICOV indicates that such methods supplement each other and have different scopes of application.

1 October 2020 in Future Generation Computer Systems
Verified
Journal Article
Closed access
JSJens Saenger
Jens Saenger
WMWojciech Mazurczyk
Wojciech Mazurczyk
JKJörg Keller
Jörg Keller
LCLuca Caviglione
Luca Caviglione

18 March 2014 in Annals of Telecommunications
Verified
Journal Article
Closed access
PDF file
Steffen WendzelSteffen Wendzel
Steffen Wendzel
JKJörg Keller
Jörg Keller

1 June 2021 in Computer Networks
Verified
Journal Article
Open access
DSDaniel Spiekermann
Daniel Spiekermann
JKJörg Keller
Jörg Keller

6 June 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
Steffen WendzelSteffen Wendzel
Steffen Wendzel
TSTobias Schmidbauer
Tobias Schmidbauer
SZSebastian Zillien
Sebastian Zillien
JKJörg Keller
Jörg Keller
Covert channels are stealthy communication channels that enable manifold adversary and legitimate scenarios, ranging from malware communications to the exchange of confidential information by journalists and censorship circumvention. We introduce a new class of covert channels that we call history covert channels . We further present a new paradigm: covert channel amplification . All covert channels described until now need to craft seemingly legitimate flows or need to modify third-party flows, mimicking unsuspicious behavior. In contrast, history covert channels can communicate by pointing to unaltered legitimate traffic created by regular network nodes. Only a negligible fraction of the covert communication process requires the transfer of covert information by the covert channel's sender . This information can be sent through different protocols/channels. Our approach allows an amplification of the covert channel's message size, i.e., minimizing the fraction of actually transferred secret data by a covert channel's sender in relation to the overall secret data being exchanged. Further, we extend the current taxonomy for covert channels to show how history channels can be categorized. We describe multiple scenarios in which history covert channels can be realized, analyze the characteristics of these channels, and show how their configuration can be optimized.

6 May 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
Steffen WendzelSteffen Wendzel
Steffen Wendzel
LCLuca Caviglione
Luca Caviglione
WMWojciech Mazurczyk
Wojciech Mazurczyk
Aleksandra MilevaAleksandra Mileva
Aleksandra Mileva
JDJana Dittmann
Jana Dittmann
SZSebastian Zillien
Sebastian Zillien
A unified understanding of terms is essential for every scientific discipline: steganography is no exception. Being divided into several domains (e.g., network and text steganography), it is crucial to provide a unified terminology as well as a taxonomy that is not limited to few applications or areas. A prime attempt toward a unified understanding of terms was conducted in 2015 with the introduction of a pattern-based taxonomy for network steganography. In 2021, the first work toward a pattern-based taxonomy for all domains of steganography was proposed. However, this initial attempt still faced several shortcomings, e.g., remaining inconsistencies and a lack of patterns for several steganography domains. As the consortium who published the previous studies on steganography patterns, we present the first comprehensive pattern-based taxonomy tailored to fit all known domains of steganography, including smaller and emerging areas, such as filesystem, IoT/CPS, and AI/ML steganography. To make our contribution more effective and promote the use of the taxonomy to advance research, we also provide a unified description method joint with a thorough tutorial on its utilization.