New Method for Checking the Data Stored with Fault Tolerance in Cloud

JI Qian; YANG Chao; ZHAO Wenhong; ZHANG Junwei

doi:10.11999/JEIT151344

Volume 38 Issue 10

Oct. 2016

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2016 > 38(10): 2640-2646

JI Qian, YANG Chao, ZHAO Wenhong, ZHANG Junwei. New Method for Checking the Data Stored with Fault Tolerance in Cloud[J]. Journal of Electronics & Information Technology, 2016, 38(10): 2640-2646. doi: 10.11999/JEIT151344

Citation:

JI Qian, YANG Chao, ZHAO Wenhong, ZHANG Junwei. New Method for Checking the Data Stored with Fault Tolerance in Cloud[J]. Journal of Electronics & Information Technology, 2016, 38(10): 2640-2646. doi: 10.11999/JEIT151344

Citation:

PDF( 834 KB)

New Method for Checking the Data Stored with Fault Tolerance in Cloud

doi: 10.11999/JEIT151344

1.
JI Qian① YANG Chao① ZHAO Wenhong② ZHANG Junwei
2.

Funds:

The National Natural Science Youth Foundation of China (61303219), The National Natural Science Foundation of China (61672415), The Fundamental Research Funds for the Central Universities (JB140303)

Received Date: 2015-12-01
Rev Recd Date: 2016-07-12
Publish Date: 2016-10-19

Abstract

Abstract

Implementation of file fault tolerance is the key for preventing data loss in cloud. However, cloud storage service providers may not offer the committed level, which results in that users may suffer data loss and economic loss. Existing inspection algorithms of testing of data fault tolerance in cloud have disadvantages such as spoofing attack of pre-fetch, low efficiency and poor practicality, which can not detect the foul behavior of cloud storage providers within a certain probability. To deal with the above problems, utilizing the difference of sequential access and random access, a remote testing algorithm of data fault tolerance in cloud named (Difference of Random and Sequential access Time) (DRST) is designed. The core idea is that the time of reading blocks of a file stored in order on a disk is much shorter than reading blocks of a file stored random on different disks. A strict theoretical proof and a in-depth performance analysis to the proposed scheme are carried out. The results show that the proposed scheme can accurately detect whether the cloud storage provider supplies clients with the committed level of fault tolerance.Whats more, the proposed scheme is much more efficient than the existing ones.
- Cloud storage,
- Cloud file security,
- Data fault tolerance,
- Random access,
- Sequential access

FullText(HTML)

References(13)

References

Chinese Institute of Electronics. Future oriented cloud service providers[C]. The Seventh Annual China Cloud Computing Conference, Beijing, China, 2015: 1080-1092.

BARACALDO N, ANDROULAKI E, GLIDER J, et al. [a16]Reconciling end-to-end confidentiality and data reduction in cloud storage[C]. Proceedings of the 6th ACM Workshop on Cloud Computing Security, Scottsdale, AZ, USA, 2014: 4003-4108.

BOWERS K, DIJK M, JUELS A, et al. How to tell if your cloud files are vulnerable to drive crashes[C]. Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS), Chicago, IL, USA, 2011: 2780-2814.

LORENA G and ORFILA A. An efficient confidentiality- preserving proof of ownership for deduplication[J]. Journal of Network and Computer Applications, 2015, 50: 49-59.

LI M, QIN C, and LEE P. CDStore: toward reliable, secure, and cost-efficient cloud storage via convergent dispersal[C]. Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference, Santa Clara, CA, USA, 2015: 3508-3520.

JUELS A and KALISKI B. PORsproofs of retrievability for large files[C]. Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS), Alexandia, USA, 2007: 584-597.

SHACHAM H and WATERS B. Compact proofs of retrievability[C]. Asiacrypt 2008, Springer-Verlag, Josef

Pieprzyk, 2008: 90-107.

ATENIESE G, BURNS R, CURTMOLA R, et al. Provable data possession at untrusted stores[C]. Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS), Alexandia, USA, 2007: 598-609.

DODIS Y, VADHAN S, and WICHS D. Proofs of retrievability via hardness amplification[C]. Theory of Cryptography Conference (TCC), San Francisco, USA, 2009: 235-248.

CURTMOLA R, KHAN O, BURNS R, et al. MR.PDP: Multiple-replica provable data possession[C]. Proceedings of 28th IEEE International Conference on Distributed Computing Systems (ICDCS), Beijing, China, 2008: 767-779.

WANG Z, SUN K, JING J, et al. Disk storage isolation and verication in cloud[C]. Proceedings of the Globecom, Anaheim, USA, 2012: 898-910.

WANG Z, SUN K, JING J, et al. Verification of data redundancy in cloud storage[C]. Proceedings of the International Workshop on Security in Cloud Computing, Hangzhou, China, 2013: 457-468.

Relative Articles

Supplements(0)

Cited By

Proportional views