Integrity Verification Scheme Research Articles

Data Integrity Schemes for Outsourced Data on Untrusted Cloud Storage: A Review

Cloud Computing have emerged into a very vast growing area which have a great impact towards the development other new technologies and application such as internet of things, sensors, artificial intelligence, social networks and business applications. With the new development of technology and applications, the production of data is increased and data have the property of being updated dynamically. That dynamic data is stored on cloud storages provided by third party service providers. The third party cloud storages cannot be solely trusted and the user does not have the control over the possession or integrity of data. The integrity is the major concern for that data as it is being intact not deleted, modified or destroyed intentionally or unintentionally. The researchers have presented several protocols such as Provable Data Possession (PDP) techniques which provide probabilistic approach for data integrity verification in which the verification is done on block level. To support dynamic nature of data the researchers have introduced different data structure along with PDP. Due to enormous amount of data and its dynamic nature, the integrity verification schemes causes high computational and communicational cost for metadata generation and node rebalancing of the data structures

Efficient and Scalable Integrity Verification of Data and Query Results for Graph Databases

Graphs are used for representing and understanding objects and their relationships for numerous applications such as social networks, Semantic Webs, and biological networks. Integrity assurance of data and query results for graph databases is an essential security requirement. In this paper, we propose two efficient integrity verification schemes—HMACs for graphs (gHMAC) for two-party data sharing, and redactable HMACs for graphs (rgHMAC) for third-party data sharing, such as a cloud-based graph database service. We compute one HMAC value for both the schemes and two other verification objects for rgHMAC scheme that are shared with the verifier. We show that the proposed schemes are provably secure with respect to integrity attacks on the structure and/or content of graphs and query results. The proposed schemes have linear complexity in terms of the number of vertices and edges in the graphs, which is shown to be optimal. Our experimental results corroborate that the proposed HMAC-based schemes for graphs are highly efficient as compared to the digital signature-based schemes—computation of HMAC tags is about 10 times faster than the computation of digital signatures.

A dynamic integrity verification scheme of cloud storage data based on lattice and Bloom filter

With the development of quantum computer, making the traditional cloud storage program data integrity verification protocol is no longer safe anymore, so how to establish a safe and efficient, cost-effective cloud storage system becomes the industry's research hotspot. This paper makes improvements on the basis of the previous schemes. On the cloud storage model, we focus on the protection of user data privacy, and send the file and user signature to CSP and TPA respectively, so these methods will improve the privacy of signature information. In the cloud storage data calculation, using of lattice and Bloom filter methods, can not only resist the quantum computer attacks, but also based on the realization of dynamic integrity, improving the utilization of cloud storage space ultimately.

Efficient data possession–checking protocol with deduplication in cloud

Deduplication has been widely applied to save storage overhead in the cloud server. Data integrity verification with deduplication can not only save space of the cloud server but also ensure security of the stored data. In the existing integrity verification scheme, deduplications are implemented by the cloud server. The signatures of all data blocks are generated and sent to the cloud server. Once receiving the data blocks and signatures, the cloud server compares the received signatures with the stored signatures. If there is a signature that has the same value as some stored signature, the received signature and data block will not be stored by the cloud server. Otherwise, the cloud server stores all received signatures and data blocks. In fact, these operations bring a lot of computational costs. To solve this problem, we propose a data integrity verification scheme with deduplication. In this scheme, the deduplication is performed by the cloud users, which can avoid additional communicational and computational costs. The experiment evaluation indicates that our scheme is practical for real application scenario. We demonstrate that the proposed scheme satisfies signature unforgeability, and the malicious users cannot obtain any legitimate file from the cloud server in the form of deception.

Searchable Encryption with Data Integrity Verification

In the cloud computing environment, the integrity and searchability are two* important attributes of data. Integrity verification ensures the security of data. Searchable encryption ensures the availability of secret data. The research of a single property of the data in the cloud environment has has been widely studied currently, but there are few research of the both properties of the data at the same time. In this paper, through studying the cloud storage scheme which support integrity verification and searchable encryption, we propose a bilinear-based integrity verification scheme with searchable encryption.

An integrity verification scheme of completeness and zero‐knowledge for multi‐Cloud storage

