m.e computer science cloud computing projects

M.E Computer Science Cloud Computing Projects

Web : www.kasanpro.com Email : [email protected]

List Link : http://kasanpro.com/projects-list/m-e-computer-science-cloud-computing-projects

Title :A Secured Cost-effective Multi-Cloud Storage in Cloud Computing.Language : C#

Project Link : http://kasanpro.com/p/c-sharp/secured-cost-effective-multi-cloud-storage-cloud-computing-module

Abstract : The end of this decade is marked by a paradigm shift of the industrial information technology towards apay-per-use service business model known as cloud computing. Cloud data Storage redefines the security issuestargeted on customer's outsourced data (data that is not stored/retrieved from the costumers own servers). In thiswork we observed that, from a customer's point of view, relying upon a solo SP for his outsourced data is not verypromising. In addition, providing better privacy as well as ensuring data availability can be achieved by dividing theuser's data block into data pieces and distributing them among the available SPs in such a way that no less than athreshold number of SPs can take part in successful retrieval of the whole data block. In this paper, we propose asecured cost-effective multi-cloud storage (SCMCS) model in cloud computing which holds an economical distributionof data among the available SPs in the market, to provide customers with data availability as well as secure storage.Our results show that, our proposed model provides a better decision for customers according to their availablebudgets.

Title :A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public VerifiabilityLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-preserving-remote-data-integrity-checking-protocol

Abstract : Remote data integrity checking is a crucial technology in cloud computing. Recently many works focus onproviding data dynamics and/or public verifiability to this type of protocols. Existing protocols can support bothfeatures with the help of a third party auditor. In a previous work, propose a remote data integrity checking protocolthat supports data dynamics. In this paper, we adapt to support public verifiability. The proposed protocol supportspublic verifiability without help of a third party auditor. In addition, the proposed protocol does not leak any privateinformation to third party verifiers. Through a formal analysis, we show the correctness and security of the protocol.After that, through theoretical analysis and experimental results, we demonstrate that the proposed protocol has agood performance.

Title :Enabling Public Auditability and Data Dynamics For Storage Security in Cloud ComputingLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/public-auditability-data-dynamics-for-storage-security-cloud-computing

Abstract : Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves theapplication software and databases to the centralized large data centers, where the management of the data andservices may not be fully trustworthy. This unique paradigm brings about many new security challenges, which havenot been well understood. This work studies the problem of ensuring the integrity of data storage in Cloud Computing.In particular, we consider the task of allowing a third party auditor (TPA), on behalf of the cloud client, to verify theintegrity of the dynamic data stored in the cloud. The introduction of TPA eliminates the involvement of the clientthrough the auditing of whether his data stored in the cloud is indeed intact. The support for data dynamics via themost general forms of data operation, such as block modification, insertion and deletion, is also a significant steptoward practicality, since services in Cloud Computing are not limited to archive or backup data only. While priorworks on ensuring remote data integrity often lacks the support of either public auditability or dynamic dataoperations, this paper achieves both. We first identify the difficulties and potential security problems of directextensions with fully dynamic data updates from prior works and then show how to construct an elegant verificationscheme for the seamless integration of these two salient features in our design. In particular, to achieve efficient datadynamics, we improve the existing proof of storage models by manipulating block tag authentication. To supportefficient handling of multiple auditing tasks, we further explore the technique of signature to extend our main resultinto a multi-user setting, where TPA can perform multiple auditing tasks simultaneously. Extensive security and

http://kasanpro.com/projects-list/m-e-computer-science-cloud-computing-projects

http://kasanpro.com/p/c-sharp/secured-cost-effective-multi-cloud-storage-cloud-computing-module

http://kasanpro.com/p/c-sharp/privacy-preserving-remote-data-integrity-checking-protocol

http://kasanpro.com/p/c-sharp/public-auditability-data-dynamics-for-storage-security-cloud-computing

performance analysis show that the proposed schemes are highly efficient and provably secure.

Title :Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the CloudLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/dynamic-resource-allocation-efficient-parallel-data-processing-cloud

Abstract : In recent years ad-hoc parallel data processing has emerged to be one of the killer applications forInfrastructure-as-a- Service (IaaS) clouds. Major Cloud computing companies have started to integrate frameworksfor parallel data processing in their product portfolio, making it easy for customers to access these services and todeploy their programs. However, the processing frameworks which are currently used have been designed for static,homogeneous cluster setups and disregard the particular nature of a cloud. Consequently, the allocated computeresources may be inadequate for big parts of the submitted job and unnecessarily increase processing time and cost.In this paper we discuss the opportunities and challenges for efficient parallel data processing in clouds and presentour research project Nephele. Nephele is the first data processing framework to explicitly exploit the dynamicresource allocation offered by today's IaaS clouds for both, task scheduling and execution. Particular tasks of aprocessing job can be assigned to different types of virtual machines which are automatically instantiated andterminated during the job execution. Based on this new framework, we perform extended evaluations ofMapReduce-inspired processing jobs on an IaaS cloud system and compare the results to the popular dataprocessing framework Hadoop.

Title :Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud DataLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-preserving-multi-keyword-ranked-search-encrypted-cloud-data

Abstract : The advent of cloud computing, data owners are motivated to outsource their complex data managementsystems from local sites to commercial public cloud for great flexibility and economic savings. But for protecting dataprivacy, sensitive data has to be encrypted before outsourcing, which obsoletes traditional data utilization based onplaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramount importance.Considering the large number of data users and documents in cloud, it is crucial for the search service to allowmulti-keyword query and provide result similarity ranking to meet the effective data retrieval need. Related works onsearchable encryption focus on single keyword search or Boolean keyword search, and rarely differentiate the searchresults. In this paper, for the first time, we define and solve the challenging problem of privacy-preservingmulti-keyword ranked search over encrypted cloud data (MRSE), and establish a set of strict privacy requirements forsuch a secure cloud data utilization system to become a reality. Among various multi-keyword semantics, we choosethe efficient principle of "coordinate matching", i.e., as many matches as possible, to capture the similarity betweensearch query and data documents, and further use "inner product similarity" to quantitatively formalize such principlefor similarity measurement. We first propose a basic MRSE scheme using secure inner product computation, andthen significantly improve it to meet different privacy requirements in two levels of threat models. Thorough analysisinvestigating privacy and efficiency guarantees of proposed schemes is given, and experiments on the real-worlddataset further show proposed schemes indeed introduce low overhead on computation and communication.


Title :Dynamic Audit Services for Integrity Verification of Outsourced Storages in CloudsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/dynamic-audit-services-integrity-verification-outsourced-storages-clouds

Abstract : In this paper, we propose a dynamic audit service for verifying the integrity of untrusted and outsourcedstorage. Our audit service, constructed based on the techniques, fragment structure, random sampling andindex-hash table, can support provable updates to outsourced data, and timely abnor- mal detection. In addition, wepropose an efficient approach based on probabilistic query and periodic verification for im- proving the performance ofaudit services. Our experimental results not only validate the effectiveness of our approaches, but also show our auditsystem has a lower computation overhead, as well as a shorter extra storage for audit mete- data.

