Cloud Storage Scheme Research Articles

A Fog-Centric Secure Cloud Storage Scheme

Cloud computing is now being utilized as a prospective alternative for catering storage service. Security issues of cloud storage are a potential deterrent in its widespread adoption. Privacy breach, malicious modification, and data loss are emerging cyber threats against cloud storage. Recently, a fog server based three-layer architecture has been presented for secure storage employing multiple clouds. The underlying techniques used are Hash-Solomon code and customized hash algorithm in order to attain the goal. However, it resulted in loss of smaller portion of data to cloud servers and failed to provide better modification detection and data recoverability. This paper proposes a novel fog-centric secure cloud storage scheme to protect data against unauthorized access, modification, and destruction. To prevent illegitimate access, the proposed scheme employs a new technique <inline-formula><tex-math notation="LaTeX">$Xor - Combination$</tex-math></inline-formula> to conceal data. Moreover, <inline-formula><tex-math notation="LaTeX">$Block - Management$</tex-math></inline-formula> outsources the outcomes of <inline-formula><tex-math notation="LaTeX">$Xor - Combination$</tex-math></inline-formula> to prevent malicious retrieval and to ensure better recoverability in case of data loss. Simultaneously, we propose a technique based on hash algorithm in order to facilitate modification detection with higher probability. We demonstrate robustness of the proposed scheme through security analysis. Experimental results validate performance supremacy of the proposed scheme compared to contemporary solutions in terms of data processing time.

LAMA: A secure lattice-based authentication scheme for cloud storage against misbehaved private key generator

LAMA: A secure lattice-based authentication scheme for cloud storage against misbehaved private key generator

A Blockchain-Based Efficient Data Integrity Verification Scheme in Multi-Cloud Storage

The cloud storage service provides the storage and access function for massive data, reducing the management cost for large amounts of data. The data integrity verification scheme in cloud storage can be employed to help users confirm the integrity of outsourced data. Although public data integrity verification schemes allow users to outsource data integrity verification to third-party auditor (TPA), there are still many problems with centralized TPA in terms of security and efficiency. In recent years, researchers have tried to apply blockchain technology to solve the centralization problem of traditional methods, but these schemes do not pay attention to the problem of efficiency degradation caused by the use of blockchain technology. This paper proposes an efficient data integrity verification scheme for multi-cloud storage services by using blockchain technology. The overall verification can verify the integrity of multiple CSPs, which solves the problems of low computational efficiency. Local verification can trace the source to the specific damaged CSP, which is more secure and reliable. In addition, this paper puts the data verification process directly in the blockchain for public execution and provides data integrity verification services without the assistance of any third-party audit platform, avoiding the security problems caused by untrusted TPA. Theoretical analysis and experiments verify the safety and effectiveness of the scheme.

DOPIV: Post-Quantum Secure Identity-Based Data Outsourcing with Public Integrity Verification in Cloud Storage

Public verification enables cloud users to employ a third party auditor (TPA) to check the data integrity. However, recent breakthrough results on quantum computers indicate that applying quantum computers in clouds would be realized. A majority of existing public verification schemes are based on conventional hardness assumptions, which are vulnerable to adversaries equipped with quantum computers in the near future. Moreover, new security issues need to be solved when an original data owner is restricted or cannot access the remote cloud server flexibly. In this paper, we propose an efficient identity-based data outsourcing with public integrity verification scheme (DOPIV) in cloud storage. DOPIV is designed on lattice-based cryptography, which achieves post-quantum security. DOPIV enables an original data owner to delegate a proxy to generate the signatures of data and outsource them to the cloud server. Any TPA can perform data integrity verification efficiently on behalf of the original data owner, without retrieving the entire data set. Additionally, DOPIV possesses the advantages of being identity-based systems, avoiding complex certificate management procedures. We provide security proofs of DOPIV in the random oracle model, and conduct a comprehensive performance evaluation to show that DOPIV is more practical in post-quantum secure cloud storage systems.

A New Framework Approach Enhances Security to Efficient Remote Collaboration in TPA Scheme for Cloud Storage

