This paper models the properties of the data object placement problem for fully associative cache. A fine placement can help to reduce cache misses. The discussed placement approach includes discovering temporal relationship in the data access trace, and packing data objects to memory blocks. The difficulty is the packing process must consider both the cache organization and irregular object sizes. Therefore, we create the graphic model of the fully associative cache. Our study finds the placement optimization problem for one-page cache is equivalent to the graph partition problem, which is a well-known NP-hard problem. It also shows there is no single universal optimal placement for all numbers of cache pages. This finding helps to derive heuristics for arranging quality data object placements that cause less cache misses for the fully associative cache. The experiment demonstrates the proposed heuristics efficiently reduce cache misses, even better than triple the cache memory size. Therefore, it helps embedded system to reduce the demand of cache memory.
{"title":"Object Placement for Fully Associative Cache","authors":"Chun-Chieh Lin, Chuen-Liang Chen","doi":"10.1109/EUC.2008.77","DOIUrl":"https://doi.org/10.1109/EUC.2008.77","url":null,"abstract":"This paper models the properties of the data object placement problem for fully associative cache. A fine placement can help to reduce cache misses. The discussed placement approach includes discovering temporal relationship in the data access trace, and packing data objects to memory blocks. The difficulty is the packing process must consider both the cache organization and irregular object sizes. Therefore, we create the graphic model of the fully associative cache. Our study finds the placement optimization problem for one-page cache is equivalent to the graph partition problem, which is a well-known NP-hard problem. It also shows there is no single universal optimal placement for all numbers of cache pages. This finding helps to derive heuristics for arranging quality data object placements that cause less cache misses for the fully associative cache. The experiment demonstrates the proposed heuristics efficiently reduce cache misses, even better than triple the cache memory size. Therefore, it helps embedded system to reduce the demand of cache memory.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122263693","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}
Signcryption is a cryptographic primitive that aims at providing confidentiality and authentication simultaneously. Recently in May 2008, a scheme for identity based threshold signcryption was proposed by Fagen Li and Yong Yu. They have proved the confidentiality of their scheme and have also claimed the unforgeability without providing satisfactory proof. In this paper, we show that in their signcryption scheme the secret key of the sender is exposed (total break) to the clerk during signcryption and hence insecure in the presence of malicious clerks. Further, we propose a corrected version of the scheme and formally prove its security under the existing security model for signcryption.
{"title":"Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme","authors":"S. S. D. Selvi, S. Vivek, C. Rangan, Neha Jain","doi":"10.1109/EUC.2008.187","DOIUrl":"https://doi.org/10.1109/EUC.2008.187","url":null,"abstract":"Signcryption is a cryptographic primitive that aims at providing confidentiality and authentication simultaneously. Recently in May 2008, a scheme for identity based threshold signcryption was proposed by Fagen Li and Yong Yu. They have proved the confidentiality of their scheme and have also claimed the unforgeability without providing satisfactory proof. In this paper, we show that in their signcryption scheme the secret key of the sender is exposed (total break) to the clerk during signcryption and hence insecure in the presence of malicious clerks. Further, we propose a corrected version of the scheme and formally prove its security under the existing security model for signcryption.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126030551","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}
Password authentication is a popular approach used for user authentication in pervasive computing environments due to its simplicity and convenience. To secure the transmission between the communicants, an authenticated shared key should be established between the communicants as the encryption key or the MAC key. Recently, Chang, Yang, and Hwang presented a password-based authenticated key agreement scheme that was claimed to be superior to similar schemes with respect to security and efficiency. In this paper, we show that their scheme is vulnerable to a denial-of-service attack. In addition, we demonstrate that their protected password change mechanism fails to provide backward secrecy. Finally, we propose an improved password-based authenticated key agreement scheme that can resist our described denial-of-service attack and can provide backward secrecy.
{"title":"An Improved Password-Based Authenticated Key Agreement Scheme for Pervasive Applications","authors":"M. Tsaur, W. Ku, Hao-Rung Chung","doi":"10.1109/EUC.2008.17","DOIUrl":"https://doi.org/10.1109/EUC.2008.17","url":null,"abstract":"Password authentication is a popular approach used for user authentication in pervasive computing environments due to its simplicity and convenience. To secure the transmission between the communicants, an authenticated shared key should be established between the communicants as the encryption key or the MAC key. Recently, Chang, Yang, and Hwang presented a password-based authenticated key agreement scheme that was claimed to be superior to similar schemes with respect to security and efficiency. In this paper, we show that their scheme is vulnerable to a denial-of-service attack. In addition, we demonstrate that their protected password change mechanism fails to provide backward secrecy. Finally, we propose an improved password-based authenticated key agreement scheme that can resist our described denial-of-service attack and can provide backward secrecy.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121089038","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}
This paper presents a study on how to increase the BitTorrent Networkpsilas performance via deploying Helpers by modeling, simulating and analyzing. We first define some high-bandwidth, high-connection and controllable super nodes as Helpers, and then try to find the best way to deploy them. Unlike other researchers, we focus on combining the advantages of both multi-server systems and BitTorrent Systems. Our main findings includes: (1) Deploying Helpers into BitTorrent Systems can distinctly enhance the system performance until the overall uploading bandwidth is no longer the constraint condition. (2) After deploying Helpers, the system can present resistance against selfish peers. (3) We can dynamically change the content of Helpers to serve the ever-changing hot torrents and make it only serve charged peers or local peers from economic angle.
{"title":"Improving BitTorrent Network's Performance via Deploying Helpers","authors":"Ke Xu, Yahui Yang, Tao Chen","doi":"10.1109/EUC.2008.96","DOIUrl":"https://doi.org/10.1109/EUC.2008.96","url":null,"abstract":"This paper presents a study on how to increase the BitTorrent Networkpsilas performance via deploying Helpers by modeling, simulating and analyzing. We first define some high-bandwidth, high-connection and controllable super nodes as Helpers, and then try to find the best way to deploy them. Unlike other researchers, we focus on combining the advantages of both multi-server systems and BitTorrent Systems. Our main findings includes: (1) Deploying Helpers into BitTorrent Systems can distinctly enhance the system performance until the overall uploading bandwidth is no longer the constraint condition. (2) After deploying Helpers, the system can present resistance against selfish peers. (3) We can dynamically change the content of Helpers to serve the ever-changing hot torrents and make it only serve charged peers or local peers from economic angle.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124991607","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}
Ehsan Mousavi Khaneghah, S. L. Mirtaheri, M. Sharifi
Scientific applications like weather forecasting require high performance and fast response time. But this ideal requirement has always been constrained by peculiarities of underlying platforms specially distributed platforms. One such constraint is the efficiency of communication between geographically dispersed and physically distributed processes running these applications, that is the efficiency of inter process communication (IPC) mechanisms. This paper provides hard evidence that an operating system kernel-level implementation of IPC on multi-computers reduces the execution time of a weather forecasting model by nearly half on average compared to when the IPC mechanism is implemented at library level. A well known non-hydrostatic version of the Penn state/NCAR mesoscale model, called MM5, is executed on a networked cluster. The performance of MM5 is measured with two distributed implementations of IPC, a kernel-level implementation called DIPC2006 and a renowned library level implementation called MPI. It is both shown how and argued why the performance of MM5 on a DIPC2006 configured cluster is by far better than its performance on an MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientist may look for more efficient distributed implementations of IPC to run their simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC for scientists.
{"title":"Evaluating the Effect of Inter Process Communication Efficiency on High Performance Distributed Scientific Computing","authors":"Ehsan Mousavi Khaneghah, S. L. Mirtaheri, M. Sharifi","doi":"10.1109/EUC.2008.11","DOIUrl":"https://doi.org/10.1109/EUC.2008.11","url":null,"abstract":"Scientific applications like weather forecasting require high performance and fast response time. But this ideal requirement has always been constrained by peculiarities of underlying platforms specially distributed platforms. One such constraint is the efficiency of communication between geographically dispersed and physically distributed processes running these applications, that is the efficiency of inter process communication (IPC) mechanisms. This paper provides hard evidence that an operating system kernel-level implementation of IPC on multi-computers reduces the execution time of a weather forecasting model by nearly half on average compared to when the IPC mechanism is implemented at library level. A well known non-hydrostatic version of the Penn state/NCAR mesoscale model, called MM5, is executed on a networked cluster. The performance of MM5 is measured with two distributed implementations of IPC, a kernel-level implementation called DIPC2006 and a renowned library level implementation called MPI. It is both shown how and argued why the performance of MM5 on a DIPC2006 configured cluster is by far better than its performance on an MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientist may look for more efficient distributed implementations of IPC to run their simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC for scientists.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"1 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128067099","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 data storaged in multi-purpose asynchronous wireless sensor network should be encrypted to protect against physical attacks. Meanwhile,in multi-purpose wireless sensor network,an access control mechanism is needed to differentiate the encrypted data which belong to different applications. However, as the author knows, by far, no secure scheme solving this problem has been proposed. In this paper, we introduce an attribute-based encryption scheme to address the encrypted data storage and access control issues, through experiment and analysis we prove that the ABE scheme could be applied to multi-purpose asynchronous WSN.
{"title":"Research on the Encrypted Data Access Control of Multi-purpose Asynchronous WSN","authors":"Qian Sun, Shanqing Guo, Qiuliang Xu","doi":"10.1109/EUC.2008.37","DOIUrl":"https://doi.org/10.1109/EUC.2008.37","url":null,"abstract":"The data storaged in multi-purpose asynchronous wireless sensor network should be encrypted to protect against physical attacks. Meanwhile,in multi-purpose wireless sensor network,an access control mechanism is needed to differentiate the encrypted data which belong to different applications. However, as the author knows, by far, no secure scheme solving this problem has been proposed. In this paper, we introduce an attribute-based encryption scheme to address the encrypted data storage and access control issues, through experiment and analysis we prove that the ABE scheme could be applied to multi-purpose asynchronous WSN.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133473554","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}
We envisage future context-aware applications will dynamically adapt their behaviors to various context data from sources in wide-area networks, such as the Internet. Facing the changing context and the sheer number of context sources, a data management system that supports effective source organization and efficient data lookup becomes crucial to the easy development of context-aware applications. In this paper, we propose the design of a new context data management system that is equipped with query processing capabilities. We encapsulate the context sources into physical spaces belonging to different context spaces and organize them as peers in semantic overlay networks. Initial evaluation results of an experimental system prototype demonstrate the effectiveness of our design.
{"title":"Data Management for Context-Aware Computing","authors":"Wenwei Xue, H. Pung, W. Ng, T. Gu","doi":"10.1109/EUC.2008.27","DOIUrl":"https://doi.org/10.1109/EUC.2008.27","url":null,"abstract":"We envisage future context-aware applications will dynamically adapt their behaviors to various context data from sources in wide-area networks, such as the Internet. Facing the changing context and the sheer number of context sources, a data management system that supports effective source organization and efficient data lookup becomes crucial to the easy development of context-aware applications. In this paper, we propose the design of a new context data management system that is equipped with query processing capabilities. We encapsulate the context sources into physical spaces belonging to different context spaces and organize them as peers in semantic overlay networks. Initial evaluation results of an experimental system prototype demonstrate the effectiveness of our design.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133378292","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 structured P2P networks, the heterogeneity of node capacity, the skewness in query pattern and the greedy routing strategy could result in the load imbalance problem. However, existing load balancing algorithms for structured P2P networks mainly focused on handling the heterogeneity among nodes and the skewed workload. To deal with the load imbalance issue caused by the greedy routing strategy, we propose a routing load dispersion (RLD) mechanism for structured P2P networks in this paper. The mechanism manages to disperse the routing load of queries among nodes so that more nodes have a chance to dedicate their capacities for routing. By dispersing the routing load, the RLD mechanism is able to make use of the free capacity in the network and avoid the congestion effectively. We also evaluate the RLD mechanism by extensive simulations and the simulation results demonstrate the effectiveness of RLD mechanism on congestion control under different workload and churn levels.
{"title":"The Effect of Routing-Load Dispersion on Congestion Control in Structured P2P Networks","authors":"Guowei Huang, Zhi Chen, Ying Wu, G. Wu","doi":"10.1109/EUC.2008.131","DOIUrl":"https://doi.org/10.1109/EUC.2008.131","url":null,"abstract":"In structured P2P networks, the heterogeneity of node capacity, the skewness in query pattern and the greedy routing strategy could result in the load imbalance problem. However, existing load balancing algorithms for structured P2P networks mainly focused on handling the heterogeneity among nodes and the skewed workload. To deal with the load imbalance issue caused by the greedy routing strategy, we propose a routing load dispersion (RLD) mechanism for structured P2P networks in this paper. The mechanism manages to disperse the routing load of queries among nodes so that more nodes have a chance to dedicate their capacities for routing. By dispersing the routing load, the RLD mechanism is able to make use of the free capacity in the network and avoid the congestion effectively. We also evaluate the RLD mechanism by extensive simulations and the simulation results demonstrate the effectiveness of RLD mechanism on congestion control under different workload and churn levels.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114803816","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. Azarderakhsh, A. Reyhani-Masoleh, Zine-Eddine Abid
Key management is a major challenge to achieve security in wireless sensor networks. In most of the schemes presented for key management in wireless sensor networks, it is assumed that the sensor nodes have the same capability. The recent research has shown that the survivability of the network can be improved if sensor nodes are grouped in clusters in which a powerful cluster head assigned. However, to gain advantages of clustering in order to find an efficient key management scheme needs more research. In this paper, we investigate the key management in cluster-based wireless sensor networks using both private and public key cryptography. Our goal is to introduce a platform in which public key cryptography is used to establish a secure link between sensor nodes and gateways. Instead of pre-loading a large number of keys into the sensor nodes, each node requests a session key from the gateway to establish a secure link with its neighbors after clustering phase. The security analysis and performance evaluation show that the proposed scheme has significant saving in storage space, transmission overhead, and perfect resilience against node capture.
{"title":"A Key Management Scheme for Cluster Based Wireless Sensor Networks","authors":"R. Azarderakhsh, A. Reyhani-Masoleh, Zine-Eddine Abid","doi":"10.1109/EUC.2008.176","DOIUrl":"https://doi.org/10.1109/EUC.2008.176","url":null,"abstract":"Key management is a major challenge to achieve security in wireless sensor networks. In most of the schemes presented for key management in wireless sensor networks, it is assumed that the sensor nodes have the same capability. The recent research has shown that the survivability of the network can be improved if sensor nodes are grouped in clusters in which a powerful cluster head assigned. However, to gain advantages of clustering in order to find an efficient key management scheme needs more research. In this paper, we investigate the key management in cluster-based wireless sensor networks using both private and public key cryptography. Our goal is to introduce a platform in which public key cryptography is used to establish a secure link between sensor nodes and gateways. Instead of pre-loading a large number of keys into the sensor nodes, each node requests a session key from the gateway to establish a secure link with its neighbors after clustering phase. The security analysis and performance evaluation show that the proposed scheme has significant saving in storage space, transmission overhead, and perfect resilience against node capture.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116092049","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, we present attacks on two improved key distribution protocol with perfect reparability that were presented at ICON 2000. First, we show that the two ldquoattacksrdquo described in their paper are trivial and do not count as attacks at all since they are well-known attacks that apply to any security system. Further, we describe several attacks on both improved protocols, and show that an illegitimate attacker could easily impersonate legitimate parties and have other parties think they are sharing keys with the impersonated party when in fact that party is not present at all.
{"title":"Attacks on Improved Key Distribution Protocols with Perfect Reparability","authors":"R. Phan, B. Goi","doi":"10.1109/EUC.2008.161","DOIUrl":"https://doi.org/10.1109/EUC.2008.161","url":null,"abstract":"In this paper, we present attacks on two improved key distribution protocol with perfect reparability that were presented at ICON 2000. First, we show that the two ldquoattacksrdquo described in their paper are trivial and do not count as attacks at all since they are well-known attacks that apply to any security system. Further, we describe several attacks on both improved protocols, and show that an illegitimate attacker could easily impersonate legitimate parties and have other parties think they are sharing keys with the impersonated party when in fact that party is not present at all.","PeriodicalId":430277,"journal":{"name":"2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing","volume":"17 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123625772","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
扫码关注我们
求助内容：
应助结果提醒方式：