Title :Data integrity proofs in cloud storageLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/data-integrity-proofs-cloud-storage

Abstract : Cloud computing has been envisioned as the de-facto solution to the rising storage costs of IT Enterprises.

http://kasanpro.com/p/c-sharp/dynamic-resource-allocation-efficient-parallel-data-processing-cloud

http://kasanpro.com/p/c-sharp/privacy-preserving-multi-keyword-ranked-search-encrypted-cloud-data

http://kasanpro.com/p/c-sharp/dynamic-audit-services-integrity-verification-outsourced-storages-clouds

http://kasanpro.com/p/c-sharp/data-integrity-proofs-cloud-storage

With the high costs of data storage devices as well as the rapid rate at which data is being generated it proves costlyfor enterprises or individual users to frequently update their hardware. Apart from reduction in storage costs dataoutsourcing to the cloud also helps in reducing the maintenance. Cloud storage moves the user's data to large datacenters, which are remotely located, on which user does not have any control. However, this unique feature of thecloud poses many new security challenges which need to be clearly understood and resolved. We provide a schemewhich gives a proof of data integrity in the cloud which the customer can employ to check the correctness of his datain the cloud. This proof can be agreed upon by both the cloud and the customer and can be incorporated in theService level agreement (SLA).

Title :Optimal Service Pricing for a Cloud CacheLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/optimal-service-pricing-cloud-cache

Abstract : Cloud applications that offer data management services are emerging. Such clouds support caching ofdata in order to provide quality query services. The users can query the cloud data, paying the price for theinfrastructure they use. Cloud management necessitates an economy that manages the service of multiple users inan efficient, but also, resourceeconomic way that allows for cloud profit. Naturally, the maximization of cloud profitgiven some guarantees for user satisfaction presumes an appropriate price-demand model that enables optimalpricing of query services. The model should be plausible in that it reflects the correlation of cache structures involvedin the queries. Optimal pricing is achieved based on a dynamic pricing scheme that adapts to time changes. Thispaper proposes a novel price-demand model designed for a cloud cache and a dynamic pricing scheme for queriesexecuted in the cloud cache. The pricing solution employs a novel method that estimates the correlations of the cacheservices in an time-efficient manner. The experimental study shows the efficiency of the solution.

http://kasanpro.com/ieee/final-year-project-center-tirunelveli-reviews

Title :Secure and Practical Outsourcing of Linear Programming in Cloud ComputingLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/secure-practical-outsourcing-linear-programming-cloud-computing

Abstract : Cloud Computing has great potential of providing robust computational power to the society at reducedcost. It enables customers with limited computational resources to outsource their large computation workloads to thecloud, and economically enjoy the massive computational power, bandwidth, storage, and even appropriate softwarethat can be shared in a pay-per-use manner. Despite the tremendous benefits, security is the primary obstacle thatprevents the wide adoption of this promising computing model, especially for customers when their confidential dataare consumed and produced during the computation. Treating the cloud as an intrinsically insecure computingplatform from the viewpoint of the cloud customers, we must design mechanisms that not only protect sensitiveinformation by enabling computations with encrypted data, but also protect customers from malicious behaviors byenabling the validation of the computation result. Such a mechanism of general secure computation outsourcing wasrecently shown to be feasible in theory, but to design mechanisms that are practically efficient remains a verychallenging problem.

Focusing on engineering computing and optimization tasks, this paper investigates secure outsourcing of widelyapplicable linear programming (LP) computations. In order to achieve practical efficiency, our mechanism designexplicitly decomposes the LP computation outsourcing into public LP solvers running on the cloud and private LPparameters owned by the customer. The resulting flexibility allows us to explore appropriate security/efficiencytradeoff via higher-level abstraction of LP computations than the general circuit representation. In particular, byformulating private data owned by the customer for LP problem as a set of matrices and vectors, we are able todevelop a set of efficient privacy-preserving problem transformation techniques, which allow customers to transformoriginal LP problem into some arbitrary one while protecting sensitive input/output information. To validate thecomputation result, we further explore the fundamental duality theorem of LP computation and derive the necessaryand sufficient conditions that correct result must satisfy. Such result verification mechanism is extremely efficient andincurs close-to-zero additional cost on both cloud server and customers. Extensive security analysis and experimentresults show the immediate practicability of our mechanism design.

Title :Automatic Protocol Blocker for Privacy-Preserving Public Auditing in Cloud ComputingLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-preserving-public-auditing-cloud-computing

Abstract : Cloud Computing is the long dreamed vision of computing as a utility, where users can remotely store their

http://kasanpro.com/p/c-sharp/optimal-service-pricing-cloud-cache


http://kasanpro.com/p/c-sharp/secure-practical-outsourcing-linear-programming-cloud-computing

http://kasanpro.com/p/c-sharp/privacy-preserving-public-auditing-cloud-computing

data into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool ofconfigurable computing resources. By data outsourcing, users can be relieved from the burden of local data storageand maintenance. However, the fact that users no longer have physical possession of the possibly large size ofoutsourced data makes the data integrity protection in Cloud Computing a very challenging and potentially formidabletask, especially for users with constrained computing resources and capabilities. Thus, enabling public auditability forcloud data storage security is of critical importance so that users can resort to an external audit party to check theintegrity of outsourced data when needed. To securely introduce an effective Third Party Auditor (TPA), the followingtwo fundamental requirements have to be met: 1) TPA should be able to efficiently audit the cloud data storagewithout demanding the local copy of data, and introduce no additional on-line burden to the cloud user; 2) The ThirdParty Auditing process should bring in no new vulnerabilities towards user data privacy. In this paper we areextending the previous system by using automatic blocker for privacy preserving public auditing for data storagesecurity in cloud computing. we utilize the public key based homomorphic authenticator and uniquely integrate it withrandom mask technique and automatic blocker. to achieve a privacy-preserving public auditing system for cloud datastorage security while keeping all above requirements in mind. Extensive security and performance analysis showsthe proposed schemes are provably secure and highly efficient.


Title :Automatic Protocol Blocker for Privacy-Preserving Public Auditing in Cloud ComputingLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/privacy-preserving-public-auditing-cloud-computing-code

