Neda Rohani, Zainab Noferesti, J. Mohajeri, M. Aref
Trivium is a hardware profile finalist of eSTREAM project. It is a synchronous bit-oriented stream cipher. The cipher’s internal state has 288 bits. Bivium is a simplified version of Trivium with a smaller internal state. Both algorithms provide the security level of 80 bits. In this paper we introduce a guess and determine attack on Trivium and Bivium. In our method, we first find the linear approximations for the updating functions. Then by using these approximations, we build a system of linear equations and internal state variables. In order to solve the system, some bits of the internal state should be guessed. Our attack on Trivium is not successful because of the large length of internal state therefore it is resistant to the method. It’s complexity is of order O(2^90.67). But for recovering the state of Bivium, we need to guess only 27.55 bits and other bits will be determined. In order to complete the attack 2^43.99 bits of key stream are needed. The complexity of the attack on Bivium is O(2^27.55), which is an improvement to the previous guess and determine attack with a complexity of order O(2^52.3).
{"title":"Guess and Determine Attack on Trivium Family","authors":"Neda Rohani, Zainab Noferesti, J. Mohajeri, M. Aref","doi":"10.1109/EUC.2010.123","DOIUrl":"https://doi.org/10.1109/EUC.2010.123","url":null,"abstract":"Trivium is a hardware profile finalist of eSTREAM project. It is a synchronous bit-oriented stream cipher. The cipher’s internal state has 288 bits. Bivium is a simplified version of Trivium with a smaller internal state. Both algorithms provide the security level of 80 bits. In this paper we introduce a guess and determine attack on Trivium and Bivium. In our method, we first find the linear approximations for the updating functions. Then by using these approximations, we build a system of linear equations and internal state variables. In order to solve the system, some bits of the internal state should be guessed. Our attack on Trivium is not successful because of the large length of internal state therefore it is resistant to the method. It’s complexity is of order O(2^90.67). But for recovering the state of Bivium, we need to guess only 27.55 bits and other bits will be determined. In order to complete the attack 2^43.99 bits of key stream are needed. The complexity of the attack on Bivium is O(2^27.55), which is an improvement to the previous guess and determine attack with a complexity of order O(2^52.3).","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123301065","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}
Designing a reliable and trusted routing scheme for resource-constrained Wireless Sensor Networks (WSNs) is a challenging task due to the lack of infrastructure and the highly dynamic network topology. To ensure trustworthy end-to-end communications between wirelessly connected sensor nodes, a considerable amount of bidirectional traffic must be relayed either between neighboring sensor nodes or between source sensor nodes and the base station. Such scenarios may lead to an added routing overhead, higher energy depletion rate and network life time minimization. The existing trusted routing protocols focus on trusted data dissemination while lacking the consideration of the restricted resources of sensor nodes and low-power radio link failures. To solve this problem, we propose a reliability-oriented routing scheme that takes into account the link reliability and residual energy of sensor nodes, thus allowing for better trustworthy data exchange, traffic balancing and network lifetime extension. Based on real test bed experiments and large-scale simulations, the attained results show the benefits stemming from the adoption of our scheme to be a reliable and energy efficient data delivery platform for potential trusted data exchange models. Our results show that the scheme is able to reduce energy consumption without affecting the connectivity of the network.
{"title":"Trusted Routing for Resource-Constrained Wireless Sensor Networks","authors":"K. Daabaj, M. Dixon, Terry Koziniec, Kevin Lee","doi":"10.1109/EUC.2010.106","DOIUrl":"https://doi.org/10.1109/EUC.2010.106","url":null,"abstract":"Designing a reliable and trusted routing scheme for resource-constrained Wireless Sensor Networks (WSNs) is a challenging task due to the lack of infrastructure and the highly dynamic network topology. To ensure trustworthy end-to-end communications between wirelessly connected sensor nodes, a considerable amount of bidirectional traffic must be relayed either between neighboring sensor nodes or between source sensor nodes and the base station. Such scenarios may lead to an added routing overhead, higher energy depletion rate and network life time minimization. The existing trusted routing protocols focus on trusted data dissemination while lacking the consideration of the restricted resources of sensor nodes and low-power radio link failures. To solve this problem, we propose a reliability-oriented routing scheme that takes into account the link reliability and residual energy of sensor nodes, thus allowing for better trustworthy data exchange, traffic balancing and network lifetime extension. Based on real test bed experiments and large-scale simulations, the attained results show the benefits stemming from the adoption of our scheme to be a reliable and energy efficient data delivery platform for potential trusted data exchange models. Our results show that the scheme is able to reduce energy consumption without affecting the connectivity of the network.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125305918","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}
The complexity of modern vehicular embedded systems is constantly rising. In addition, distributed embedded systems like automobiles often implement safety-relevant applications which have a high demands on safety and reliability. This poses a great challenge for the design of these systems. Self-adaptation may overcome these challenges and enhance the flexibility and robustness of automotive embedded systems. To design such systems in an efficient way, an adaptive system has to be verified and validated even in early stages of the development process. Co-simulation enables such an approach. In this paper, we outline a concept for iterative virtual prototyping of the entire automotive in-vehicle network including hardware components, software functions and interconnection networks. Furthermore, we present an approach to simulate self-adaptive behavior of the automotive embedded system.
{"title":"Co-Simulation of Self-Adaptive Automotive Embedded Systems","authors":"M. Zeller, Gereon Weiss, D. Eilers, R. Knorr","doi":"10.1109/EUC.2010.21","DOIUrl":"https://doi.org/10.1109/EUC.2010.21","url":null,"abstract":"The complexity of modern vehicular embedded systems is constantly rising. In addition, distributed embedded systems like automobiles often implement safety-relevant applications which have a high demands on safety and reliability. This poses a great challenge for the design of these systems. Self-adaptation may overcome these challenges and enhance the flexibility and robustness of automotive embedded systems. To design such systems in an efficient way, an adaptive system has to be verified and validated even in early stages of the development process. Co-simulation enables such an approach. In this paper, we outline a concept for iterative virtual prototyping of the entire automotive in-vehicle network including hardware components, software functions and interconnection networks. Furthermore, we present an approach to simulate self-adaptive behavior of the automotive embedded system.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127788094","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}
Over the past few years, Cognitive Radio (CR) has been considered as a demanding concept for improving the utilization of limited radio spectrum resources for future wireless communications and mobile computing. Since a member of Cognitive Radio Networks may join or leave the network at any time, the issue of supporting secure communication in CRNs becomes more critical than for the other conventional wireless networks. This work thus proposes a secure trust-based authentication approach for CRNs. A CR node’s trust value is determined from its previous trust behavior in the network and depending on this trust value, it is decided whether or not this CR node will obtain access to the Primary User’s free spectrum. The security analysis is performed to guarantee that the proposed approach achieves security proof.
{"title":"Trust-Based Authentication for Secure Communication in Cognitive Radio Networks","authors":"S. Parvin, Song Han, B. Tian, F. Hussain","doi":"10.1109/EUC.2010.95","DOIUrl":"https://doi.org/10.1109/EUC.2010.95","url":null,"abstract":"Over the past few years, Cognitive Radio (CR) has been considered as a demanding concept for improving the utilization of limited radio spectrum resources for future wireless communications and mobile computing. Since a member of Cognitive Radio Networks may join or leave the network at any time, the issue of supporting secure communication in CRNs becomes more critical than for the other conventional wireless networks. This work thus proposes a secure trust-based authentication approach for CRNs. A CR node’s trust value is determined from its previous trust behavior in the network and depending on this trust value, it is decided whether or not this CR node will obtain access to the Primary User’s free spectrum. The security analysis is performed to guarantee that the proposed approach achieves security proof.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"11 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126020561","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}
The host-multi-SIMD chip multiprocessor (CMP) architecture has been proved to be an efficient architecture for high performance signal processing which explores both task level parallelism by multi-core processing and data level parallelism by SIMD processors. Different from the cache-based memory subsystem in most general purpose processors, this architecture uses on-chip scratchpad memory (SPM) as processor local data buffer and allows software to explicitly control the data movements in the memory hierarchy. This SPM-based solution is more efficient for predictable signal processing in embedded systems where data access patterns are known at design time. The predictable performance is especially important for real time signal processing. According to Amdahl¡¯s law, the nonparallelizable part of an algorithm has critical impact on the overall performance. Implementing an algorithm in a parallel platform usually produces control and communication overhead which is not parallelizable. This paper presents the architectural support in an embedded multiprocessor platform to maximally reduce the parallel processing overhead. The effectiveness of these architecture designs in boosting parallel performance is evaluated by an implementation example of 64x64 complex matrix multiplication. The result shows that the parallel processing overhead is reduced from 369% to 28%.
{"title":"Architectural Support for Reducing Parallel Processing Overhead in an Embedded Multiprocessor","authors":"Jian Wang, Joar Sohl, Dake Liu","doi":"10.1109/EUC.2010.17","DOIUrl":"https://doi.org/10.1109/EUC.2010.17","url":null,"abstract":"The host-multi-SIMD chip multiprocessor (CMP) architecture has been proved to be an efficient architecture for high performance signal processing which explores both task level parallelism by multi-core processing and data level parallelism by SIMD processors. Different from the cache-based memory subsystem in most general purpose processors, this architecture uses on-chip scratchpad memory (SPM) as processor local data buffer and allows software to explicitly control the data movements in the memory hierarchy. This SPM-based solution is more efficient for predictable signal processing in embedded systems where data access patterns are known at design time. The predictable performance is especially important for real time signal processing. According to Amdahl¡¯s law, the nonparallelizable part of an algorithm has critical impact on the overall performance. Implementing an algorithm in a parallel platform usually produces control and communication overhead which is not parallelizable. This paper presents the architectural support in an embedded multiprocessor platform to maximally reduce the parallel processing overhead. The effectiveness of these architecture designs in boosting parallel performance is evaluated by an implementation example of 64x64 complex matrix multiplication. The result shows that the parallel processing overhead is reduced from 369% to 28%.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130878697","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}
A trusted virtual domain (TVD) enables grouping of related virtual machines running on separate physical machine into a single network domain with a unified security policy. Since the virtual machines can be running different operating systems and applications, the attacker can generate attacks in the TVD by exploiting a single vulnerability in any of the operating systems or applications. Our aim in this paper is to consider the design choices and develop an intrusion detection architecture that would enable efficient detection and prevention of different types of attacks in such a TVD based distributed environments. The proposed architecture can capture the knowledge of the operating systems and applications at fine granular level and isolate the malicious entities that are generating the attack traffic. Our model takes into account the security policies that are specific to the virtual machine as well as security policies of the trusted virtual domains to deal with the attacks efficiently.
{"title":"Detecting Security Attacks in Trusted Virtual Domains","authors":"U. Tupakula, V. Varadharajan","doi":"10.1109/EUC.2010.87","DOIUrl":"https://doi.org/10.1109/EUC.2010.87","url":null,"abstract":"A trusted virtual domain (TVD) enables grouping of related virtual machines running on separate physical machine into a single network domain with a unified security policy. Since the virtual machines can be running different operating systems and applications, the attacker can generate attacks in the TVD by exploiting a single vulnerability in any of the operating systems or applications. Our aim in this paper is to consider the design choices and develop an intrusion detection architecture that would enable efficient detection and prevention of different types of attacks in such a TVD based distributed environments. The proposed architecture can capture the knowledge of the operating systems and applications at fine granular level and isolate the malicious entities that are generating the attack traffic. Our model takes into account the security policies that are specific to the virtual machine as well as security policies of the trusted virtual domains to deal with the attacks efficiently.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131536768","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}
Soft error has become an increasingly significant problem in modern computing systems. To overcome soft errors, it has reported that the instruction-level temporal redundancy in out-of-order cores suffers a performance penalty up to 45%. In this work, we propose the fault-tolerant double execution architecture with the fast error correcting code (such as two-dimensional error code) in the instruction reuse buffer. Experimental results show that it gains back IPC loss between 9.14% and 10.15%, with an average around 9.22% compared with the conventional double execution approach.
{"title":"A Fault-tolerant Architecture with Error Correcting Code for the Instruction-level Temporal Redundancy","authors":"Chao Yan, Hongjun Dai, Tianzhou Chen, Meikang Qiu","doi":"10.1109/EUC.2010.124","DOIUrl":"https://doi.org/10.1109/EUC.2010.124","url":null,"abstract":"Soft error has become an increasingly significant problem in modern computing systems. To overcome soft errors, it has reported that the instruction-level temporal redundancy in out-of-order cores suffers a performance penalty up to 45%. In this work, we propose the fault-tolerant double execution architecture with the fast error correcting code (such as two-dimensional error code) in the instruction reuse buffer. Experimental results show that it gains back IPC loss between 9.14% and 10.15%, with an average around 9.22% compared with the conventional double execution approach.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132296809","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}
Hierarchical wireless sensor networks (HSNs) have been widely used in many applications, especially in military areas. They usually consist of different types of nodes and behave better in performances and reliability than traditional flat wireless sensor networks (FSNs). In this paper, a novel key pre-distribution scheme is proposed for a three-tier HSN. Shamir¡¯s secret sharing technique is implemented in intra-cluster pair wise key establishment. Compared with existing key management schemes, our scheme guarantees a fully connected network with less storage requirement and communication overhead of sensors. Besides, it substantially improves the network resilience against nodes capture attack and collusion attack.
{"title":"Key Sharing in Hierarchical Wireless Sensor Networks","authors":"Ya-nan Liu, Jian Wang, He Du, L. Zhang","doi":"10.1109/EUC.2010.117","DOIUrl":"https://doi.org/10.1109/EUC.2010.117","url":null,"abstract":"Hierarchical wireless sensor networks (HSNs) have been widely used in many applications, especially in military areas. They usually consist of different types of nodes and behave better in performances and reliability than traditional flat wireless sensor networks (FSNs). In this paper, a novel key pre-distribution scheme is proposed for a three-tier HSN. Shamir¡¯s secret sharing technique is implemented in intra-cluster pair wise key establishment. Compared with existing key management schemes, our scheme guarantees a fully connected network with less storage requirement and communication overhead of sensors. Besides, it substantially improves the network resilience against nodes capture attack and collusion attack.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125119089","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}
The privacy-CA solution (PCAS) is a protocol designed by the Trusted Computing Group (TCG) as an alternative to the Direct Anonymous Attestation scheme for anonymous authentication of Trusted Platform Module (TPM). The protocol has been specified in TPM Specification Version 1.2. In this paper we offer a rigorous security analysis of the protocol. We first design an appropriate security model that captures the level of security offered by PCAS. The model is justified via the expected uses of the protocol in real applications. We then prove, assuming standard security notions for the underlying primitives that the protocol indeed meets the security notion we design. Our analysis sheds some light on the design of the protocol. Finally, we propose a strengthened protocol that meets a stronger notion of security where the adversary is allowed to adaptively corrupt TPMs.
PCAS (privacy-CA solution)是由可信计算组(TCG)设计的一种协议，作为直接匿名认证方案的替代方案，用于可信平台模块(TPM)的匿名认证。该协议已在TPM Specification Version 1.2中指定。本文对该协议进行了严格的安全性分析。我们首先设计一个适当的安全模型，以捕获PCAS提供的安全级别。该模型通过实际应用中协议的预期使用得到验证。然后，假设底层原语的标准安全概念，我们证明协议确实符合我们设计的安全概念。我们的分析揭示了协议的设计。最后，我们提出了一个增强的协议，该协议满足更强的安全概念，允许对手自适应地破坏tpm。
{"title":"Security of the TCG Privacy-CA Solution","authors":"Liqun Chen, B. Warinschi","doi":"10.1109/EUC.2010.98","DOIUrl":"https://doi.org/10.1109/EUC.2010.98","url":null,"abstract":"The privacy-CA solution (PCAS) is a protocol designed by the Trusted Computing Group (TCG) as an alternative to the Direct Anonymous Attestation scheme for anonymous authentication of Trusted Platform Module (TPM). The protocol has been specified in TPM Specification Version 1.2. In this paper we offer a rigorous security analysis of the protocol. We first design an appropriate security model that captures the level of security offered by PCAS. The model is justified via the expected uses of the protocol in real applications. We then prove, assuming standard security notions for the underlying primitives that the protocol indeed meets the security notion we design. Our analysis sheds some light on the design of the protocol. Finally, we propose a strengthened protocol that meets a stronger notion of security where the adversary is allowed to adaptively corrupt TPMs.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124359868","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
扫码关注我们
求助内容：
应助结果提醒方式：