Smart cards are an example of advanced chip technology. They allow information transfer between the card holder and the system over secure networks, but they contain sensitive data related to both the card holder and the system, that has to be kept private and confidential. The objective of this work is to create an executable model of a smart card system, including the security protocols and transactions, and to examine the strengths and determine the weaknesses by running tests on the model. The security objectives have to be considered during the early stages of systems development and design, an executable model will give the designer the advantage of exploring the vulnerabilities early, and therefore enhancing the system security. The Unified Modeling Language (UML) 2.0 is used to model the smart card security protocol. The executable model is programmed in SystemC with the Transaction Level Modeling (TLM) extensions. The final model was used to examine the effectiveness of a number of authentication mechanisms with different probabilities of failure. In addition, a number of probable attacks on the current security protocol were modeled to examine the vulnerabilities. The executable model shows that the smart card system security protocols and transactions need further improvement to withstand different types of security attacks.
{"title":"Modelling Smart Card Security Protocols in SystemC TLM","authors":"A. Bushager, Mark Zwolinski","doi":"10.1109/EUC.2010.102","DOIUrl":"https://doi.org/10.1109/EUC.2010.102","url":null,"abstract":"Smart cards are an example of advanced chip technology. They allow information transfer between the card holder and the system over secure networks, but they contain sensitive data related to both the card holder and the system, that has to be kept private and confidential. The objective of this work is to create an executable model of a smart card system, including the security protocols and transactions, and to examine the strengths and determine the weaknesses by running tests on the model. The security objectives have to be considered during the early stages of systems development and design, an executable model will give the designer the advantage of exploring the vulnerabilities early, and therefore enhancing the system security. The Unified Modeling Language (UML) 2.0 is used to model the smart card security protocol. The executable model is programmed in SystemC with the Transaction Level Modeling (TLM) extensions. The final model was used to examine the effectiveness of a number of authentication mechanisms with different probabilities of failure. In addition, a number of probable attacks on the current security protocol were modeled to examine the vulnerabilities. The executable model shows that the smart card system security protocols and transactions need further improvement to withstand different types of security attacks.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129406152","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}
Within a mobile environment, communications may necessitate different security properties depending on the sensitivity of the data exchanged. A protocol such as HTTPS that uses the Secure Socket Layer/Transport Layer Security (SSL/TLS) may offer these properties, but it is known that SSL/TLS is high-energy consuming and the properties are provided as a block, which may have an important impact on the battery life of the mobile devices. In this paper, we propose to build security protocols from software security components offering each one a security property. By externalizing the security functionalities and adapting the security level to the users’ needs, we are providing a security management architecture adapted to mobile environments. A proof of concept is provided based on the XMPP protocol.
{"title":"Designing Security Protocols Adapted to the Constraints of Mobile Environments","authors":"M. Kamel, K. Boudaoud, S. Lequeux, M. Riveill","doi":"10.1109/EUC.2010.100","DOIUrl":"https://doi.org/10.1109/EUC.2010.100","url":null,"abstract":"Within a mobile environment, communications may necessitate different security properties depending on the sensitivity of the data exchanged. A protocol such as HTTPS that uses the Secure Socket Layer/Transport Layer Security (SSL/TLS) may offer these properties, but it is known that SSL/TLS is high-energy consuming and the properties are provided as a block, which may have an important impact on the battery life of the mobile devices. In this paper, we propose to build security protocols from software security components offering each one a security property. By externalizing the security functionalities and adapting the security level to the users’ needs, we are providing a security management architecture adapted to mobile environments. A proof of concept is provided based on the XMPP protocol.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133634103","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}
Radio Frequency Identification (RFID) technology has been widely used in supply chains to track and manage shipments. By tagging shipments with RFID tags, which can be remotely accessed by RFID readers, shipments can be identified and tracked in a supply chain. Security issues in RFID have been major concerns, since passive RFID tags have very weak computational power to support authentication. Sound authentication between tag and reader remains a challenging problem. In this paper, we provide a novel authentication scheme to protect tags from being tracked and identified by unauthorized readers and protect authorized readers against bogus tags. Our scheme can be applied to supply chain security. It also exhibits an additional feature that a supply chain can be dynamically updated.
{"title":"Efficient RFID Authentication Scheme for Supply Chain Applications","authors":"Fei Bi, Y. Mu","doi":"10.1109/EUC.2010.94","DOIUrl":"https://doi.org/10.1109/EUC.2010.94","url":null,"abstract":"Radio Frequency Identification (RFID) technology has been widely used in supply chains to track and manage shipments. By tagging shipments with RFID tags, which can be remotely accessed by RFID readers, shipments can be identified and tracked in a supply chain. Security issues in RFID have been major concerns, since passive RFID tags have very weak computational power to support authentication. Sound authentication between tag and reader remains a challenging problem. In this paper, we provide a novel authentication scheme to protect tags from being tracked and identified by unauthorized readers and protect authorized readers against bogus tags. Our scheme can be applied to supply chain security. It also exhibits an additional feature that a supply chain can be dynamically updated.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132832459","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}
Passive tags are widely used in many applications, for example, the supply chain, the food industry and ware-house management. In such applications, the location information of tags is very important. However, the uncertain proper-ties of Received Signal Strength Indicators (RSSI), various backscattering events on different power levels and the directivity of readers prevent traditional ranging-based approaches working well in passive RFID systems. In accordance with our observations during experiments, we create a novel approach to locate a specific tag among objects. Although absolute positions are difficult to obtain, we can estimate locations by building a relative relationship between tags. To reduce the effect of the above limitations, we propose a range-free approach named LocaToR to establish a relative neighborhood graph. We implement our method on a real passive system. Taking environmental factors into consideration, we look at two situations: a controlled chamber and a semi-open space. Experimental results show that our approach can obviously improve the accuracy of the localization system as well as save readers' energy.
{"title":"LocaToR: Locating Passive RFID Tags with the Relative Neighborhood Graph","authors":"Yiyang Zhao, S. Cheung, L. Ni","doi":"10.1109/EUC.2010.31","DOIUrl":"https://doi.org/10.1109/EUC.2010.31","url":null,"abstract":"Passive tags are widely used in many applications, for example, the supply chain, the food industry and ware-house management. In such applications, the location information of tags is very important. However, the uncertain proper-ties of Received Signal Strength Indicators (RSSI), various backscattering events on different power levels and the directivity of readers prevent traditional ranging-based approaches working well in passive RFID systems. In accordance with our observations during experiments, we create a novel approach to locate a specific tag among objects. Although absolute positions are difficult to obtain, we can estimate locations by building a relative relationship between tags. To reduce the effect of the above limitations, we propose a range-free approach named LocaToR to establish a relative neighborhood graph. We implement our method on a real passive system. Taking environmental factors into consideration, we look at two situations: a controlled chamber and a semi-open space. Experimental results show that our approach can obviously improve the accuracy of the localization system as well as save readers' energy.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133449936","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}
In this paper, following our recent developed concept of subnet model in mesh networks, we continue to investigate the characterizations of probabilistic fault tolerance for the mesh networks with faulty node. We consider two fault models: each node has deterministic or stochastic failure probability, then we study the fault tolerance of mesh networks based on our novel technique - subnet model. We derive lower bounds on the connectivity probability for mesh networks. Our study shows that mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough for multicomputer systems under deterministic or stochastic node failure probability. Comparing with deterministic node failure probability, stochastic model is close to realistic case.
{"title":"Probabilistic Analysis on Mesh Network Fault Tolerance: Deterministic vs. Stochastic","authors":"Gaocai Wang, Taoshen Li, Jianer Chen","doi":"10.1109/EUC.2010.115","DOIUrl":"https://doi.org/10.1109/EUC.2010.115","url":null,"abstract":"In this paper, following our recent developed concept of subnet model in mesh networks, we continue to investigate the characterizations of probabilistic fault tolerance for the mesh networks with faulty node. We consider two fault models: each node has deterministic or stochastic failure probability, then we study the fault tolerance of mesh networks based on our novel technique - subnet model. We derive lower bounds on the connectivity probability for mesh networks. Our study shows that mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough for multicomputer systems under deterministic or stochastic node failure probability. Comparing with deterministic node failure probability, stochastic model is close to realistic case.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125696576","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 main goal of Cluster-based sensor networks is to decrease system delay and reduce energy consumption. LEACH is a cluster-based protocol for micro sensor networks which achieves energy-efficient, scalable routing and fair media access for sensor nodes. However, the election of a malicious or compromised sensor node as the cluster head is one the most significant breaches in cluster-based wireless sensor networks. We propose a deterministic key management scheme, called DKS-LEACH, to secure LEACH protocol against malicious attacks. Our contributions are twofold. Firstly, we design and performed a theoretical evaluation of our security model which secures the setup and study phases of LEACH protocol. Secondly, using the TOSSIM simulator, we performed an evaluation of the power consumption of DKS-LEACH. The results indicate clear advantages of our approach in preventing the election of untrustworthy cluster head as well different kind of attacks from malicious sensor nodes.
{"title":"A Deterministic Key Management Scheme for Securing Cluster-Based Sensors Networks","authors":"Mandicou Ba, I. Niang, B. Gueye, Thomas Noël","doi":"10.1109/EUC.2010.70","DOIUrl":"https://doi.org/10.1109/EUC.2010.70","url":null,"abstract":"The main goal of Cluster-based sensor networks is to decrease system delay and reduce energy consumption. LEACH is a cluster-based protocol for micro sensor networks which achieves energy-efficient, scalable routing and fair media access for sensor nodes. However, the election of a malicious or compromised sensor node as the cluster head is one the most significant breaches in cluster-based wireless sensor networks. We propose a deterministic key management scheme, called DKS-LEACH, to secure LEACH protocol against malicious attacks. Our contributions are twofold. Firstly, we design and performed a theoretical evaluation of our security model which secures the setup and study phases of LEACH protocol. Secondly, using the TOSSIM simulator, we performed an evaluation of the power consumption of DKS-LEACH. The results indicate clear advantages of our approach in preventing the election of untrustworthy cluster head as well different kind of attacks from malicious sensor nodes.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123876623","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 scheduling frameworks provide ways for composing large and complex real-time systems from independent sub-systems. In this paper, we consider the imprecise reward-based periodic task model in a compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability analysis of mandatory parts is analyzed to meet the minimum requirement of tasks. In addition, we provide a scheduling algorithm for guaranteeing a certain amount of reward, which makes it feasible to compose multiple imprecise components efficiently.
{"title":"Hierarchical Real-Time Scheduling Framework for Imprecise Computations","authors":"G. M. Tchamgoue, K. Kim, Yong-Kee Jun, W. Lee","doi":"10.1109/EUC.2010.46","DOIUrl":"https://doi.org/10.1109/EUC.2010.46","url":null,"abstract":"Hierarchical scheduling frameworks provide ways for composing large and complex real-time systems from independent sub-systems. In this paper, we consider the imprecise reward-based periodic task model in a compositional scheduling framework. Thus, we introduce the imprecise periodic resource model to characterize the imprecise resource allocations, and the interface model to abstract the imprecise real-time requirements of the component. The schedulability analysis of mandatory parts is analyzed to meet the minimum requirement of tasks. In addition, we provide a scheduling algorithm for guaranteeing a certain amount of reward, which makes it feasible to compose multiple imprecise components efficiently.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122027874","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}
Cederquist et al. proposed an optimistic certified email protocol, which employs key chains to reduce the storage requirement of the trusted third party (TTP). We extend their protocol to satisfy the property of TTP transparency, using existing verifiably encrypted signature schemes. An implementation with the scheme based on bilinear pairing makes our extension one of the most efficient certified email protocols satisfying strong fairness, timeliness, and TTP transparency.
{"title":"Extending a Key-Chain Based Certified Email Protocol with Transparent TTP","authors":"Zhiyuan Liu, Jun Pang, Chenyi Zhang","doi":"10.1109/EUC.2010.101","DOIUrl":"https://doi.org/10.1109/EUC.2010.101","url":null,"abstract":"Cederquist et al. proposed an optimistic certified email protocol, which employs key chains to reduce the storage requirement of the trusted third party (TTP). We extend their protocol to satisfy the property of TTP transparency, using existing verifiably encrypted signature schemes. An implementation with the scheme based on bilinear pairing makes our extension one of the most efficient certified email protocols satisfying strong fairness, timeliness, and TTP transparency.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124868078","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}
R. Ramamoorthy, F. Richard, Yu, Helen Tang, P. Mason
Cooperative communication is considered a promising technique to increase channel capacity and improve reliability in wireless and cellular networks. However, it also raises a number of serious security issues as malicious nodes may impersonate and affect the integrity of the communication. In this paper, we propose a prevention-based security technique for cooperative communication taking into consideration authentication protocol, based on hash chains and Merkle trees, along with physical layer parameters which relate to the channel state information. Based on this consideration, we derive the closed-form secured throughput equations for proactive relay selection in cooperative communication that provides both hop-by-hop and end-to-end authentication and integrity protection. The simulation results show that our proposed solution, which provides authentication and protects data integrity, has a higher throughput performance when compared to existing schemes that do not consider security.
{"title":"Combined Authentication and Quality of Service in Cooperative Communication Networks","authors":"R. Ramamoorthy, F. Richard, Yu, Helen Tang, P. Mason","doi":"10.1109/EUC.2010.91","DOIUrl":"https://doi.org/10.1109/EUC.2010.91","url":null,"abstract":"Cooperative communication is considered a promising technique to increase channel capacity and improve reliability in wireless and cellular networks. However, it also raises a number of serious security issues as malicious nodes may impersonate and affect the integrity of the communication. In this paper, we propose a prevention-based security technique for cooperative communication taking into consideration authentication protocol, based on hash chains and Merkle trees, along with physical layer parameters which relate to the channel state information. Based on this consideration, we derive the closed-form secured throughput equations for proactive relay selection in cooperative communication that provides both hop-by-hop and end-to-end authentication and integrity protection. The simulation results show that our proposed solution, which provides authentication and protects data integrity, has a higher throughput performance when compared to existing schemes that do not consider security.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124686918","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}
Chungman Seo, Youngshin Han, Hae Young Lee, Jason J. Jung, Chilgee Lee
This paper presents a cloud computing architecture for discrete event system modeling and simulation. Simulators with models used in the cloud computing are considered as web services which are accessed via web browser. This environment supports the simulation of homogeneous or heterogeneous models without much knowledge of discrete event modeling and simulation.
{"title":"Implementation of Cloud Computing Environment for Discrete Event System Simulation using Service Oriented Architecture","authors":"Chungman Seo, Youngshin Han, Hae Young Lee, Jason J. Jung, Chilgee Lee","doi":"10.1109/EUC.2010.60","DOIUrl":"https://doi.org/10.1109/EUC.2010.60","url":null,"abstract":"This paper presents a cloud computing architecture for discrete event system modeling and simulation. Simulators with models used in the cloud computing are considered as web services which are accessed via web browser. This environment supports the simulation of homogeneous or heterogeneous models without much knowledge of discrete event modeling and simulation.","PeriodicalId":265175,"journal":{"name":"2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124975231","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
扫码关注我们
求助内容：
应助结果提醒方式：