Abstract : Cloud Computing is the long dreamed vision of computing as a utility, where users can remotely store theirdata into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool ofconfigurable computing resources. By data outsourcing, users can be relieved from the burden of local data storageand maintenance. However, the fact that users no longer have physical possession of the possibly large size ofoutsourced data makes the data integrity protection in Cloud Computing a very challenging and potentially formidabletask, especially for users with constrained computing resources and capabilities. Thus, enabling public auditability forcloud data storage security is of critical importance so that users can resort to an external audit party to check theintegrity of outsourced data when needed. To securely introduce an effective Third Party Auditor (TPA), the followingtwo fundamental requirements have to be met: 1) TPA should be able to efficiently audit the cloud data storagewithout demanding the local copy of data, and introduce no additional on-line burden to the cloud user; 2) The ThirdParty Auditing process should bring in no new vulnerabilities towards user data privacy. In this paper we areextending the previous system by using automatic blocker for privacy preserving public auditing for data storagesecurity in cloud computing. we utilize the public key based homomorphic authenticator and uniquely integrate it withrandom mask technique and automatic blocker. to achieve a privacy-preserving public auditing system for cloud datastorage security while keeping all above requirements in mind. Extensive security and performance analysis showsthe proposed schemes are provably secure and highly efficient.

Title :Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud DataLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/efficient-ranked-keyword-search-outsourced-cloud-data

Abstract : Cloud computing economically enables the paradigm of data service outsourcing. However, to protect dataprivacy, sensitive cloud data has to be encrypted before outsourced to the commercial public cloud, which makeseffective data utilization service a very challenging task. Although traditional searchable encryption techniques allowusers to securely search over encrypted data through keywords, they support only Boolean search and are not yetsufficient to meet the effective data utilization need that is inherently demanded by large number of users and hugeamount of data files in cloud. In this paper, we define and solve the problem of secure ranked keyword search overencrypted cloud data. Ranked search greatly enhances system usability by enabling search result relevance rankinginstead of sending undifferentiated results, and further ensures the file retrieval accuracy. Specifically, we explore thestatistical measure approach, i.e. relevance score, from information retrieval to build a secure searchable index, anddevelop a one-to-many order-preserving mapping technique to properly protect those sensitive score information. Theresulting design is able to facilitate efficient server-side ranking without losing keyword privacy. Thorough analysisshows that our proposed solution enjoys "as-strong-as-possible" security guarantee compared to previous searchableencryption schemes, while correctly realizing the goal of ranked keyword search. Extensive experimental resultsdemonstrate the efficiency of the proposed solution.

Title :Preserving Integrity of Data and Public Auditing for Data Storage Security in Cloud ComputingLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/data-integrity-public-auditing-data-storage-security-cloud-computing

http://kasanpro.com/p/ns2/privacy-preserving-public-auditing-cloud-computing-code

http://kasanpro.com/p/c-sharp/efficient-ranked-keyword-search-outsourced-cloud-data

http://kasanpro.com/p/c-sharp/data-integrity-public-auditing-data-storage-security-cloud-computing

Abstract : Cloud Computing is the long dreamed vision of computing as a utility, where users can remotely store theirdata into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool ofconfigurable computing resources. By data outsourcing, users can be relieved from the burden of local data storageand maintenance. However, the fact that users no longer have physical possession of the possibly large size ofoutsourced data makes the data integrity protection in Cloud Computing a very challenging and potentially formidabletask, especially for users with constrained computing resources and capabilities. Thus, enabling public auditability forcloud data storage security is of critical importance so that users can resort to an external audit party to check theintegrity of outsourced data when needed. To securely introduce an effective third party auditor (TPA), the followingtwo fundamental requirements have to be met: 1) TPA should be able to efficiently audit the cloud data storagewithout demanding the local copy of data, and introduce no additional on-line burden to the cloud user; 2) he thirdparty auditing process should bring in no new vulnerabilities towards user data privacy. In this paper, we utilize anduniquely combine the public key based homomorphic authenticator with random masking to achieve the privacy-preserving public cloud data auditing system, which meets all above requirements. To support efficient handling ofmultiple auditing tasks, we further explore the technique of bilinear aggregate signature to extend our main result intoa multi-user setting, where TPA can perform multiple auditing tasks simultaneously. Extensive security andperformance analysis shows the proposed schemes are provably secure and highly efficient.

Title :Cloud Computing Security: From Single to Multi-CloudsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/cloud-computing-security-from-single-multi-clouds

Abstract : The use of cloud computing has increased rapidly in many organizations. Cloud computing provides manybenefits in terms of low cost and accessibility of data. Ensuring the security of cloud computing is a major factor in thecloud computing environment, as users often store sensitive information with cloud storage providers but theseproviders may be untrusted. Dealing with "single cloud" providers is predicted to become less popular with customersdue to risks of service availability failure and the possibility of malicious insiders in the single cloud. A movementtowards "multi-clouds", or in other words, "interclouds" or "cloud-of-clouds" has emerged recently.

This paper surveys recent research related to single and multi-cloud security and addresses possible solutions. It isfound that the research into the use of multi-cloud providers to maintain security has received less attention from theresearch community than has the use of single clouds. This work aims to promote the use of multi-clouds due to itsability to reduce security risks that affect the cloud computing user.

Title :A Secured Cost-effective Multi-Cloud Storage in Cloud ComputingLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/secured-cost-effective-multi-cloud-storage-cloud-computing

Abstract : The end of this decade is marked by a paradigm shift of the industrial information technology towards apay-per-use service business model known as cloud computing. Cloud data Storage redefines the security issuestargeted on customer's outsourced data (data that is not stored/retrieved from the costumers own servers). In thiswork we observed that, from a customer's point of view, relying upon a solo SP for his outsourced data is not verypromising. In addition, providing better privacy as well as ensuring data availability can be achieved by dividing theuser's data block into data pieces and distributing them among the available SPs in such a way that no less than athreshold number of SPs can take part in successful retrieval of the whole data block. In this paper, we propose asecured cost-effective multi-cloud storage (SCMCS) model in cloud computing which holds an economical distributionof data among the available SPs in the market, to provide customers with data availability as well as secure storage.Our results show that, our proposed model provides a better decision for customers according to their availablebudgets.


Title :A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public VerifiabilityLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/remote-data-integrity-checking-protocol

Abstract : Remote data integrity checking is a crucial technology in cloud computing. Recently many works focus onproviding data dynamics and/or public verifiability to this type of protocols. Existing protocols can support bothfeatures with the help of a third party auditor. In a previous work, propose a remote data integrity checking protocolthat supports data dynamics. In this paper, we adapt to support public verifiability. The proposed protocol supportspublic verifiability without help of a third party auditor. In addition, the proposed protocol does not leak any privateinformation to third party verifiers. Through a formal analysis, we show the correctness and security of the protocol.

http://kasanpro.com/p/c-sharp/cloud-computing-security-from-single-multi-clouds

http://kasanpro.com/p/ns2/secured-cost-effective-multi-cloud-storage-cloud-computing

http://kasanpro.com/p/ns2/remote-data-integrity-checking-protocol

After that, through theoretical analysis and experimental results, we demonstrate that the proposed protocol has agood performance.


Title :Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based EncryptionLanguage : ASP.NET with VB

Project Link : http://kasanpro.com/p/asp-net-with-vb/secure-sharing-personal-health-records-attribute-based-encryption-implement