SummaryTo resist the attacks from the malicious Cloud service providers and the organizer, an integrality verification of completeness and zero‐knowledge property (IVCZKP) scheme for multi‐Cloud environment is proposed. First, the bilinear pairing maps are adopted as a basis of theoretical support for IVCZKP scheme. Second, the change of file blocks is recorded, and the hash value of each block is generated through the index‐hash table in the verification process. Finally, the hash value of each block is updated through this index‐hash table to support the dynamic updates to user's data, such as data modification, data insertion, and data deletion. Compared with the original scheme, IVCZKP scheme can resist the forgery attacks and has the completeness and zero‐knowledge property. Theory analysis and the experimental results show that this scheme can reduce the computation time and has more performance on integrity verification in multi‐Cloud environment.

Efficient Integrity Verification Scheme for Medical Data Records in Cloud-Assisted Wireless Medical Sensor Networks

Wireless sensor networks (WSNs) have been widely used in many applications recently. As an important application of the WSNs, the wireless medical sensor networks (WMSNs) could improve health-care quality and have become significant in the modern medical system. WMSNs devices typically have limited computing, storage and communication capabilities. To enhance the capabilities of WSNs, cloud-assisted WMSNs have been introduced, and they can provide more efficient processing of cloud users’ medical data records stored in the cloud. The integrity of medical data records is very important since these data will be used to provide a medical diagnosis and other medical treatments. In this paper, we propose an efficient integrity verification scheme for medical data records in cloud-assisted WMSNs. Based on elliptic curve digital signature algorithm, we construct linearly homomorphic authenticator, so that the third party auditor (TPA) can verify the the integrity of medical data records without bringing in new security threats. TPA does not need to retrieve the entire medical data records, thus can dramatically reduce the communication and computation overhead. Moreover, we further extend our scheme to support batch integrity verification for multiple cloud users simultaneously. In particular, to achieve efficient medical data dynamic operations, using index hash tables, our scheme can execute dynamic operations efficiently. Performance comparison shows that our scheme is more light-weight, and can be used much more practically in cloud-assisted WMSNs.

Integrity Verification for Multiple Data Copies in Cloud Storage Based on Spatiotemporal Chaos

Aiming to strike for a balance between the security, efficiency and availability of the data verification in cloud storage, a novel integrity verification scheme based on spatiotemporal chaos is proposed for multiple data copies. Spatiotemporal chaos is implemented for node calculation of the binary tree, and the location of the data in the cloud is verified. Meanwhile, dynamic operation can be made to the data. Furthermore, blind information is used to prevent a third-party auditor (TPA) leakage of the users’ data privacy in a public auditing process. Performance analysis and discussion indicate that it is secure and efficient, and it supports dynamic operation and the integrity verification of multiple copies of data. It has a great potential to be implemented in cloud storage services.

Dynamic data integrity auditing for secure outsourcing in the cloud

SummaryCloud servers provide cloud users with storage service and allow cloud users to access their files anytime. To guarantee security of the stored files, auditors need to periodically verify data block correctness. In the existing integrity verification schemes, there are few protocols to support the users' identity anonymity and the data block dynamic operation simultaneously. In this paper, we present an efficient and anonymous identity‐based integrity auditing protocol, which supports data dynamic operation and can be extended to support batch auditing in the multifile or multiuser setting. Our scheme not only resists forgery, replace, and replay attacks but also maintains users' anonymity, which is not discussed in other related techniques. The computation efficiency of auditor is improved a lot. Comparing with Zhang's efficient identity‐based public auditing scheme, our scheme is more suitable for actual application scenario with large‐scale storage system.

A Survey on Integrity Verification and Data Auditing Schemes for Data Verification in Remote Cloud Servers

Cloud computing is the opportunistic model that provides a lot of services to the business organisations to concentrate more on their own business services instead of spending more cost on maintenance. The service providers provide an unlimited storage capability to the clients with characteristics like scalability, reliability, on-demand self-service etc. Clients host their data on cloud servers and pay the cost based on their usage. The data consumers can access the data from the cloud servers. Because of lack of access control and data may tamper by malicious users, business organisations hesitating to use the cloud computing. Ensuring the data storage correctness and integrity is one of the major issues in the cloud computing. In this paper, we discussed the various integrity system models that are available and the procedure for the various existing integrity verification schemes proposed. Finally, those schemes are analysed in terms of security and performance.

Broken Integrity Detection of Video Files in Video Event Data Recorders

