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

{"title":"A Block Gathering Based on Mobile Web Page Segmentation Algorithm","authors":"Libing Wu, Yalin Ke, Yanxiang He, Nan Liu","doi":"10.1109/TrustCom.2011.195","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.195","url":null,"abstract":"Compared to html page, the mobile web page has different features. The mobile web page is arranged through some important tags such as <div>, >table>, which are called Gathering Node in this paper. Based on these Gathering Nodes, we proposed a Block Gathering Based Page Segmentation algorithm (BGBPS). The experiment shows that BGBPS algorithm has great effect on semantic segmentation of mobile web page.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122505597","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":"DACC: Distributed Access Control in Clouds","authors":"S. Ruj, A. Nayak, I. Stojmenovic","doi":"10.1109/TrustCom.2011.15","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.15","url":null,"abstract":"We propose a new model for data storage and access in clouds. Our scheme avoids storing multiple encrypted copies of same data. In our framework for secure data storage, cloud stores encrypted data (without being able to decrypt them). The main novelty of our model is addition of key distribution centers (KDCs). We propose DACC (Distributed Access Control in Clouds) algorithm, where one or more KDCs distribute keys to data owners and users. KDC may provide access to particular fields in all records. Thus, a single key replaces separate keys from owners. Owners and users are assigned certain set of attributes. Owner encrypts the data with the attributes it has and stores them in the cloud. The users with matching set of attributes can retrieve the data from the cloud. We apply attribute-based encryption based on bilinear pairings on elliptic curves. The scheme is collusion secure, two users cannot together decode any data that none of them has individual right to access. DACC also supports revocation of users, without redistributing keys to all the users of cloud services. We show that our approach results in lower communication, computation and storage overheads, compared to existing models and schemes.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122513468","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":"DSBS: Distributed and Scalable Barrier Synchronization in Many-Core Network-on-Chips","authors":"Xiaowen Chen, Shuming Chen","doi":"10.1109/TrustCom.2011.141","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.141","url":null,"abstract":"This paper proposes a distributed and scalable hardware solution for efficient barrier synchronization management on many-core Network-on-Chips (NoCs). It includes two hardware modules, named Root Distributed and Scalable Barrier Synchronizer (Root DSBS) and Leaf Distributed and Scalable Barrier Synchronizer (Leaf DSBS). The Root DSBS is located in the central node, connecting to the processor core and the network interface. It provides a set of globally addressed barrier counters, sets the barrier and counts arriving \"barrier acquire\" requests, and releases the barrier and sends out \"barrier release\" acknowledgements once the barrier condition is satisfied. The Leaf DSBS is integrated into each router in the on-chip network. It is responsible for efficiently transmitting barrier synchronization related packets in the on-chip network to the Root DSBS. The Root DSBS in the central node and all Leaf DSBSs in routers cooperate together to accomplish barrier synchronization. Our solution has two salient features. One is called \"Unicast Merging\" -- \"barrier acquire\" packets towards the same barrier are merged into one packet when they pass through the same router simultaneously. The purpose is to minimize the completion time of barrier acquiring by reducing the number of barrier synchronization related packets. The other is called \"Broadcasting\" -- a \"barrier release\" packet is broadcasted to all synchronized nodes. Its object is to reduce area cost by avoiding storing synchronized node numbers as well as to minimize the completion time of barrier releasing by avoiding sending unicast \"barrier release\" packets. To evaluate the performance, we investigate hardware cost and employ both synthetic and application experiments. Synthesis and experiment results show that our distributed and scalable barrier synchronization obtains both area and performance advantage over the conventional barrier synchronization counterpart. The Root DSBS and Leaf DSBSs can run over 2GHz in TSMC 65nm technology with small area overhead. Our solution only costs a little completion time and generates well distributed and uniform network traffic. When the network size is 16x16, the application's performance improvement can achieve 24.60%.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116741950","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":"Statistical Fault Localization via Semi-dynamic Program Slicing","authors":"Rongwei Yu, Lei Zhao, Lina Wang, Xiaodan Yin","doi":"10.1109/TrustCom.2011.89","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.89","url":null,"abstract":"Fault localization is a critical step of software debugging. We present a statistical fault localization approach via semi-dynamic slicing in this paper. In our technique, we first conduct the execution flow graph based on both the coverage information and static control-flow-graph to model the executions approximately. Second, we use the backward slicing to analyze the dependence relationships between execution statements and execution results, obtain sliced statements and calculate the coverage statistics. At last, we calculate the fault suspiciousness according to Tarantula, a classic approach of statistical fault localization. Controlled experiments are setup on the Siemens subjects, and the results are promising.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117028639","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 Precise Memory Model for Operating System Code Verification","authors":"Geng Chen, Lei Luo, Lijie Wang","doi":"10.1109/TrustCom.2011.153","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.153","url":null,"abstract":"Recently, safety and security requirements of real-time system received much attention. Several formal approaches have been presented to verify some related properties at the source code level. System's code is almost universally written in the C programming language, where memory is just a sequence of bytes and data can overlap almost arbitrarily. In this paper, we present a two-level formal memory model: abstract level and physical level. The abstract level is used to verify properties at design stage. While at physical level, the memory model captures some low-level features of C's pointers and memory. It is used to prove properties on code level. Then, we provide some well-behaved operations in the memory model and prove the well-formedness conditions of both levels. We use this model to solve the problems we encountered in an ongoing attempt to verify the Software Virtual Machine Kernel (SVMK). It is a real-time operating system kernel based on virtualization technology. The memory model is integrated in our verification environment based on the interactive theorem prover Coq. This verification environment will ultimately be used for the verification of the SVMK.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128509605","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":"SWTrust: Generating Trusted Graph for Trust Evaluation in Online Social Networks","authors":"Wenjun Jiang, Guojun Wang","doi":"10.1109/TrustCom.2011.251","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.251","url":null,"abstract":"To solve the problem of \"Can Alice trust Bob on a service in a social network setting\", we propose the SWTrust framework to generate trusted graphs for trust evaluation in online social networks: (1) to develop a novel PSN algorithm for preprocessing a social network, where we classify a user's neighbors by their social distance and define neighbors' priority based on their topic-related degree and target-related degree, (2) to develop distributed algorithms to build trust network (BTN) and to generate trusted graph (GTG). Experimental results with data from Epinions.com show that our work can discover short paths and generate high quality trusted graphs efficiently.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128734890","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":"Secret Sharing Scheme with Fairness","authors":"Youliang Tian, Jianfeng Ma, Changgen Peng, Jianming Zhu","doi":"10.1109/TrustCom.2011.64","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.64","url":null,"abstract":"In the setting of secret sharing, one desirable property is fairness, which guarantees that if there is a player getting the secret in the recovery phase, then each player participating to the reconstruction process does too. In this paper we study the fairness problem of secret reconstruction in a secret sharing scheme. We use a new approach to achieve the fairness of secret sharing. We first define the fairness of secret sharing probabilistically. Based on this definition, a fair secret sharing scheme is proposed, its security and fairness are shown against three different attack types and do not depend upon any unproven intractability assumption. Our scheme is an extension of Shamir's secret sharing scheme and the approach of fairness of Dov Gordon et al.(STOC2008). Theoretical analysis shows that our proposed scheme is more efficient.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124639370","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":"Performance Analysis of Key Management Schemes in Wireless Sensor Network Using Analytic Hierarchy Process","authors":"Na Ruan, Yizhi Ren, Y. Hori, K. Sakurai","doi":"10.1109/TrustCom.2011.243","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.243","url":null,"abstract":"To achieve security in wireless sensor networks (WSNs), key management is one of the most challenging issues in design of WSN due to resource-constrained sensor nodes. Various key management schemes (KMs) have been proposed to enable encryption and authentication in WSN for different application scenarios. According to different equirements, it is important to select the trustworthy KMs in a WSN for setting up a fully appropriate WSN mechanism. An Analytic Hierarchy Process (AHP)-aided method helping with the complex decision has been presented in our previous work. Our purpose in this paper is to do performance analysis of KMs in WSN using our previous AHP-aided method. We analyze the characters of abundance KMs intuitively. The following five performance criteria are considered: scalability, key connectivity, resilience, storage overhead and communication overhead. As all permutations of five performance criteria include 120 types' situations, experimental analyses on 43 KMs for the optimum selection are presented.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114838923","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":"Towards Detecting Thread Deadlock in Java Programs with JVM Introspection","authors":"Yan Wen, Jinjing Zhao, Minhuan Huang, Hua Chen","doi":"10.1109/TrustCom.2011.222","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.222","url":null,"abstract":"Deadlock is a common error for multithread Java programs. Existing Java thread deadlock detection solutions either require source code, or are built on non-official JVMs. In a consequence, a great number of Java programs cannot be evaluated with these solutions. This paper proposes a new Java thread deadlock detection approach, namely JDeadlockDetector. JDeadlockDetector is built on the official Java Virtual Machine (JVM), viz., OpenJDK's HotSpot. Compared to existing methods, JDeadlockDetector archieves three unique advantages, i.e., application transparency, detection accuracy and minimized performance overhead. Our functionality evaluation shows JDeadlockDetector achieves no false negative and minimized false positive while the performance evaluation shows the workloads generated by SPECjbb2005 achieve 96.7% of official JVM speed on average.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127671493","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 Hybrid Trust Model for Authorisation Using Trusted Platforms","authors":"Aarthi Krishna, V. Varadharajan","doi":"10.1109/TrustCom.2011.39","DOIUrl":"https://doi.org/10.1109/TrustCom.2011.39","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 hybrid trust model that provides techniques for authorisation taking into account state of user platforms leveraging trusted computing technology. 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 model and then provide a description of the proposed hybrid model.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126338876","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}