Abstract: Cloud computing provides customers with storage as a service, allowing data to be stored, managed, and cached remotely. Users can also access it online. A major concern for users is the integrity of the data stored in the cloud, as it is possible for external invaders or criminals to attack, repair, or destroy the data stored in the cloud. Data auditing is a trending concept that involves hiring a third-party auditor to perform a data integrity test (TPA). The main purpose of this project is to provide a safe and effective testing system that combines features such as data integrity, confidentiality, and privacy protection. The cloud server is only used to store encrypted data blocks in the proposed system. It is not subject to any additional computer verification. TPA and the data owner are in charge of all the functions of the scheme. A variety of materials are used to evaluate the proposed audit process. The proposed solution meets all the processes while minimizing the load on cloud servers. Data dynamics actions such as data review, deletion, and installation will be performed in the future. Keywords: Cloud storage; Third Party Auditor; Public Auditing; Privacy Preserving; Integrity;

Third Party Public Auditing Scheme for Cloud Storage

Abstract: Thus the new auditing scheme has been developed by considering all these requirements. It consist of three entities: data owner, TPA and cloud server. The data owner performs various operations such as splitting the file to blocks, encrypting them, generating a hash value for each, concatenating it and generating a signature on it. The TPA performs the main role of data integrity check. It performs activities like generating hash value for encrypted blocks received from cloud server, concatenating them and generates signature on it. It later compares both the signatures to verify whether the data stored on cloud is tampered or not. It verifies the integrity of data on demand of the users. The cloud server is used only to save the encrypted blocks of data. This proposed auditing scheme make use of AES algorithm for encryption, SHA-2 for integrity check and RSA signature for digital signature calculation. In this philosophy, users of cloud storage services no longer physically maintain direct control over their data, which makes data security one of the major concerns of using cloud. Existing research work already allows data integrity to be verified without possession of the actual data file. When the verification is done by a trusted third party, this verification process is also called data auditing, and this third party is called an auditor. As a result, every small update will cause re-computation and updating of the authenticator for an entire file block, which in turn causes higher storage and communication overheads. In this paper, we provide a formal analysis for possible types of fine-grained data updates and propose a scheme that can fully support authorized auditing and fine-grained update requests. Basedon our scheme, we also propose an enhancement that can dramatically reduce communication overheads for verifying small updates Keywords: Cloud computing, big data, data security, authorized auditing, fine-grained dynamic data update

Enabling Decentralized and Dynamic Data Integrity Verification for Secure Cloud Storage via T-Merkle Hash Tree Based Blockchain

Cloud storage provides elastic storage services for enterprises and individuals remotely. However, security problems such as data integrity are becoming a major obstacle. Recently, blockchain-based verification approaches have been extensively studied to get rid of a centralized third-party auditor. Most of these schemes suffer from poor scalability and low search efficiency and even fail to support data dynamic update operations on blockchain, which limits their large-scale and practical applications. In this work, we propose a blockchain-based dynamic data integrity verification scheme for cloud storage with T-Merkle hash tree. A decentralized scheme is proposed to eliminate the restrictions of previous centralized schemes. The data tags are generated by the technique of ZSS short signature and stored on blockchain. An improved verification method is designed to check the integrity of cloud data by transferring computation from a verifier to cloud server and blockchain. Furthermore, a storage structure called T-Merkle hash tree which is built based on T-tree and Merkle hash tree is designed to improve storage utilization of blockchain and support binary search on chain. Moreover, we achieve efficient and secure dynamic update operations on blockchain by an append-only manner. Besides, we extend our scheme to support batch verification to handle massive tasks simultaneously; thus, the efficiency is improved and communication cost is reduced. Finally, we implemented a prototype system based on Hyperledger Fabric to validate our scheme. Security analysis and performance studies show that the proposed scheme is secure and efficient.

PSCPAC: Post-quantum secure certificateless public auditing scheme in cloud storage

To reduce the local storage burden and enjoy the conveniently ubiquitous access, an increasing number of individuals and enterprises prefer to outsource their data to the cloud server. Due to the loss of physical control over data, how to guarantee the cloud server stores user’s data honestly becomes an important security challenge. Meanwhile, most of existing public auditing schemes based on traditional public key cryptosystem either suffer from bearing the heavy burden of certificate management or possess an inherent key escrow drawback. Even worse, with the advent of powerful quantum computers, most of them could be cracked quickly by a large-scale quantum computer in polynomial time in the near future. To this end, we propose a novel post-quantum secure certificateless public auditing scheme in cloud storage (PSCPAC) from lattice assumptions. Compared with the existing schemes, our novel scheme enjoys the following promising merits: (1) removing the requirement for complicated certificate management in traditional PKI-based public auditing schemes; (2) eliminating the inherent key escrow problem in ID-based public auditing schemes; (3) providing resistance against quantum computers attacks. Correctness, security and performance analysis demonstrate that PSCPAC is provably secure, highly efficient and more practical for post-quantum security in cloud storage public auditing.