Abstract : Personal health record (PHR) is an emerging patient-centric model of health information exchange, whichis often outsourced to be stored at a third party, such as cloud providers. However, there have been wide privacyconcerns as personal health information could be exposed to those third party servers and to unauthorized parties. Toassure the patients' control over access to their own PHRs, it is a promising method to encrypt the PHRs beforeoutsourcing. Yet, issues such as risks of privacy exposure, scalability in key management, flexible access andefficient user revocation, have remained the most important challenges toward achieving fine-grained,cryptographically enforced data access control. In this paper, we propose a novel patient-centric framework and asuite of mechanisms for data access control to PHRs stored in semi-trusted servers. To achieve fine-grained andscalable data access control for PHRs, we leverage attribute based encryption (ABE) techniques to encrypt eachpatient's PHR file. Different from previous works in secure data outsourcing, we focus on the multiple data ownerscenario, and divide the users in the PHR system into multiple security domains that greatly reduces the keymanagement complexity for owners and users. A high degree of patient privacy is guaranteed simultaneously byexploiting multi-authority ABE. Our scheme also enables dynamic modification of access policies or file attributes,supports efficient on-demand user/attribute revocation and break-glass access under emergency scenarios.Extensive analytical and experimental results are presented which show the security, scalability and efficiency of ourproposed scheme.

Title :Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based EncryptionLanguage : ASP.NET with C#

Project Link : http://kasanpro.com/p/asp-net-with-c-sharp/secure-sharing-personal-health-records-attribute-based-encryption


Title :Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based EncryptionLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/secure-sharing-personal-health-records-attribute-based-encryption-implement-code

Abstract : Personal health record (PHR) is an emerging patient-centric model of health information exchange, whichis often outsourced to be stored at a third party, such as cloud providers. However, there have been wide privacyconcerns as personal health information could be exposed to those third party servers and to unauthorized parties. Toassure the patients' control over access to their own PHRs, it is a promising method to encrypt the PHRs beforeoutsourcing. Yet, issues such as risks of privacy exposure, scalability in key management, flexible access andefficient user revocation, have remained the most important challenges toward achieving fine-grained,


http://kasanpro.com/p/asp-net-with-vb/secure-sharing-personal-health-records-attribute-based-encryption-implement

http://kasanpro.com/p/asp-net-with-c-sharp/secure-sharing-personal-health-records-attribute-based-encryption

http://kasanpro.com/p/c-sharp/secure-sharing-personal-health-records-attribute-based-encryption-implement-code

cryptographically enforced data access control. In this paper, we propose a novel patient-centric framework and asuite of mechanisms for data access control to PHRs stored in semi-trusted servers. To achieve fine-grained andscalable data access control for PHRs, we leverage attribute based encryption (ABE) techniques to encrypt eachpatient's PHR file. Different from previous works in secure data outsourcing, we focus on the multiple data ownerscenario, and divide the users in the PHR system into multiple security domains that greatly reduces the keymanagement complexity for owners and users. A high degree of patient privacy is guaranteed simultaneously byexploiting multi-authority ABE. Our scheme also enables dynamic modification of access policies or file attributes,supports efficient on-demand user/attribute revocation and break-glass access under emergency scenarios.Extensive analytical and experimental results are presented which show the security, scalability and efficiency of ourproposed scheme.

Title :Scalable and Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based EncryptionLanguage : PHP

Project Link : http://kasanpro.com/p/php/secure-sharing-personal-health-records-attribute-based-encryption-module



Title :Mining Contracts for Business Events and Temporal Constraints in Service EngagementsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/mining-contracts-business-events-temporal-constraints-service-engagements

Abstract : Contracts are legally binding descriptions of business service engagements. In particular, we considerbusiness events as elements of a service engagement. Business events such as purchase, delivery, bill payment,bank interest accrual not only correspond to essential processes but are also inherently temporally constrained.Identifying and understanding the events and their temporal relationships can help a business partner determine whatto deliver and what to expect from others as it participates in the service engagement specified by a contract.However, contracts are expressed in unstructured text and their insights are buried therein.

Our contributions are threefold. We develop a novel approach employing a hybrid of surface patterns, parsing, andclassification to extract (1) business events and (2) their temporal constraints from contract text. We use topicmodeling to (3) automatically organize the event terms into clusters. An evaluation on a real-life contract datasetdemonstrates the viability and promise of our hybrid approach, yielding an F-measure of 0.89 in event extraction and0.90 in temporal constraints extraction. The topic model yields event term clusters with an average match of 85%between two independent human annotations and an expert-assigned set of class labels for the clusters.

Title :A Load Balancing Model Based on Cloud Partitioning for the Public CloudLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/load-balancing-model-based-cloud-partitioning-public-cloud

Abstract : Load balancing in the cloud computing environment has an important impact on the performance. Goodload balancing makes cloud computing more efficient and improves user satisfaction. This article introduces a betterload balance model for the public cloud based on the cloud partitioning concept with a switch mechanism to choosedifferent strategies for different situations. The algorithm applies the game theory to the load balancing strategy to

http://kasanpro.com/p/php/secure-sharing-personal-health-records-attribute-based-encryption-module

http://kasanpro.com/p/c-sharp/mining-contracts-business-events-temporal-constraints-service-engagements

http://kasanpro.com/p/c-sharp/load-balancing-model-based-cloud-partitioning-public-cloud

improve the efficiency in the public cloud environment.

Title :A Load Balancing Model Based on Cloud Partitioning for the Public CloudLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/load-balancing-model-based-cloud-partitioning-public-cloud-code

Abstract : Load balancing in the cloud computing environment has an important impact on the performance. Goodload balancing makes cloud computing more efficient and improves user satisfaction. This article introduces a betterload balance model for the public cloud based on the cloud partitioning concept with a switch mechanism to choosedifferent strategies for different situations. The algorithm applies the game theory to the load balancing strategy toimprove the efficiency in the public cloud environment.

Title :AMES-Cloud: A Framework of Adaptive Mobile Video Streaming and Efficient Social Video Sharing in theCloudsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/ames-adaptive-mobile-video-streaming-efficient-social-video-sharing-clouds

Abstract : While demands on video traffic over mobile networks have been souring, the wireless link capacity cannotkeep up with the traffic demand. The gap between the traffic demand and the link capacity, along with time-varyinglink conditions, results in poor service quality of video streaming over mobile networks such as long buffering time andintermittent disruptions. Leveraging the cloud computing technology, we propose a new mobile video streamingframework, dubbed AMES-Cloud, which has two main parts: AMoV (adaptive mobile video streaming) and ESoV(efficient social video sharing). AMoV and ESoV construct a private agent to provide video streaming servicesefficiently for each mobile user. For a given user, AMoV lets her private agent adaptively adjust her streaming flowwith a scalable video coding technique based on the feedback of link quality. Likewise, ESoV monitors the socialnetwork interactions among mobile users, and their private agents try to prefetch video content in advance. Weimplement a prototype of the AMES-Cloud framework to demonstrate its performance. It is shown that the privateagents in the clouds can effectively provide the adaptive streaming, and perform video sharing (i.e., prefetching)based on the social network analysis.


Title :AMES-Cloud: A Framework of Adaptive Mobile Video Streaming and Efficient Social Video Sharing in theCloudsLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/ames-adaptive-mobile-video-streaming-social-video-sharing-clouds

Abstract : While demands on video traffic over mobile networks have been souring, the wireless link capacity cannotkeep up with the traffic demand. The gap between the traffic demand and the link capacity, along with time-varyinglink conditions, results in poor service quality of video streaming over mobile networks such as long buffering time andintermittent disruptions. Leveraging the cloud computing technology, we propose a new mobile video streamingframework, dubbed AMES-Cloud, which has two main parts: AMoV (adaptive mobile video streaming) and ESoV(efficient social video sharing). AMoV and ESoV construct a private agent to provide video streaming servicesefficiently for each mobile user. For a given user, AMoV lets her private agent adaptively adjust her streaming flowwith a scalable video coding technique based on the feedback of link quality. Likewise, ESoV monitors the socialnetwork interactions among mobile users, and their private agents try to prefetch video content in advance. Weimplement a prototype of the AMES-Cloud framework to demonstrate its performance. It is shown that the privateagents in the clouds can effectively provide the adaptive streaming, and perform video sharing (i.e., prefetching)based on the social network analysis.


Title :NCCloud: A Network-Coding-Based Storage System in a Cloud-of-CloudsLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/nccloud-network-coding-based-storage-system-cloud-clouds

http://kasanpro.com/p/ns2/load-balancing-model-based-cloud-partitioning-public-cloud-code

http://kasanpro.com/p/c-sharp/ames-adaptive-mobile-video-streaming-efficient-social-video-sharing-clouds


http://kasanpro.com/p/ns2/ames-adaptive-mobile-video-streaming-social-video-sharing-clouds

http://kasanpro.com/p/c-sharp/nccloud-network-coding-based-storage-system-cloud-clouds

Abstract : To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloudvendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost datawith the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system forfault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloudfailure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storageregenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasurecodes (e.g., RAID-6), but use less repair traffic and hence incur less monetary cost due to data transfer. One keydesign feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, whilepreserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud anddeploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary costsavings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storageoperations such as upload/download.

Title :NCCloud: A Network-Coding-Based Storage System in a Cloud-of-CloudsLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/nccloud-network-coding-based-storage-system-cloud-clouds-code

Abstract : To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloudvendors. However, if a cloud suffers from a permanent failure and loses all its data, we need to repair the lost datawith the help of the other surviving clouds to preserve data redundancy. We present a proxy-based storage system forfault-tolerant multiple-cloud storage called NCCloud, which achieves cost-effective repair for a permanent single-cloudfailure. NCCloud is built on top of a network-coding-based storage scheme called the functional minimum-storageregenerating (FMSR) codes, which maintain the same fault tolerance and data redundancy as in traditional erasurecodes (e.g., RAID-6), but use less repair traffic and hence incur less monetary cost due to data transfer. One keydesign feature of our FMSR codes is that we relax the encoding requirement of storage nodes during repair, whilepreserving the benefits of network coding in repair. We implement a proof-of-concept prototype of NCCloud anddeploy it atop both local and commercial clouds. We validate that FMSR codes provide significant monetary costsavings in repair over RAID-6 codes, while having comparable response time performance in normal cloud storageoperations such as upload/download.

Title :Privacy-Preserving Multi-keyword Ranked Search over Encrypted Cloud DataLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/privacy-preserving-multi-keyword-ranked-search-encrypted-cloud-data-code

Abstract : With the advent of cloud computing, data owners are motivated to outsource their complex datamanagement systems from local sites to the commercial public cloud for great flexibility and economic savings. Butfor protecting data privacy, sensitive data has to be encrypted before outsourcing, which obsoletes traditional datautilization based on plaintext keyword search. Thus, enabling an encrypted cloud data search service is of paramountimportance. Considering the large number of data users and documents in the cloud, it is necessary to allow multiplekeywords in the search request and return documents in the order of their relevance to these keywords. Relatedworks on searchable encryption focus on single keyword search or Boolean keyword search, and rarely sort thesearch results. In this paper, for the first time, we define and solve the challenging problem of privacypreservingmulti-keyword ranked search over encrypted cloud data (MRSE).We establish a set of strict privacy requirements forsuch a secure cloud data utilization system. Among various multikeyword semantics, we choose the efficient similaritymeasure of "coordinate matching", i.e., as many matches as possible, to capture the relevance of data documents tothe search query. We further use "inner product similarity" to quantitatively evaluate such similarity measure. We firstpropose a basic idea for the MRSE based on secure inner product computation, and then give two significantlyimproved MRSE schemes to achieve various stringent privacy requirements in two different threat models. Thoroughanalysis investigating privacy and efficiency guarantees of proposed schemes is given. Experiments on the real-worlddataset further show proposed schemes indeed introduce low overhead on computation and communication.

Title :Compatibility-aware Cloud Service Composition Under Fuzzy PreferencesLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/compatibility-aware-cloud-service-composition-under-fuzzy-preferences

Abstract : When a single Cloud service (i.e., a software image and a virtual machine), on its own, cannot satisfy allthe user requirements, a composition of Cloud services is required. Cloud service composition, which includes severaltasks such as discovery, compatibility checking, selection, and deployment, is a complex process and users find itdifficult to select the best one among the hundreds, if not thousands, of possible compositions available. Servicecomposition in Cloud raises even new challenges caused by diversity of users with different expertise requiring theirapplications to be deployed across difference geographical locations with distinct legal constraints. The main difficulty

http://kasanpro.com/p/ns2/nccloud-network-coding-based-storage-system-cloud-clouds-code

http://kasanpro.com/p/c-sharp/privacy-preserving-multi-keyword-ranked-search-encrypted-cloud-data-code

http://kasanpro.com/p/c-sharp/compatibility-aware-cloud-service-composition-under-fuzzy-preferences

lies in selecting a combination of virtual appliances (software images) and infrastructure services that are compatibleand satisfy a user with vague preferences. Therefore, we present a framework and algorithms which simplify Cloudservice composition for unskilled users. We develop an ontologybased approach to analyze Cloud servicecompatibility by applying reasoning on the expert knowledge. In addition, to minimize effort of users in expressingtheir preferences, we apply combination of evolutionary algorithms and fuzzy logic for composition optimization. Thislets users express their needs in linguistics terms which brings a great comfort to them compared to systems thatforce users to assign exact weights for all preferences.

Title :Compatibility-aware Cloud Service Composition Under Fuzzy PreferencesLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/compatibility-aware-cloud-service-composition-under-fuzzy-preference

