Pub Date : 2022-10-01DOI: 10.1109/EMSOFT55006.2022.00009
Arthur Grisel-Davy, Amrita Milan Bhogayata, Srijan Pabbi, Apurva Narayan, S. Fischmeister
The current security mechanisms for embedded systems often rely on Intrusion Detection System (IDS) running on the system itself. This provides the detector with relevant internal resources but also exposes it to being bypassed by an attacker. If the host is compromised, its IDS can not be trusted anymore and becomes useless. Power consumption offers an accurate and trusted representation of the system’s state that can be leveraged to verify its integrity during the boot sequence. We present a novel IDS that uses the side-channel power consumption of a target device to protect it against various firmware and hardware attacks. The proposed Boot Process Verifier (BPV) uses a combination of rule-based and machine-learning-based side-channel analysis to monitor and evaluate the integrity of different networking equipment with an overall accuracy of 0,942. The BPV is part of a new layer of cybersecurity mechanisms that leverage the physical emissions of devices for protection.
{"title":"Work-in-Progress: Boot Sequence Integrity Verification with Power Analysis","authors":"Arthur Grisel-Davy, Amrita Milan Bhogayata, Srijan Pabbi, Apurva Narayan, S. Fischmeister","doi":"10.1109/EMSOFT55006.2022.00009","DOIUrl":"https://doi.org/10.1109/EMSOFT55006.2022.00009","url":null,"abstract":"The current security mechanisms for embedded systems often rely on Intrusion Detection System (IDS) running on the system itself. This provides the detector with relevant internal resources but also exposes it to being bypassed by an attacker. If the host is compromised, its IDS can not be trusted anymore and becomes useless. Power consumption offers an accurate and trusted representation of the system’s state that can be leveraged to verify its integrity during the boot sequence. We present a novel IDS that uses the side-channel power consumption of a target device to protect it against various firmware and hardware attacks. The proposed Boot Process Verifier (BPV) uses a combination of rule-based and machine-learning-based side-channel analysis to monitor and evaluate the integrity of different networking equipment with an overall accuracy of 0,942. The BPV is part of a new layer of cybersecurity mechanisms that leverage the physical emissions of devices for protection.","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129337160","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}
Pub Date : 2022-10-01DOI: 10.1109/EMSOFT55006.2022.00011
Niraj Kumar, Arijit Mondal
A significant transition in the characteristics of computational workloads coupled with the developments in computing as well as networking concepts and practices has presented various challenges and opportunities. In this work, we study dynamic offloading of soft real-time tasks in SDN based fog computing system. Preliminary results have been presented to highlight the impact of intra/inter-cluster offloading on the penalty due to deadline miss. Finally, the future research directions have been outlined.
{"title":"Work in Progress: Dynamic Offloading of Soft Real-time Tasks in SDN-based Fog Computing Environment","authors":"Niraj Kumar, Arijit Mondal","doi":"10.1109/EMSOFT55006.2022.00011","DOIUrl":"https://doi.org/10.1109/EMSOFT55006.2022.00011","url":null,"abstract":"A significant transition in the characteristics of computational workloads coupled with the developments in computing as well as networking concepts and practices has presented various challenges and opportunities. In this work, we study dynamic offloading of soft real-time tasks in SDN based fog computing system. Preliminary results have been presented to highlight the impact of intra/inter-cluster offloading on the penalty due to deadline miss. Finally, the future research directions have been outlined.","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115596449","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}
Pub Date : 2022-10-01DOI: 10.1109/EMSOFT55006.2022.00015
A. Chodorek, R. Chodorek
The classic approach to the Web of Things in embedded systems consists of the use of embedded web servers that transmit data from sensors to external entities (web clients). In this paper we present a browser-driven sensor service, in which an embedded web browser shares data with external entities: collects them, pre-processes them and sends them to their recipients. The paper shows the framework software of such a system and a simple, prototype implementation with the use of this framework.
{"title":"Work-in-Progress: A Browser-Driven Sensor Service for Embedded IoT","authors":"A. Chodorek, R. Chodorek","doi":"10.1109/EMSOFT55006.2022.00015","DOIUrl":"https://doi.org/10.1109/EMSOFT55006.2022.00015","url":null,"abstract":"The classic approach to the Web of Things in embedded systems consists of the use of embedded web servers that transmit data from sensors to external entities (web clients). In this paper we present a browser-driven sensor service, in which an embedded web browser shares data with external entities: collects them, pre-processes them and sends them to their recipients. The paper shows the framework software of such a system and a simple, prototype implementation with the use of this framework.","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132047379","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}
Pub Date : 2022-10-01DOI: 10.1109/emsoft55006.2022.00006
{"title":"EMSOFT 2022 Program Committee","authors":"","doi":"10.1109/emsoft55006.2022.00006","DOIUrl":"https://doi.org/10.1109/emsoft55006.2022.00006","url":null,"abstract":"","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127637468","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}
Pub Date : 2022-10-01DOI: 10.1109/EMSOFT55006.2022.00012
Rezwana Mamata, Akramul Azim
Real-time embedded systems require sufficient re-sources to meet the application’s requirements. This often creates over-provisioning of resources, increasing the unused resources and overall costs. Determining optimal resource supply is essential to avoid over-resource provisioning. Existing research works lack consideration of finding the optimized supply of resources to meet the workload demand during any time intervals. Therefore, we propose a resource-aware optimization model to minimize the resource provision in any periodic task model. The proposed approach exploits the supply and demand bound functions to reduce resource over-provisioning while guaranteeing task deadlines. The preliminary experimental results show the benefits of our proposed approach for enhancing resource usage.
{"title":"Work-in-Progress: A Resource-Aware Optimization Model for Real-Time Systems Analysis and Design","authors":"Rezwana Mamata, Akramul Azim","doi":"10.1109/EMSOFT55006.2022.00012","DOIUrl":"https://doi.org/10.1109/EMSOFT55006.2022.00012","url":null,"abstract":"Real-time embedded systems require sufficient re-sources to meet the application’s requirements. This often creates over-provisioning of resources, increasing the unused resources and overall costs. Determining optimal resource supply is essential to avoid over-resource provisioning. Existing research works lack consideration of finding the optimized supply of resources to meet the workload demand during any time intervals. Therefore, we propose a resource-aware optimization model to minimize the resource provision in any periodic task model. The proposed approach exploits the supply and demand bound functions to reduce resource over-provisioning while guaranteeing task deadlines. The preliminary experimental results show the benefits of our proposed approach for enhancing resource usage.","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"68 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130439700","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}
Pub Date : 2022-10-01DOI: 10.1109/emsoft55006.2022.00005
{"title":"Welcome Message from the EMSOFT 2022 Program Chairs","authors":"","doi":"10.1109/emsoft55006.2022.00005","DOIUrl":"https://doi.org/10.1109/emsoft55006.2022.00005","url":null,"abstract":"","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"27 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123074313","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}
Pub Date : 2022-10-01DOI: 10.1109/EMSOFT55006.2022.00014
Yining Wu, G. Sai, Shengyu Duan
Matrix factorization (MF) is widely used in collaborative filtering-based recommendation systems, but the computational complexity greatly increases for larger scaled recommendation systems. We propose to accelerate MF by performing approximate matrix multiplications, considering the joint sparsity of the decomposed matrices. We show our method realizes a more than 1.1 speedup with a minimal error, and the speedup can be higher for the recommendation systems with larger scales.
{"title":"Work-in-Progress: Accelerated Matrix Factorization by Approximate Computing for Recommendation System","authors":"Yining Wu, G. Sai, Shengyu Duan","doi":"10.1109/EMSOFT55006.2022.00014","DOIUrl":"https://doi.org/10.1109/EMSOFT55006.2022.00014","url":null,"abstract":"Matrix factorization (MF) is widely used in collaborative filtering-based recommendation systems, but the computational complexity greatly increases for larger scaled recommendation systems. We propose to accelerate MF by performing approximate matrix multiplications, considering the joint sparsity of the decomposed matrices. We show our method realizes a more than 1.1 speedup with a minimal error, and the speedup can be higher for the recommendation systems with larger scales.","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123995821","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}
Pub Date : 2022-10-01DOI: 10.1109/EMSOFT55006.2022.00013
Jean-Baptiste Jeannin, Jiawei Chen, José Luiz Vargas de Mendonça, Konstantinos Mamouras
Several quantitative semantics of temporal logics have been investigated recently. We propose a general form to model those quantitative semantics, establish requirements for soundness, and evaluate the framework on a few examples.
{"title":"Work-in-Progress: Towards a Theory of Robust Quantitative Semantics for Signal Temporal Logic","authors":"Jean-Baptiste Jeannin, Jiawei Chen, José Luiz Vargas de Mendonça, Konstantinos Mamouras","doi":"10.1109/EMSOFT55006.2022.00013","DOIUrl":"https://doi.org/10.1109/EMSOFT55006.2022.00013","url":null,"abstract":"Several quantitative semantics of temporal logics have been investigated recently. We propose a general form to model those quantitative semantics, establish requirements for soundness, and evaluate the framework on a few examples.","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114230506","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}
Pub Date : 2022-10-01DOI: 10.1109/EMSOFT55006.2022.00010
Haegeon Jeong, Kyungtae Kang
Imprecise computing has emerged as an approach for designing energy-efficient digital systems as it can save computing resources. Hot-patching is one of the techniques used to implement it. Hot-patching can add or delete application functions without restarting the application. In this study, we implemented a hot-patching tool for a Linux application and applied it to imprecise computing. We measured the CPU cycle and instruction counts based on square root calculation applications. The experimental results confirmed that CPU resource utilization reduced by 20% when applying a patch with an error range of approximately 2%. Hence, we confirmed that imprecise computing can be performed through hot-patching.
{"title":"Work-in-Progress: Hot-patching Technique for Imprecise Computing by Saving Resource","authors":"Haegeon Jeong, Kyungtae Kang","doi":"10.1109/EMSOFT55006.2022.00010","DOIUrl":"https://doi.org/10.1109/EMSOFT55006.2022.00010","url":null,"abstract":"Imprecise computing has emerged as an approach for designing energy-efficient digital systems as it can save computing resources. Hot-patching is one of the techniques used to implement it. Hot-patching can add or delete application functions without restarting the application. In this study, we implemented a hot-patching tool for a Linux application and applied it to imprecise computing. We measured the CPU cycle and instruction counts based on square root calculation applications. The experimental results confirmed that CPU resource utilization reduced by 20% when applying a patch with an error range of approximately 2%. Hence, we confirmed that imprecise computing can be performed through hot-patching.","PeriodicalId":371537,"journal":{"name":"2022 International Conference on Embedded Software (EMSOFT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133013726","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：