Efficient personalized search over encrypted data for mobile edge-assisted cloud storage

Cloud storage services allow a data owner to share her/his outsourced data with other users, and enable the users to search target data by keywords. To ensure the data confidentiality, data owner always encrypt data using traditional encryption schemes before outsourcing. Whereas, it makes efficiently searching impossible. Symmetric searchable encryption (SSE) is a cryptographic primitive that resolves this tension. However, most existing SSE schemes do not consider the individual characteristics of users during the search, such that they cannot support personalized search services over encrypted data. Meanwhile, security and efficiency issues in the cloud service model have also severely affected the user’s search experience, and the introduction of mobile edge servers can solve these problems to some extent. In this paper, we propose a personalized searchable encryption scheme (PSED) for mobile edge-assisted cloud storage. Our contribution consists of three aspects. First, we incorporate the user’s preference factors into the user’s query which enable users to get accurate personalized search results. Second, the computational overhead of the cloud server is reduced by calculating the relevance scores of the subqueries and subindexes on mobile edge servers. Third, by cutting the index and the query matrix, the encryption efficiency of the index and the query matrix is improved. Security analysis shows that PSED can guarantee the privacy of the data and the user. Experimental results demonstrate that the proposed schemes are highly efficient and accurate.

Hybrid semantic deep learning architecture and optimal advanced encryption standard key management scheme for secure cloud storage and intrusion detection

Cloud computing helps users to store and retrieve their data in the cloud online on an as-per-pay basis anytime, anywhere in the world. As a consequence, the security of data stored in the cloud serves as a key concern for cloud consumers due to ongoing hacking incidents in the cloud. Both cloud service providers (CSPs) and consumers face various attacks that pose a serious threat to both the organization and the user. Therefore, a robust intrusion detection system (IDS) needs to be configured to identify and avoid potential attacks in the cloud at an earlier stage. The state-of-the-art IDS system which used shallow machine learning techniques suffered from poor accuracy with a higher false alarm rate and higher response time. To overcome this problem, a hybrid semantic deep learning (HSDL) architecture is developed in this paper by integrating the long short-term memory (LSTM), convolutional neural network (CNN), and support vector machine (SVM) architectures. The semantic information present in the network traffic is identified using a semantic layer known as the Word2Vec embedding layer. The HSDL model classifies the intrusion present in the text along with its corresponding attack class. The normal text without any trace of intrusion is encrypted using an advanced encryption standard (AES) algorithm to enhance cloud storage security, and the optimal key with the largest key breaking time for the AES algorithm is selected using the crossover-based mine blast optimization algorithm (CMBA). The proposed HSDL scheme is evaluated and tested using two real-time intrusion detection benchmark datasets, namely NSL-KDD and UNSW-NB15. The proposed model achieves an accuracy of 99.98% for the NSL-KDD and 98.47% for the UNSW-NB15 dataset, respectively. The experimental and security analysis conducted proves the efficiency and robustness of the proposed scheme.

Design and development of a secure certificateless proxy signature based (SE-CLPS) encryption scheme for cloud storage

Certificateless Public Key Cryptography (CL-PKC) scheme is a new standard that combines Identity (ID)-based cryptography and tradi- tional PKC. It yields better security than the ID-based cryptography scheme without requiring digital certificates. In the CL-PKC scheme, as the Key Generation Center (KGC) generates a public key using a partial secret key, the need for authenticating the public key by a trusted third party is avoided. Due to the lack of authentication, the public key associated with the private key of a user may be replaced by anyone. Therefore, the ciphertext cannot be decrypted accurately. To mitigate this issue, an Enhanced Certificateless Proxy Signature (E-CLPS) is proposed to offer high security guarantee and requires minimum computational cost. In this work, the Hackman tool is used for detecting the dictionary attacks in the cloud. From the experimental analysis, it is observed that the proposed E-CLPS scheme yields better Attack Detection Rate, True Positive Rate, True Negative Rate and Minimum False Positives and False Negatives than the existing schemes.

A robust and secure multi-authority access control system for cloud storage

