2011 Frontiers of Information Technology最新文献_第3页

Development of an Optical Sensor for the Detection of Volatile Organic Compounds 挥发性有机化合物光学传感器的研制

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.66

U. Masud, M. I. Baig

引用次数: 1

SWAM: Stuxnet Worm Analysis in Metasploit Metasploit中的Stuxnet蠕虫分析

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.34

Rahat Masood, Um-e-Ghazia, Z. Anwar

{"title":"SWAM: Stuxnet Worm Analysis in Metasploit","authors":"Rahat Masood, Um-e-Ghazia, Z. Anwar","doi":"10.1109/FIT.2011.34","DOIUrl":"https://doi.org/10.1109/FIT.2011.34","url":null,"abstract":"Nowadays cyber security is becoming a great challenge. Attacker's community is progressing towards making smart and intelligent malwares (viruses, worms and Root kits). They stealth their existence and also use administrator rights without knowing legal user. Stuxnet worm is an example of a recent malware first detected in July 2010. Its variants were also detected earlier. It is the first type of worm that affects the normal functionality of industrial control systems (ICS) having programmable logic controllers (PLC) through PLC Root kit. Its main goal is to modify ICS behavior by changing the code of PLC and make it to behave in a way that attacker wants. It is a complex piece of malware having different operations and functionalities which are achieved by exploiting zero day vulnerabilities. Stuxnet exploits various vulnerable services in Microsoft Windows. In this paper we will show real time simulation of first three vulnerabilities of these through Metasploit Framework 3.2 and analyze results. A real time scenario is established based on some assumptions. We assumed Proteus design (pressure sensor) as PLC and showed after exploitation that the pressure value drops to an unacceptable level by changing Keil code of this design.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132278106","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}

引用次数: 21

High Throughput Hardware Implementation of Secure Hash Algorithm (SHA-3) Finalist: BLAKE 安全哈希算法(SHA-3)的高吞吐量硬件实现入围者:BLAKE

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.42

Kashif Latif, A. Mahboob, A. Aziz

引用次数: 8

Investigating integration challenges and solutions in global software development 调查全球软件开发中的集成挑战和解决方案

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.61

A. Zafar, Sajad Ali, R. Shahzad

引用次数: 21

Secure Solution to Data Transfer from Sensor Node to Sink against Aggregator Compromises 从传感器节点到汇聚器的数据传输安全解决方案

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.53

Sarfraz Azam, Rizwan Manzoor, M. Rehman

{"title":"Secure Solution to Data Transfer from Sensor Node to Sink against Aggregator Compromises","authors":"Sarfraz Azam, Rizwan Manzoor, M. Rehman","doi":"10.1109/FIT.2011.53","DOIUrl":"https://doi.org/10.1109/FIT.2011.53","url":null,"abstract":"Energy is an igniting issue in the domain of wireless sensor networks. To overcome this issue, the technique of data aggregation is introduced. As the aggregator node collects data from many sensors so it becomes very interesting for compromisers. Unfortunately these aggregator nodes could be under the influence of various attacks. Under such circumstances, we have to make our data more secure, to protect it from adversary attacks. Proposed RSS (Re-Sequencing Scheme) provides secure data aggregation. It is based on symmetric key, information dispersal algorithm and multipath routing. Symmetric key is injected in the node at deployment time and it is shared only between the node and sink. Node sense data places it in buffer then disrupts the data sequence according to symmetric key. It splits data into many shares and routes them on multiple paths. On receiving, these aggregated shares are reconstructed by the sink and arrange the data in order, with the help of symmetric key. The RSS provides authenticity, data availability and protection against eavesdropping, data tampering and denial of service attacks, even in the presence of compromised nodes.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522460","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

Gradient Adjusted Predictor with Pseudo-Distance Technique for Lossless Compression of Color-Mapped Images 基于伪距离技术的梯度调整预测器用于彩色映射图像的无损压缩

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.58

B. Koc, Z. Arnavut

引用次数: 6

Analysis of Fast Parallel Sorting Algorithms for GPU Architectures' 面向GPU架构的快速并行排序算法分析

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.39

F. Khan, O. Khan, B. Montrucchio, P. Giaccone

{"title":"Analysis of Fast Parallel Sorting Algorithms for GPU Architectures'","authors":"F. Khan, O. Khan, B. Montrucchio, P. Giaccone","doi":"10.1109/FIT.2011.39","DOIUrl":"https://doi.org/10.1109/FIT.2011.39","url":null,"abstract":"Sorting algorithms have been studied extensively since past three decades. Their uses are found in many applications including real-time systems, operating systems, and discrete event simulations. In most cases, the efficiency of an application itself depends on usage of a sorting algorithm. Lately, the usage of graphic cards for general purpose computing has again revisited sorting algorithms. In this paper we extended our previous work regarding parallel sorting algorithms on GPU, and are presenting an analysis of parallel and sequential bitonic, odd-even and rank-sort algorithms on different GPU and CPU architectures. Their performance for various queue sizes is measured with respect to sorting time and rate and also the speed up of bitonic sort over odd-even sorting algorithms is shown on different GPUs and CPU. The algorithms have been written to exploit task parallelism model as available on multi-core GPUs using the OpenCL specification. Our findings report minimum of 19x speed-up of bitonic sort against odd-even sorting technique for small queue sizes on CPU and maximum of 2300x speed-up for very large queue sizes on Nvidia Quadro 6000 GPU architecture.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129375333","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}

引用次数: 22

Dynamic Collaborations for Information Sharing within and across Virtual Teams 在虚拟团队内部和跨虚拟团队之间实现信息共享的动态协作

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.45

Ahmad Kamran Malik, S. Dustdar

{"title":"Dynamic Collaborations for Information Sharing within and across Virtual Teams","authors":"Ahmad Kamran Malik, S. Dustdar","doi":"10.1109/FIT.2011.45","DOIUrl":"https://doi.org/10.1109/FIT.2011.45","url":null,"abstract":"Dynamic teams created by different enterprises collaborate to achieve their mutual goals. User-based collaborations for a specific task, within and across teams, result in a new team represented as dynamic collaboration (c). These inter-team and intra-team collaborations are mostly temporary which are based on specific task or goal. Collaborations among different teams, within a team, or across teams can take different forms when some or all of the users belonging to one or more teams collaborate for a common goal having diverse access control and sharing requirements imposed by themselves, their teams, or their parent enterprises. In such a dynamic environment, information sharing and privacy are critical issues for users, their teams and enterprises. We propose a dynamic sharing and privacy-aware model that supports enhanced sharing and preserves the privacy of users, their teams, and enterprises. We extend the widely used Role-Based Access Control (RBAC) model with team and task entities in addition to sharing and privacy data elements. In this model, using context constraints and hybrid access control policy, a user can control what to share with whom in which context conditions. We present a Dynamic Sharing and Privacy-aware Role-Based Access Control (DySP-RBAC) model that extends the RBAC model for enhanced sharing and privacy of information among collaborating users within and across virtual teams.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"28 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132638558","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

Efficient Gender Classification Using Interlaced Derivative Pattern and Principal Component Analysis 基于交错导数模式和主成分分析的高效性别分类

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.57

S. Khan, Muhammad Nazir, Usman Asghar, Naveed Riaz Ansari

{"title":"Efficient Gender Classification Using Interlaced Derivative Pattern and Principal Component Analysis","authors":"S. Khan, Muhammad Nazir, Usman Asghar, Naveed Riaz Ansari","doi":"10.1109/FIT.2011.57","DOIUrl":"https://doi.org/10.1109/FIT.2011.57","url":null,"abstract":"With the wealth of image data that is now becoming increasingly accessible through the advent of the world wide web and proliferation of cheap, high quality digital cameras it is becoming ever more desirable to be able to automatically classify Gender into appropriate category such that intelligent agents and other such intelligent software might make better informed decisions regarding them without a need for excessive human intervention. In this paper, we present a new technique which provides superior performance superior than existing gender classification techniques. We first detect the face portion using Voila Jones face detector and then Interlaced Derivative Pattern (IDP)extract discriminative facial features for gender which are passed through Principal Component Analysis (PCA) to eliminate redundant features and thus reduce dimension. Keeping in mind strengths of different classifiers three classifiers K-nearest neighbor, Support Vector Machine and Fisher Discriminant Analysis are combined, which minimizes the classification error rate. We have used Stanford University Medical students (SUMS) face database for our experiment. Comparing our results and performance with existing techniques our proposed method provides high accuracy rate and robustness to illumination change.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131051628","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

Enhancing Stealthiness & Efficiency of Android Trojans and Defense Possibilities (EnSEAD) - Android's Malware Attack, Stealthiness and Defense: An Improvement 增强Android木马的隐身性和效率和防御可能性(EnSEAD) - Android的恶意软件攻击，隐身性和防御:一个改进

2011 Frontiers of Information Technology Pub Date : 2011-12-19 DOI: 10.1109/FIT.2011.35

Mohammad Ali, H. Ali, Z. Anwar

引用次数: 6