{"title":"One Kind of Cross-Domain DAA Scheme from Bilinear Mapping","authors":"Xiaoming Wang, Heyou Cheng, Ruihua Zhang","doi":"10.1109/TrustCom.2014.62","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.62","url":null,"abstract":"Direct anonymous attestation was adopted by TCG organization for authenticating remote trusted computing platform. Its advantage is that we can protect the privacy of the platform. Since DAA is a unidirectional authentication, it can't resist the platform masquerading attacks. Because DAA scheme has unidirectional authentication security flaws, the proposed method key negotiation, successfully repairs the defects. In practical applications, there may be a case of multiple trust domains, but most of the existing DAA programs don't support across trust domains. For this limitation, by introducing cross domain certificate issuer, using CL-LRSW signature successfully solve the problem of cross trust domains. After analysis, the scheme satisfies anonymity, enforceability, unlinkability, and can effectively resist platform masquerading attacks.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"24 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":"126625518","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}
Zhou Lei, Zhaoxin Li, Yu Lei, Y. Bi, Luokai Hu, W. Shen
{"title":"An Improved Image File Storage Method Using Data Deduplication","authors":"Zhou Lei, Zhaoxin Li, Yu Lei, Y. Bi, Luokai Hu, W. Shen","doi":"10.1109/TrustCom.2014.82","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.82","url":null,"abstract":"Recent years have seen a rapid growth in the number of virtual machines and virtual machine images that are managed to support infrastructure as a service (IaaS). For example, Amazon Elastic Compute Cloud (EC2) has 6,521 public virtual machine images. This creates several challenges in management of image files in a cloud computing environment. In particular, a large amount of duplicate data that exists in image files consumes significant storage space. To address this problem, we propose an effective image file storage technique using data deduplication with a modified fixed-size block scheme. When a user requests to store an image file, this technique first calculates the fingerprint for the image file, and then compares the fingerprint with the fingerprints in a fingerprint library. If the fingerprint of the image is already in the library, a pointer to the existing fingerprint is used to store this image. Otherwise this image will be processed using the fixed-size block image segmentation method. We design a metadata format for image files to organize image file blocks and a new MD5 index table of image files to reduce their retrieval time. The experiments show that our technique can significantly reduce the transmission time of image files that have already existed in storage. Also the deletion rate for image groups which have the same version of operating systems but different versions of software applications is up about 58%.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"384 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":"114896852","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":"AppCaulk: Data Leak Prevention by Injecting Targeted Taint Tracking into Android Apps","authors":"J. Schütte, Dennis Titze, J. M. D. Fuentes","doi":"10.1109/TrustCom.2014.48","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.48","url":null,"abstract":"As Android is entering the business domain, leaks of business-critical and personal information through apps become major threats. Due to the context-insensitive nature of the Android permission model, information flow policies cannot be enforced by on-board mechanisms. We therefore propose AppCaulk, an approach to harden any existing Android app by injecting a targeted dynamic taint analysis, which tracks and blocks unwanted information flows at runtime. Critical data flows are first discovered using a static taint analysis and the relevant data propagation paths are instrumented by a taint tracking code at register level. At runtime the dynamic taint analysis woven into the app detects and blocks data leaks as they are about to occur. In contrast to existing taint analysis approaches like Taint droid, AppCaulk does not require modification of the Android middleware and can thus be applied to any stock Android installation. In this paper, we explain the design of AppCaulk, describe the evaluation of its prototype, and compare its effectiveness with Taintdroid.","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":"116117195","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":"A Machine Learning Based Trust Evaluation Framework for Online Social Networks","authors":"Kang Zhao, Li Pan","doi":"10.1109/TrustCom.2014.13","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.13","url":null,"abstract":"Trust in Online Social Networks is an increasing popular issue in the field of social computing. It has been widely used in scenarios such as e-commerce, friend recommendation and trust-based access control system. Several trust computing methods have been proposed from different perspectives, however, most of them just quantify certain trust related factors and integrate them into a trust value by setting a weight for each factor. On the one hand, the weight is difficult to select since the influence that each factor has on trust is uncertain. On the other hand, the trust values generated by these methods might not be in accordance with users' subjective judgements and they are not straightforward for users to understand. It is necessary for a trust evaluation method to provide accurate and intuitive trust levels for the social network users. Therefore, in this paper, trust evaluation is formalized as a classification problem and a novel approach utilizing machine learning method is presented. Firstly, the trust feature vector is constructed according to the trust related factors. Then by training with collected sample data which contains trust feature vectors and trust ratings, a trust classifier can be established. Based on this approach, a general trust evaluation framework is proposed for network-level trust evaluation. The experiments in real social networks verify the feasibility of our framework and show that the trained trust classifier has a relatively high predicting accuracy.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"15 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":"121286439","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":"Encrypted Keyword Search Mechanism Based on Bitmap Index for Personal Storage Services","authors":"Yong Ho Hwang, J. Seo, I. Kim","doi":"10.1109/TrustCom.2014.22","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.22","url":null,"abstract":"The remote storage service has been one of the most popular cloud services. However, outsourcing in the remote storage causes a privacy issue such as the exposure of personal data and the leakage of private information. In this paper, we focus on the encrypted keyword search problem, called searchable symmetric encryption in cryptography, to reserve the user privacy and the data confidentiality in cloud storage services. Even though many works have been introduced, they still suffer from limitations in their practical use due to high search costs and huge index size. We present a new keyword search mechanism based on the bitmap index that represents a set of files in the inverted index form. The proposed mechanism has fast search time and small index size compared with the previous works in practical use. We show that it can be directly applied to practical services by testing the known NoSQL database, Couch base.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"38 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":"124358202","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":"VALID: A Web Framework for Visual Analytics of Large Streaming Data","authors":"Chenhui Li, G. Baciu","doi":"10.1109/TrustCom.2014.89","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.89","url":null,"abstract":"Visual analytics of increasingly large data sets has become a challenge for traditional in-memory and off-line algorithms as well as in the cognitive process of understanding features at various scales of resolution. In this paper, we attempt a new web-based framework for the dynamic visualization of large data. The framework is based on the idea that no physical device can ever catch up to the analytical demand and the physical requirements of large data. Thus, we adopt a data streaming generator model that serializes the original data into multiple streams of data that can be contained on current hardware. Thus, the scalability of the visual analytics of large data is inherent in the streaming architecture supported by our platform. The platform is based on the traditional server-client model. However, the platform is enhanced by effective analytical methods that operate on data streams, such as binned points and bundling lines that reduce and enhance large streams of data for effective interactive visualization. We demonstrate the effectiveness of our framework on different types of large datasets.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"61 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":"127922016","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}
Yao Cheng, Chang Xu, Yi Yang, Lingyun Ying, Purui Su, D. Feng
{"title":"Automated User Profiling in Location-Based Mobile Messaging Applications","authors":"Yao Cheng, Chang Xu, Yi Yang, Lingyun Ying, Purui Su, D. Feng","doi":"10.1109/TrustCom.2014.7","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.7","url":null,"abstract":"Location-based messaging applications (LMAs), a kind of messaging applications for mobile devices which enable users to connect with people based on their geographical locations, have recently experienced a huge popularity growth. The killer feature in LMAs that embodies the concept of geo-based instant messaging, named people nearby, allows users at any place to search and communicate with other registered users nearby. In this paper, we discuss a common weakness in LMAs that relates to the abuse of the people nearby function. In this case, rich personal data of registered LMA users can be easily obtained, bringing a chance to perform automated user profiling in LMAs. Specifically, we build an automated and scalable system to construct extended profiles (or we call life profile) of LMA users, which contain not only personal information of LMA users but also the daily activities and social ties inferred from their leaked spatio-temporal privacy. The system is highly adaptable to various applications, requiring no modification of applications or trivial work on protocol reverse engineering. We conduct the evaluation on a large scale for the first time. In our experiment, we succeed to construct life profiles for more than 280,000 users from two popular LMAs. The results of empirical analysis not only validate the existence of the privacy issue in LMAs, but also demonstrate its severity.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"75 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":"131616519","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":"Detect Android Malware Variants Using Component Based Topology Graph","authors":"Tong Shen, Yibing Zhongyang, Zhi Xin, Bing Mao, Hao Huang","doi":"10.1109/TrustCom.2014.52","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.52","url":null,"abstract":"Smartphone has experienced explosive growth recently. At present, Android system is the most popular mobile platform and attracts lots of developers as well as malware authors. In order to evade detection, malware authors often apply obfuscation techniques to morph malware. Since traditional malware detectors are based on pure syntax, they may fail to detect obfuscated malware variants. We present a novel signature, topology graph based on Android components, which could model malicious payloads properly and resist against common obfuscation used by hackers. We performe stress test on security tools provided by Virus total with ten kinds of malware families from Android Malware Genome Project. Unfortunately, the result is not optimistic that obfuscated malware samples evade most of security tools. Nevertheless, 86.36% of obfuscated malware samples we tested are caught by our detector with tolerable false positive. The evaluation demonstrates that our approach is able to detect malware variants generated by common obfuscation techniques.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1982 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":"131033841","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":"Overhead-Free In-Place Recovery Scheme for XOR-Based Storage Codes","authors":"Ximing Fu, Zhiqing Xiao, Shenghao Yang","doi":"10.1109/TrustCom.2014.70","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.70","url":null,"abstract":"This paper proposes a novel recovery scheme for the XOR-based storage codes with the increasing-difference property. For a message of kL bits stored in n storage nodes, a data collector connects any k out of the n storage nodes to recover the message. In our scheme, the data collector acquires exactly L bits for each node, so that no transmission overhead exists. Furthermore, we propose an in-place decoding algorithm that acquires less auxiliary space than the existing decoding algorithm, and the decoding computational complexity of our decoding algorithm is the same as the existing decoding algorithm.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"8 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":"127799410","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}
Chun-qiang Hu, Fan Zhang, Tao Xiang, Hongjuan Li, Xiao Xiao, Gui-chao Huang
{"title":"A Practically Optimized Implementation of Attribute Based Cryptosystems","authors":"Chun-qiang Hu, Fan Zhang, Tao Xiang, Hongjuan Li, Xiao Xiao, Gui-chao Huang","doi":"10.1109/TrustCom.2014.29","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.29","url":null,"abstract":"Attribute based encryption (ABE) has been applied to many applications nowadays [1][2] and it effectively achieves a fine grained access control. Even the encryptor needs only one encryption operation, and all the decryption operations are distributed to the receiver's end, the computational cost of encryption is still impractical when there is a large amount of encryption with different access structures. In this paper, we examine existing techniques that optimize the decentralized attribute based encryption scheme [3], such as a better construction of e Linear Secret-Sharing Scheme (LSSS) matrix, pre-processing of scalar multiplication and pairing, multi-pairing and so on. We proposed the deployment of offline pools to improve the real-time operations. We proposed the method to construct offline pools and designed algorithms to achieve better hitting rate of offline pool topples. We evaluated the optimization techniques, the result shows that there is a 45 times of performance improvement in the encryption (6-8 times for the decryption) after we applied all the real-time optimization techniques mentioned in our paper. With deployment of the offline pools, the optimization can be improved at least 100-200 times than without offline pools.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"99 2 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":"124328353","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}