Ciphertext-Policy Attribute-based Encryption (CP-ABE) is regarded as an ideal technique for data access control in cloud storage platform. The traditional CP-ABE requires only one trusted authority to manage the whole attribute set and issue associated keys. However, it makes the only-one-authority become a high-risk entity of the system: When the authority is compromised or crashed, the system will break down. In this paper, we propose a robust multi-authority based CP-ABE scheme for cloud storage, in which multiple authorities jointly manage the whole attribute set. In our proposed scheme, attribute associated keys can be distributed if and only if the active authorities involved in the procedure exceed a specified threshold (t). We further prove that our proposed scheme is secure and robust, which can tolerate less than t authorities being compromised or no more than n − t authorities being crashed, where n denotes the total number of authorities.

Efficient TPA-based auditing scheme for secure cloud storage

In recent years, how to design efficient auditing protocol to verify the integrity of users’ data, which is stored in cloud services provider (CSP), becomes a research focus. Homomorphic message authentication code (MAC) and homomorphic signature are two popular techniques to respectively design private and public auditing protocols. On the one hand, it is not suitable for the homomorphic-MAC-based auditing protocols to be outsourced to third-party auditor (TPA), who has more professional knowledge and computational abilities, although they have high efficiencies. On the other hand, the homomorphic-signature-based ones are very suitable for employing TPA without compromising user’s signing key but have very low efficiency (compared to the former case). In this paper, we propose a new auditing protocol, which perfectly combines the advantages of above two cases. In particular, it is almost as efficient as a homomorphic-MAC-based protocol proposed by Zhang et al. recently. Moreover, it is also suitable for outsourcing to TPA because it does not compromise the privacy of users’ signing key, which can be seen from our security analysis. Finally, numerical analysis and experimental results demonstrate the high-efficiency of our protocol.

Efficient Revocable Multi-Authority Attribute-Based Encryption for Cloud Storage

As is known, attribute-based encryption (ABE) is usually adopted for cloud storage, both for its achievement of fine-grained access control over data, and for its guarantee of data confidentiality. Nevertheless, single-authority attribute-based encryption (SA-ABE) has its obvious drawback in that only one attribute authority can assign the users' attributes, enabling the data to be shared only within the management domain of the attribute authority, while rendering multiple attribute authorities unable to share the data. On the other hand, multi-authority attribute-based encryption (MA-ABE) has its advantages over SA-ABE. It can not only satisfy the need for the fine-grained access control and confidentiality of data, but also make the data shared among different multiple attribute authorities. However, existing MA-ABE schemes are unsuitable for the devices with resources-constraint, because these schemes are all based on expensive bilinear pairing. Moreover, the major challenge of MA-ABE scheme is attribute revocation. So far, many solutions in this respect are not efficient enough. In this paper, on the basis of the elliptic curves cryptography, we propose an efficient revocable multi-authority attribute-based encryption (RMA-ABE) scheme for cloud storage. The security analysis indicates that the proposed scheme satisfies indistinguishable under adaptive chosen plaintext attack assuming hardness of the decisional Diffie-Hellman problem. Compared with the other schemes, the proposed scheme gets its advantages in that it is more economical in computation and storage.

Privacy preserving file auditing schemes for cloud storage using verifiable random function

Users leverage the cloud storage to store data by uploading files to the cloud storage. They can use it to share files to work on collaborative projects. However, during administrative operations by cloud storage service provider (CSSP), there may be some inadvertent corruption of files during data migration and backup. Due to heavy demands, the cloud service provider may not update the desired files immediately when requested by the owner. As a result, a user of the file may receive an obsolete file. To ensure integrity and freshness of files, third party auditing (TPA) services should be supported by CSSP while maintaining the confidentiality of user files and preserving privacy of users. In this paper, three privacy preserving auditing schemes for files stored in cloud has been proposed. Verifiable random function, merkle hash tree and ciphertext-policy attribute-based encryption has been used to achieve the desired goals.

Efficient and Secure Group based Collusion Resistant Public Auditing Scheme for Cloud Storage

Tremendous changes have been seen in the arena of cloud computing from previous years. Many organizations share their data or files on cloud servers to avoid infrastructure and maintenance costs. Employees from different departments create their specific groups and share sensitive information among group members. Revoked users from the group may try to access this information by colluding with an untrusted cloud server. Many researchers have specified revocation procedures using re-signature, proxy-re-signature concept to deflect the collusion between the cloud server and a revoked user. But these techniques are costly in terms of communication overhead and verification cost if combined with auditing techniques to prove the integrity of outsourced data on the cloud server. To reduce this cost, a collusion resistant public auditing scheme with group member revocation is proposed in this paper. In this scheme, the data owner regularly updates the recent valid members list which is used by a third-party auditor to validate the signature so that collusion can be avoided. To verify the integrity of outsourced data, proposed scheme uses one of the modern cryptographic technique indistinguishability obfuscation combined with a one-way function which can reduce the verification time significantly. Experimental results show that the proposed scheme decreases the communication overhead and verification cost compared to existing schemes.

