ACM Home Page
Please provide us with feedback. Feedback
Secure data deduplication
Full text PdfPdf (434 KB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 4th ACM international workshop on Storage security and survivability table of contents
Alexandria, Virginia, USA
SESSION: Encryption table of contents
Pages 1-10  
Year of Publication: 2008
ISBN:978-1-60558-299-3
Authors
Mark W. Storer  University of California, Santa Cruz, Santa Cruz, CA, USA
Kevin Greenan  University of California, Santa Cruz, Santa Cruz, CA, USA
Darrell D.E. Long  University of California, Santa Cruz, Santa Cruz, CA, USA
Ethan L. Miller  University of California, Santa Cruz, Santa Cruz, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 222,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1456469.1456471
What is a DOI?

ABSTRACT

As the world moves to digital storage for archival purposes, there is an increasing demand for systems that can provide secure data storage in a cost-effective manner. By identifying common chunks of data both within and between files and storing them only once, deduplication can yield cost savings by increasing the utility of a given amount of storage. Unfortunately, deduplication exploits identical content, while encryption attempts to make all content appear random; the same content encrypted with two different keys results in very different ciphertext. Thus, combining the space efficiency of deduplication with the secrecy aspects of encryption is problematic.

We have developed a solution that provides both data security and space efficiency in single-server storage and distributed storage systems. Encryption keys are generated in a consistent manner from the chunk data; thus, identical chunks will always encrypt to the same ciphertext. Furthermore, the keys cannot be deduced from the encrypted chunk data. Since the information each user needs to access and decrypt the chunks that make up a file is encrypted using a key known only to the user, even a full compromise of the system cannot reveal which chunks are used by which users.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
N. Agrawal, W. J. Bolosky, J. R. Douceur, and J. R. Lorch. A five-year study of file-system metadata. In Proceedings of the steganographic storage. Lecture Notes in Computer Science, 2429:130--140, Mar. 2002.
 
3
 
4
 
5
 
6
 
7
P. J. Braam. The Lustre storage architecture. http://www.lustre.org/documentation.html, Cluster File Systems, Inc., Aug. 2004.
 
8
 
9
 
10
 
11
F. Douglis and A. Iyengar. Application-specific delta-encoding via resemblance detection. In Proceedings of the 2003 USENIX Annual Technical Conference, pages 113--126. USENIX, June 2003.
12
 
13
14
 
15
 
16
Health Information Portability and Accountability Act, Oct. 1996.
 
17
 
18
R. J. Honicky and E. L. Miller. Replication under scalable hashing: A family of algorithms for scalable decentralized data distribution. In Proceedings of the 18th International Parallel & Distributed Processing Symposium (IPDPS 2004), Santa Fe, NM, Apr. 2004. IEEE.
 
19
A. Iyengar, R. Cahn, J. A. Garay, and C. Jutla. Design and implementation of a secure distributed data repository. In Proceedings of the 14th IFIP International Information Security Conference (SEC'98), pages 123--135, Sept. 1998.
 
20
21
 
22
 
23
 
24
25
 
26
M. G. Oxley. (H.R.3763) Sarbanes-Oxley Act of 2002, Feb. 2002.
 
27
 
28
M. O. Rabin. Fingerprinting by random polynomials. Technical Report TR--15--81, Center for Research in Computing Technology, Harvard University, 1981.
 
29
 
30
31
32
 
33
 
34
 
35
36
 
37
 
38


Collaborative Colleagues:
Mark W. Storer: colleagues
Kevin Greenan: colleagues
Darrell D.E. Long: colleagues
Ethan L. Miller: colleagues