A tunable proof of ownership scheme for deduplication using Bloom filters

Abstract

Deduplication is a widely used technique in storage services, since it affords a very efficient usage of resourcesbeing especially effective for consumer-grade storage services (e.g. Dropbox). Deduplication has been shown to suffer from several security weaknesses, the most severe ones enabling a malicious user to obtain possession of a file it is not entitled to. Standard solutions to this problem require users to prove possession of data prior to its upload. Unfortunately, the schemes proposed in the literature are very taxing on either the server or the client side. In this paper, we introduce a novel solution based on Bloom filters that provides a flexible, scalable, and provably secure solution to the weaknesses of deduplication, and that overcomes the deficiencies of existing approaches. We provide a formal description of the scheme, a thorough security analysis, and compare our solution against multiple existing ones, both analytically and by means of extensive benchmarking. Our results confirm the quality and viability of our approach.

ase-PoW: A Proof of Ownership Mechanism for Cloud Deduplication in Hierarchical Environments

“…The security analysis of ase-PoW is based on ce-PoW [14] and builds on the earlier proofs of Di Pietro et al [12] and Blasco et al [13]. The adversary is challenged on J independent chunk positions where the probability of success is:…”

“…In contrast to [12] and [13] which do not apply encryption and to [14] which applies CE, a symmetric encryption scheme is applied herein. It ensures encrypted chunks are independent of files entropy, thus preventing this attack.…”

“…We now evaluate the complexity of ase-PoW with that of Di Pietro et al [12], Blasco et al [13] and González-Manzano et al [14]. In particular, the evaluations (see Table 1) focus on client and server computation and I/O, server memory usage, bandwidth, and number of used keys (if required).…”

“…Several PoW schemes extending the work of Halevi et al have been proposed in the literature. For example, Di Pietro et al [12] propose the s-PoW scheme designed to enhance client-side efficiency, Blasco et al [13] present the bf-PoW scheme designed to achieve flexibility and scalability, and González-Manzano et al [14] propose the ce-PoW scheme designed to deal with honest-but-curious servers and to achieve efficiency. In a hierarchical deployment, deduplication also needs to ensure that users have rights to access the data and a number of proposals have been presented in this regard [15,16,17,18,19,20,21].…”

Data Deduplication Methods: A Review

“…For this purpose Vedic mathematical methods such as [20] can be used, especially where the resources (memory to store and compute) keys are constrained. The constrained memory scenarios are the normally found in Cloud and IoT industry.…”