Journal Article10.1109/TC.2015.2401017
Secure Distributed Deduplication Systems with Improved Reliability
Jin Li,Xiaofeng Chen,Xinyi Huang,Shaohua Tang,Yang Xiang,Mohammad Mehedi Hassan,Abdulhameed Alelaiwi +6 more
168
TL;DR: This paper proposes new distributed deduplication systems with higher reliability in which the data chunks are distributed across multiple cloud servers, and achieves the security requirements of data confidentiality and tag consistency by introducing a deterministic secret sharing scheme in distributed storage systems.
read more
Abstract: Data deduplication is a technique for eliminating duplicate copies of data, and has been widely used in cloud storage to reduce storage space and upload bandwidth. However, there is only one copy for each file stored in cloud even if such a file is owned by a huge number of users. As a result, deduplication system improves storage utilization while reducing reliability. Furthermore, the challenge of privacy for sensitive data also arises when they are outsourced by users to cloud. Aiming to address the above security challenges, this paper makes the first attempt to formalize the notion of distributed reliable deduplication system. We propose new distributed deduplication systems with higher reliability in which the data chunks are distributed across multiple cloud servers. The security requirements of data confidentiality and tag consistency are also achieved by introducing a deterministic secret sharing scheme in distributed storage systems, instead of using convergent encryption as in previous deduplication systems. Security analysis demonstrates that our deduplication systems are secure in terms of the definitions specified in the proposed security model. As a proof of concept, we implement the proposed systems and demonstrate that the incurred overhead is very limited in realistic environments.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
PORs: Proofs of Retrievability for Large Files
Ari Juels,Burton S. Kaliski +1 more
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
2K
Multi-key privacy-preserving deep learning in cloud computing
TL;DR: This work presents a basic scheme based on multi-key fully homomorphic encryption (MK-FHE), and proposes a hybrid structure scheme by combining the double decryption mechanism and FHE, and proves that these two multi- key privacy-preserving deep learning schemes over encrypted data are secure.
508
Secure Multi-Party Computation: Theory, practice and applications
TL;DR: This paper presents a comprehensive survey on the theoretical and practical aspects of SMPC protocols, including its security requirements and basic construction techniques, and summarizes the concrete application-oriented protocols that are currently available.
374
Privacy-preserving outsourced classification in cloud computing
TL;DR: This work proposes a framework for privacy-preserving outsourced classification in cloud computing (POCC), and proves that the scheme is secure in the semi-honest model.
339
Security, privacy & efficiency of sustainable Cloud Computing for Big Data & IoT
TL;DR: A new system for Cloud Computing integrated with Internet of Things as a base scenario for Big Data and an architecture relaying on the security of the network are proposed in order to improve their security issues.
266
References
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Provable data possession at untrusted stores
Giuseppe Ateniese,Randal Burns,Reza Curtmola,Joseph Herring,Lea Kissner,Zachary N. J. Peterson,Dawn Song +6 more
- 28 Oct 2007
TL;DR: The provable data possession (PDP) model as discussed by the authors allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it.
Efficient dispersal of information for security, load balancing, and fault tolerance
TL;DR: Information Dispersal Algorithm (IDA) has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission ofInformation in networks, and to communications between processors in parallel computers.
2.5K
•Posted Content
Provable Data Possession at Untrusted Stores.
Giuseppe Ateniese,Randal Burns,Reza Curtmola,Joseph Herring,Lea Kissner,Zachary N. J. Peterson,Dawn Song +6 more
TL;DR: Ateniese et al. as discussed by the authors introduced the provable data possession (PDP) model, which allows a client that has stored data at an untrusted server to verify that the server possesses the original data without retrieving it.
•Posted Content
PORs: Proofs of Retrievability for Large Files
Ari Juels,Burton S. Kaliski +1 more
TL;DR: This paper defines and explores proofs of retrievability (PORs), a POR scheme that enables an archive or back-up service to produce a concise proof that a user can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.
2K