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

Roman Schlegel

dblp:16/259 · DBLP profile ↗
← Back
17ranked-venue papers
10as first author
0since 2021 · last 2017
—ORCID · none

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

Security and privacy · 8 · 5 first-authorSystems, architecture and hardware · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 3 · 1 first-authorComputer networks · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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
6 papers
Privacy and data protection · 56% Cryptographic primitives and cryptanalysis · 16% Network security · 11%
Human-computer interaction and pervasive computing
2 papers
Ubiquitous computing and smart environments · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 13 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
location privacy
0.632017
Privacy-Preserving Location Sharing Services for Social Networks · IEEE Trans. Serv. Comput. 2017
User-Defined Privacy Grid System for Continuous Location-Based Services · IEEE Trans. Mob. Comput. 2015
Interrupt Now or Inform Later?: Comparing Immediate and Delayed Privacy Feedback · CHI 2015
Ubiquitous computing and smart environments › privacy
privacy feedback
0.422015
Interrupt Now or Inform Later?: Comparing Immediate and Delayed Privacy Feedback · CHI 2015
Reflection or action?: how feedback and control affect location sharing decisions · CHI 2014
Cryptographic primitives and cryptanalysis
encryption
0.312017
Privacy-Preserving Location Sharing Services for Social Networks · IEEE Trans. Serv. Comput. 2017
Privacy and data protection › location privacy
location sharing privacy
0.312017
Privacy-Preserving Location Sharing Services for Social Networks · IEEE Trans. Serv. Comput. 2017
Ubiquitous computing and smart environments › interruption management
interruption timing
0.212015
Interrupt Now or Inform Later?: Comparing Immediate and Delayed Privacy Feedback · CHI 2015
Network security
peer-to-peer network security
0.212014
ReDS: A Framework for Reputation-Enhanced DHTs · IEEE Trans. Parallel Distributed Syst. 2014
Authentication and access control › trust management
reputation systems
0.212014
ReDS: A Framework for Reputation-Enhanced DHTs · IEEE Trans. Parallel Distributed Syst. 2014
Distributed systems › peer-to-peer systems
distributed hash table
0.212014
ReDS: A Framework for Reputation-Enhanced DHTs · IEEE Trans. Parallel Distributed Syst. 2014
Distributed systems
peer-to-peer systems
0.212014
ReDS: A Framework for Reputation-Enhanced DHTs · IEEE Trans. Parallel Distributed Syst. 2014
Web and mobile security
mobile security
0.112011
Soundcomber: A Stealthy and Context-Aware Sound Trojan for Smartphones · NDSS 2011
Privacy and data protection › privacy preferences
personalized privacy
0.112017
Privacy-Preserving Location Sharing Services for Social Networks · IEEE Trans. Serv. Comput. 2017
Spatial and temporal data management
location-based services
0.112015
User-Defined Privacy Grid System for Continuous Location-Based Services · IEEE Trans. Mob. Comput. 2015
Wireless sensing and localization
acoustic sensing
0.012011
Soundcomber: A Stealthy and Context-Aware Sound Trojan for Smartphones · NDSS 2011

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

