Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856747
Aiman Ghannami, C. Shao
Although Software-Defined Networking (SDN) is a mature paradigm, failure recovery and management in SDN still need much research attention. OpenFlow, as an implementation of SDN, provides flexible and abstracted approach to configure SDN networks. This Paper focuses on failure recovery mechanism using OpenFlow. The proposed mechanism is divided into: (a) computing the working paths proactively between each source-destination pair and return a list of paths ordered by-path latency from shortest to longest path, (b)implement per-Link Bidirectional Forwarding Detection(BFD) for failure detection, to enable fast detection time, thus fast recovery time, (d) configure OpenFlow Fast Failover Group for restoration such that, the highest-priority bucket to be linked to the shortest path, the second highest-priority bucket linked to the second shortest path and so on. Upon failure, the switch will revert to the second fastest path, (e) to achieve high resource utilization, OpenFlow Select Group used to split the flow among the working paths. The proposed architecture of this work provides high utilization of network resources in addition to efficient fast detection and recovery time. As the evaluation shows, the usage of multipath routing with fast failover scheme provide much resource utilization and fast recovery time.
{"title":"Efficient fast recovery mechanism in Software-Defined Networks: Multipath routing approach","authors":"Aiman Ghannami, C. Shao","doi":"10.1109/ICITST.2016.7856747","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856747","url":null,"abstract":"Although Software-Defined Networking (SDN) is a mature paradigm, failure recovery and management in SDN still need much research attention. OpenFlow, as an implementation of SDN, provides flexible and abstracted approach to configure SDN networks. This Paper focuses on failure recovery mechanism using OpenFlow. The proposed mechanism is divided into: (a) computing the working paths proactively between each source-destination pair and return a list of paths ordered by-path latency from shortest to longest path, (b)implement per-Link Bidirectional Forwarding Detection(BFD) for failure detection, to enable fast detection time, thus fast recovery time, (d) configure OpenFlow Fast Failover Group for restoration such that, the highest-priority bucket to be linked to the shortest path, the second highest-priority bucket linked to the second shortest path and so on. Upon failure, the switch will revert to the second fastest path, (e) to achieve high resource utilization, OpenFlow Select Group used to split the flow among the working paths. The proposed architecture of this work provides high utilization of network resources in addition to efficient fast detection and recovery time. As the evaluation shows, the usage of multipath routing with fast failover scheme provide much resource utilization and fast recovery time.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121431505","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856688
Alessandro Greco, A. Caponi, G. Bianchi
The fast evolving nature and the growing complexity of modern offensive techniques used in Advanced Persistent Threats attacks calls for innovative approaches to defense techniques. Common network monitoring solutions fail in case of attacks able to remain silent and quietly control the network for long periods of time. Indeed, such type of attacks requires the deployment of security functionality able to recognize the so called lateral movements, exploited by the attackers to spread the infection inside the network. The implementation of a distributed monitoring infrastructure exploiting innovative detection approaches allows to overcome the lack of a single monitoring point and successfully detect complex behavior of lateral movements. In this paper we demonstrate how to effectively use eXtended Finite State Machine patterns to face a set of commonly used lateral movement techniques, including IP spoofing ones.
{"title":"Facing lateral movements using widespread behavioral probes","authors":"Alessandro Greco, A. Caponi, G. Bianchi","doi":"10.1109/ICITST.2016.7856688","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856688","url":null,"abstract":"The fast evolving nature and the growing complexity of modern offensive techniques used in Advanced Persistent Threats attacks calls for innovative approaches to defense techniques. Common network monitoring solutions fail in case of attacks able to remain silent and quietly control the network for long periods of time. Indeed, such type of attacks requires the deployment of security functionality able to recognize the so called lateral movements, exploited by the attackers to spread the infection inside the network. The implementation of a distributed monitoring infrastructure exploiting innovative detection approaches allows to overcome the lack of a single monitoring point and successfully detect complex behavior of lateral movements. In this paper we demonstrate how to effectively use eXtended Finite State Machine patterns to face a set of commonly used lateral movement techniques, including IP spoofing ones.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115337024","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856734
Pedro Roger Magalhães Vasconcelos, G. A. Freitas, T. Marques
Virtualization is an important technology in data center environment due to its useful features such as server consolidation, power saving, live migration and faster server provisioning. However, virtualization sometimes incurs some performance loss. There are many virtualization approaches including full virtualization and operating system-level virtualization. Different virtualization platforms differ in terms of features, performance and virtualization overhead. Thus, one platform can be more suitable to certain kind of application than another. Applications being virtualized also differ in resource usage. Web conferencing systems become popular as the clients' bandwidth has increased in last years, in educational, researching and business fields. The BigBlueButton is a web conferencing system that allows multiple users join a conference room, having classes and share their microphone, webcam, desktop and files. In this paper, we use KVM and OpenVZ as virtualization platforms to deploy conference systems using BigBlueButton. We explore its virtual performance under a real-world workload and a set of benchmarks that stress different aspects such as computing power, latency and memory, I/O and network bandwidth. These results can be a valuable information to be taken in account by systems administrators, for capacity planning and systems designing. Which, in turn, lead to cost savings for companies.
{"title":"Virtualization technologies in web conferencing systems: A performance overview","authors":"Pedro Roger Magalhães Vasconcelos, G. A. Freitas, T. Marques","doi":"10.1109/ICITST.2016.7856734","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856734","url":null,"abstract":"Virtualization is an important technology in data center environment due to its useful features such as server consolidation, power saving, live migration and faster server provisioning. However, virtualization sometimes incurs some performance loss. There are many virtualization approaches including full virtualization and operating system-level virtualization. Different virtualization platforms differ in terms of features, performance and virtualization overhead. Thus, one platform can be more suitable to certain kind of application than another. Applications being virtualized also differ in resource usage. Web conferencing systems become popular as the clients' bandwidth has increased in last years, in educational, researching and business fields. The BigBlueButton is a web conferencing system that allows multiple users join a conference room, having classes and share their microphone, webcam, desktop and files. In this paper, we use KVM and OpenVZ as virtualization platforms to deploy conference systems using BigBlueButton. We explore its virtual performance under a real-world workload and a set of benchmarks that stress different aspects such as computing power, latency and memory, I/O and network bandwidth. These results can be a valuable information to be taken in account by systems administrators, for capacity planning and systems designing. Which, in turn, lead to cost savings for companies.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"317 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131052154","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856749
Benfilali Mostefa, Sofiane Boukli-Hacene
The main obstacle to transmit images in wireless sensor networks is the lack of an appropriate strategy for processing the large volume of data such as images. The high rate packets errors because of what numbers very high packets carrying the data of the captured images and the need for retransmission in case of errors, and more, the energy reserve and band bandwidth is insufficient to accomplish these tasks. This paper presents new effective technique called “Background subtraction” to compress, process and transmit the images in a wireless sensor network. The practical results show the effectiveness of this approach to make the image compression in the networks of wireless sensors achievable, reliable and efficient in terms of energy and the minimization of amount of image data.
{"title":"Adaptive image compression in wireless sensor networks","authors":"Benfilali Mostefa, Sofiane Boukli-Hacene","doi":"10.1109/ICITST.2016.7856749","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856749","url":null,"abstract":"The main obstacle to transmit images in wireless sensor networks is the lack of an appropriate strategy for processing the large volume of data such as images. The high rate packets errors because of what numbers very high packets carrying the data of the captured images and the need for retransmission in case of errors, and more, the energy reserve and band bandwidth is insufficient to accomplish these tasks. This paper presents new effective technique called “Background subtraction” to compress, process and transmit the images in a wireless sensor network. The practical results show the effectiveness of this approach to make the image compression in the networks of wireless sensors achievable, reliable and efficient in terms of energy and the minimization of amount of image data.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115037167","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856660
Oleg Garasym, I. Taralova, R. Lozi
The increasing number of e-transactions requires more secure and innovative schemes for secure information storage and transmission. Since the encryption should be unique for each transaction, there is a big necessity of new generators of very huge numbers of encryption keys, and chaotic random number generators seem to be perfectly suitable for this application. In this paper a new robust, gigaperiodic and simple in implementation chaotic generator is proposed. The generator construction is based on the principle of ring-coupling. The proposed chaotic generator successfully passed statistical and analytical tests: NIST, largest Lyapunov exponent, autocorrelation, cross-correlation, uniform distribution. For the best precision of uniform distribution, approximate density function has been applied, the distribution errors are analyzed by written software. The resulting chaotic system promises the designed robust implementation to cryptosystems.
{"title":"Key requirements for the design of robust chaotic PRNG","authors":"Oleg Garasym, I. Taralova, R. Lozi","doi":"10.1109/ICITST.2016.7856660","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856660","url":null,"abstract":"The increasing number of e-transactions requires more secure and innovative schemes for secure information storage and transmission. Since the encryption should be unique for each transaction, there is a big necessity of new generators of very huge numbers of encryption keys, and chaotic random number generators seem to be perfectly suitable for this application. In this paper a new robust, gigaperiodic and simple in implementation chaotic generator is proposed. The generator construction is based on the principle of ring-coupling. The proposed chaotic generator successfully passed statistical and analytical tests: NIST, largest Lyapunov exponent, autocorrelation, cross-correlation, uniform distribution. For the best precision of uniform distribution, approximate density function has been applied, the distribution errors are analyzed by written software. The resulting chaotic system promises the designed robust implementation to cryptosystems.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115436983","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856680
Al Harthy Khoula, N. Shah, Arun Shankarappa
Ad hoc network is a networking concept, which emerged in the beginning of the 1990's. Also known as Peer to Peer (P2P) network, these types of networks have facilitated connections among computers. Currently, smartphones are connected to each other wirelessly to share information through hotspot ad hoc feature. These types of connections have led to many threats and attacks. There have been limited research efforts in threat detection mechanisms for smartphone hotspot connections. This paper will propose a smartphone hotspot Intrusion Detection system (IDS) which simulates the detection of the attacks (especially DOS attacks), on smartphone hotspot connections. The proposed architecture is realized into a prototype, which takes into account primary and secondary data collected related to threats. The novelty of the proposed system is in utilization of historical logs to take decisions regarding user access to hotspot connections.
{"title":"Smartphone's hotspot security issues and challenges","authors":"Al Harthy Khoula, N. Shah, Arun Shankarappa","doi":"10.1109/ICITST.2016.7856680","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856680","url":null,"abstract":"Ad hoc network is a networking concept, which emerged in the beginning of the 1990's. Also known as Peer to Peer (P2P) network, these types of networks have facilitated connections among computers. Currently, smartphones are connected to each other wirelessly to share information through hotspot ad hoc feature. These types of connections have led to many threats and attacks. There have been limited research efforts in threat detection mechanisms for smartphone hotspot connections. This paper will propose a smartphone hotspot Intrusion Detection system (IDS) which simulates the detection of the attacks (especially DOS attacks), on smartphone hotspot connections. The proposed architecture is realized into a prototype, which takes into account primary and secondary data collected related to threats. The novelty of the proposed system is in utilization of historical logs to take decisions regarding user access to hotspot connections.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"582 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122844762","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856675
Mohammad Al-Smadi, Omar Qawasmeh, Bashar Talafha, M. Al-Ayyoub, Y. Jararweh, E. Benkhelifa
This research proposes a framework for aspect-based sentiment analysis (ABSA) of Hotels' reviews. The proposed framework consists of: (a) a reference human annotated Arabic dataset to support ABSA tasks such as aspect category identification, opinion target expression extraction, and opinion sentiment polarity. The dataset was annotated on both sentence-level and text-level, (b) baseline approach where a Support Vector Machine (SVM) was trained as part of the ABSA tasks, (c) baseline experiments and results, and (d) a common evaluation technique to provide a unified evaluation of future research working on the same dataset and ABSA tasks.
{"title":"An enhanced framework for aspect-based sentiment analysis of Hotels' reviews: Arabic reviews case study","authors":"Mohammad Al-Smadi, Omar Qawasmeh, Bashar Talafha, M. Al-Ayyoub, Y. Jararweh, E. Benkhelifa","doi":"10.1109/ICITST.2016.7856675","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856675","url":null,"abstract":"This research proposes a framework for aspect-based sentiment analysis (ABSA) of Hotels' reviews. The proposed framework consists of: (a) a reference human annotated Arabic dataset to support ABSA tasks such as aspect category identification, opinion target expression extraction, and opinion sentiment polarity. The dataset was annotated on both sentence-level and text-level, (b) baseline approach where a Support Vector Machine (SVM) was trained as part of the ABSA tasks, (c) baseline experiments and results, and (d) a common evaluation technique to provide a unified evaluation of future research working on the same dataset and ABSA tasks.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122694384","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856720
Adnan Ahmed, Pardeep Kumar, Ali Raza Bhangwar, M. Channa
Wireless Sensor Network (WSN) has emerged as useful alternative to provide prompt communication services in mission critical applications such as post disaster relief operations where reliably data delivery in timely manner is utmost important. However, unsupervised nature of such environments makes security of node vulnerable and exposes them various threats such as damage, physical capture and node's misbehavior attacks. Moreover, the data delivery with higher end-to-end delays undermines the benefits of such networks. Recently, trust aware protocols have proved their efficacy in countering node misbehavior attacks. The existing trust aware routing protocols either use single metric (trust) or composite metric (trust and hop count, trust and energy or trust and geographical information) thereby overlooking QoS requirements. Recent research has proved that there can be significant variations in wireless links such as delay, capacity and loss ratio thereby leading to high route instability. Therefore, this paper presents the Secure and QoS aware Routing Protocol (SQRP) that takes into consideration the trust and QoS parameters pertaining to link's quality (transmission rate, link capacity and loss ratio) to select an optimized end-to-end route. This multi-facet strategy helps to maintain the trusted network environment while routing the data using the links that satisfy QoS requirements. Simulation results demonstrate that SQRP achieves improved performance in terms of throughput, delay and link stability.
{"title":"A secure and QoS aware routing protocol for Wireless Sensor Network","authors":"Adnan Ahmed, Pardeep Kumar, Ali Raza Bhangwar, M. Channa","doi":"10.1109/ICITST.2016.7856720","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856720","url":null,"abstract":"Wireless Sensor Network (WSN) has emerged as useful alternative to provide prompt communication services in mission critical applications such as post disaster relief operations where reliably data delivery in timely manner is utmost important. However, unsupervised nature of such environments makes security of node vulnerable and exposes them various threats such as damage, physical capture and node's misbehavior attacks. Moreover, the data delivery with higher end-to-end delays undermines the benefits of such networks. Recently, trust aware protocols have proved their efficacy in countering node misbehavior attacks. The existing trust aware routing protocols either use single metric (trust) or composite metric (trust and hop count, trust and energy or trust and geographical information) thereby overlooking QoS requirements. Recent research has proved that there can be significant variations in wireless links such as delay, capacity and loss ratio thereby leading to high route instability. Therefore, this paper presents the Secure and QoS aware Routing Protocol (SQRP) that takes into consideration the trust and QoS parameters pertaining to link's quality (transmission rate, link capacity and loss ratio) to select an optimized end-to-end route. This multi-facet strategy helps to maintain the trusted network environment while routing the data using the links that satisfy QoS requirements. Simulation results demonstrate that SQRP achieves improved performance in terms of throughput, delay and link stability.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132964600","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856671
Sihem Bensimessaoud, N. Badache, S. Benmeziane, Amina Djellalbia
Today, more and more social network data are published for data analysis. Although this analysis is important, these publications may be targeted by re-identification attacks i.e., where an attacker tries to recover the identities of some nodes that were removed during the anonymization process. Among these attacks, we distinguish “the neighborhood attacks” where an attacker can have background knowledge about the neighborhoods of target victims. Researchers have developed anonymization models similar to k-anonymity, based on edges adding method, but can significantly alter the properties of the original graph. In this work, an enhanced anonymization algorithm based on the addition of fake nodes is proposed, which ensures that the published graph preserves an important utility that is the average path length “APL”.
{"title":"An enhanced approach to preserving privacy in social network data publishing","authors":"Sihem Bensimessaoud, N. Badache, S. Benmeziane, Amina Djellalbia","doi":"10.1109/ICITST.2016.7856671","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856671","url":null,"abstract":"Today, more and more social network data are published for data analysis. Although this analysis is important, these publications may be targeted by re-identification attacks i.e., where an attacker tries to recover the identities of some nodes that were removed during the anonymization process. Among these attacks, we distinguish “the neighborhood attacks” where an attacker can have background knowledge about the neighborhoods of target victims. Researchers have developed anonymization models similar to k-anonymity, based on edges adding method, but can significantly alter the properties of the original graph. In this work, an enhanced anonymization algorithm based on the addition of fake nodes is proposed, which ensures that the published graph preserves an important utility that is the average path length “APL”.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133414681","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}
Pub Date : 2016-12-01DOI: 10.1109/ICITST.2016.7856665
S. Srinivasan
Cloud Computing is in widespread use today because of its many benefits. One of the early concerns was security and it has been shown in multiple studies that cloud security is significantly enhanced by the use of cloud service. Organizations are able to enhance security because of the advanced features that a cloud service provider is able to provide. The availability of high-end resources for all users of cloud services requires making adjustments to business processes. The main thrust of this paper is to show that when business processes involve the use of cloud then there is the potential for the loss of privacy. We will address this aspect extensively in this paper and suggest some solutions to preserve privacy of individuals and organizations. One aspect of this involves the use of Big Data in the cloud. We will point out that the benefits of using the cloud for large volume storage and handling multiple sources of data. Big Data involves not only having access to a vast collection of data from multiple sources but also the ability to combine them to draw conclusions. When data collected by a particular source alone is available, it may not violate the privacy of individuals. We have to view this in light of the ability to re-identify individuals based on the volume of data available from multiple sources.
{"title":"Data privacy concerns involving cloud","authors":"S. Srinivasan","doi":"10.1109/ICITST.2016.7856665","DOIUrl":"https://doi.org/10.1109/ICITST.2016.7856665","url":null,"abstract":"Cloud Computing is in widespread use today because of its many benefits. One of the early concerns was security and it has been shown in multiple studies that cloud security is significantly enhanced by the use of cloud service. Organizations are able to enhance security because of the advanced features that a cloud service provider is able to provide. The availability of high-end resources for all users of cloud services requires making adjustments to business processes. The main thrust of this paper is to show that when business processes involve the use of cloud then there is the potential for the loss of privacy. We will address this aspect extensively in this paper and suggest some solutions to preserve privacy of individuals and organizations. One aspect of this involves the use of Big Data in the cloud. We will point out that the benefits of using the cloud for large volume storage and handling multiple sources of data. Big Data involves not only having access to a vast collection of data from multiple sources but also the ability to combine them to draw conclusions. When data collected by a particular source alone is available, it may not violate the privacy of individuals. We have to view this in light of the ability to re-identify individuals based on the volume of data available from multiple sources.","PeriodicalId":258740,"journal":{"name":"2016 11th International Conference for Internet Technology and Secured Transactions (ICITST)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131986458","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：