2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications最新文献_第3页

Privacy Aware Non-linear Support Vector Machine for Multi-source Big Data 多源大数据隐私感知非线性支持向量机

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.103

Yunmei Lu, Piyaphol Phoungphol, Yanqing Zhang

{"title":"Privacy Aware Non-linear Support Vector Machine for Multi-source Big Data","authors":"Yunmei Lu, Piyaphol Phoungphol, Yanqing Zhang","doi":"10.1109/TrustCom.2014.103","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.103","url":null,"abstract":"In order to build reliable prediction models and attain high classification accuracy, assembling datasets from multiple databases maintained by different sources (such as different hospitals) has become increasingly common. However, assembling these composite datasets involves the disclosure of individuals' records, therefore many local owners are reluctant to share their data due to privacy concerns. This paper presents a framework for building a Privacy-Aware Non-linear Support Vector Machine (PAN-SVM) classifier using distributed data sources. The framework with three layers can do global classification based on distributed data sources and protect individuals' records at the same time. At the bottom layer, k-means clustering is used to select landmarks that will be used by the medium layer after they are encrypted by a secure sum protocol. The medium layer employs Nystrom low-rank approximation and kernel matrix decomposition techniques to construct a global SVM classifier which is accelerated at the top layer by employing a cutting-plane technique. Simulation results on multiple datasets indicate that the new framework can solve the classification problem on distributed data sources effectively and efficiently, and protect the privacy of individuals' data as well.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"6 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":"131670075","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}

引用次数: 5

Remote Programmatic vCloud Forensics: A Six-Step Collection Process and a Proof of Concept 远程编程vCloud取证:六步收集过程和概念证明

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.124

Ben Martini, Kim-Kwang Raymond Choo

引用次数: 55

A Stateful Mechanism for the Tree-Rule Firewall 树规则防火墙的状态机制

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.20

T. Chomsiri, Xiangjian He, P. Nanda, Zhiyuan Tan

{"title":"A Stateful Mechanism for the Tree-Rule Firewall","authors":"T. Chomsiri, Xiangjian He, P. Nanda, Zhiyuan Tan","doi":"10.1109/TrustCom.2014.20","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.20","url":null,"abstract":"In this paper, we propose a novel connection tracking mechanism for Tree-rule firewall which essentially organizes firewall rules in a designated Tree structure. A new firewall model based on the proposed connection tracking mechanism is then developed and extended from the basic model of Net filter's Conn Track module, which has been used by many early generation commercial and open source firewalls including IPTABLES, the most popular firewall. To reduce the consumption of memory space and processing time, our proposed model uses one node per connection instead of using two nodes as appeared in Net filter model. This can reduce memory space and processing time. In addition, we introduce an extended hash table with more hashing bits in our firewall model in order to accommodate more concurrent connections. Moreover, our model also applies sophisticated techniques (such as using static information nodes, and avoiding timer objects and memory management tasks) to improve its processing speed. Finally, we implement this model on Linux Cent OS 6.3 and evaluate its speed. The experimental results show that our model performs more efficiently in comparison with the Net filter/IPTABLES.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"25 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":"122427996","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}

引用次数: 15

A Study on Recursive Neural Network Based Sentiment Classification of Sina Weibo 基于递归神经网络的新浪微博情感分类研究

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.88

Chen Fu, Bai Xue, Shaobin Zhan

引用次数: 2

An On-Line Anomaly Detection Method Based on a New Stationary Metric - Entropy-Ratio 基于新平稳度量熵比的在线异常检测方法

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.16

Ziyu Wang, Jiahai Yang, Fuliang Li

引用次数: 5

SIMS: A Comprehensive Approach for a Secure Instant Messaging Sifter SIMS:一种安全即时通讯筛选器的综合方法

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.25

Günter Fahrnberger

引用次数: 7

Computation Integrity Measurement Based on Branch Transfer 基于分支转移的计算完整性度量

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.75

Jianming Fu, Yan Lin, Xu Zhang, Pengwei Li