user study · 0.4semi-trusted third party · 0.4dynamic grid system · 0.4reputation tracking · 0.4redundant lookup queries · 0.4experience sampling study · 0.4order-retrievable encryption · 0.3index structure design · 0.3stealthy recording · 0.2context-aware audio processing · 0.2
YearPublicationVenuePosition
2017 A security evaluation of IEC 62351
Roman Schlegel, Sebastian Obermeier 0001, Johannes Schneider 0002
J. Inf. Secur. Appl.1
2017 Privacy-Preserving Location Sharing Services for Social Networks
abstract
A common functionality of many location-based social networking applications is a location sharing service that allows a group of friends to share their locations. With a potentially untrusted server, such a location sharing service may threaten the privacy of users. Existing solutions for Privacy-Preserving Location Sharing Services (PPLSS) require a trusted third party that has access to the exact location of all users in the system or rely on expensive algorithms or protocols in terms of computational or communication overhead. Other solutions can only provide approximate query answers. To overcome these limitations, we propose a new encryption notion, called Order-Retrievable Encryption (ORE), for PPLSS for social networking applications. The distinguishing characteristics of our PPLSS are that it (1) allows a group of friends to share their exact locations without the need of any third party or leaking any location information to any server or users outside the group, (2) achieves low computational and communication cost by allowing users to receive the exact location of their friends without requiring any direct communication between users or multiple rounds of communication between a user and a server, (3) provides efficient query processing by designing an index structure for our ORE scheme, (4) supports dynamic location updates, and (5) provides personalized privacy protection within a group of friends by specifying a maximum distance where a user is willing to be located by his/her friends. Experimental results show that the computational and communication cost of our PPLSS is much better than the state-of-the-art solution.
Roman Schlegel, Chi-Yin Chow, Qiong Huang 0001, Duncan S. Wong
IEEE Trans. Serv. Comput.1
2015 Interrupt Now or Inform Later?: Comparing Immediate and Delayed Privacy Feedback
abstract
Feedback about privacy-affecting system operations is important for informed end-user privacy management. While feedback is most relevant if provided immediately, such delivery interrupts the user and risks disrupting ongoing tasks. The timing, volume, and nature of feedback is therefore critical for avoiding inopportune interruption. We varied the timing and actionability of feedback regarding accesses to a user's physical location. We found that the sense of privacy violation was heightened when feedback was immediate, but not actionable. While immediate and actionable feedback may sometimes be necessary, our findings suggest that moderately delayed feedback is often acceptable. A moderate delay may serve as a compromise to minimize interruption and avoid overly alarming reaction to immediate feedback. However, immediate and actionable feedback could still be beneficial when privacy sensitivity is high or ambiguous.
Sameer Patil 0001, Roberto Hoyle, Roman Schlegel, Apu Kapadia, Adam J. Lee
CHI3
2015 Structured system threat modeling and mitigation analysis for industrial automation systems
abstract
Industrial control systems are an important part of critical infrastructures and their uninterrupted operation is important for many aspects of society. In recent years these systems have come under more scrutiny, as reports about attacks on them have become more frequent. There is therefore a need to better secure them, and the first step to achieve this is to identify the threat landscape for such systems. This is typically done by creating a threat model of a system, enumerating the potential threats, and then devising mitigation options based on the discovered threats. However, many of the available threat modeling methods and tools target very specific systems (e.g., software components), and do not lend themselves well to evaluating diverse systems or abstract reference architectures of systems. In this paper we present a methodology for system threat modeling that addresses this gap, by enabling the modeling of a diverse range of systems and reference architectures of systems. Furthermore, the methodology provides additional functionality, such as guiding the user in the completion of a threat model and automatically detecting unmitigated threats in a system. In addition, our methodology also takes mitigation into account by modeling the security components in a system. We have implemented the methodology in a web-based tool, and also evaluated the tool on a reference architecture of a complex automation system, validating both the approach and the tool.
Roman Schlegel, Sebastian Obermeier 0001, Johannes Schneider 0002
INDIN1
2015 A Framework for Incident Response in Industrial Control Systems
abstract
Industrial control systems are used to control and supervise plants and critical infrastructures. They are crucial for operation of many industries and even society at large. However, despite efforts to secure such systems, there are frequent reports of incidents that lead to problems because of human error (e.g., installing unauthorized software on a mission-critical machine) or even cyber attacks. While such incidents should be prevented in the first place, it is not feasible to achieve 100% security; therefore, operators should be prepared to deal with incidents promptly and efficiently if they occur. In this paper, we present a general methodology and framework for investigating incidents in industrial control systems. The methodology is supported by a tool to automate an investigation, especially to efficiently determine the state of files on a device after an incident. This enables faster recovery from incidents by being able to identify suspicious files and focus on the files that have been modified compared to the initially installed files, or a previously taken baseline. An evaluation confirms the applicability of the methodology for an embedded industrial controller and for an industrial control system.
Roman Schlegel, Ana Hristova, Sebastian Obermeier 0001
SECRYPT1
2015 User-Defined Privacy Grid System for Continuous Location-Based Services
abstract
Location-based services (LBS) require users to continuously report their location to a potentially untrusted server to obtain services based on their location, which can expose them to privacy risks. Unfortunately, existing privacy-preserving techniques for LBS have several limitations, such as requiring a fully-trusted third party, offering limited privacy guarantees and incurring high communication overhead. In this paper, we propose a user-defined privacy grid system called dynamic grid system (DGS); the first holistic system that fulfills four essential requirements for privacy-preserving snapshot and continuous LBS. (1) The system only requires a semi-trusted third party, responsible for carrying out simple matching operations correctly. This semi-trusted third party does not have any information about a user's location. (2) Secure snapshot and continuous location privacy is guaranteed under our defined adversary models. (3) The communication cost for the user does not depend on the user's desired privacy level, it only depends on the number of relevant points of interest in the vicinity of the user. (4) Although we only focus on range and k-nearest-neighbor queries in this work, our system can be easily extended to support other spatial queries without changing the algorithms run by the semi-trusted third party and the database server, provided the required search area of a spatial query can be abstracted into spatial regions. Experimental results show that our DGS is more efficient than the state-of-the-art privacy-preserving technique for continuous LBS.
Roman Schlegel, Chi-Yin Chow, Qiong Huang 0001, Duncan S. Wong
IEEE Trans. Mob. Comput.1
2014 Reflection or action?: how feedback and control affect location sharing decisions
abstract
Owing to the ever-expanding size of social and professional networks, it is becoming cumbersome for individuals to configure information disclosure settings. We used location sharing systems to unpack the nature of discrepancies between a person's disclosure settings and contextual choices. We conducted an experience sampling study (N = 35) to examine various factors contributing to such divergence. We found that immediate feedback about disclosures without any ability to control the disclosures evoked feelings of oversharing. Moreover, deviation from specified settings did not always signal privacy violation; it was just as likely that settings prevented information disclosure considered permissible in situ. We suggest making feedback more actionable or delaying it sufficiently to avoid a knee-jerk reaction. Our findings also make the case for proactive techniques for detecting potential mismatches and recommending adjustments to disclosure settings, as well as selective control when sharing location with socially distant recipients and visiting atypical locations.
Sameer Patil 0001, Roman Schlegel, Apu Kapadia, Adam J. Lee
CHI2
2014 Automatic attack surface reduction in next-generation industrial control systems
abstract
Industrial control systems are often large and complex distributed systems and therefore expose a large potential attack surface. Effectively minimizing this attack surface requires security experts and significant manpower during engineering and maintenance of the system. This task, which is already difficult for today's control systems, will become significantly more complex for tomorrow's systems, which can reconfigure themselves dynamically, e.g., if hardware failures occur. In this article, we present a dynamic security system which can automatically minimize the attack surface of a control system's communication network. This security system is specifically designed for next-generation industrial control systems, but can also be applied in current generation systems. The presented security system adapts the necessary parameters of network and security controls according to the underlying changes in the control system environment. This ensures a better cyber security resilience against system compromise and reduces the attack surface because security controls will only allow data transfer that is required by the control application. Our evaluations for a next generation industrial control system and a current generation substation automation system show that the attack surface can be reduced by up to 90%, depending on the size and actual configuration of the control system.
Sebastian Obermeier 0001, Michael Wahler, Thanikesavan Sivanthi, Roman Schlegel, Aurelien Monot
CICS4
2014 ReDS: A Framework for Reputation-Enhanced DHTs
abstract
Distributed hash tables (DHTs), such as Chord and Kademlia, offer an efficient means to locate resources in peer-to-peer networks. Unfortunately, malicious nodes on a lookup path can easily subvert such queries. Several systems, including Halo (based on Chord) and Kad (based on Kademlia), mitigate such attacks by using redundant lookup queries. Much greater assurance can be provided; we present Reputation for Directory Services (ReDS), a framework for enhancing lookups in redundant DHTs by tracking how well other nodes service lookup requests. We describe how the ReDS technique can be applied to virtually any redundant DHT including Halo and Kad. We also study the collaborative identification and removal of bad lookup paths in a way that does not rely on the sharing of reputation scores, and we show that such sharing is vulnerable to attacks that make it unsuitable for most applications of ReDS. Through extensive simulations, we demonstrate that ReDS improves lookup success rates for Halo and Kad by 80 percent or more over a wide range of conditions, even against strategic attackers attempting to game their reputation scores and in the presence of node churn.
Ruj Akavipat, Mahdi N. Al-Ameen, Apu Kapadia, Zahid Rahman, Roman Schlegel, Matthew Wright 0001
IEEE Trans. Parallel Distributed Syst.5
2013 Secure design of engineering software tools in Industrial Automation and Control Systems
abstract
Industrial Automation and Control Systems (IACS) used in critical infrastructure typically perform their tasks using embedded devices. While the security of the embedded devices during the operation of the system is naturally the focus of security considerations, the security of the engineering framework is often overlooked. In this paper, we model the trust boundaries of a typical engineering tool used in an IACS, identify security risks in this context, suggest mitigation techniques for end users, and finally propose an architecture that allows to implement secure engineering frameworks.
Ana Hristova, Sebastian Obermeier 0001, Roman Schlegel
INDIN3
2013 A Conditional Proxy Broadcast Re-Encryption Scheme Supporting Timed-Release
Kaitai Liang, Qiong Huang 0001, Roman Schlegel, Duncan S. Wong, Chunming Tang 0003
ISPEC3
2012 Touch Gestures Based Biometric Authentication Scheme for Touchscreen Mobile Phones
Weizhi Meng 0001, Duncan S. Wong, Roman Schlegel, Lam-for Kwok
Inscrypt3
2012 Private Friends on a Social Networking Site Operated by an Overly Curious SNP
Roman Schlegel, Duncan S. Wong
NSS1
2012 Anonymous overlay network supporting authenticated routing
Roman Schlegel, Duncan S. Wong
Inf. Sci.1
2011 Soundcomber: A Stealthy and Context-Aware Sound Trojan for Smartphones
Roman Schlegel, Kehuan Zhang, Xiao-yong Zhou, Mehool Intwala, Apu Kapadia, XiaoFeng Wang 0001
NDSS1
2011 Eyeing your exposure: quantifying and controlling information sharing for improved privacy
abstract
A large body of research has focused on disclosure policies for controlling information release in social sharing (e.g., location-based) applications. However, less work has considered how exposed these policies actually leave users; i.e., to what extent are disclosures in compliance with these policies actually being made? For instance, consider a disclosure policy granting Alice's coworkers access to her location during work hours. Alice might feel that this policy appropriately controls her exposure, but may feel differently if she learned that her boss was accessing her location every 5 minutes. In addition to specifying who has access to personal information, users need a way to quantify, interpret, and control the extent to which this data is shared.
Roman Schlegel, Apu Kapadia, Adam J. Lee
SOUPS1
2006 SPam over Internet Telephony (SPIT) Prevention Framework
abstract
SPam over Internet telephony (SPIT) is expected to become a threat inhibiting the delivery of voice services over the Internet in the near future both because of its technical and economical characteristics. Experiences with email SPAM and its analogies with SPIT suggest that SPIT will be difficult to detect with a single detection method. Moreover, personalized management of detection strategies will be needed to increase effectiveness and to adapt the methods to special environments. This paper presents a modular framework for SPIT prevention designed to be easily manageable and extensible. Additionally, the framework makes use of a two-stage architecture in order to exploit the knowledge coming both from the signaling and from the media flows while still allowing real-time delivery of the media content to the user. Following the experience gained with our prototype implementation we also present the most important design issues we encountered and suggest solutions to these issues.
Roman Schlegel, Saverio Niccolini, Sandra Tartarelli, Marcus Brunner
GLOBECOM1