Aspect of join ingress authority for civic directory

T Nowadays, Cloud computing is a major and emerging platform that provides various IT related services. The two major factors which inhibit the growth of cloud computing are privacy and security. Hackers can break into public or private cloud environment and steal the data. They can use it with malicious intent such as either use or sell the sensitive information obtained from the business cloud environment. Hence, user’s safety depends upon security level in cloud service providers. For an enterprise, there are enormous amount of data is stored and most of them are sensitive information which can affect huge number of people or an entire business organization. Networks are the medium through which all tasks are performed. For access control, being one of the classic research topics, various schemes have been proposed and implemented. In existing key policy, when the key which provides access to the data falls into the wrong hands, they can use it with malicious intent such as steal or alter the data or sell the sensitive information obtained from the business cloud environment. Using our proposed algorithm, we can able to provide a collaborative access control scheme for public cloud storage. This system is implemented using encryption method called Attribute Based Encryption. Encrypting data ensures that even if the data falls into the wrong hands, it is useless as long as its keys remain secure. Even when the hacker gets access to the key, he cannot access the data as only the assigned users can access the data using the key.

Neural-assisted image-dependent encryption scheme for medical image cloud storage

Current medical technology evolves massive reports such as electronic patient records and scanned medical images; such reports are needed to be stored securely for future references. Existing storage systems are not feasible for massive data storage. Fortunately, cloud storage services meet the demand through their properties such as scalability and availability. Cloud computing is encouraged by amazing web innovation and modern electronic contraptions. Medical images can be stored in the cloud area, but most of the cloud service providers keep the client data in the plain text format. Cloud users need to take the responsibility to preserve the medical data with their strategy. Most of the existing image encryption solutions are vulnerable to the chosen-plaintext attack because the increasing power of computers and ingenuity of hackers are opening up more and more cracks in this mathematical armour. This paper proposes Hopfield neural network (HNN)-influenced image encryption technique to withstand against various attacks which optimize and improvise system through continuous learning and updating. These methods provide a critical security feature that adapts itself for day-to-day miracles of the real world. In this scheme, the back propagation neural network has been employed to generate image-specific keys that increase the resiliency against hackers. The generated keys are used as an initial seed for confusion and diffusion sequence generation through HNN.

A Lattice Attribute-Based Encryption Scheme for Cloud Storage Based on R-LWE Problem

Attribute-Based Encryption (ABE) is generally applied on Cloud Storage to ensure the security and efficient access control of uploaded data. However, with the development of quantum computing, Diffie-Hellman Problem and Discrete Logarithm Problem, which all ABE scheme based on, have been solved. Therefore, anti-quantum ABE schemes become a research hotspot. However, current anti-quantum ABE schemes cannot make attribute revocation. In order to solve these problems, we propose a lattice attribute-based encryption scheme for cloud storage based on R-LWE problem (L-ABE). Firstly, we construct public/secret key pairs based on the hardness of Ring Learning with Error problem (R-LWE) to achieve quantum attack resistance effectively. Secondly, our scheme can achieve attribute revocation to ensure fine-grained access control. Finally, we prove that our scheme can resist chosen plaintext attack.

Enabling Efficient, Secure and Privacy-Preserving Mobile Cloud Storage

Mobile cloud storage (MCS) provides clients with convenient cloud storage service. In this article, we propose an efficient, secure and privacy-preserving mobile cloud storage scheme, which protects the data confidentiality and privacy simultaneously, especially the access pattern. Specifically, we propose an oblivious selection and update (OSU) protocol as the underlying primitive of the proposed mobile cloud storage scheme. OSU is based on onion additively homomorphic encryption with constant encryption layers and enables the client to obliviously retrieve an encrypted data item from the cloud and update it with a fresh value by generating a small encrypted vector, which significantly reduces the client&#x2019;s computation as well as the communication overheads. Compared with previous works, our presented work has valuable properties, such as fine-grained data structure (small item size), lightweight client-side computation (a few of additively homomorphic operations) and constant communication overhead, which make it more suitable for MCS scenario. Moreover, by employing the &#x201C;verification chunks&#x201D; method, our scheme can be verifiable to resist malicious cloud. The comparison and evaluation indicate that our scheme is more efficient than existing oblivious storage solutions with the aspects of client and cloud workloads, respectively.