Leibniz Trans. Embed. Syst.最新文献

Randomization as Mitigation of Directed Timing Inference Based Attacks on Time-Triggered Real-Time Systems with Task Replication 随机化缓解带有任务复制的时间触发实时系统的定向时间推理攻击

Leibniz Trans. Embed. Syst. Pub Date : 2021-08-12 DOI: 10.4230/LITES.7.1.1

Kristin Krüger, Nils Vreman, R. Pates, M. Maggio, M. Völp, G. Fohler

{"title":"Randomization as Mitigation of Directed Timing Inference Based Attacks on Time-Triggered Real-Time Systems with Task Replication","authors":"Kristin Krüger, Nils Vreman, R. Pates, M. Maggio, M. Völp, G. Fohler","doi":"10.4230/LITES.7.1.1","DOIUrl":"https://doi.org/10.4230/LITES.7.1.1","url":null,"abstract":"Time-triggered real-time systems achieve deterministic behavior using schedules that are constructed offline, based on scheduling constraints. Their deterministic behavior makes time-triggered systems suitable for usage in safety-critical environments, like avionics. However, this determinism also allows attackers to fine-tune attacks that can be carried out after studying the behavior of the system through side channels, targeting safety-critical victim tasks. Replication -- i.e., the execution of task variants across different cores -- is inherently able to tolerate both accidental and malicious faults (i.e. attacks) as long as these faults are independent of one another. Yet, targeted attacks on the timing behavior of tasks which utilize information gained about the system behavior violate the fault independence assumption fault tolerance is based on. This violation may give attackers the opportunity to compromise all replicas simultaneously, in particular if they can mount the attack from already compromised components. In this paper, we analyze vulnerabilities of time-triggered systems, focusing on safety-certified multicore real-time systems. We introduce two runtime mitigation strategies to withstand directed timing inference based attacks: (i) schedule randomization at slot level, and (ii) randomization within a set of offline constructed schedules. We evaluate these mitigation strategies with synthetic experiments and a real case study to show their effectiveness and practicality. (Less)","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122948038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

We know what you're doing! Application detection using thermal data 我们知道你在干什么!应用程序检测使用热数据

Leibniz Trans. Embed. Syst. Pub Date : 2021-08-12 DOI: 10.4230/LITES.7.1.2

Philipp Miedl, R. Ahmed, L. Thiele

{"title":"We know what you're doing! Application detection using thermal data","authors":"Philipp Miedl, R. Ahmed, L. Thiele","doi":"10.4230/LITES.7.1.2","DOIUrl":"https://doi.org/10.4230/LITES.7.1.2","url":null,"abstract":"Modern mobile and embedded devices have high computing power which allows them to be used for multiple purposes. Therefore, applications with low security restrictions may execute on the same device as applications handling highly sensitive information. In such a setup, a security risk occurs if it is possible that an application uses system characteristics to gather information about another application on the same device.In this work, we present a method to leak sensitive runtime information by just using temperature sensor readings of a mobile device. We employ a Convolutional-Neural-Network, Long Short-Term Memory units and subsequent label sequence processing to identify the sequence of executed applications over time. To test our hypothesis we collect data from two state-of-the-art smartphones and real user usage patterns. We show an extensive evaluation using laboratory data, where we achieve labelling accuracies up to 90% and negligible timing error. Based on our analysis we state that the thermal information can be used to compromise sensitive user data and increase the vulnerability of mobile devices. A study based on data collected outside of the laboratory opens up various future directions for research.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":" October","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113946969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Susceptibility to Image Resolution in Face Recognition and Training Strategies to Enhance Robustness 人脸识别对图像分辨率的敏感性及增强鲁棒性的训练策略

Leibniz Trans. Embed. Syst. Pub Date : 2021-07-08 DOI: 10.4230/LITES.8.1.1

Martin Knoche, S. Hörmann, G. Rigoll

{"title":"Susceptibility to Image Resolution in Face Recognition and Training Strategies to Enhance Robustness","authors":"Martin Knoche, S. Hörmann, G. Rigoll","doi":"10.4230/LITES.8.1.1","DOIUrl":"https://doi.org/10.4230/LITES.8.1.1","url":null,"abstract":"Face recognition approaches often rely on equal image resolution for verifying faces on two images. However, in practical applications, those image resolutions are usually not in the same range due to different image capture mechanisms or sources. In this work, we first analyze the impact of image resolutions on face verification performance with a state-of-the-art face recognition model. For images synthetically reduced to $5,times,5$ px resolution, the verification performance drops from $99.23%$ increasingly down to almost $55%$. Especially for cross-resolution image pairs (one high- and one low-resolution image), the verification accuracy decreases even further. We investigate this behavior more in-depth by looking at the feature distances for every 2-image test pair. To tackle this problem, we propose the following two methods: 1) Train a state-of-the-art face-recognition model straightforwardly with $50%$ low-resolution images directly within each batch. 2) Train a siamese-network structure and add a cosine distance feature loss between high- and low-resolution features. Both methods show an improvement for cross-resolution scenarios and can increase the accuracy at very low resolution to approximately $70%$. However, a disadvantage is that a specific model needs to be trained for every resolution pair. Thus, we extend the aforementioned methods by training them with multiple image resolutions at once. The performances for particular testing image resolutions are slightly worse, but the advantage is that this model can be applied to arbitrary resolution images and achieves an overall better performance ($97.72%$ compared to $96.86%$). Due to the lack of a benchmark for arbitrary resolution images for the cross-resolution and equal-resolution task, we propose an evaluation protocol for five well-known datasets, focusing on high, mid, and low-resolution images.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115505552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A Survey of Probabilistic Timing Analysis Techniques for Real-Time Systems 实时系统的概率时序分析技术综述

Leibniz Trans. Embed. Syst. Pub Date : 2019-05-14 DOI: 10.4230/LITES-v006-i001-a003

Robert I. Davis, L. Cucu-Grosjean

引用次数: 50

Elastic Scheduling for Parallel Real-Time Systems 并行实时系统的弹性调度

Leibniz Trans. Embed. Syst. Pub Date : 2019-05-14 DOI: 10.4230/LITES-v006-i001-a005

James Orr, C. Gill, Kunal Agrawal, Jing Li, Sanjoy Baruah

引用次数: 7

A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems 实时系统概率可调度性分析技术综述

Leibniz Trans. Embed. Syst. Pub Date : 2019-05-14 DOI: 10.4230/LITES-v006-i001-a004

Robert I. Davis, L. Cucu-Grosjean

引用次数: 34

Improving WCET Evaluation using Linear Relation Analysis 用线性关系分析改进WCET评价

Leibniz Trans. Embed. Syst. Pub Date : 2019-02-18 DOI: 10.4230/LITES-v006-i001-a002

Pascal Raymond, Claire Maiza, C. Parent-Vigouroux, Erwan Jahier, N. Halbwachs, Fabienne Carrier, Mihail Asavoae, Rémy Boutonnet

引用次数: 6

Local Planning Semantics: A Semantics for Distributed Real-Time Systems 局部规划语义:分布式实时系统的一种语义

Leibniz Trans. Embed. Syst. Pub Date : 2019-02-18 DOI: 10.4230/LITES-v006-i001-a001

Mahieddine Dellabani, Jacques Combaz, S. Bensalem, M. Bozga

{"title":"Local Planning Semantics: A Semantics for Distributed Real-Time Systems","authors":"Mahieddine Dellabani, Jacques Combaz, S. Bensalem, M. Bozga","doi":"10.4230/LITES-v006-i001-a001","DOIUrl":"https://doi.org/10.4230/LITES-v006-i001-a001","url":null,"abstract":"Design, implementation and verification of distributed real-time systems are acknowledged to be very hard tasks. Such systems are prone to different kinds of delay, such as execution time of actions or communication delays implied by distributed platforms. The latter increase considerably the complexity of coordinating the parallel activities of running components. Scheduling such systems must cope with those delays by proposing execution strategies ensuring global consistency while satisfying the imposed timing constraints. In this paper, we investigate a formal model for such systems as compositions of timed automata subject to multiparty interactions, and propose a semantics aiming to overcome the communication delays problem through anticipating the execution of interactions. To be effective in a distributed context, scheduling an interaction should rely on (as much as possible) local information only, namely the state of its participating components. However, as shown in this paper these information is not always sufficient and does not guarantee a safe execution of the system as it may introduce deadlocks. Moreover, delays may also affect the satisfaction of timing constraints, which also corresponds to deadlocks in the former model. Thus, we also explore methods for analyzing such deadlock situations and for computing deadlock-free scheduling strategies when possible.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114163831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

A Static Analysis for the Minimization of Voters in Fault-Tolerant Circuits 容错电路中投票人最小的静态分析

Leibniz Trans. Embed. Syst. Pub Date : 2018-10-15 DOI: 10.4230/LITES-v005-i001-a004

D. Burlyaev, Pascal Fradet, A. Girault

{"title":"A Static Analysis for the Minimization of Voters in Fault-Tolerant Circuits","authors":"D. Burlyaev, Pascal Fradet, A. Girault","doi":"10.4230/LITES-v005-i001-a004","DOIUrl":"https://doi.org/10.4230/LITES-v005-i001-a004","url":null,"abstract":"We present a formal approach to minimize the number of voters in triple-modular redundant (TMR) sequential circuits. Our technique actually works on a single copy of the TMR circuit and considers a large class of fault mo dels of the form “at most 1 Single-Event Upset (SEU) or Single-Event Transient (SET) every k clock cycles”. Verification-based voter minimization guarantees that the resulting TMR circuit (i) is fault tolerant to the soft-errors defined by the fault model and (ii) is functionally equivalent to the initial TMR circuit. Our approach operates at the logic level and takes into account the input and output interface specifications of the circuit. Its implementation makes use of graph traversal algorithms, fixed-point iterations, and binary decision diagrams (BDD). Experimental results on the ITC’99 benchmark suite indicate that our method significantly decreases the number of inserted voters, yielding a hardware reduction of up to 55% and a clock frequency increase of up to 35% compared to full TMR. As our experiments show, if the SEU fault-model is replaced with the stricter fault-model of SET, it has a minor impact on the number of removed voters. On the other hand, BDD-based modelling of SET effects represents a more complex task than the modelling of an SEU as a bit-flip. We propose solutions for this task and explain the nature of encountered problems. We address scalability issues arising from formal verification with approximations and assess their efficiency and precision.","PeriodicalId":376325,"journal":{"name":"Leibniz Trans. Embed. Syst.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114655517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The Semantic Foundations and a Landscape of Cache-Persistence Analyses 缓存持久性分析的语义基础和前景

Leibniz Trans. Embed. Syst. Pub Date : 2018-08-02 DOI: 10.4230/LITES-v005-i001-a003

J. Reineke

引用次数: 9