Dynamic Provable Data Possession

Erway, C. Chris; Küpçü, Alptekin; Papamanthou, Charalampos; Tamassia, Roberto

doi:10.1145/2699909

Cited by 448 publications

(382 citation statements)

References 52 publications

(44 reference statements)

Supporting

Mentioning

380

Contrasting

Order By: Relevance

“…In 2012, Newsweek of the US declared the death of printed newspapers. Through Big Data flows, paper manufacturers have to identify new items with which they can cope with future environments and new products that they can make with paper [15]. Just as Xerox is selling document An Efficient Authentication Scheme to Protect User Privacy… management consulting services rather than copiers and IBM is selling new software and servers and abandoning PC sales, paper manufacturers have to rethink their future [16].…”

Section: Norske Skogmentioning

confidence: 99%

An Efficient Authentication Scheme to Protect User Privacy in Seamless Big Data Services

Jeong

Shin

2015

Wireless Pers Commun

View full text Add to dashboard Cite

Recently, due to the increase in the volume and types of data processed in cloud environments, methods that allow easy access to Big Data stored in heterogeneous devices in different network environments are in demand. This study proposes a security management scheme that allows users to easily access Big Data from different network environments by assigning a key shared among users and servers, and linking Big Data and user's attribute information in order to protect the privacy of users using Big Data in cloud environments and the data itself. The proposed scheme possesses a high level of safety even when the user-generated random-bit signal is interrupted or modulated by a third party. It is also used in sharing users' security awareness information since it passes sufficient random bits. In addition, users' anonymity is guaranteed because the scheme passes hash-chained bit sequence values so the bit sequence that generates security awareness information is not exposed unnecessarily to a third party.

show abstract

Section: Norske Skogmentioning

confidence: 99%

An Efficient Authentication Scheme to Protect User Privacy in Seamless Big Data Services

Jeong

Shin

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Accumulators for batch updates are presented in [55] and accumulator-like expressions to authenticate static sets for provable data possession are presented in [1,19]. The work in [48] studies efficient algorithms for accumulators with unknown trapdoor information.…”

Section: Related Workmentioning

confidence: 99%

Authenticated Hash Tables Based on Cryptographic Accumulators

2015

Self Cite

View full text Add to dashboard Cite

Suppose a client stores n elements in a hash table that is outsourced to an untrusted server. We address the problem of authenticating the hash table operations, where the goal is to design protocols capable of verifying the correctness of queries and updates performed by the server, thus ensuring the integrity of the remotely stored data across its entire update history. Solutions to this authentication problem allow the client to gain trust in the operations performed by a faulty or even malicious server that lies outside the administrative control of the client. We present two novel schemes that implement an authenticated hash table. An authenticated hash table exports the basic hash-table functionality for maintaining a dynamic set of elements, A preliminary version of this paper [44] was presented at the 15th 123 Algorithmica coupled with the ability to provide short cryptographic proofs that a given element is a member or not of the current set. By employing efficient algorithmic constructs and cryptographic accumulators as the core security primitive, our schemes provide constant proof size, constant verification time and sublinear query or update time, strictly improving upon previous approaches. Specifically, in our first scheme which is based on the RSA accumulator, the server is able to construct a (non-)membership proof in constant time and perform updates in O (n log n) time for any fixed constant 0 < < 1. A variation of this scheme achieves a different trade-off, offering constant update time and O(n ) query time. Our second scheme uses an accumulator based on bilinear pairings to achieve O(n ) update time at the server while keeping all other complexities constant. A variation of this scheme achieves O(n log n) time for queries and constant update time. An experimental evaluation of both solutions shows their practicality.

show abstract

“…Similar to [21], only partial support for dynamic data operation is considered. Erway et al [12] extended the PDP model in [1] to support dynamic updates to stored data files using rank-based authenticated skip lists. However, the efficiency of their scheme remains unclear and these schemes hold good only for verifying a single copy.…”

Section: Related Workmentioning

confidence: 99%

Efficient integrity verification of replicated data in cloud using homomorphic encryption

Mukundan

Madria

Linderman

2014

Distrib Parallel Databases

View full text Add to dashboard Cite

The cloud computing is an emerging model in which computing infrastructure resources are provided as a service over the internet. Data owners can outsource their data by remotely storing them in the cloud and enjoy on-demand high quality services from a shared pool of configurable computing resources. However, since data owners and the cloud servers are not in the same trusted domain, the outsourced data may be at risk as the cloud server may no longer be fully trusted. Therefore, data confidentiality, availability and integrity is of critical importance in such a scenario. The 123Distrib Parallel Databases on all the remotely stored copies. To deal with such problems, previous multi copy verification schemes either focused on static files or incurred huge update costs in a dynamic file scenario. In this paper, we propose a dynamic multi-replica provable data possession scheme (DMR-PDP) that while maintaining data confidentiality prevents the CSP from cheating, by maintaining fewer copies than paid for and/or tampering data. In addition, we also extend the scheme to support a basic file versioning system where only the difference between the original file and the updated file is propagated rather than the propagation of operations for privacy reasons. DMR-PDP also supports efficient dynamic operations like block modification, insertion and deletion on replicas over the cloud servers. Through security analysis and experimental results, we demonstrate that the proposed scheme is secure and performs better than some other related ideas published recently.

show abstract

Dynamic Provable Data Possession

Cited by 448 publications

References 52 publications

An Efficient Authentication Scheme to Protect User Privacy in Seamless Big Data Services

An Efficient Authentication Scheme to Protect User Privacy in Seamless Big Data Services

Authenticated Hash Tables Based on Cryptographic Accumulators

Efficient integrity verification of replicated data in cloud using homomorphic encryption

Contact Info

Product

Resources

About