Abstract : When a single Cloud service (i.e., a software image and a virtual machine), on its own, cannot satisfy allthe user requirements, a composition of Cloud services is required. Cloud service composition, which includes severaltasks such as discovery, compatibility checking, selection, and deployment, is a complex process and users find itdifficult to select the best one among the hundreds, if not thousands, of possible compositions available. Servicecomposition in Cloud raises even new challenges caused by diversity of users with different expertise requiring theirapplications to be deployed across difference geographical locations with distinct legal constraints. The main difficultylies in selecting a combination of virtual appliances (software images) and infrastructure services that are compatibleand satisfy a user with vague preferences. Therefore, we present a framework and algorithms which simplify Cloudservice composition for unskilled users. We develop an ontologybased approach to analyze Cloud servicecompatibility by applying reasoning on the expert knowledge. In addition, to minimize effort of users in expressingtheir preferences, we apply combination of evolutionary algorithms and fuzzy logic for composition optimization. Thislets users express their needs in linguistics terms which brings a great comfort to them compared to systems thatforce users to assign exact weights for all preferences.


Title :A Load Balancing Model Based on Cloud Partitioning for the Public CloudLanguage : Java

Project Link : http://kasanpro.com/p/java/load-balancing-model-cloud-partitioning-public-cloud

Abstract : Load balancing in the cloud computing environment has an important impact on the performance. Goodload balancing makes cloud computing more efficient and improves user satisfaction. This article introduces a betterload balance model for the public cloud based on the cloud partitioning concept with a switch mechanism to choosedifferent strategies for different situations. The algorithm applies the game theory to the load balancing strategy toimprove the efficiency in the public cloud environment.

Title :EduCloud: PaaS versus IaaS Cloud Usage for an Advanced Computer Science CourseLanguage : Java

Project Link : http://kasanpro.com/p/java/educloud-paas-iaas-cloud-usage-advanced-computer-science-course

Abstract : The cloud has become a widely used term in academia and the industry. Education has not remainedunaware of this trend, and several educational solutions based on cloud technologies are already in place, especiallyfor software as a service cloud. However, an evaluation of the educational potential of infrastructure and platformclouds has not been explored yet. An evaluation of which type of cloud would be the most beneficial for students tolearn, depending on the technical knowledge required for its usage, is missing. Here, the first systematic evaluation ofdifferent types of cloud technologies in an advanced course on network overlays with 84 students and four professorsis presented. This evaluation tries to answer the question whether cloud technologies (and which specific type ofcloud) can be useful in educational scenarios for computer science students by focusing students in the actual tasksat hand. This study demonstrates that platform clouds are valued by both students and professors to achieve thecourse objectives and that clouds offer a significant improvement over the previous situation in labs where much effortwas devoted to setting up the software necessary for course activities. These results most strongly apply to courses inwhich students interact with resources that are non-self-contained (e.g., network nodes, databases, mechanicalequipment, or the cloud itself), but could also apply to other science disciplines that involve programming orperforming virtual experiments.


http://kasanpro.com/p/ns2/compatibility-aware-cloud-service-composition-under-fuzzy-preference

http://kasanpro.com/p/java/load-balancing-model-cloud-partitioning-public-cloud

http://kasanpro.com/p/java/educloud-paas-iaas-cloud-usage-advanced-computer-science-course


Title :Automating Cloud Services Life Cycle through Semantic TechnologiesLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/automating-cloud-services-life-cycle-semantic-technologies

Abstract : Managing virtualized services efficiently over the cloud is an open challenge. Traditional models ofsoftware development are not appropriate for the cloud computing domain, where software (and other) services areacquired on demand. In this paper, we describe a new integrated methodology for the life cycle of IT servicesdelivered on the cloud and demonstrate how it can be used to represent and reason about services and servicerequirements and so automate service acquisition and consumption from the cloud. We have divided the IT servicelife cycle into five phases of requirements, discovery, negotiation, composition, and consumption. We detail eachphase and describe the ontologies that we have developed to represent the concepts and relationships for eachphase. To show how this life cycle can automate the usage of cloud services, we describe a cloud storage prototypethat we have developed. This methodology complements previous work on ontologies for service descriptions in thatit is focused on supporting negotiation for the particulars of a service and going beyond simple matchmaking.

Title :Achieving Effective Cloud Search Services: Multi-keyword Ranked Search over Encrypted Cloud DataSupporting Synonym QueryLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/cloud-search-services-multi-keyword-ranked-search-encrypted-cloud

Abstract : In recent years, consumer-centric cloud computing paradigm has emerged as the development of smartelectronic devices combined with the emerging cloud computing technologies. A variety of cloud services aredelivered to the consumers with the premise that an effective and efficient cloud search service is achieved. Forconsumers, they want to find the most relevant products or data, which is highly desirable in the "pay-as-you use"cloud computing paradigm. As sensitive data (such as photo albums, emails, personal health records, financialrecords, etc.) are encrypted before outsourcing to cloud, traditional keyword search techniques are useless.Meanwhile, existing search approaches over encrypted cloud data support only exact or fuzzy keyword search, butnot semantics-based multi-keyword ranked search. Therefore, how to enable an effective searchable system withsupport of ranked search remains a very challenging problem. This paper proposes an effective approach to solve theproblem of multi-keyword ranked search over encrypted cloud data supporting synonym queries. The maincontribution of this paper is summarized in two aspects: multi-keyword ranked search to achieve more accuratesearch results and synonym-based search to support synonym queries. Extensive experiments on real-world datasetwere performed to validate the approach, showing that the proposed solution is very effective and efficient formultikeyword ranked searching in a cloud environment.

Title :Achieving Effective Cloud Search Services: Multi-keyword Ranked Search over Encrypted Cloud DataSupporting Synonym QueryLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/multi-keyword-ranked-search-cloud-search-services-encrypted-cloud

Abstract : In recent years, consumer-centric cloud computing paradigm has emerged as the development of smartelectronic devices combined with the emerging cloud computing technologies. A variety of cloud services aredelivered to the consumers with the premise that an effective and efficient cloud search service is achieved. Forconsumers, they want to find the most relevant products or data, which is highly desirable in the "pay-as-you use"cloud computing paradigm. As sensitive data (such as photo albums, emails, personal health records, financialrecords, etc.) are encrypted before outsourcing to cloud, traditional keyword search techniques are useless.Meanwhile, existing search approaches over encrypted cloud data support only exact or fuzzy keyword search, butnot semantics-based multi-keyword ranked search. Therefore, how to enable an effective searchable system withsupport of ranked search remains a very challenging problem. This paper proposes an effective approach to solve theproblem of multi-keyword ranked search over encrypted cloud data supporting synonym queries. The maincontribution of this paper is summarized in two aspects: multi-keyword ranked search to achieve more accuratesearch results and synonym-based search to support synonym queries. Extensive experiments on real-world datasetwere performed to validate the approach, showing that the proposed solution is very effective and efficient formultikeyword ranked searching in a cloud environment.


