Electronic Communications of the EASST (European Association of Software Science and Technology)
Not a member yet
887 research outputs found
Sort by
A Novel Approach to Achieving End-to-End QoS for Avionic Applications
Full text linkFuture Internet of Things (IoT) applications, such as connected industry 4.0, become more challenging with the strict Quality of Service (QoS) requirements, including reliability and delay guarantees. Several mechanisms in the communication stack to match the expected QoS are already discussed and specified at different layers, with the goal to make the communication more reliable. They focus on the layer-specific enhancements. For example, Time-Slotted Channel Hopping (TSCH) is a link layer mechanism to avoid narrowband interference. On the network layer, several multi-path routing schemes are proposed to distribute the traffic load or to have backup paths with the purpose of making data transmissions more robust to link failures. In addition to the layer-specific improvements, an integration of the cross-layer information can guarantee an end-to-end QoS for communication in dynamic environments. In this work we propose and evaluate a cross-layer framework for cell- disjoint routing, which eliminates overlapping resource scheduling in both time and frequency. It enables the end-to-end QoS for wireless sensor networks under the IPv6 Over the TSCH Mode of IEEE 802.15.4 (6TiSCH). The proposed framework, called 6TiSCH stack with cross-layer information exchange (6TiSCH-CLX), is validated on a selected set of aviation industry applications using both simulations and analytical model
Data Race Detection in the Linux Kernel with CPALockator
Full text linkMost of the state-of-the-art verification tools do not scale well on complicated software. Our goal was to develop a tool, which becomes a golden mean between precise and slow software model checkers and fast and imprecise static analyzers.It allows verifying industrial software more efficiently.Our method is based on the Thread-Modular approach elaborating the idea of abstraction from precise thread interaction and considering every thread separately, but in a special environment, which models thread effects on each other.The approach was implemented in the CPAchecker framework and was evaluated on benchmarks based on Linux device drivers for data race detection. It demonstrated that predicate abstraction allows keeping a false alarms rate at a reasonable level of 52\%. Moreover, it did not miss known real bugs found by analysis of commits in the Linux kernel repository thus confirming the soundness of the approach
Zero Trust Service Function Chaining
Full text linkIn this paper, we address the inefficient handling of traditional security functions in Zero Trust (ZT) networks. For this reason, we propose a novel network security concept that combines the ideas of ZT and Service Function Chaining (SFC). This allows us to efficiently decide which security functions to apply to which packets and when
Hacking planned obsolescense in robotics, towards security-oriented robot teardown
Full text linkAs robots get damaged or security compromised, their components will increasingly require updates and replacements. Contrary to the expectations, most manufacturers employ planned obsolescence practices and discourage repairs to evade competition. We introduce and advocate for robot teardownas an approach to study robot hardware architectures and fuel security research. We show how our approach helps uncovering security vulnerabilities, and provide evidence of planned obsolescence practice
Discrete-time Analysis of Multicomponent GI/GI/1 Queueing Networks
Full text linkIn this work, we provide initial insights regarding the error introducedinto multicomponent queueing systems by assuming the departure processes of arbitraryGI/GI/1-oo queues to be renewal processes. To this end, we compute the sojourntime distribution as well as departure distributions of a linear chain of queueingcomponents and compare the results to a simulation of the same system. By applyingthe renewal approximation, potential autocorrelations of the departure processesare lost. We investigate the magnitude of this error regarding both the sojourn timeas well as interdeparture time distributions for a broad set of parameters. Althoughmore indepth studies are needed, our results show that both distributions can beclosely approximated, which allows the application of the model to asses the performanceof real world NFV function chains
Browser Fingerprinting: How to Protect Machine Learning Models and Data with Differential Privacy?
Full text linkAs modern communication networks grow more and more complex, manually maintaining an overview of deployed soft- and hardware is challenging. Mechanisms such as fingerprinting are utilized to automatically extract information from ongoing network traffic and map this to a specific device or application, e.g., a browser. Active approaches directly interfere with the traffic and impose security risks or are simply infeasible. Therefore, passive approaches are employed, which only monitor traffic but require a well-designed feature set since less information is available. However, even these passive approaches impose privacy risks. Browser identification from encrypted traffic may lead to data leakage, e.g., the browser history of users. We propose a passive browser fingerprinting method based on explainable features and evaluate two privacy protection mechanisms, namely differentially private classifiers and differentially private data generation. With a differentially private Random Decision Forest, we achieve an accuracy of 0.877. If we train a non-private Random Forest on differentially private synthetic data, we reach an accuracy up to 0.887, showing a reasonable trade-off between utility and privacy
Polymorphic Protocols for Fighting Bots
Full text linkWeb Robots (bots) that automate communication with a service on the Internet via their API are efficient and easy to scale. A large number of bots leads to significant losses for providers and can frustrate users of social media, games or online stores. Existing solutions such as CAPTCHAs or complex registrations either frustrate users or are easy to circumvent. Current solutions that make it difficult to create bots are only effective for the first bot. Once the first bot is created, it can be easily duplicated to build an army of bots. This paper presents an approach inspired by polymorphic malware and censorship resistance to change this. Each client that communicates with a service does so by using its own application protocol that is syntactically different but not semantically. Thus, a bot creator is forced to either find a way to automatically extract the whole application protocol from a client or to reverse engineer a new protocol for each bot that is created
Smart Urban Data Space for Citizen Science
Full text linkIn smart cities, the number of citizen-operated sensor devices continues to increase. This development multiplies the amount of collectible data about our urban environment. Currently, many of those sensors are connected to proprietary cloud services with questionable effects on user privacy. Simply avoiding interconnecting those devices misses out on opportunities to collectively use data as a shared source of information. The city of Hamburg sponsored project Smart Networks for Urban Citizen Participation (SANE) aims at enabling citizens to connect existing sensors to create a city-wide data space while keeping control of devices and gathered data. Interconnecting these sensors enables all citizens to generate higher value information and thus improve their urban environmental awareness. In this paper, we describe the demo of our SANE architecture. The demo presents how citizens connect to the city-wide data space, how data can be collected, processed, and shared in a privately manner
Block-Based Models and Theorem Proving in Model-Based Development
Full text linkThis paper presents a methodology to integrate computer-assisted theorem proving into a standard workflow for model-based development that uses a block-based language as a modeling and simulation tool. The theorem prover provides confidence in the results of the analysis as it guides the developers towards a correct formalization of the system under development
Privacy-Preserving and Scalable Authentication based on Network Connection Traces
Full text linkSince password-based authentication is no longer sufficient for web applications, additional authentication factors are required. Especially in the context of mobile devices and with regard to usability, there is an increasing focus on methods where the user's behavior is used as authentication factor (e.g., touchscreen interactions or sensors). As this typically requires the processing of large amounts of sensitive data, issues related to privacy and scalability arise. Our work addresses the issues by presenting a scalable and privacy-friendly approach for authenticating users of mobile applications based on information about their network connections