Ralf C. Staudemeyer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ralf C. Staudemeyer has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Henrich C. Poehls
University of Passau, Passau, Germany
2 shared publications - Tobias Tefke
Schmalkalden University of Applied Sciences Blechhammer D-98574 Schmalkalden Germany
2 shared publications Elias Petri
Fakultät Informatik, Hochschule Schmalkalden, Schmalkalden, Deutschland
1 shared publication- Eric Rothstein Morris
Singapore University of Technology and Design Singapore
1 shared publication Henrich C. Pöhls
University of Passau
1 shared publicationMarcin Wójcik
University of Cambridge
1 shared publication
Latest Publications
- Open Access
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 18631-18659
A Survey on Anonymous Communication Systems With a Focus on Dining Cryptographers Networks
Traffic analysis attacks can counteract end-to-end encryption and use leaked communication metadata to reveal information about communicating parties. With an ever-increasing amount of traffic by an ever-increasing number of networked devices, communication privacy is undermined. Therefore, Anonymous Communication Systems (ACSs) are proposed to hide the relationship between transmitted messages and their senders and receivers, providing privacy properties known as anonymity, unlinkability, and unobservability. This article aims to review research in the ACSs field, focusing on Dining Cryptographers Networks (DCNs). The DCN-based methods are information-theoretically secure and thus provide unconditional unobservability guarantees. Their adoption for anonymous communications was initially hindered because their computational and communication overhead was deemed significant at that time, and scalability problems occurred. However, more recent contributions, such as the possibility to transmit messages of arbitrary length, efficient disruption handling and overhead improvements, have made the integration of modern DCN-based methods more realistic. In addition, the literature does not follow a common definition for privacy properties, making it hard to compare the approaches’ gains. Therefore, this survey contributes to introducing a harmonized terminology for ACS privacy properties, then presents an overview of the underlying principles of ACSs, in particular, DCN-based methods, and finally, investigates their alignment with the new harmonized privacy terminologies. Previous surveys did not cover the most recent research advances in the ACS area or focus on DCN-based methods. Our comprehensive investigation closes this gap by providing visual maps to highlight privacy properties and discussing the most promising ideas for making DCNs applicable in resource-constrained environments.
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 18631-18659
Open AccessA Survey on Anonymous Communication Systems With a Focus on Dining Cryptographers Networks
Traffic analysis attacks can counteract end-to-end encryption and use leaked communication metadata to reveal information about communicating parties. With an ever-increasing amount of traffic by an ever-increasing number of networked devices, communication privacy is undermined. Therefore, Anonymous Communication Systems (ACSs) are proposed to hide the relationship between transmitted messages and their senders and receivers, providing privacy properties known as anonymity, unlinkability, and unobservability. This article aims to review research in the ACSs field, focusing on Dining Cryptographers Networks (DCNs). The DCN-based methods are information-theoretically secure and thus provide unconditional unobservability guarantees. Their adoption for anonymous communications was initially hindered because their computational and communication overhead was deemed significant at that time, and scalability problems occurred. However, more recent contributions, such as the possibility to transmit messages of arbitrary length, efficient disruption handling and overhead improvements, have made the integration of modern DCN-based methods more realistic. In addition, the literature does not follow a common definition for privacy properties, making it hard to compare the approaches’ gains. Therefore, this survey contributes to introducing a harmonized terminology for ACS privacy properties, then presents an overview of the underlying principles of ACSs, in particular, DCN-based methods, and finally, investigates their alignment with the new harmonized privacy terminologies. Previous surveys did not cover the most recent research advances in the ACS area or focus on DCN-based methods. Our comprehensive investigation closes this gap by providing visual maps to highlight privacy properties and discussing the most promising ideas for making DCNs applicable in resource-constrained environments.
- Open Access
A Survey on Anonymous Communication Systems with a Focus on Dining Cryptographers Networks
Traffic analysis attacks can counteract end-to-end encryption and use leaked communication metadata to reveal information about communicating parties. With an ever-increasing amount of traffic by an ever-increasing number of networked devices, communication privacy is undermined. Therefore, Anonymous Communication Systems (ACSs) are proposed to hide the relationship between transmitted messages and their senders and receivers, providing privacy properties known as anonymity, unlinkability, and unobservability. This article aims to review research in the ACSs field, focusing on Dining Cryptographers Networks (DCNs). The DCN-based methods are information-theoretically secure and thus provide unconditional unobservability guarantees. Their adoption for anonymous communications was initially hindered because their computational and communication overhead was deemed significant at that time, and scalability problems occurred. However, more recent contributions, such as the possibility to transmit messages of arbitrary length, efficient disruption handling and overhead improvements, have made the integration of modern DCN-based methods more realistic. In addition, the literature does not follow a common definition for privacy properties, making it hard to compare the approaches' gains. Therefore, this survey contributes to introducing a harmonized terminology for ACS privacy properties, then presents an overview of the underlying principles of ACSs, in particular, DCN-based methods, and finally, investigates their alignment with the new harmonized privacy terminologies. Previous surveys did not cover the most recent research advances in the ACS area or focus on DCN-based methods. Our comprehensive investigation closes this gap by providing visual maps to highlight privacy properties and discussing the most promising ideas for making DCNs applicable in resource-constrained environments.
Open AccessA Survey on Anonymous Communication Systems with a Focus on Dining Cryptographers Networks
Traffic analysis attacks can counteract end-to-end encryption and use leaked communication metadata to reveal information about communicating parties. With an ever-increasing amount of traffic by an ever-increasing number of networked devices, communication privacy is undermined. Therefore, Anonymous Communication Systems (ACSs) are proposed to hide the relationship between transmitted messages and their senders and receivers, providing privacy properties known as anonymity, unlinkability, and unobservability. This article aims to review research in the ACSs field, focusing on Dining Cryptographers Networks (DCNs). The DCN-based methods are information-theoretically secure and thus provide unconditional unobservability guarantees. Their adoption for anonymous communications was initially hindered because their computational and communication overhead was deemed significant at that time, and scalability problems occurred. However, more recent contributions, such as the possibility to transmit messages of arbitrary length, efficient disruption handling and overhead improvements, have made the integration of modern DCN-based methods more realistic. In addition, the literature does not follow a common definition for privacy properties, making it hard to compare the approaches' gains. Therefore, this survey contributes to introducing a harmonized terminology for ACS privacy properties, then presents an overview of the underlying principles of ACSs, in particular, DCN-based methods, and finally, investigates their alignment with the new harmonized privacy terminologies. Previous surveys did not cover the most recent research advances in the ACS area or focus on DCN-based methods. Our comprehensive investigation closes this gap by providing visual maps to highlight privacy properties and discussing the most promising ideas for making DCNs applicable in resource-constrained environments.
- Open Access
- 5 April 2022
- Published by Springer Nature in Informatik Spektrum
- Vol. 45 (2) , 106-114
Erstellung einer kollaborativen Arbeitsumgebung für die pandemiebedingte Online-Lehre — ein Praxisbericht
- 5 April 2022
- Published by Springer Nature in Informatik Spektrum
- Vol. 45 (2) , 106-114
Open AccessErstellung einer kollaborativen Arbeitsumgebung für die pandemiebedingte Online-Lehre — ein Praxisbericht
- Open Access
Understanding LSTM -- a tutorial into Long Short-Term Memory Recurrent Neural Networks
Long Short-Term Memory Recurrent Neural Networks (LSTM-RNN) are one of the most powerful dynamic classifiers publicly known. The network itself and the related learning algorithms are reasonably well documented to get an idea how it works. This paper will shed more light into understanding how LSTM-RNNs evolved and why they work impressively well, focusing on the early, ground-breaking publications. We significantly improved documentation and fixed a number of errors and inconsistencies that accumulated in previous publications. To support understanding we as well revised and unified the notation used.
Open AccessUnderstanding LSTM -- a tutorial into Long Short-Term Memory Recurrent Neural Networks
Long Short-Term Memory Recurrent Neural Networks (LSTM-RNN) are one of the most powerful dynamic classifiers publicly known. The network itself and the related learning algorithms are reasonably well documented to get an idea how it works. This paper will shed more light into understanding how LSTM-RNNs evolved and why they work impressively well, focusing on the early, ground-breaking publications. We significantly improved documentation and fixed a number of errors and inconsistencies that accumulated in previous publications. To support understanding we as well revised and unified the notation used.
- Open Access
- 26 February 2019
- Published by Springer Nature in Journal of Reliable Intelligent Environments
- Vol. 5 (1) , 41-64
What it takes to boost Internet of Things privacy beyond encryption with unobservable communication: a survey and lessons learned from the first implementation of DC-net
- 26 February 2019
- Published by Springer Nature in Journal of Reliable Intelligent Environments
- Vol. 5 (1) , 41-64
Open AccessWhat it takes to boost Internet of Things privacy beyond encryption with unobservable communication: a survey and lessons learned from the first implementation of DC-net