发布求助
文献互助 智能选刊 最新文献

2011 Third International Conference on Communications and Mobile Computing最新文献

筛选
英文 中文
Efficient Taint Analysis with Taint Behavior Summary 有效的污点分析与污点行为总结
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.76
Ruoyu Zhang, Shan Huang, Zhengwei Qi
{"title":"Efficient Taint Analysis with Taint Behavior Summary","authors":"Ruoyu Zhang, Shan Huang, Zhengwei Qi","doi":"10.1109/CMC.2011.76","DOIUrl":"https://doi.org/10.1109/CMC.2011.76","url":null,"abstract":"Software security has drawn much attention recently. As an effective approach to detect software vulnerabilities and improve software security, dynamic taint analysis has been frequently researched in the last few years. In this paper, we implement a dynamic taint tracking system LTTS. In order to address the efficiency problem which exists in many of the current taint tracking systems, we also propose a taint behavior summary mechanism to optimize the system. According to our experiments, LTTS has achieved relative high efficiency compared to the existing techniques.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132615213","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}
引用次数: 3
LiChord: A Linear Code Based Structured P2P for Approximate Match 一种基于线性代码的结构化P2P近似匹配方法
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.31
Shuling Wang, Shoubao Yang, Liangmin Guo
{"title":"LiChord: A Linear Code Based Structured P2P for Approximate Match","authors":"Shuling Wang, Shoubao Yang, Liangmin Guo","doi":"10.1109/CMC.2011.31","DOIUrl":"https://doi.org/10.1109/CMC.2011.31","url":null,"abstract":"A fundamental problem that confronts DHT-based structured P2P applications is the confine to exact match. By observing the blind objects distribution and single key-based locating mechanism in structured P2P, approximate match is a challenge to be resolved. LiChord, a linear code based structured P2P, is proposed to deal with the problem. Theories of linear code are explored in LiChord's mapping process. The mapping mechanism makes approximate match achievable by mapping resemble objects to the same node Results of theoretical discussion and evaluations, the mapping mechanism preserves the features of scalability and load balancing and enhances flexibility of query.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122092068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Trustworthy Service Selection Scheme Based on Attribute Signature 基于属性签名的可信服务选择方案
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.87
Li Liu, Zhi-gang Chen
{"title":"Trustworthy Service Selection Scheme Based on Attribute Signature","authors":"Li Liu, Zhi-gang Chen","doi":"10.1109/CMC.2011.87","DOIUrl":"https://doi.org/10.1109/CMC.2011.87","url":null,"abstract":"A fundamental challenge in service-oriented computing (SOC) is to select trustworthy Service. Existing approaches for service selection fail to capture the dynamic trust relationships between stranger services. Automatic trust negotiation (ATN)is a new approach to establish trust between strangers on the internet through the bilateral exchange of digital credentials. When a credential contains sensitive information, its disclosure is governed by an access control policy that specifies credentials that must be received before the sensitive credential is disclosed. The traditional ATN is inefficient in negotiation and strategic cycle may appear. In this paper we proposed a service selection scheme based on attribute signature (WSSABS). WSSABS, based on the Decisional Bilinear Diffie-Hellman, provide administratively scalable alternative to attribute-based authorization methods and provide fine-grained access control for Web service. Attribute Signature with attribute value commit methods are used to prevent collusion and forge. Finally, we show a brief security proof about the scheme.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129096618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Accurate Wireless Location and Tracking Technique for Indoor UWB Non-linear/Non-Gaussian Systems 室内超宽带非线性/非高斯系统的精确无线定位与跟踪技术
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.38
Fucheng Cao, Dan Wang
{"title":"Accurate Wireless Location and Tracking Technique for Indoor UWB Non-linear/Non-Gaussian Systems","authors":"Fucheng Cao, Dan Wang","doi":"10.1109/CMC.2011.38","DOIUrl":"https://doi.org/10.1109/CMC.2011.38","url":null,"abstract":"This paper deals with the joint TOA/DOA (time of arrival/direction of arrival) estimation and tracking of UWB source. The TOA and DOA of the moving target were estimated with the low complexity array processing, then, a particle filter was presented to accurately track the target's real-time location and velocity. This tracking method is effective to the in door UWB non-Linear/non-Gaussian systems and the performance is greatly superior to the standard extended Kalman filter.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117015826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Temporal Ordered Image Encryption 时序图像加密
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.71
Xiaoyi Zhou, Jixin Ma, M. Petridis, W.-C. Du
{"title":"Temporal Ordered Image Encryption","authors":"Xiaoyi Zhou, Jixin Ma, M. Petridis, W.-C. Du","doi":"10.1109/CMC.2011.71","DOIUrl":"https://doi.org/10.1109/CMC.2011.71","url":null,"abstract":"The existing image encryption algorithms encrypt images independently, which means the probability of an eavesdropper working out one image stays the same under the same circumstances (same bits of keys and the same algorithm, for example). However, in real-life applications such as communication systems, on one hand, sequences of images may need to be sent with various security demands, and on the other hand, the temporal order of sequences of images may be changed. This paper proposes a novel idea to integrate the notion of temporal order with cryptosystems. Experimental results show that satisfactory security performance is achieved when the order for the sequence of images is changed.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115257855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
The Power of Refresh: A Novel Mechanism for Securing Low Entropy PII 刷新的力量:一种保护低熵PII的新机制
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.32
Yuqian Li, Yang Liu, Zhifang Liu, Jiwei Huang, Zhen Chen
{"title":"The Power of Refresh: A Novel Mechanism for Securing Low Entropy PII","authors":"Yuqian Li, Yang Liu, Zhifang Liu, Jiwei Huang, Zhen Chen","doi":"10.1109/CMC.2011.32","DOIUrl":"https://doi.org/10.1109/CMC.2011.32","url":null,"abstract":"Deterministic encryption for low entropy personally identifiable information(PII) is vulnerable to dictionary attack. It is particularly so because of an expedient method to enumerate possible PII'splain text instead of all possible keys. Deterministic encryption, however, is indispensable in the generation of hash or index of PII. This paper presents a novel mechanism to frustrate dictionary attacks by refreshing the encryption in an external \"blackbox\". The \"blackbox\" has a private key inside and even the person who designed and manufactured it could not track or reveal its input and output without knowing the private key. The major part of this paper is about the analysis of this novel mechanism. The use of conditional entropy in this paper both measures the power to defend the attack and proves the value and feasibility of this novel mechanism. A lower bound for conditional entropy against a computationally-unbounded adversary is guaranteed. The essential meaning of the lower bound is also given based on min-entropy. By the proof, this mechanism can provide very reliable security for PII in online social networks (OSN) and keep efficiency and functionality at the same time.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115667613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Energy-Efficient Spectrum Leasing in Cognitive Relay Networks 认知中继网络中的节能频谱租赁
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.123
Q. Jin, Haixia Zhang, D. Yuan, Jiali Xu, Chengxiang Wang
{"title":"Energy-Efficient Spectrum Leasing in Cognitive Relay Networks","authors":"Q. Jin, Haixia Zhang, D. Yuan, Jiali Xu, Chengxiang Wang","doi":"10.1109/CMC.2011.123","DOIUrl":"https://doi.org/10.1109/CMC.2011.123","url":null,"abstract":"In this paper, we propose an energy-efficient resource allocation algorithm to minimize the total average transmission power of secondary users (SUs) in cognitive relay networks. Each SU in cognitive relay networks can choose direct transmission or cooperative transmission with the help of relay nodes (RNs). The primary users (PUs) may lease the licensed spectrum for a fraction of time to SUs for some remuneration. So the SUs adopt time-division multiple-access (TDMA) to access the licensed spectrum. For energy efficiency, we jointly consider the time slot scheduling and transmission strategy selection (i.e. direct transmission or cooperative transmission) problem. Numerical results indicate that the transmission power consumption indeed decreases due to the cooperative diversity.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"50 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123697836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
TasteBuddy-based Version Selection Strategy for BitTorrent Users against Content Pollution 基于taste - buddy的bt用户内容污染版本选择策略
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.116
Lingyun Ruan, An'an Luo, Zhen Chen
{"title":"TasteBuddy-based Version Selection Strategy for BitTorrent Users against Content Pollution","authors":"Lingyun Ruan, An'an Luo, Zhen Chen","doi":"10.1109/CMC.2011.116","DOIUrl":"https://doi.org/10.1109/CMC.2011.116","url":null,"abstract":"Content pollution problem has attracted broad attention due to its impacts on P2P networks' efficiency and availability. Especially for Bit Torrent users, unmanageable versions of BT torrents and chunk-based file sharing mode make it more difficult to avoid pollution dissemination. In our paper, we propose a smart version selection strategy based on taste buddies to help users select high-quality versions and keep away from polluted ones. Performance evaluation based on real data shows that our approach effectively lowers the probability of selecting polluted versions compared with other strategies.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128369483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Scheduling Algorithm for Barrier Coverage in Wireless Sensor Networks 无线传感器网络中屏障覆盖的分布式调度算法
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.14
Dongsong Ban, Quanyou Feng, Gang Han, Wei Yang, Jie Jiang, Wenhua Dou
{"title":"Distributed Scheduling Algorithm for Barrier Coverage in Wireless Sensor Networks","authors":"Dongsong Ban, Quanyou Feng, Gang Han, Wei Yang, Jie Jiang, Wenhua Dou","doi":"10.1109/CMC.2011.14","DOIUrl":"https://doi.org/10.1109/CMC.2011.14","url":null,"abstract":"Barrier coverage is a hot issue in wireless sensor networks for its various applications, such as border surveillance and intrusion detection. In wireless sensor networks, it is a very important problem that how to prolong the network life time. In this paper, we focus on the problem that how to prolong the network lifetime for barrier coverage application. Firstly, the surveillance region is divided into small vertical segment, which is called as slice. Based on this discretization, we formulate the problem that how to schedule sensors to achieve barrier coverage with the maximized network lifetime as BCSP (Barrier Coverage Scheduling Problem). Secondly, a distributed scheduling algorithm DBCS (Distributed Barrier Coverage Scheduling) is proposed. Finally, comprehensive simulations demonstrate that the proposed algorithm prolongs network lifetime effectively, DBCS is applicable for large scale sensor networks.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129967327","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}
引用次数: 18
Multipath Channel Estimation Using Fast Least-Squares Algorithm 基于快速最小二乘算法的多径信道估计
2011 Third International Conference on Communications and Mobile Computing Pub Date : 2011-04-18 DOI: 10.1109/CMC.2011.12
Xue Jiang, W. Zeng, En Cheng, C. Lin
{"title":"Multipath Channel Estimation Using Fast Least-Squares Algorithm","authors":"Xue Jiang, W. Zeng, En Cheng, C. Lin","doi":"10.1109/CMC.2011.12","DOIUrl":"https://doi.org/10.1109/CMC.2011.12","url":null,"abstract":"Least-squares (LS) method is widely used for multipath channel estimation. The conventional algorithms for computing the LS solution involve matrix inversion, which is computationally demanding. In this paper, by exploiting the special structure of Toeplitz matrices, a fast and memory-saving numerical algorithm is developed for calculating the LS estimate of a multipath channel. The proposed fast channel estimation algorithm is easy to implement and has a low computational complexity of $O(Nlog N)$ with $N$ the received signal length. Simulation results are provided to verify the performance and computational efficiency of the proposed fast LS algorithm.","PeriodicalId":263741,"journal":{"name":"2011 Third International Conference on Communications and Mobile Computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125988463","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}
引用次数: 9
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书