{"title":"Computation Integrity Measurement Based on Branch Transfer","authors":"Jianming Fu, Yan Lin, Xu Zhang, Pengwei Li","doi":"10.1109/TrustCom.2014.75","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.75","url":null,"abstract":"Tasks are selectively migrated to the cloud with the widespread adoption of the cloud computing platform, but the user cannot know whether the tasks are tampered in the cloud, so it is an urgent demand for cloud users to verify the execution integrity of the program in the cloud. The computation integrity measurement based on behavior is difficult to detect carefully crafted shell code. According to the property of shell code, this paper proposes a computation integrity measurement based on branch transfer called CIMB, which is a fine-grained instruction-level integrity measurement. In this approach, all branches in the user-level have been recorded, which effectively cover all execution control flow of a program, and CIMB can detect control-flow hijacking attacks without the support of source code, such as Return-oriented Programming (ROP) and Jump-oriented Programming (JOP). Meanwhile, distance between two instruction addresses and machine code of instruction can mask the measurement inconsistency derived from address space layout randomization of program and shared libraries. Finally, we have implemented CIMB with a dynamic binary instrumentation tool Pin on ×86 32-bit version of ubuntu12.04. Its experimental results show that CIMB is feasible and it has a relatively stable measurement result, and the advantages of CIMB and factors affecting the results of measurement are analyzed and discussed.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"36 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":"114221495","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

Defensor: Lightweight and Efficient Security-Enhanced Framework for Android defender:轻量级和高效的Android安全增强框架

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.36

Xuerui Pan, Yibing Zhongyang, Zhi Xin, Bing Mao, Hao Huang

{"title":"Defensor: Lightweight and Efficient Security-Enhanced Framework for Android","authors":"Xuerui Pan, Yibing Zhongyang, Zhi Xin, Bing Mao, Hao Huang","doi":"10.1109/TrustCom.2014.36","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.36","url":null,"abstract":"Recently the market of Android has shown an explosive development. Unfortunately the increasing popularity turns the Android platform into the main target of malware. At the same time, the limited security protection built-in Android makes the situation much worse. In this paper, we present a new framework named Defensor which takes the practicability and effectiveness into consideration. The core part of Defensor is built in Linux kernel, which results in a small size of TCB. Defensor is a system-wide lightweight inspecting framework. It can closely monitor the malicious behaviors within and across applications, such as sending SMS to premium rate numbers, stealing privacy from the compromised device and getting root privileges through root exploits. This type of monitor is mandatory. Any application installed on the phone and any component including malicious native code can't bypass it. Defensor can not only rebuild the high level behaviors from system calls, but also extract the context information that the behavior runs in. Context-based information likes background and foreground contributes a lot to the accuracy of malware detection. We have tested Defensor on real malware to prove its effectiveness. Finally, an experimental evaluation showing that the overhead introduced by Defensor is limited.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"88 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120867309","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

A Proposal for a Reference Architecture for Long-Term Archiving, Preservation, and Retrieval of Big Data 大数据长期存档、保存和检索的参考体系结构建议

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.80

Phillip Viana, L. Sato

引用次数: 11

Proofs of Ownership and Retrievability in Cloud Storage 云存储中的所有权证明和可检索性

2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications Pub Date : 2014-09-24 DOI: 10.1109/TrustCom.2014.44

Ruiying Du, L. Deng, J. Chen, Kun He, Minghui Zheng

{"title":"Proofs of Ownership and Retrievability in Cloud Storage","authors":"Ruiying Du, L. Deng, J. Chen, Kun He, Minghui Zheng","doi":"10.1109/TrustCom.2014.44","DOIUrl":"https://doi.org/10.1109/TrustCom.2014.44","url":null,"abstract":"With the development and maturity of cloud computing technology, the demand for cloud storage is growing. Deduplication is a basic requirement for cloud storage to save storage space of cloud servers. And as clients are untrusted from the perspective of the server, the notion of Proofs of Ownership (PoWs) has been proposed in client-side deduplication. On the other hand, the clients cannot completely trust the server either, thus clients have to know whether their files are stored integrally in the cloud. However, most existing works only focus on one-way validation. In this paper, we introduce a framework called Proofs of Ownership and Retrievability (PoOR) considering the requirement of mutual validation. In our PoOR scheme, clients can prove to the server their ownership of files and verify the retrievability of the files without uploading or downloading them. For ensuring the recoverability and security of files in server, we encode files by erasure code. In order to keep the communication cost in constant, we employ Merkle Tree and homomorphic verifiable tags which also induce acceptable storage overheads. At last, we implemente our scheme and compare it with other schemes. The result shows that the PoOR scheme is efficient in computation performance, especially when the size of the file is large.","PeriodicalId":268788,"journal":{"name":"2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"4 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":"127602991","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}

引用次数: 18