{"title":"Power Based Malicious Code Detection Techniques for Smartphones","authors":"Bryan Dixon, Shivakant Mishra, Jean-Luc Pepin","doi":"10.1109/NCA.2014.45","DOIUrl":"https://doi.org/10.1109/NCA.2014.45","url":null,"abstract":"In recent years there have been a growing number of viruses, root kits, and malware designed to gain access to system resources and information stored on smartphones. This paper examines the effectiveness of two smartphone-specific techniques for detecting malicious code behavior based on individual power consumption profiles based on time and location. Prototypes for each of the techniques were developed for use with Google's Android platform and were each evaluated over periods of six months or more involving several real-world users. This paper describes the design and implementation of each of these prototypes as well as the evaluation of their results.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132806600","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}
{"title":"Parallel Realization of Cognitive Cells on Film Mammography","authors":"A. P. James, Sherin Sugathan","doi":"10.1109/TRUSTCOM.2013.232","DOIUrl":"https://doi.org/10.1109/TRUSTCOM.2013.232","url":null,"abstract":"High speed detection of breast masses from mammography images at an affordable cost is a problem of practical significance in large volume real-time processing and diagnostic assessments. In this paper, we present a new approach to real-time detection of breast masses by introducing the concept of cognitive cells that has a fully parallel high speed computing architecture realised in a low cost hardware. The prototype system was tested using the Compute Unified Device Architecture (CUDA) that achieved an average speed of 6 ms for processing a single 1024x1024 pixels mammography image. Initial results shows feasibility of using cognitive cells for suspicious breast cancer mass detection in mammograms with superior performances in speed in comparison to other standard methods. We report specificity of 95.25% and the cancer false positives per image as 2.275 for MISC, ASYM, CIRC and SPIC cases, while a relatively lower specificity of 70% and the false positives per image as 2.25 is reported for CALC and ARCH cases of abnormalities.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123057718","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}
{"title":"Research on the Anti-attack Design Principles of Low-Latency Anonymous Communication","authors":"Ming Zheng, Jianping Wu, Haixin Duan","doi":"10.1109/TrustCom.2013.79","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.79","url":null,"abstract":"Low-latency anonymous communication is widely used in privacy protection. However, the attacks against anonymous communication are critical threats to the privacy protection. Many efforts have been conducted to provide robustness by establishing anti-attack principles. In this paper we present a brief survey on attack methods and summarize up four underlying anti-attack principles. In order to better understand the background of anonymous communication, we demonstrate the processes of attack and introduce some typical attack methods, ranging from active attacks to passive attacks. Based on our analysis, we propose four underlying principles, including information leaking prevention, key node protection, data stream signatures elimination and connection characteristics elimination, to improve the anti-attack ability of low-latency anonymous communication. To validate these principles, we design a protocol named Hermit-crab, which follows the four anti-attack principles. The analysis shows the protocol can effectively defend common attacks in low-latency anonymous communication.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125442518","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}
{"title":"Normal Vector Based Fault-Tolerant Event Boundary Detection in Wireless Sensor Networks","authors":"Wei Wang, Ruihua Zhang, Zhongwei Chen, Lei Ju","doi":"10.1109/TrustCom.2013.160","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.160","url":null,"abstract":"This paper presented a distributed fault-tolerant event boundary detection scheme for wireless sensor networks. In this paper, the node coordinate and its reading were mapped on a 3D mesh surface, By comparing the node normal vector got by Normal Vector Based Fault-Tolerant Event Boundary Detection (NVBD) with a predefined threshold, the event boundary nodes are found. This approach was composed of two major tasks: (1) detecting the faulty node and then replacing its detection value with its neighbors' weighted median value, (2) computing node normal vector using its neighbors' detection values. Then we compared it with a threshold to judge if it is a boundary node. The results of numerical simulations show that the NVBD scheme can achieve a substantial improvement on detection performance.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126616695","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}
{"title":"On the Design of a Trust Enhanced Distributed Authorisation Architecture for Service Oriented Architectures","authors":"Aarthi Krishna, V. Varadharajan, Nathan Tarr","doi":"10.1109/TrustCom.2013.246","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.246","url":null,"abstract":"Authorisation systems play a vital role in protecting access to resources in distributed systems. Traditionally, authorisation is performed at the user level to determine whether a user has the necessary privileges to access a requested resource. However, when it comes to the user's platform, it is often assumed that the system hosting the user and the software running on it are 'trusted' and that it will behave correctly. In this paper, we propose a comprehensive trust enhanced distributed authorisation architecture that provides a holistic framework for authorisation taking into account the state of a user platform. The model encompasses the notions of 'hard' and 'soft' trust to determine whether a platform can be trusted for authorisation. We first explain the rationale for the overall model and then describe our hybrid model with 'hard' and 'soft' trust components, followed by a description of the system architecture. We then illustrate proposed architecture in the context of a simple scenario involving a social networking system.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116023896","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}
{"title":"LogicCrowd: A Declarative Programming Platform for Mobile Crowdsourcing","authors":"Jurairat Phuttharak, S. Loke","doi":"10.1109/TrustCom.2013.158","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.158","url":null,"abstract":"We present an attempt to engage social media networks, bringing the crowdsourcing model into mobile environments. We introduce LogicCrowd, a declarative programming paradigm for mobile crowdsourcing applications, developed as an extension of Prolog. LogicCrowd aims at filling the gap between traditional machine computation, which operates upon its database, and social media, which is capable of interacting with real people. In this paper, we illustrate the potential of our approach via programming idioms, a prototype implementation and scenarios.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116060994","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}
{"title":"Scenario-Based Execution Method for Massively Parallel Accelerators","authors":"S. Yamagiwa, Shixun Zhang","doi":"10.1109/TrustCom.2013.127","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.127","url":null,"abstract":"The manycore architecture has become one of the choices in the acceleration method of massively parallel computation. It is an unavoidable option for the top supercomputers in the world in order to achieve the high performance computing applying accelerators such as the graphics processing unit (GPU). However such accelerators are equipped on the processing nodes where the CPU cores control the accelerators via the peripheral bus. Therefore, even if the accelerator implements a large amount of parallelism, the performance is inevitably degraded due to the data migration overheads for downloading the kernel program to the accelerator and transferring the I/O data consumed by the program. To avoid the overheads, it is important to pack many tasks in a single kernel and to invoke it for the smallest numbers of execution times of the kernel programs. However, it is very difficult to pack it because it is necessary to exchange the I/O data in recursive operations or among different computing contents. In order to address this problem, the kernel program must invoke many different contents of the program at a single execution of the kernel program. This paper proposes a novel execution mechanism for the accelerators that drastically improves the performance, called the scenario-based execution for the accelerators. It exploits the potential performance of the accelerators, and the application invokes all program contents on the accelerator side. This paper discusses the design and implementation of the scenario-based execution method, and also the performance aspect using a realistic application.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123016857","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}
Jingguo Ge, Chuan-zhen Du, Yulei Wu, E. Yuepeng, Junling You
{"title":"Performance Analysis of Load-Aware Anycasting Based on OpenFlow","authors":"Jingguo Ge, Chuan-zhen Du, Yulei Wu, E. Yuepeng, Junling You","doi":"10.1109/TrustCom.2013.231","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.231","url":null,"abstract":"Anycast is a practical solution for service discovery among replication of multiple instances in the Internet. OpenFlow is a good candidate to solve the problems of non-awareness of topology changes, costly address translation and low flexibility resulting from anycast service. This paper presents a new anycast mechanism based on OpenFlow technology using the controller to make anycast routing decisions. The controller possesses the knowledge of network topology and link status to realize load-aware anycasting. The effectiveness and accuracy of the proposed scheme is validated by extensive simulation experiments. The results show that the performance of the presented load-aware anycasting outperforms that of existing anycast schemes.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121895550","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}
{"title":"Feature Based Video Watermarking Resistant to Geometric Distortions","authors":"Xiaochen Yuan, Chi-Man Pun","doi":"10.1109/TrustCom.2013.92","DOIUrl":"https://doi.org/10.1109/TrustCom.2013.92","url":null,"abstract":"This paper proposes a digital video watermarking scheme which is robust to geometric distortions, such as rotation, scaling, and cropping. The watermark is embedded / extracted based on feature extraction and local Zernike transform in / from each selected frame. The feature extraction method called Adaptive Harris Detector is proposed by adopting and revising the traditional Harris Corner Detector, and the local Zernike moments-based method is raised for watermarking use. In each selected frame, the extracted circular patches are decomposed into a collection of binary patches with Bit-Plane Decomposition method. Magnitudes of the local Zernike moments are calculated by Zernike transform and modified to embed the watermarks. Experimental results show that the proposed watermarking scheme is robust against geometric distortions and meanwhile preserves the imperceptibility of the video. Furthermore, it outperforms comparable methods when tested under common signal processing attacks.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412219","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}
{"title":"Environmental Spatio-temporal Ontology for the Linked Open Data Cloud","authors":"Ahsan Morshed, J. Aryal, R. Dutta","doi":"10.1109/TRUSTCOM.2013.279","DOIUrl":"https://doi.org/10.1109/TRUSTCOM.2013.279","url":null,"abstract":"The rapid access of sensor technology provides both challenges and opportunities to authenticated spatiotemporal data. Authentication can be assured by developing related ontologies. Ontology explicitly specifies shared conceptualization and formal vocabularies. In this paper, we proposed an environmental spatio-temporal ontology (ESTO) using unified resource description framework (RDF) and Intelligent Environmental Knowledgebase (i-EKbase) recommendation system. Five different environmental data sources namely SILO, AWAP, ASRIS, CosmOz, and MODIS were considered to develop i-EKbase where knowledge was integrated. The recommendation system was founded on web based large scale dynamic data mining, contextual knowledge extraction, and integrated knowledge representation. The proposed ESTO was tested for optimization of the accessibility and usability issues related to big data sets and minimize the overall application costs. RDF representation made this ontology very flexible to publish on Linked Open Data Cloud environment.","PeriodicalId":206739,"journal":{"name":"2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128329998","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}