Dynamic Proofs of Retrievability via Oblivious RAM

Cash, David M.; Küpçü, Alptekin; Wichs, Daniel

doi:10.1007/978-3-642-38348-9_17

Cited by 121 publications

(103 citation statements)

References 26 publications

Supporting

Mentioning

101

Contrasting

Order By: Relevance

“…Remote data integrity checks for public cloud storage have been investigated in various systems and security models [5]- [24]. Considering the large size of the outsourced data and data owner's constrained resource capability, the cost to audit data integrity in the cloud environment could be formidable and expensive to data owner.…”

Section: Related Workmentioning

confidence: 99%

“…On the other hand, many studies [6], [9], [19]- [24] consider to support data dynamics on the basis of basic PDP and PoR models. Specially, Erway et al [19] developed a PDP scheme with full data dynamics using skip list.…”

Section: Related Workmentioning

confidence: 99%

“…PDP just can verify the data integrity while PoR can further recover the original data when there is data corruption but the corruption ratio is within some threshold. Following these models, improved schemes [6], [8]- [24] have been proposed to support new features such as data dynamics, public auditability, etc. The support of data dynamics allows the data owner to modify, delete the existing data blocks and insert new blocks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

Ren

Wang

et al. 2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Cloud storage allows users to store their data in a remote server to get rid of expensive local storage and management costs and then access data of interest anytime anywhere. A number of solutions have been proposed to tackle the verification of remote data integrity and retrievability in cloud storage systems. Most of existing schemes, however, do not support efficient data dynamics and/or suffer from security vulnerabilities when involving dynamic data operations. In this paper, we propose a dynamic proof of retrievability scheme supporting public auditability and communication-efficient recovery from data corruptions. To this end, we split up the data into data blocks and encode each data block individually using outer code and inner code before outsourcing so that i) an update inside any data block only affects a few codeword symbols and ii) communication-efficient data repair for a breakdown server can be achieved and communication overhead for small data corruptions within a server can be eliminated. Based on the encoded data blocks, we utilize rb23Tree to enforce the data sequence for dynamic operations, preventing the cloud service provider from manipulating data block to pass the integrity check in the dynamic scenario. We also analyze the effectiveness of the proposed construction in defending against pollution attacks during data recovery. Formal security analysis and extensive experimental evaluations are conducted, showing that the proposed scheme is practical for use in cloud storage systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

Ren

Wang

et al. 2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…That is, the client can only perform data check and data retrieval, but cannot perform modification, insertion and deletion. A few PORs were proposed to deal with the dynamic operations, e.g, [21]- [24]; however, all these schemes are based on erasure coding, not network coding. There are two notable schemes which are mostly related to our proposed scheme.…”

Section: Introductionmentioning

confidence: 99%

D2-POR: Direct Repair and Dynamic Operations in Network Coding-Based Proof of Retrievability

Omote

Tran

2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYProof of Retrievability (POR) is a protocol by which a client can distribute his/her data to cloud servers and can check if the data stored in the servers is available and intact. After that, network codingbased POR has been applied to improve network throughput. Although many network coding-based PORs have been proposed, most of them have not achieved the following practical features: direct repair and dynamic operations. In this paper, we propose the D2-POR scheme (Direct repair and Dynamic operations in network coding-based POR) to address these shortcomings. When a server is corrupted, the D2-POR can support the direct repair in which the data stored in the corrupted server can be repaired using the data directly provided by healthy servers. The client is thus free from the burden of data repair. Furthermore, the D2-POR allows the client to efficiently perform dynamic operations, i.e., modification, insertion and deletion. key words: Proof of Retrievability, network coding, direct repair, dynamic operations

show abstract

“…Existing schemes [5]- [19] provide the data owner who holds secret keys can only modify the data. And all other users (who share data with the data owner only) have read permission.…”

Section: Introductionmentioning

confidence: 99%

Public Integrity Checking for Dynamic Data Sharing among Multi Groups

2016

IJSR

View full text Add to dashboard Cite

Cloud is un-trusted file storage, and there is still a challenging issue, i.e., frequent change of the data in an un-trusted cloud.For that a number of techniques have been proposed for data integrity auditing to ensure user's confidence of their shared data on cloud. Most of the paper focus on the original data owner who will create the data can modify the data, and the other users have only the reading permission. To enhance this work to multi-user modification therefore any user (in group) can modify the data in the cloud. Main issues of multi-user modification is used revocation, here a user can revocate, just delete the user information no need to update the signature, because the data in depend to the user. Multi file auditing is also efficiently supported in our scheme by mechanism of batch auditing. So it reduces the computational/communication cost. This work enhanced to multiple groups to access the data. This paper concluded as, a efficient integrity auditing scheme for cloud data characterized by multi-user modification, public auditing, high error detection probability, efficient user revocation, resist user impersonation attack, Multi file auditing.

show abstract

Dynamic Proofs of Retrievability via Oblivious RAM

Cited by 121 publications

References 26 publications

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

Dynamic Proofs of Retrievability for Coded Cloud Storage Systems

D2-POR: Direct Repair and Dynamic Operations in Network Coding-Based Proof of Retrievability

Public Integrity Checking for Dynamic Data Sharing among Multi Groups

Contact Info

Product

Resources

About