PCS: a parity-based personal data recovery service in cloud

As more and more data are generated in an electronic format, the necessity of a data recovery service has increased, and the development of more efficient data backup and recovery technology has been an important issue during the past decade. While lots of effective backup and recovery technologies have been developed for enterprise level, little work has been done for convenient and inexpensive personal data recovery service, i.e., cloud storage service is still inadequate or expensive for backing up tera-scale HDDs. Furthermore, since privacy protection is a crucial issue for providing a personal data recovery service, a plain data backup-based recovery service is not adequate for public service. Users are reluctant to upload their data to internet backup servers until they can fully trust the service provider in terms of privacy protection. We propose a novel data recovery service framework on cloud infrastructure, a parity cloud service, which provides privacy-protected personal data recovery service while requiring a small storage space in the cloud. The proposed framework does not require any user data to be uploaded to the server, but only parity data are uploaded to the server for user data recovery. Also, the necessary server-side resources for providing the service are within a reasonable bound, depending on the data recoverability and recovery time.

[1]  J. Sikora.  Disk failures in the real world : What does an MTTF of 1 , 000 , 000 hours mean to you ? , 2007 .

[2]  Spencer W. Ng,et al.  Disk scrubbing in large archival storage systems , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[3]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[4]  James S. Plank,et al.  Mean Time to Meaningless: MTTDL, Markov Models, and Storage System Reliability , 2010, HotStorage.

[5]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[6]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[7]  Michaël Quisquater,et al.  How to Explain Zero-Knowledge Protocols to Your Children , 1989, CRYPTO.

[8]  K. Srinathan,et al.  Round-Optimal and Efficient Verifiable Secret Sharing , 2006, TCC.

[9]  Dongwook Kim,et al.  Parity Cloud Service: A Privacy-Protected Personal Data Recovery Service , 2011, 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications.

[10]  Li Zhou,et al.  ORTHRUS: a lightweighted block-level cloud storage system , 2012, Cluster Computing.

[11]  Siani Pearson,et al.  Taking account of privacy when designing cloud computing services , 2009, 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing.

[12]  Jon G. Elerath.  A simple equation for estimating reliability of an N+1 redundant array of independent disks (RAID) , 2009, 2009 IEEE/IFIP International Conference on Dependable Systems & Networks.

[13]  Dan Simon,et al.  Extensible Authentication Protocol (eap) Key Management Framework , 2007 .

[14]  Fang Hao,et al.  Secure Cloud Computing with a Virtualized Network Infrastructure , 2010, HotCloud.

[15]  Albert Y. Zomaya,et al.  Energy-efficient data replication in cloud computing datacenters , 2013, GLOBECOM Workshops.

[16]  Randy H. Katz,et al.  Above the Clouds: A Berkeley View of Cloud Computing , 2009 .

[17]  Hannu H. Kari.  Latent Sector Faults and Reliability of Disk Arrays , 2005 .

[18]  Scott A. Brandt,et al.  Reliability mechanisms for very large storage systems , 2003, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings..