Volatile Organic Compounds (VOCs) are organic compounds with a low boiling point at room temperature. This fact leads to their easy evaporation into the nearby air, intoxicating it and making breathing hard for living species especially human beings are vulnerable to audible and visual damage. Technological advancements in biomedical engineering have led to the development of various methods to moderate this problem. In this paper, we present an optical sensor that can be used to analyze the quantity of VOCs in air. The technique deploys Absorption Spectroscopy based measurements at different points in a defined area. Emphasis has been led to the optical setup that uses a mechanical chopper and a set of lenses, since the main results rely heavily on it. Some of the important outcomes are presented and discussed in detail which leads to attention grabbing graphical results.
{"title":"Development of an Optical Sensor for the Detection of Volatile Organic Compounds","authors":"U. Masud, M. I. Baig","doi":"10.1109/FIT.2011.66","DOIUrl":"https://doi.org/10.1109/FIT.2011.66","url":null,"abstract":"Volatile Organic Compounds (VOCs) are organic compounds with a low boiling point at room temperature. This fact leads to their easy evaporation into the nearby air, intoxicating it and making breathing hard for living species especially human beings are vulnerable to audible and visual damage. Technological advancements in biomedical engineering have led to the development of various methods to moderate this problem. In this paper, we present an optical sensor that can be used to analyze the quantity of VOCs in air. The technique deploys Absorption Spectroscopy based measurements at different points in a defined area. Emphasis has been led to the optical setup that uses a mechanical chopper and a set of lenses, since the main results rely heavily on it. Some of the important outcomes are presented and discussed in detail which leads to attention grabbing graphical results.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"95 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":"115001093","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}
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.
{"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}
Cryptographic hash functions are at heart of many information security applications like digital signatures, message authentication codes (MACs), and other forms of authentication. In consequence of recent innovations in cryptanalysis of commonly used hash algorithms, NIST USA announced a publicly open competition for selection of new standard Secure Hash Algorithm called SHA-3. An essential part of this contest is hardware performance evaluation of the candidates. In this work we present a high throughput efficient hardware implementation of one of the final round candidate of SHA-3: BLAKE. We implemented and investigated the performance of BLAKE on latest Xilinx FPGAs. We show our results in form of chip area consumption, throughput and throughput per area. We compare and contrasted these results with most recently reported implementations of BLAKE. Our design ranked highest in terms of speed, achieving throughputs of 2.47Gbps on Virtex 7 and 2.28Gbps on Virtex 5.
{"title":"High Throughput Hardware Implementation of Secure Hash Algorithm (SHA-3) Finalist: BLAKE","authors":"Kashif Latif, A. Mahboob, A. Aziz","doi":"10.1109/FIT.2011.42","DOIUrl":"https://doi.org/10.1109/FIT.2011.42","url":null,"abstract":"Cryptographic hash functions are at heart of many information security applications like digital signatures, message authentication codes (MACs), and other forms of authentication. In consequence of recent innovations in cryptanalysis of commonly used hash algorithms, NIST USA announced a publicly open competition for selection of new standard Secure Hash Algorithm called SHA-3. An essential part of this contest is hardware performance evaluation of the candidates. In this work we present a high throughput efficient hardware implementation of one of the final round candidate of SHA-3: BLAKE. We implemented and investigated the performance of BLAKE on latest Xilinx FPGAs. We show our results in form of chip area consumption, throughput and throughput per area. We compare and contrasted these results with most recently reported implementations of BLAKE. Our design ranked highest in terms of speed, achieving throughputs of 2.47Gbps on Virtex 7 and 2.28Gbps on Virtex 5.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"48 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":"129816333","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}
One of the major challenges of Global Software Development (GSD) is associated with overcoming integration problems that remain hidden throughout development and surface at the end of a project. Incompatibilities and other integration complexities can lead to extra costs, delays, lowered quality and even failure of a GSD project. A solid integration strategy can be an effective solution to overcome integration challenges, but this requires a good understanding of what causes failure and how the failures can be mitigated. The aim of this study is to investigate integration problems that occurred in different phases of GSD, and successful integration practices with their relative importance through an extensive literature review and a Delphi survey. As a result, a prioritized list of failure and success factors is obtained. The findings are applicable for planning new projects at an early stage of GSD or improving ongoing projects.
{"title":"Investigating integration challenges and solutions in global software development","authors":"A. Zafar, Sajad Ali, R. Shahzad","doi":"10.1109/FIT.2011.61","DOIUrl":"https://doi.org/10.1109/FIT.2011.61","url":null,"abstract":"One of the major challenges of Global Software Development (GSD) is associated with overcoming integration problems that remain hidden throughout development and surface at the end of a project. Incompatibilities and other integration complexities can lead to extra costs, delays, lowered quality and even failure of a GSD project. A solid integration strategy can be an effective solution to overcome integration challenges, but this requires a good understanding of what causes failure and how the failures can be mitigated. The aim of this study is to investigate integration problems that occurred in different phases of GSD, and successful integration practices with their relative importance through an extensive literature review and a Delphi survey. As a result, a prioritized list of failure and success factors is obtained. The findings are applicable for planning new projects at an early stage of GSD or improving ongoing projects.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"20 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":"130043987","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}
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.
{"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}
Color-mapped images are widely used in many applications. Unlike most of the color-mapped image compression techniques, which require two passes, the pseudo-distance compression technique requires one pass and runs in linear time. Recently, we showed that when a structured arithmetic coder is used, after a color-mapped image is transformed with a pseudo-distance technique, better compression gains can be achieved over GIF and Huffman coder. In this work, we show that further compression gains are possible when a Gradient Adjusted Predictor is employed along with the pseudo-distance technique.
{"title":"Gradient Adjusted Predictor with Pseudo-Distance Technique for Lossless Compression of Color-Mapped Images","authors":"B. Koc, Z. Arnavut","doi":"10.1109/FIT.2011.58","DOIUrl":"https://doi.org/10.1109/FIT.2011.58","url":null,"abstract":"Color-mapped images are widely used in many applications. Unlike most of the color-mapped image compression techniques, which require two passes, the pseudo-distance compression technique requires one pass and runs in linear time. Recently, we showed that when a structured arithmetic coder is used, after a color-mapped image is transformed with a pseudo-distance technique, better compression gains can be achieved over GIF and Huffman coder. In this work, we show that further compression gains are possible when a Gradient Adjusted Predictor is employed along with the pseudo-distance technique.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"115 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":"131797809","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}
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.
{"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}
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.
{"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}
S. Khan, Muhammad Nazir, Usman Asghar, Naveed Riaz Ansari
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.
随着万维网的出现和廉价、高质量的数码相机的普及，越来越多的人可以获得丰富的图像数据，能够自动将性别分类到适当的类别，这样智能代理和其他智能软件就可以在不需要过多人为干预的情况下做出更明智的决定，这变得越来越可取。在本文中，我们提出了一种新的性别分类技术，其性能优于现有的性别分类技术。我们首先使用Voila Jones人脸检测器检测人脸部分，然后利用IDP (inter隔行导数模式)提取性别判别性人脸特征，并通过主成分分析(PCA)去除冗余特征，从而实现降维。考虑到不同分类器的优势，将k近邻分类器、支持向量机分类器和Fisher判别分析分类器相结合，使分类错误率最小化。我们使用Stanford University Medical students (sum)的人脸数据库进行实验。结果表明，该方法具有较高的准确率和对光照变化的鲁棒性。
{"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}
In this work, we have studied Android Architecture from a security point of view. We have studied various defense mechanisms that are present in current Android Platform or are recently proposed. We took inspiration from Sound comber -- a recent Android Trojan that steals sensitive information using various techniques. We enhanced the capabilities of Sound comber in terms of its stealthiness and efficiency in malicious communication by identifying new covert channel and incorporating basic compression. We then developed a new Android Trojan -- Contact Archiver (steals user contacts) which inherits properties from Sound comber, i.e. uses few and innocuous permissions, circumvents already-known security defenses, conveys information remotely without direct network access plus incorporates enhancements proposed by us. We also propose some defense possibilities to detect Contact Archiver covert communication. Our future work will be to block security attacks performed using our enhancements, when they are used in any Android malware.
{"title":"Enhancing Stealthiness & Efficiency of Android Trojans and Defense Possibilities (EnSEAD) - Android's Malware Attack, Stealthiness and Defense: An Improvement","authors":"Mohammad Ali, H. Ali, Z. Anwar","doi":"10.1109/FIT.2011.35","DOIUrl":"https://doi.org/10.1109/FIT.2011.35","url":null,"abstract":"In this work, we have studied Android Architecture from a security point of view. We have studied various defense mechanisms that are present in current Android Platform or are recently proposed. We took inspiration from Sound comber -- a recent Android Trojan that steals sensitive information using various techniques. We enhanced the capabilities of Sound comber in terms of its stealthiness and efficiency in malicious communication by identifying new covert channel and incorporating basic compression. We then developed a new Android Trojan -- Contact Archiver (steals user contacts) which inherits properties from Sound comber, i.e. uses few and innocuous permissions, circumvents already-known security defenses, conveys information remotely without direct network access plus incorporates enhancements proposed by us. We also propose some defense possibilities to detect Contact Archiver covert communication. Our future work will be to block security attacks performed using our enhancements, when they are used in any Android malware.","PeriodicalId":101923,"journal":{"name":"2011 Frontiers of Information Technology","volume":"52 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":"124900589","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
扫码关注我们
求助内容：
应助结果提醒方式：