Title :A Mechanism Design Approach to Resource Procurement in Cloud ComputingLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/resource-procurement-cloud-computing-module

http://kasanpro.com/p/c-sharp/automating-cloud-services-life-cycle-semantic-technologies

http://kasanpro.com/p/c-sharp/cloud-search-services-multi-keyword-ranked-search-encrypted-cloud

http://kasanpro.com/p/ns2/multi-keyword-ranked-search-cloud-search-services-encrypted-cloud

http://kasanpro.com/p/c-sharp/resource-procurement-cloud-computing-module

Abstract : We present a cloud resource procurement approach which not only automates the selection of anappropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloudresource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible(C-BIC), and cloud optimal (C-OPT). C-DSIC is dominant strategy incentive compatible, based on the VCGmechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budgetbalance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowestcost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner.C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, butalso individually rational. Our experiments indicate that the resource procurement cost decreases with increase innumber of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud brokerwhich can implement C-DSIC, C-BIC, or C-OPT to perform resource procurement in a cloud computing context. Acloud broker with such a procurement module enables users to automate the choice of a cloud vendor among manywith diverse offerings, and is also an essential first step toward implementing dynamic pricing in the cloud.

Title :A Mechanism Design Approach to Resource Procurement in Cloud ComputingLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/resource-procurement-cloud-computing

Abstract : We present a cloud resource procurement approach which not only automates the selection of anappropriate cloud vendor but also implements dynamic pricing. Three possible mechanisms are suggested for cloudresource procurement: cloud-dominant strategy incentive compatible (C-DSIC), cloud-Bayesian incentive compatible(C-BIC), and cloud optimal (C-OPT). C-DSIC is dominant strategy incentive compatible, based on the VCGmechanism, and is a low-bid Vickrey auction. C-BIC is Bayesian incentive compatible, which achieves budgetbalance. C-BIC does not satisfy individual rationality. In C-DSIC and C-BIC, the cloud vendor who charges the lowestcost per unit QoS is declared the winner. In C-OPT, the cloud vendor with the least virtual cost is declared the winner.C-OPT overcomes the limitations of both C-DSIC and C-BIC. C-OPT is not only Bayesian incentive compatible, butalso individually rational. Our experiments indicate that the resource procurement cost decreases with increase innumber of cloud vendors irrespective of the mechanisms. We also propose a procurement module for a cloud brokerwhich can implement C-DSIC, C-BIC, or C-OPT to perform resource procurement in a cloud computing context. Acloud broker with such a procurement module enables users to automate the choice of a cloud vendor among manywith diverse offerings, and is also an essential first step toward implementing dynamic pricing in the cloud.

Title :A Novel Model for Competition and Cooperation Among Cloud ProvidersLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/competition-cooperation-among-cloud-providers

Abstract : Having received significant attention in the industry, the cloud market is nowadays fiercely competitive withmany cloud providers. On one hand, cloud providers compete against each other for both existing and new cloudusers. To keep existing users and attract newcomers, it is crucial for each provider to offer an optimal price policywhich maximizes the final revenue and improves the competitive advantage. The competition among providers leadsto the evolution of the market and dynamic resource prices over time. On the other hand, cloud providers maycooperate with each other to improve their final revenue. Based on a Service Level Agreement, a provider canoutsource its users' resource requests to its partner to reduce the operation cost and thereby improve the finalrevenue. This leads to the problem of determining the cooperating parties in a cooperative environment. This papertackles these two issues of the current cloud market. First, we solve the problem of competition among providers andpropose a dynamic price policy. We employ a discrete choice model to describe the user's choice behavior based onhis obtained benefit value. The choice model is used to derive the probability of a user choosing to be served by acertain provider. The competition among providers is formulated as a non-cooperative stochastic game where theplayers are providers who act by proposing the price policy simultaneously. The game is modelled as a MarkovDecision Process whose solution is a Markov Perfect Equilibrium. Then, we address the cooperation among providersby presenting a novel algorithm for determining a cooperation strategy that tells providers whether to satisfy users'resource requests locally or outsource them to a certain provider. The algorithm yields the optimal cooperationstructure from which no provider unilaterally deviates to gain more revenue. Numerical simulations are carried out toevaluate the performance of the proposed models.

Title :A Novel Model for Competition and Cooperation Among Cloud ProvidersLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/competition-cooperation-model-among-cloud-providers

Abstract : Having received significant attention in the industry, the cloud market is nowadays fiercely competitive withmany cloud providers. On one hand, cloud providers compete against each other for both existing and new cloud

http://kasanpro.com/p/ns2/resource-procurement-cloud-computing

http://kasanpro.com/p/c-sharp/competition-cooperation-among-cloud-providers

http://kasanpro.com/p/ns2/competition-cooperation-model-among-cloud-providers

users. To keep existing users and attract newcomers, it is crucial for each provider to offer an optimal price policywhich maximizes the final revenue and improves the competitive advantage. The competition among providers leadsto the evolution of the market and dynamic resource prices over time. On the other hand, cloud providers maycooperate with each other to improve their final revenue. Based on a Service Level Agreement, a provider canoutsource its users' resource requests to its partner to reduce the operation cost and thereby improve the finalrevenue. This leads to the problem of determining the cooperating parties in a cooperative environment. This papertackles these two issues of the current cloud market. First, we solve the problem of competition among providers andpropose a dynamic price policy. We employ a discrete choice model to describe the user's choice behavior based onhis obtained benefit value. The choice model is used to derive the probability of a user choosing to be served by acertain provider. The competition among providers is formulated as a non-cooperative stochastic game where theplayers are providers who act by proposing the price policy simultaneously. The game is modelled as a MarkovDecision Process whose solution is a Markov Perfect Equilibrium. Then, we address the cooperation among providersby presenting a novel algorithm for determining a cooperation strategy that tells providers whether to satisfy users'resource requests locally or outsource them to a certain provider. The algorithm yields the optimal cooperationstructure from which no provider unilaterally deviates to gain more revenue. Numerical simulations are carried out toevaluate the performance of the proposed models.

Title :Consistency as a Service: Auditing Cloud ConsistencyLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/consistency-service-auditing-cloud-consistency

Abstract : Cloud storage services have become commercially popular due to their overwhelming advantages. Toprovide ubiquitous always-on access, a cloud service provider (CSP) maintains multiple replicas for each piece ofdata on geographically distributed servers. A key problem of using the replication technique in clouds is that it is veryexpensive to achieve strong consistency on a worldwide scale. In this paper, we first present a novel consistency as aservice (CaaS) model, which consists of a large data cloud and multiple small audit clouds. In the CaaS model, a datacloud is maintained by a CSP, and a group of users that constitute an audit cloud can verify whether the data cloudprovides the promised level of consistency or not. We propose a two-level auditing architecture, which only requires aloosely synchronized clock in the audit cloud. Then, we design algorithms to quantify the severity of violations withtwo metrics: the commonality of violations, and the staleness of the value of a read. Finally, we devise a heuristicauditing strategy (HAS) to reveal as many violations as possible. Extensive experiments were performed using acombination of simulations and real cloud deployments to validate HAS.