As digital evidence has a highly influential role in proving the innocence of suspects, methods for integrity verification of such digital evidence have become essential in the digital forensic field. Most surveillance camera systems are not equipped with proper built-in integrity protection functions. Because digital forgery techniques are becoming increasingly sophisticated, manually determining whether digital content has been falsified is becoming extremely difficult for investigators. Hence, systematic approaches to forensic integrity verification are essential for ascertaining truth or falsehood. We propose an integrity determination method that utilizes the structure of the video content in a Video Event Data Recorder (VEDR). The proposed method identifies the difference in frame index fields between a forged file and an original file. Experiments conducted using real VEDRs in the market and video files forged by a video editing tool demonstrate that the proposed integrity verification scheme can detect broken integrity in video content.

A data integrity verification scheme in mobile cloud computing

The provable data possession (PDP) scheme is vital to data-oriented mobile cloud computing security architecture. Without an efficient PDP scheme, users cannot verify whether the server retrieves original data before the data is being processed. One big issue of recent PDP verification schemes is that computation complexity and space overheads are very high. In this paper, we develop 2 comprehensive mobile provable data possession schemes (MPDP) using a hash tree data structure and a Boneh–Lynn–Shacham short signature scheme. Our MPDP schemes support data dynamics via verification outsourcing, blockless verification, stateless verification, and dynamic data operations. Experimental results show that these 2 MPDP schemes are highly accurate in the data verification process, and have a low data transmission cost.

LBT-based cloud data integrity verification scheme

LBT-based cloud data integrity verification scheme

SCLPV: Secure Certificateless Public Verification for Cloud-Based Cyber-Physical-Social Systems Against Malicious Auditors

Cyber-physical-social system (CPSS) allows individuals to share personal information collected from not only cyberspace but also physical space. This has resulted in generating numerous data at a user’s local storage. However, it is very expensive for users to store large data sets, and it also causes problems in data management. Therefore, it is of critical importance to outsource the data to cloud servers, which provides users an easy, cost-effective, and flexible way to manage data, whereas users lose control on their data once outsourcing their data to cloud servers, which poses challenges on integrity of outsourced data. Many schemes have been proposed to allow a third-party auditor to verify data integrity using the public keys of users. Most of these schemes bear a strong assumption: the auditors are honest and reliable, and thereby are vulnerability in the case that auditors are malicious. Moreover, in most of these schemes, an auditor needs to manage users certificates to choose the correct public keys for verification. In this paper, we propose a secure certificateless public integrity verification scheme (SCLPV). The SCLPV is the first work that simultaneously supports certificateless public verification and resistance against malicious auditors to verify the integrity of outsourced data in CPSS. A formal security proof proves the correctness and security of our scheme. In addition, an elaborate performance analysis demonstrates that the SCLPV is efficient and practical. Compared with the only existing certificateless public verification scheme (CLPV), the SCLPV provides stronger security guarantees in terms of remedying the security vulnerability of the CLPV and resistance against malicious auditors. In comparison with the best of integrity verification scheme achieving resistance against malicious auditors, the communication cost between the auditor and the cloud server of the SCLPV is independent of the size of the processed data, meanwhile, the auditor in the SCLPV does not need to manage certificates.

Freecursive ORAM

Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns as seen by untrusted storage. Recently, ORAM has been architected into secure processors. A big challenge for hardware ORAM schemes is how to efficiently manage the Position Map (PosMap), a central component in modern ORAM algorithms. Implemented naively, the PosMap causes ORAM to be fundamentally unscalable in terms of on-chip area. On the other hand, a technique called Recursive ORAM fixes the area problem yet significantly increases ORAM's performance overhead. To address this challenge, we propose three new mechanisms. We propose a new ORAM structure called the PosMap Lookaside Buffer (PLB) and PosMap compression techniques to reduce the performance overhead from Recursive ORAM empirically (the latter also improves the construction asymptotically). Through simulation, we show that these techniques reduce the memory bandwidth overhead needed to support recursion by 95%, reduce overall ORAM bandwidth by 37% and improve overall SPEC benchmark performance by 1.27x. We then show how our PosMap compression techniques further facilitate an extremely efficient integrity verification scheme for ORAM which we call PosMap MAC (PMMAC). For a practical parameterization, PMMAC reduces the amount of hashing needed for integrity checking by >= 68x relative to prior schemes and introduces only 7% performance overhead. We prototype our mechanisms in hardware and report area and clock frequency for a complete ORAM design post-synthesis and post-layout using an ASIC flow in a 32~nm commercial process. With 2 DRAM channels, the design post-layout runs at 1~GHz and has a total area of .47~mm2. Depending on PLB-specific parameters, the PLB accounts for 10% to 26% area. PMMAC costs 12% of total design area. Our work is the first to prototype Recursive ORAM or ORAM with any integrity scheme in hardware.

