{"title":"Performance of Cooperative Firewalls in Real-World Deployments","authors":"Nishant Patanaik, A. Goulart","doi":"10.1109/Trustcom.2015.359","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.359","url":null,"abstract":"The concept of cooperative firewalls or customer edge switching (CES) has been proposed to establish secure communication sessions between public and private domains in the global Internet. It allows public (or private) domains to initiate a trusted communication session with a private domain, by using the private host's fully qualified domain name (FQDN) instead of its IP addresses. However, this concept requires further evaluation in real-world scenario deployments that could benefit from having cooperative firewalls. The scenario addressed in this paper is Internet of Things (IoT). An analytical model was developed to estimate the performance in terms of session setup delays and number of servers required for the Customer Edge Traversal Protocol (CETP) to support a large number of IP-based devices.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121420178","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}
F. Auricchio, M. Ferretti, A. Lefieux, M. Musci, A. Reali, S. Trimarchi, A. Veneziani
{"title":"Assessment of a Black-Box Approach for a Parallel Finite Elements Solver in Computational Hemodynamics","authors":"F. Auricchio, M. Ferretti, A. Lefieux, M. Musci, A. Reali, S. Trimarchi, A. Veneziani","doi":"10.1109/Trustcom.2015.633","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.633","url":null,"abstract":"Numerical approximation of blood flow has emerged in the last 20 years as a tool to investigate physiopathology of the circulation, moving from a proof-of-concept to a clinical stage. By merging medical images with numerical models it is possible to support the decision-making process of surgeons and doctors in general. In particular, the iCardioCloud project aims at establishing a framework to perform a complete patient-specific hemodynamics analysis for aortic diseases such as dissections, occlusions and aneurysms. From a computer science standpoint, such a project faces multiple challenges. First of all the dimension of the problem in terms of number of equations to be solved for each patient is in general huge and thus it requires massively parallel methods. In addition, clinical timeline demands for efficiency, since availability of results -- at least in an emergency scenario -- should be granted in few hours from data retrieval. Therefore it is mandatory to develop a good implementation on high-end parallel systems, such as large clusters or even supercomputers. Unfortunately, it is not straightforward to obtain an efficient implementation on such machines. In this paper we discuss a parallel implementation obtained with a black-box approach, that is set up by assembling existing packages and libraries and in particular LifeV, a finite element library developed for Computational Fluid Dynamics. The ultimate goal is to assess if the application can be solved efficiently and which is the parallel paradigm that best matches the computational requirements.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123841929","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":"Countermeasure Security Risks Management in the Internet of Things Based on Fuzzy Logic Inference","authors":"Igor Kotenko, I. Saenko, S. Ageev","doi":"10.1109/Trustcom.2015.431","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.431","url":null,"abstract":"Systems based on the concept of 'Internet of Things' (IoT) are known for multi-tiered architecture, variety and a great number of energy constrained 'things', the influence of new types of attacks, the incompleteness and ambiguity of their parameters. For these reasons, risk management in IoT could be improved by application of fuzzy data processing. The paper considers the main approaches to the construction of intelligent methods and algorithms of information security risk assessment and management for IoT. Mathematical models for security risk assessment in IoT are proposed and investigated. In relation to the concept of multi-agent network control, the Mamdani fuzzy inference procedures for risk assessment and management are developed. Procedures for fuzzy clustering, classification and ranking of security threats are outlined. The experimental results show high stability of the developed security risks management algorithms to uncertainties of input variables.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"19 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124008642","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":"Group Sparsity Tensor Factorization for De-anonymization of Mobility Traces","authors":"Takao Murakami, Atsunori Kanemura, H. Hino","doi":"10.1109/Trustcom.2015.427","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.427","url":null,"abstract":"The de-anonymization attack using personalized transition matrices is known as one of the most successful approaches to link anonymized traces with users. However, since many users disclose only a small amount of location information to the public in their daily lives, the amount of training data available to the adversary can be very small. The aim of this paper is to quantify the risk of de-anonymization in this realistic situation. To achieve this aim, we utilize the fact that spatial data can form group structure, and propose group sparsity tensor factorization to train the personalized transition matrices that capture spatial group structure from a small amount of training data. We apply our training method to the de-anonymization attack, and evaluate it using the Geolife dataset. The results show that the training method using tensor factorization outperforms the Maximum Likelihood estimation method, and is further improved by incorporating group sparsity regularization.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124620136","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 Scalable Data Hiding Scheme Using Hilbert Space Curve and Chaos","authors":"Gyan Singh Yadav, A. Ojha","doi":"10.1109/Trustcom.2015.463","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.463","url":null,"abstract":"Data hiding techniques using visual cryptography use images as data carriers in such a way that human visual system cannot perceive any modifications in the images. Extensive work has been done on data hiding using gray scale images during the last two decades. Embedding capacity, visual quality of the stego-image, security and the complexity of the embedding algorithm are four main criteria in evaluating the performance of a data hiding scheme. In the present paper, a data hiding scheme is proposed that performs well on two important aspects - data security and embedding capacity while maintaining the quality of the stego-image. The proposed algorithm employs Hilbert space curve and chaotic maps to find out secure data locations with enhanced data security. The method is scalable for large data size and is also computationally convenient. Numerical results demonstrate effectiveness of the proposed algorithm.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124984622","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":"DPBSV -- An Efficient and Secure Scheme for Big Sensing Data Stream","authors":"Deepak Puthal, S. Nepal, R. Ranjan, Jinjun Chen","doi":"10.1109/Trustcom.2015.381","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.381","url":null,"abstract":"Stream processing has become an important paradigm for the massive real-time processing of continuous data flows in large scale sensor networks. While dealing with big data streams in sensor networks, Stream Processing Engines (SPEs) must always verify the authenticity, and integrity of the data as the medium of communication is untrusted, as malicious attackers could access and modify the data. Existing technologies for data security verification are not suitable for data streaming applications, as the verification in real time introduces significant overheads. In this paper, we propose a Dynamic Prime Number Based Security Verification (DPBSV) scheme for big data stream processing. Our scheme is based on a common shared key that is updated dynamically by generating synchronized pairs of prime numbers. Theoretical analyses and experimental results of our DPBSV scheme show that it can significantly improve the efficiency as compared to existing approaches by reducing the security verification overhead. Our approach not only reduces the verification time, but also strengthens the security of the data by constantly updating the shared keys.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130903577","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":"The Role of Risk Perceptions in Privacy Concerns Evaluation","authors":"Anna Rohunen, Jouni Markkula","doi":"10.1109/Trustcom.2015.479","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.479","url":null,"abstract":"The collection of information on individual persons for personal data intensive systems and services poses the risk of privacy violations and raises privacy concerns. Individuals' privacy concerns and risk perceptions affect their decision-making on personal data disclosure for services. In the research presented in this paper, data subjects' privacy concerns and risk perceptions were studied by surveying drivers on the possibility of collecting driving data on their vehicles. The research sought to explore the following questions: (1) How are data subjects' risk perceptions related to their privacy concerns, (2) how do risk perceptions and privacy concerns jointly affect willingness to disclose data, (3) how should risk perceptions be incorporated into evaluation of data subjects' privacy behavior? The study's primary findings were as follows: (1) surprisingly, clear dependencies between risk perceptions and privacy concerns were not found, (2) data subjects risk perceptions and two privacy concerns-related factors independently affected their willingness to disclose data -- the two privacy concerns-related factors were the data subjects' perceptions of other drivers' privacy concerns and their discussing information privacy with other drivers, (3) risk perceptions, in combination with privacy concerns, should be incorporated into the data subjects' privacy behavior evaluations. The results of the study contribute to improving the validity of privacy behavior measurements and models.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121949033","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":"Data Mobility Management Model for Active Data Cubes","authors":"T. Dang, D. Hoang, P. Nanda","doi":"10.1109/Trustcom.2015.443","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.443","url":null,"abstract":"Cloud computing dramatically reduces the expense and complexity of managing IT systems. Business customers do not need to invest in their own costly IT infrastructure, but can delegate and deploy their services effectively to cloud vendors and service providers. A number of security and protection mechanisms have been proposed to prevent the disclosure of sensitive information or tempering with the data by employing various policy, encryption, and monitoring approaches. However, few efforts have been focused on data mobility issues in terms of protection of data when it is moved within a cloud or to and from a new cloud environment. To allay users' concern of data control, data ownership, security and privacy, we propose a novel data mobility management model which ensures continuity protecting data at new cloud hosts at new data locations. The model provides a mobility service to handle data moving operation that relies on a new location database service. The new model allows the establishment of a proxy supervisor in the new environment and the ability of the active data to record its own location. The experimental outcomes demonstrate the feasibility, proactivity, and efficiency by the full mobility management model.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"7 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120998652","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}
Ayman Tarakji, Alexander Gladis, Tarek Anwar, R. Leupers
{"title":"Enhanced GPU Resource Utilization through Fairness-aware Task Scheduling","authors":"Ayman Tarakji, Alexander Gladis, Tarek Anwar, R. Leupers","doi":"10.1109/Trustcom.2015.611","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.611","url":null,"abstract":"Underutilization as well as oversubscription of processing resources are common problems in current accelerator-based computing systems. Facing these challenges will require intelligent algorithms for scheduling parallel workloads on accelerators. The general aim of this paper is to achieve fair distribution of the tremendous computation power of modern devices among running applications towards enhancing resource utilization. Given a set of real applications, we evaluate our model and explore the advantages of multi-tasking and concurrency on current GPUs.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126898033","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":"An Entropy-Based Distributed DDoS Detection Mechanism in Software-Defined Networking","authors":"Rui Wang, Zhiping Jia, Lei Ju","doi":"10.1109/Trustcom.2015.389","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.389","url":null,"abstract":"Software-Defined Networking (SDN) and OpenFlow (OF) protocol have brought a promising architecture for the future networks. However, the centralized control and programmable characteristics also bring a lot of security challenges. Distributed denial-of-service (DDoS) attack is still a security threat to SDN. To detect the DDoS attack in SDN, many researches collect the flow tables from the switch and do the anomaly detection in the controller. But in the large scale network, the collecting process burdens the communication overload between the switches and the controller. Sampling technology may relieve this overload, but it brings a new tradeoff between sampling rate and detection accuracy. In this paper, we first extend a copy of the packet number counter of the flow entry in the OpenFlow table. Based on the flow-based nature of SDN, we design a flow statistics process in the switch. Then, we propose an entropy-based lightweight DDoS flooding attack detection model running in the OF edge switch. This achieves a distributed anomaly detection in SDN and reduces the flow collection overload to the controller. We also give the detailed algorithm which has a small calculation overload and can be easily implemented in SDN software or programmable switch, such as Open vSwitch and NetFPGA. The experimental results show that our detection mechanism can detect the attack quickly and achieve a high detection accuracy with a low false positive rate.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126003141","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}