Title :Consistency as a Service: Auditing Cloud ConsistencyLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/consistency-as-a-service-auditing-cloud-consistency

Abstract : Cloud storage services have become commercially popular due to their overwhelming advantages. Toprovide ubiquitous always-on access, a cloud service provider (CSP) maintains multiple replicas for each piece ofdata on geographically distributed servers. A key problem of using the replication technique in clouds is that it is veryexpensive to achieve strong consistency on a worldwide scale. In this paper, we first present a novel consistency as aservice (CaaS) model, which consists of a large data cloud and multiple small audit clouds. In the CaaS model, a datacloud is maintained by a CSP, and a group of users that constitute an audit cloud can verify whether the data cloudprovides the promised level of consistency or not. We propose a two-level auditing architecture, which only requires aloosely synchronized clock in the audit cloud. Then, we design algorithms to quantify the severity of violations withtwo metrics: the commonality of violations, and the staleness of the value of a read. Finally, we devise a heuristicauditing strategy (HAS) to reveal as many violations as possible. Extensive experiments were performed using acombination of simulations and real cloud deployments to validate HAS.

Title :Panda: Public Auditing for Shared Data with Efficient User Revocation in the CloudLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/panda-public-auditing-shared-data-efficient-user-revocation-cloud

Abstract : With data storage and sharing services in the cloud, users can easily modify and share data as a group.To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all theblocks in shared data. Different blocks in shared data are generally signed by different users due to data modificationsperformed by different users. For security reasons, once a user is revoked from the group, the blocks which werepreviously signed by this revoked user must be re-signed by an existing user. The straightforward method, whichallows an existing user to download the corresponding part of shared data and re-sign it during user revocation, is

http://kasanpro.com/p/c-sharp/consistency-service-auditing-cloud-consistency

http://kasanpro.com/p/ns2/consistency-as-a-service-auditing-cloud-consistency

http://kasanpro.com/p/c-sharp/panda-public-auditing-shared-data-efficient-user-revocation-cloud

inefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditingmechanism for the integrity of shared data with efficient user revocation in mind. By utilizing the idea of proxyre-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existingusers do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to auditthe integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data hasbeen re-signed by the cloud. Moreover, our mechanism is able to support batch auditing by verifying multiple auditingtasks simultaneously. Experimental results show that our mechanism can significantly improve the efficiency of userrevocation.

Title :Panda: Public Auditing for Shared Data with Efficient User Revocation in the CloudLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/panda-public-auditing-shared-data-efficient-user-revocation-cloud-code

Abstract : With data storage and sharing services in the cloud, users can easily modify and share data as a group.To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all theblocks in shared data. Different blocks in shared data are generally signed by different users due to data modificationsperformed by different users. For security reasons, once a user is revoked from the group, the blocks which werepreviously signed by this revoked user must be re-signed by an existing user. The straightforward method, whichallows an existing user to download the corresponding part of shared data and re-sign it during user revocation, isinefficient due to the large size of shared data in the cloud. In this paper, we propose a novel public auditingmechanism for the integrity of shared data with efficient user revocation in mind. By utilizing the idea of proxyre-signatures, we allow the cloud to re-sign blocks on behalf of existing users during user revocation, so that existingusers do not need to download and re-sign blocks by themselves. In addition, a public verifier is always able to auditthe integrity of shared data without retrieving the entire data from the cloud, even if some part of shared data hasbeen re-signed by the cloud. Moreover, our mechanism is able to support batch auditing by verifying multiple auditingtasks simultaneously. Experimental results show that our mechanism can significantly improve the efficiency of userrevocation.

Title :Performance and cost evaluation of an adaptive encryption architecture for cloud databasesLanguage : C#

Project Link : http://kasanpro.com/p/c-sharp/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases

Abstract : The cloud database as a service is a novel paradigm that can support several Internet-based applications,but its adoption requires the solution of information confidentiality problems. We propose a novel architecture foradaptive encryption of public cloud databases that offers an interesting alternative to the trade-off between therequired data confidentiality level and the flexibility of the cloud database structures at design time. We demonstratethe feasibility and performance of the proposed solution through a software prototype. Moreover, we propose anoriginal cost model that is oriented to the evaluation of cloud database services in plain and encrypted instances andthat takes into account the variability of cloud prices and tenant workload during a medium-term period.

Title :Performance and cost evaluation of an adaptive encryption architecture for cloud databasesLanguage : NS2

Project Link : http://kasanpro.com/p/ns2/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases-code

Abstract : The cloud database as a service is a novel paradigm that can support several Internet-based applications,but its adoption requires the solution of information confidentiality problems. We propose a novel architecture foradaptive encryption of public cloud databases that offers an interesting alternative to the trade-off between therequired data confidentiality level and the flexibility of the cloud database structures at design time. We demonstratethe feasibility and performance of the proposed solution through a software prototype. Moreover, we propose anoriginal cost model that is oriented to the evaluation of cloud database services in plain and encrypted instances andthat takes into account the variability of cloud prices and tenant workload during a medium-term period.


Title :Comprehensive Explanation of SLA Violations at RuntimeLanguage : Java

Project Link : http://kasanpro.com/p/java/comprehensive-explanation-sla-violations-runtime

http://kasanpro.com/p/ns2/panda-public-auditing-shared-data-efficient-user-revocation-cloud-code

http://kasanpro.com/p/c-sharp/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases

http://kasanpro.com/p/ns2/performance-cost-evaluation-adaptive-encryption-architecture-cloud-databases-code

http://kasanpro.com/p/java/comprehensive-explanation-sla-violations-runtime

Abstract : Service Level Agreements (SLAs) establish the Quality of Service (QoS) agreed between service-basedsystems consumers and providers. Since the violation of such SLAs may involve penalties, quality assurancetechniques have been developed to supervise the SLAs fulfillment at runtime. However, existing proposals presentsome drawbacks: 1) the SLAs they support are not expressive enough to model real-world scenarios, 2) they couplethe monitoring configuration to a given SLA specification, 3) the explanations of the violations are difficult tounderstand and even potentially inaccurate, 4) some proposals either do not provide an architecture, or present lowcohesion within their elements. In this paper, we propose a comprehensive solution, from a conceptual referencemodel to its design and implementation, that overcomes these drawbacks. The resulting platform, SALMonADA,receives the SLA agreed between the parties as input and reports timely and comprehensive explanations of SLAviolations. SALMonADA performs an automated monitoring configuration and it analyses highly expressive SLAs bymeans of a constraint satisfaction problems based technique. We have evaluated the impact of SALMonADA over theresulting service consumption time performance. The results are satisfactory enough to consider SALMonADA forSLA supervision because of its low intrusiveness.