2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications最新文献

筛选
英文 中文
On Energy Efficient Scheduling and Load Distribution Based on Renewable Energy for Wireless Mesh Network in Disaster Area 基于可再生能源的灾区无线网状网络节能调度与负荷分配研究
Meng Li, Hiroki Nishiyama, Y. Owada, K. Hamaguchi
{"title":"On Energy Efficient Scheduling and Load Distribution Based on Renewable Energy for Wireless Mesh Network in Disaster Area","authors":"Meng Li, Hiroki Nishiyama, Y. Owada, K. Hamaguchi","doi":"10.1109/TrustCom.2014.59","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.59","url":null,"abstract":"In recent years, disasters happened in many places, and resulted in power shortage and communication interruption. The Wireless Mesh Networks (WMNs) constituted by Renewable Energy-enabled Base Station (REBS) is regarded as a powerful solution in post-disaster recovery, for its energy harvesting ability and the ready-made facilities. However, this solution needs to address several challenges such as unstable power supply, limited bandwidth and long-term optimization. In this paper, we focus on the issue of energy efficiency when realizing the maximal network throughput in a period of time, by the combination of energy usage and network data distribution. To this end, we firstly analyze the unique features of REBS and its associated network in disaster area. Then a throughput-maximization problem is proposed in order to figure out the maximal network throughput. Based on the maximal value, we count out the most energy-efficiency result while guaranteeing the maximal network throughput. We formulate the proposed model into a two-stage Mixed-Integer Linear Programming (MILP) problem and solve it by branch-and-bound algorithm. Simulation results demonstrate our considered two-stage energy efficient scheme strikes a balance between network throughput and its associated energy consumption, and outperforms the existing schemes.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117170554","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}
引用次数: 4
SARAH - Statistical Analysis for Resource Allocation in Hadoop SARAH——Hadoop中资源分配的统计分析
B. Martin
{"title":"SARAH - Statistical Analysis for Resource Allocation in Hadoop","authors":"B. Martin","doi":"10.1109/TrustCom.2014.102","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.102","url":null,"abstract":"Improving the performance of big data applications requires understanding the size and distribution of the input and intermediate data sets. Obtaining this understanding and then translating it into resource settings is challenging. SARAH provides a set of tools that analyze input and intermediate data sets and recommend configuration settings and performance optimizations. Statistics generated by SARAH are persistently stored, incrementally updated and operate across the several processing frameworks available in Apache Hadoop. In this paper we present the SARAH tool set, describe several Hadoop use cases for utilizing statistics and illustrate the effectiveness of utilizing statistics for balancing reduce workload on Map-Reduce jobs on web server log file data.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120880099","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}
引用次数: 4
A Novel Feature Selection Approach for Intrusion Detection Data Classification 一种新的入侵检测数据分类特征选择方法
Mohammed A. Ambusaidi, Xiangjian He, Zhiyuan Tan, P. Nanda, L. Lu, Upasana T. Nagar
{"title":"A Novel Feature Selection Approach for Intrusion Detection Data Classification","authors":"Mohammed A. Ambusaidi, Xiangjian He, Zhiyuan Tan, P. Nanda, L. Lu, Upasana T. Nagar","doi":"10.1109/TrustCom.2014.15","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.15","url":null,"abstract":"Intrusion Detection Systems (IDSs) play a significant role in monitoring and analyzing daily activities occurring in computer systems to detect occurrences of security threats. However, the routinely produced analytical data from computer networks are usually of very huge in size. This creates a major challenge to IDSs, which need to examine all features in the data to identify intrusive patterns. The objective of this study is to analyze and select the more discriminate input features for building computationally efficient and effective schemes for an IDS. For this, a hybrid feature selection algorithm in combination with wrapper and filter selection processes is designed in this paper. Two main phases are involved in this algorithm. The upper phase conducts a preliminary search for an optimal subset of features, in which the mutual information between the input features and the output class serves as a determinant criterion. The selected set of features from the previous phase is further refined in the lower phase in a wrapper manner, in which the Least Square Support Vector Machine (LSSVM) is used to guide the selection process and retain optimized set of features. The efficiency and effectiveness of our approach is demonstrated through building an IDS and a fair comparison with other stateof-the-art detection approaches. The experimental results show that our hybrid model is promising in detection compared to the previously reported results.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418382","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}
引用次数: 33
Network Traffic Anomaly Detection Using Adaptive Density-Based Fuzzy Clustering 基于自适应密度的模糊聚类网络流量异常检测
Duo Liu, Chung-Horng Lung, N. Seddigh, B. Nandy
{"title":"Network Traffic Anomaly Detection Using Adaptive Density-Based Fuzzy Clustering","authors":"Duo Liu, Chung-Horng Lung, N. Seddigh, B. Nandy","doi":"10.1109/TrustCom.2014.109","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.109","url":null,"abstract":"Fuzzy C-means (FCM) clustering has been used to distinguish communication network traffic outliers based on the uncommon statistical characteristics of network traffic data. The raditional FCM does not leverage spatial information in its analysis, which leads to inaccuracies in certain instances. To address this challenge, this paper proposes an adaptive fuzzy clustering technique based on existing possibilistic clustering algorithms. The proposed technique simultaneously considers distance, density, and the trend of density change of data instances in the membership degree calculation. Specifically the membership degree is quickly updated when the distance or density is beyond the pre-defined threshold, or density change does not match the data distribution. In contrast, the traditional FCM updates its membership degree only based on the distance between data points and the cluster centroid. The proposed approach enables the clustering to reflect the inherent diversity nature of communication network traffic. Further, an adaptive threshold is introduced to speed up the iterative clustering process. The proposed algorithm has been evaluated via experiments using traffic from a real network. The results indicate that the adaptive fuzzy clustering reduces false negatives while improves true positive results.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127056552","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}
引用次数: 8
Temporal Access Control with User Revocation for Cloud Data 云数据的用户撤销临时访问控制
N. Balani, S. Ruj
{"title":"Temporal Access Control with User Revocation for Cloud Data","authors":"N. Balani, S. Ruj","doi":"10.1109/TrustCom.2014.45","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.45","url":null,"abstract":"We propose a temporal access control scheme to protect and selectively access data in clouds. In many applications like healthcare, online tests, social networks, data should be accessed within a certain period of time. Although access control has been widely studied, temporal access control has not received attention. Ours is the first scheme on temporal access control with user revocation. Our scheme encrypts and stores data in clouds in such a way that only authorized users are able to decrypt it within a specified time period. We use a new variant of attribute-based encryption in order to achieve our objective. To reduce computational load during decryption, we partially outsource the decryption to a proxy server, who can gain no information about the data. We analytically show that our scheme has comparable computation and communication costs, but also supports revocation, which was not present in previous schemes.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116272246","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}
引用次数: 14
A Robust Authentication Scheme for Observing Resources in the Internet of Things Environment 一种物联网环境下观察资源的鲁棒认证方案
M. Jan, P. Nanda, Xiangjian He, Zhiyuan Tan, R. Liu
{"title":"A Robust Authentication Scheme for Observing Resources in the Internet of Things Environment","authors":"M. Jan, P. Nanda, Xiangjian He, Zhiyuan Tan, R. Liu","doi":"10.1109/TrustCom.2014.31","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.31","url":null,"abstract":"The Internet of Things is a vision that broadens the scope of the internet by incorporating physical objects to identify themselves to the participating entities. This innovative concept enables a physical device to represent itself in the digital world. There are a lot of speculations and future forecasts about the Internet of Things devices. However, most of them are vendor specific and lack a unified standard, which renders their seamless integration and interoperable operations. Another major concern is the lack of security features in these devices and their corresponding products. Most of them are resource-starved and unable to support computationally complex and resource consuming secure algorithms. In this paper, we have proposed a lightweight mutual authentication scheme which validates the identities of the participating devices before engaging them in communication for the resource observation. Our scheme incurs less connection overhead and provides a robust defence solution to combat various types of attacks.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131236298","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}
引用次数: 107
Visual Similarity Based Anti-phishing with the Combination of Local and Global Features 局部特征与全局特征相结合的基于视觉相似性的反网络钓鱼
Yu Zhou, Yongzheng Zhang, Jun Xiao, Yipeng Wang, Weiyao Lin
{"title":"Visual Similarity Based Anti-phishing with the Combination of Local and Global Features","authors":"Yu Zhou, Yongzheng Zhang, Jun Xiao, Yipeng Wang, Weiyao Lin","doi":"10.1109/TrustCom.2014.28","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.28","url":null,"abstract":"Phishing uses a fake Web page to steal personal sensitive information such as credit card numbers and passwords. Generally, the fake Web page is visually similar to the legitimate target Web page. The phishers can obtain financial benefits through these information. Anti-phishing is very important for a variety of applications such as phishing attacks, online transaction security, and user privacy protection. In this paper, we propose a novel and effective visual similarity based phishing detection approach that compares the snapshot image pair of the suspected Web page and the protected Web page. The proposed approach is based on the key insight that both the local and the global features of the Web page image can be used to represent the visual characteristics of the Web page together. This approach is purely on the image level, and thus can effectively deal with the non-text phishing tricks including images or Flashes objects in the HTML contents. For the local feature, the existence of the target logo is detected. For the global feature, the similarity of the visible part of the Web page is considered. We implemented and evaluated the proposed approach on a large scale dataset consisting of 2,129 real world phishing Web pages and 1,367 irrelevant legitimate Web pages. The experimental results show that the proposed approach can achieve over 90.00% true positive rate and 97.00% true negative rate. Our approach has been applied in the anti-phishing project of a major Internet Service Provider and gives a periodical reports to the potential users.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131899353","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}
引用次数: 27
Secure and Privacy-Friendly Public Key Generation and Certification 安全和隐私友好的公钥生成和认证
Fábio Borges, L. Martucci, Filipe Beato, M. Mühlhäuser
{"title":"Secure and Privacy-Friendly Public Key Generation and Certification","authors":"Fábio Borges, L. Martucci, Filipe Beato, M. Mühlhäuser","doi":"10.1109/TrustCom.2014.19","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.19","url":null,"abstract":"Digital societies increasingly rely on secure communication between parties. Certificate enrollment protocols are used by certificate authorities to issue public key certificates to clients. Key agreement protocols, such as Diffie-Hellman, are used to compute secret keys, using public keys as input, for establishing secure communication channels. Whenever the keys are generated by clients, the bootstrap process requires either (a) an out-of-band verification for certification of keys when those are generated by the clients themselves, or (b) a trusted server to generate both the public and secret parameters. This paper presents a novel constrained key agreement protocol, built upon a constrained Diffie-Hellman, which is used to generate a secure public-private key pair, and to set up a certification environment without disclosing the private keys. In this way, the servers can guarantee that the generated key parameters are safe, and the clients do not disclose any secret information to the servers.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132116891","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
A High Speed Lossless Compression Algorithm Based on CPU and GPU Hybrid Platform 基于CPU和GPU混合平台的高速无损压缩算法
Bin Zhou, Hai Jin, Ran Zheng
{"title":"A High Speed Lossless Compression Algorithm Based on CPU and GPU Hybrid Platform","authors":"Bin Zhou, Hai Jin, Ran Zheng","doi":"10.1109/TrustCom.2014.90","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.90","url":null,"abstract":"With the development of modern computer technology, the growth of purchase funds for storage equipment is far behind the growth of data. How to effectively use the limited storage resources to store data becomes the focus of our research and the data compression technology is the key to solve this problem. The traditional compression technology on the CPU platform could not meet the requirements for processing massive data in the compression rate and the energy cost. The GPU provides a new solution for its strong parallel computation ability. In this paper we present an implementation of Parallel Matching Lempel-Ziv-Storer-Szymanski (PMLZSS), a high speed lossless data compression algorithm by using CUDA framework. The basic idea of our implementation of the PMLZSS algorithm on GPUs is the introduction of a paralleled matrix matching. The data needed to be compressed are divided into multiple dictionary strings and pre-read strings as the vertical axis and horizontal axis of the matrices, respectively. All of the matrices are paralleled matched in the different blocks. Compared with the traditional serial CPU platform LZSS compression algorithm and BZIP2 compression algorithm, the experimental data shows that on the premise of the basic compression rate unchanged, relative to the serial LZSS, the compression speed of PMLZSS is improved about 16x, while to the BZIP2, about 12x.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133862744","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}
引用次数: 4
Multi-dimensions of Developer Trustworthiness Assessment in OSS Community 开源软件社区开发者可信度评估的多维度研究
Yu Bai, Gang Yin, Huaimin Wang
{"title":"Multi-dimensions of Developer Trustworthiness Assessment in OSS Community","authors":"Yu Bai, Gang Yin, Huaimin Wang","doi":"10.1109/TrustCom.2014.14","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.14","url":null,"abstract":"With the prosperity of the Open Source Software, various software communities are formed and they attract huge amounts of developers to participate in distributed software development. For such software development paradigm, how to evaluate the skills of the developers comprehensively and automatically is critical. However, most of the existing researches assess the developers based on the Implementation aspects, such as the artifacts they created or edited. They ignore the developers' contributions in Social collaboration aspects, such as answering questions, giving advices, making comments or creating social connections. In this paper, we propose a novel model which evaluate the individuals' skills from both Implementation and Social collaboration aspects. Our model defines four metrics from muti-dimensions, including collaboration index, technical skill, community influence and development contribution. We carry out experiments on a real-world online software community. The results show that our approach can make more comprehensive measurement than the previous work.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124702244","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
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学术官方微信
小红书