Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thomas Muders

dblp:73/11206 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0001-7596-4427ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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
Web and mobile security · 28% Network security · 28% Cryptographic protocols and secure computation · 28%
Human-computer interaction and pervasive computing
1 paper
Usability and user experience research · 100%

Topics — the 3 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management › public key infrastructure
certificate validation
0.112012
Why eve and mallory love android: an analysis of android SSL (in)security · CCS 2012
Network security › secure communication › secure communication protocol
TLS
0.112012
Why eve and mallory love android: an analysis of android SSL (in)security · CCS 2012
Usable security › security warnings
security warning design
0.012012
Towards measuring warning readability · CCS 2012

Methods — techniques the papers use, named apart from their topics

readability measures · 0.3experimental user study · 0.3static analysis · 0.1large-scale app analysis · 0.1
YearPublicationVenuePosition
2025 Contrast-Enhanced EIT Robustly Tracks Regional Lung Perfusion Compared to Non-Enhanced EIT and Pulmonary CT
abstract
Regional perfusion monitoring, often performed by pulmonary perfusion computed tomography, is vital in intensive care units. Electrical impedance tomography, repeatable and of non-invasive nature, could provide an attractive alternative. This study compares non-enhanced and contrast-enhanced electrical impedance tomography to computed tomography under induced central to peripheral lung perfusion impairments and cardiac output modulation in 11 animals. A new algorithmic framework using multi-compartment modeling and tracer kinetics was developed to improve perfusion estimation. A multi-resolution mixed models analysis shows electrical impedance tomography agrees poorly with computed tomography in static monitoring, with limits of agreement exceeding relative errors of 100%. For trend tracking,contrast-enhancement with 5.85% NaCl yielded concordance rates above 80%, and over 90% for peripheral impairments, emerging as a robust tracker of coarse to fine perfusion changes. Non-enhanced electrical impedance tomography peaked around 60% under central impairment and cardiac modulation, proving to be less reliable.
Diogo Filipe Silva, Sebastian Reinartz, Thomas Muders, Karin Wodack, Christian Putensen, Robert Siepmann, Benjamin Hentze, Steffen Leonhardt
IEEE Trans. Medical Imaging3
2012 Why eve and mallory love android: an analysis of android SSL (in)security
abstract
Many Android apps have a legitimate need to communicate over the Internet and are then responsible for protecting potentially sensitive data during transit. This paper seeks to better understand the potential security threats posed by benign Android apps that use the SSL/TLS protocols to protect data they transmit. Since the lack of visual security indicators for SSL/TLS usage and the inadequate use of SSL/TLS can be exploited to launch Man-in-the-Middle (MITM) attacks, an analysis of 13,500 popular free apps downloaded from Google's Play Market is presented.
Sascha Fahl, Marian Harbach, Thomas Muders, Matthew Smith 0001, Lars Baumgärtner, Bernd Freisleben
CCS3
2012 Towards measuring warning readability
abstract
Security systems frequently rely on warning messages to convey important information, especially when a machine is not able to assess a situation automatically. For a long time, researchers have investigated the effects of warning messages to optimise their reception by a user. Design guidelines and best practises help the developer or interaction designer to adequately channel urgent information. In this poster, we investigate the application of readability measures to assess the difficulty of the descriptive text in warning messages. Adapting such a measure to fit the needs of warning message design allows objective feedback on the quality of a warning's descriptive text. An automated process will be able to assist software developers and designers in creating more readable and hence more understandable security warning messages. We present an initial exploration of the use of readability measures on the descriptive text of warning messages. Existing measures were evaluated on warning messages extracted from current browsers using an experimental study with 15 undergrad students. While our data did not yield conclusive results yet, we argue that readability measures can provide valuable assistance when implementing security systems.
Marian Harbach, Sascha Fahl, Thomas Muders, Matthew Smith 0001
CCS3
2012 Towards privacy-preserving access control with hidden policies, hidden credentials and hidden decisions
abstract
The growing adoption of cloud technology in sensitive application domains, such as medicine, gives rise to new problems in maintaining the privacy of the involved parties during authorisation. In such domains, an honest but curious service provider can derive sensitive information purely from the authorisation process. In this paper, we present a detailed discussion of this rising problem including a concrete example and argue the need for the combination of hidden credentials, hidden policies and hidden decisions. We then show that mechanisms explored in previous work only cover individual aspects of this problem, but do not achieve a comprehensive solution without making restrictive assumptions on the resources, policies or subjects to be protected. As a first step towards solving this problem, we introduce an abstract foundation for using homomorphic cryptography to provide the required combination of privacy as a wrapper for other access control (AC) mechanisms. We achieve hidden policies, hidden credentials and even hidden access control decisions, so that the subject of an AC request only learns whether or not access was granted. Meanwhile, the provider of a resource learns nothing at the policy decision point and only access frequencies for individual resources at the policy enforcement point. We postulate that this is the maximum achievable level of protection in the authorisation process, without making restrictive assumptions on the resources, policies or subjects to be protected. Once homomorphic cryptography achieves satisfactory performance, our model can be used to transparently add this protection to other access control models.
Marian Harbach, Sascha Fahl, Michael Brenner 0003, Thomas Muders, Matthew Smith 0001
PST4
2012 Helping Johnny 2.0 to encrypt his Facebook conversations
abstract
Several billion Facebook messages are sent every day. While there are many solutions to email security whose usability has been extensively studied, little work has been done in the area of message security for Facebook and even less on the usability aspects in this area. To evaluate the need for such a mechanism, we conducted a screening study with 514 participants, which showed a clear desire to protect private messages on Facebook. We therefore proceeded to analyse the usability of existing approaches and extracted key design decisions for further evaluation. Based on this analysis, we conducted a laboratory study with 96 participants to analyse different usability aspects and requirements of a Facebook message encryption mechanism. Two key findings of our study are that automatic key management and key recovery capabilities are important features for such a mechanism. Following on from these studies, we designed and implemented a usable service-based encryption mechanism for Facebook conversations. In a final study with 15 participants, we analysed the usability of our solution. All participants were capable of successfully encrypting their Facebook conversations without error when using our service, and the mechanism was perceived as usable and useful. The results of our work suggest that in the context of the social web, new security/usability trade-offs can be explored to protect users more effectively.
Sascha Fahl, Marian Harbach, Thomas Muders, Matthew Smith 0001, Uwe Sander
SOUPS3
2012 Confidentiality as a Service - Usable Security for the Cloud
abstract
There is an increasing number of easy-to-use cloud services to store and share information with others. Facebook, Dropbox, iCloud, Googlemail, Amazon S3, Windows SkyDrive and similar services encourage users to entrust the companies' servers with a large variety of information: from their holiday pictures to corporate documents. However, both private and corporate users commonly fail to take account of possible privacy consequences. Even though there are approaches to provide confidentiality for the users' data in the cloud, these are not widely adopted due to both awareness and usability issues. Therefore, we propose the novel Confidentiality as a Service (CaaS) paradigm to provide usable confidentiality and integrity for the bulk of users, for whom the current security mechanisms are too complex or require too much effort. The CaaS paradigm combines data security with usability by design and integrates effortlessly into available cloud service applications and workflows. We leverage the splitting of trust between the cloud service provider and one or more CaaS providers to improve usability. CaaS focuses on unobtrusive confidentiality by hiding all cryptographic artefacts from the prevalently non-technical users. Data protection is based on symmetric encryption and invisible key-management mechanisms. We present an integration for multiple popular cloud services to demonstrate the seamless applicability of CaaS.
Sascha Fahl, Marian Harbach, Thomas Muders, Matthew Smith 0001
TrustCom3