Freecursive ORAM

Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns as seen by untrusted storage. Recently, ORAM has been architected into secure processors. A big challenge for hardware ORAM schemes is how to efficiently manage the Position Map (PosMap), a central component in modern ORAM algorithms. Implemented naively, the PosMap causes ORAM to be fundamentally unscalable in terms of on-chip area. On the other hand, a technique called Recursive ORAM fixes the area problem yet significantly increases ORAM's performance overhead. To address this challenge, we propose three new mechanisms. We propose a new ORAM structure called the PosMap Lookaside Buffer (PLB) and PosMap compression techniques to reduce the performance overhead from Recursive ORAM empirically (the latter also improves the construction asymptotically). Through simulation, we show that these techniques reduce the memory bandwidth overhead needed to support recursion by 95%, reduce overall ORAM bandwidth by 37% and improve overall SPEC benchmark performance by 1.27x. We then show how our PosMap compression techniques further facilitate an extremely efficient integrity verification scheme for ORAM which we call PosMap MAC (PMMAC). For a practical parameterization, PMMAC reduces the amount of hashing needed for integrity checking by >= 68x relative to prior schemes and introduces only 7% performance overhead. We prototype our mechanisms in hardware and report area and clock frequency for a complete ORAM design post-synthesis and post-layout using an ASIC flow in a 32~nm commercial process. With 2 DRAM channels, the design post-layout runs at 1~GHz and has a total area of .47~mm2. Depending on PLB-specific parameters, the PLB accounts for 10% to 26% area. PMMAC costs 12% of total design area. Our work is the first to prototype Recursive ORAM or ORAM with any integrity scheme in hardware.

Integrity Verification Scheme of Video Contents in Surveillance Cameras for Digital Forensic Investigations

Integrity Verification Scheme of Video Contents in Surveillance Cameras for Digital Forensic Investigations

An Improved Privacy Preserving Construction for Data Integrity Verification in Cloud Storage

The increasing demand in promoting cloud computing in either business or other areas requires more security of a cloud storage system. Traditional cloud storage systems fail to protect data integrity information (DII), when the interactive messages between the client and the data storage server are sniffed. To protect DII and support public verifiability, we propose a data integrity verification scheme by deploying a designated confirmer signature DCS as a building block. The DCS scheme strikes the balance between public verifiable signatures and zero-knowledge proofs which can address disputes between the cloud storage server and any user, whoever acting as a malicious player during the two-round verification. In addition, our verification scheme remains blockless and stateless, which is important in conducting a secure and efficient cryptosystem. We perform security analysis and performance evaluation on our scheme, and compared with the existing schemes, the results show that our scheme is more secure and efficient.

A Double-Efficient Integrity Verification Scheme to Cloud Storage Data

This paper proposed two integrity verification schemes based on Schnorr Signature Scheme. One is safety integrity verification scheme (SIVS). Another is efficient integrity verification scheme (EIVS). They are difference in characteristics. EIVS has good computational costs while SIVS has high security guarantee. However, they are similar in work. The cloud storage server will choose a set of file blocks and verification blocks randomly while the user sends a challenge, and generate response values to send to the user. The user generates a set of signatures to verify the values. The aim is to check whether the cloud storage server preserves perfectly the user's file or not. In contrast with other schemes, the approach not only has double integrity verification guarantee schemes but also pay lower costs for communication and computation.

A Remote Data Integrity Verification Scheme Based on Cloud Computing

Aiming at solving data integrity protection problems in the cloud , a remote data integrity verification scheme is proposed. Firstly, the data integrity verification is constructed based on homomorphic identification and data fragment structure. Secondly, by introducing random mask, the public verification is realized and by building index-hash table (IHT), the scheme can support dynamic verification. Finally, use the MapReduce for parallel computing, which reduces computation overhead side and storage overhead. The security and performance analyses show that our proposed scheme is secure and reliable.