{"title":"A Patient-Centric Attribute Based Access Control Scheme for Secure Sharing of Personal Health Records Using Cloud Computing","authors":"H. S. G. Pussewalage, V. Oleshchuk","doi":"10.1109/CIC.2016.020","DOIUrl":"https://doi.org/10.1109/CIC.2016.020","url":null,"abstract":"Personal health records (PHR) are an emerging health information exchange model, which facilitates PHR owners to efficiently share their private health data among a variety of users including healthcare professionals as well as family and friends. PHRs are usually outsourced and stored in third-party cloud platforms which relieves PHR owners from the burden of managing their PHR data while achieving better availability of health data. However, outsourcing private health data raises significant privacy concerns because there is a higher risk of leaking health information to unauthorized parties. To ensure PHR owners' control of their outsourced PHR data, attribute based encryption (ABE) mechanisms have been considered. However, such existing PHR solutions suffer from inflexibility in access especially due to the limitations associated with ABE mechanisms. In this paper, we propose a patient-centric, attribute based PHR sharing scheme which can provide flexible access for both professional users such as doctors as well as personal users such as family and friends. In the proposed solution, each PHR file is encrypted and stored in a healthcare cloud along with an attribute based access policy which controls the access to the encrypted resource. We use an attribute based authorization mechanism to authorize access requesting users to access a given PHR resource based on the associated access policy while utilizing a proxy re-encryption scheme to facilitate the authorized users to decrypt the required PHR files. Furthermore, we have demonstrated that the proposed scheme can overcome the access inflexibility issues associated with the existing ABE based PHR sharing schemes while maintaining an adequate level of security and privacy.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134392181","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":"Business Process Tasks-Assignment and Resource Allocation in Crowdsourcing Context","authors":"Kahina Bessai, F. Charoy","doi":"10.1109/CIC.2016.016","DOIUrl":"https://doi.org/10.1109/CIC.2016.016","url":null,"abstract":"Crowdsourcing is important paradigm in human problem solving using the Web. When they face a workloadoutburst, businesses may choose outsource certain or all ofprocess tasks to the crowd in order to not compromise thequality of service promised for their customers. This may occur in situations like crisis management, when organisation are overloaded by a sudden event breakout. These tasks are generally difficult to implement as solution based on software service only. So, the use of crowdsourcing platform seems enticing.To ensure efficient and wise use of resources, decision makingaids methods need to be developed in which the aim is to assist businesses in choosing the most knowledgeable workers. In this paper we address the resource allocation problem in crisis context by defining a delegation approach based on crowd-sourcing as resource provider. Firstly, we propose a mathematical model for business process execution in crowd-sourcing context and anexact optimization algorithm. Secondly, as the problem addressed here is NP-complete, we propose an efficient algorithm, as shown by a series of experiments, to deal with the considered problem.Furthermore, to overcome the limitations of existing workswe take here the fact that business process tasks are dependent while optimizing the overall execution time of a given business process instance under budget constraint.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131446917","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":"Collaborative Scientific Workflow Composition as a Service: An Infrastructure Supporting Collaborative Data Analytics Workflow Design and Management","authors":"Jia Zhang, Q. Bao, Xiaoyi Duan, Shiyong Lu, Lijun Xue, Runyu Shi, P. Tang","doi":"10.1109/CIC.2016.039","DOIUrl":"https://doi.org/10.1109/CIC.2016.039","url":null,"abstract":"The need for collaborative data analytics increases significantly when confronted with the challenges of big data. Although workflow tools offer a formal way to define, automate, and repeat multi-step computational procedures, designing complex data processing workflow requires collaboration from multiple people with complementary expertise. Existing tools are not suitable to support collaborative design of comprehensive workflows. To address such a challenge, this paper reports the design and development of a software infrastructure with the capability of supporting collaborative data-oriented workflow composition and management, adding a key component to existing cyberinfrastructure that will support big data collaboration through the Internet. A collaborative provenance query model (CPM) is presented together with graph-based patterns and algebra. A hypergraph theory-based provenance mining technique is reported. The research extends an existing open-source workflow tool, by adding system-level facilities to support human interaction and cooperation that are essential for an effective and efficient scientific collaboration.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114640303","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":"Differentially Private Distributed Data Analysis","authors":"Hassan Takabi, Samir Koppikar, S. Zargar","doi":"10.1109/CIC.2016.038","DOIUrl":"https://doi.org/10.1109/CIC.2016.038","url":null,"abstract":"Users' data analysis has become widespread these days; however, privacy of users is a great concern, specifically, if these data are collected from several sources or shared with multiple entities. One example of distributed analysis is to aggregate statistics of users. Differential Privacy has been proved as a proper tool to perturb the aggregate results. Its previous deployment techniques have several limitations, e.g., they mostly support centralized databases and are prone to collusion in a distributed setting, they pose a trade-off between privacy and utility or they are inefficient in terms of communication and computation costs.To address these issues, we present DstrDP (Distributed Differential Privacy) protocol for private data aggregation. The goal is to generate differentially private aggregate results from distributed databases. In particular, DstrDP focuses on count queries and employs Laplace perturbation mechanism. DstrDP generates Laplace noise in a way that maintains the optimal utility of users' data while does not rely on any trusted party and is resistant to collusion as long as the decryption key remains confidential. We describe our proposed approach and using decision tree classifier as a case study and show that DstrDP can protect the privacy of intermediate results and confirm the efficiency of our protocol by evaluating its performance.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116525584","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":"Monitoring Collective Attention During Disasters","authors":"Xingsheng He, Y. Lin","doi":"10.1109/CIC.2016.068","DOIUrl":"https://doi.org/10.1109/CIC.2016.068","url":null,"abstract":"The proliferation of vast information shared through social media and other communication technologies has led us to an era of attention scarcity. Effective crisis response requires both a systematic understanding of how collective attention emerges during disaster events and robust techniques for monitoring the public's attention shift due to the events.However, \"attention\" is an abstract concept that is very challenging to characterize. In this work, we propose an attention shift network to systematically analyze the dynamics of collective attention in response to real-world exogenous shocks such as disasters. Using hashtags appeared in Twitter users' complete timelines around a violent terrorist attack -- the Paris attacks occurred on November 13, 2015 -- we thoroughly investigate the properties of network structures and reveal the temporal dynamics of the collective attention under both regular time and exogenous shock.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127687931","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":"QL-SimP: Query Language for Secure Interoperable Multi-Granular Provenance Framework","authors":"A. A. Jabal, E. Bertino","doi":"10.1109/CIC.2016.029","DOIUrl":"https://doi.org/10.1109/CIC.2016.029","url":null,"abstract":"We propose a query language for a secure interoperable multi-granular provenance framework. The proposed language is independent of the underlying provenance representation and supports different types of provenance queries. We have implemented the query language into our provenance framework which is integrated with CRIS - a real world system for managing scientific data. We have also evaluated our provenance queries based on relational and graph databases.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132439067","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}
Davide Alberto Albertini, B. Carminati, E. Ferrari
{"title":"Privacy Settings Recommender for Online Social Network","authors":"Davide Alberto Albertini, B. Carminati, E. Ferrari","doi":"10.1109/CIC.2016.079","DOIUrl":"https://doi.org/10.1109/CIC.2016.079","url":null,"abstract":"In recent years Relationship Based Access Control (ReBAC) has become the reference paradigm for controlled information sharing in Online Social Network (OSN) scenarios. Nevertheless, many of the most popular OSN providers do not implement in their platforms an access control model fully compliant with ReBAC. This fact, thus, limits the capability of OSN users to define customized and fine-grained access control policies. Moreover, average users might have difficulties in properly setting, potentially, complex access control policies. As results, many users give up in defining proper privacy setting, simply accepting the default setting proposed by OSN provider. To cope with this problem, we see the need of tools in support of policy specification. At this aim, in this paper we presenta recommendation system that, exploiting an association rules mining process, learns OSN users' habits in releasing resources in online social networks, and exploit them to suggest customized access control policies. We also prove the feasibility of the presented techniques by illustrating an experiment which has been conducted on 30 human users by building customized access control policies from the data learnt from each of them.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132459458","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 Measuring Knowledge Exposure in Online Social Networks","authors":"A. Masoumzadeh, Andrew Cortese","doi":"10.1109/CIC.2016.080","DOIUrl":"https://doi.org/10.1109/CIC.2016.080","url":null,"abstract":"We propose a novel metric to measure users' exposure to various pieces of knowledge in an Online Social Network (OSN). Knowledge exposure considers not only the availability of information to users but also the effort it takes to discover it. We calculate knowledge exposure by performing link analysis on a navigation graph that models OSN's user interface. Our experiments show that the proposed metric can discriminate among pieces of knowledge based on how they are presented to users. We expect such an exposure metric to be useful as an input to privacy control policies and to enhance user privacy management in social networking environments in general.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127119755","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 Dynamic Privacy Aware Access Control Model for Location Based Services","authors":"Leila Karimi, Balaji Palanisamy, J. Joshi","doi":"10.1109/CIC.2016.084","DOIUrl":"https://doi.org/10.1109/CIC.2016.084","url":null,"abstract":"The proliferation of Location Based Services (LBSs) and Geo Social Networks (GSNs) significantly increase the exposure risks of location information leading to leakage of sensitive information. Location privacy preserving methods are designed to provide a specified level of privacy based on some pre-defined privacy guarantees such as k-anonymity and e-differential privacy. In certain situations, we note that users would need different privacy protection levels based on their relationships and trust associated with the users of the exposed location data. For instance, users of a location-based social network may need a smaller privacy protection level in interaction with their close friends and a larger privacy protection level in relationship with public users. In this paper, we present a privacy aware access control model that provides different location privacy protection levels based on various access control list of users. The proposed privacy preserving access control model not only preserves the confidentiality of access control policy but also provides an efficient mechanism for grant and revoke of authorizations.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127157990","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":"Modeling Data-Plane Power Consumption of Future Internet Architectures","authors":"Chen Chen, David Barrera, A. Perrig","doi":"10.1109/CIC.2016.031","DOIUrl":"https://doi.org/10.1109/CIC.2016.031","url":null,"abstract":"With current efforts to design Future Internet Architectures (FIAs), the evaluation and comparison of different proposals is an interesting research challenge. Previously, metrics such as bandwidth or latency have commonly been used to compare FIAs to IP networks. We suggest the use of power consumption as a metric to compare FIAs. While low power consumption is an important goal in its own right (as lower energy use translates to smaller environmental impact as well as lower operating costs), power consumption can also serve as a proxy for other metrics such as bandwidth and processor load. Lacking power consumption statistics about either commodity FIA routers or widely deployed FIA testbeds, we propose models for power consumption of FIA routers. Based on our models, we simulate scenarios for measuring power consumption of content delivery in different FIAs. Specifically, we address two questions: 1) which of the proposed FIA candidates achieves the lowest energy footprint; and 2) which set of design choices yields a power-efficient network architecture? Although the lack of real-world data makes numerous assumptions necessary for our analysis, we explore the uncertainty of our calculations through sensitivity analysis of input parameters.","PeriodicalId":438546,"journal":{"name":"2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129258341","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}