一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

一種新的云存儲數(shù)據(jù)容錯存儲方式檢驗(yàn)方法

紀(jì)倩,  楊超,  趙文紅,  張俊偉

紀(jì)倩, 楊超, 趙文紅, 張俊偉. 一種新的云存儲數(shù)據(jù)容錯存儲方式檢驗(yàn)方法[J]. 電子與信息學(xué)報(bào), 2016, 38(10): 2640-2646. doi: 10.11999/JEIT151344
引用本文: 紀(jì)倩, 楊超, 趙文紅, 張俊偉. 一種新的云存儲數(shù)據(jù)容錯存儲方式檢驗(yàn)方法[J]. 電子與信息學(xué)報(bào), 2016, 38(10): 2640-2646. doi: 10.11999/JEIT151344
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

一種新的云存儲數(shù)據(jù)容錯存儲方式檢驗(yàn)方法

doi: 10.11999/JEIT151344
  • 1.

    (西安電子科技大學(xué)計(jì)算機(jī)學(xué)院 西安 710071) ②(嘉興學(xué)院南湖學(xué)院 嘉興 314001)

基金項(xiàng)目: 

國家自然科學(xué)基金青年基金(61303219)，國家自然科學(xué)基金(61672415)，中央高?；究蒲袠I(yè)務(wù)費(fèi)(JB140303)

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

  • 1.

    JI Qian① YANG Chao① ZHAO Wenhong② ZHANG Junwei

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)

  • 摘要: 云存儲中，防止數(shù)據(jù)丟失的關(guān)鍵是實(shí)現(xiàn)文件容錯。然而，云存儲服務(wù)商可能沒有提供承諾的容錯水平，導(dǎo)致用戶蒙受數(shù)據(jù)丟失和經(jīng)濟(jì)損失的雙重風(fēng)險(xiǎn)?，F(xiàn)有云存儲數(shù)據(jù)容錯存儲方式檢驗(yàn)方法存在服務(wù)器預(yù)讀取欺騙攻擊，并且效率低、實(shí)用性差，不能達(dá)到在一定概率范圍內(nèi)，快速、輕量級地檢測出犯規(guī)的服務(wù)器行為的要求。針對上述問題，該文利用磁盤順序存取和隨機(jī)存取的差異性設(shè)計(jì)了一種遠(yuǎn)程數(shù)據(jù)容錯存儲方式檢驗(yàn)方法 隨機(jī)與順序訪問時(shí)間差異化(DRST)方法，其原理是文件塊被分散地放在不同磁盤上，讀取一個磁盤上順序存儲的文件塊比隨機(jī)讀取不同磁盤上的文件塊所需的響應(yīng)時(shí)間短。最后，對所提方法進(jìn)行了嚴(yán)格的理論證明和深入的性能分析，結(jié)果表明，所提方法能夠快速檢驗(yàn)出服務(wù)器是否為用戶提供了其承諾的容錯水平，并且比現(xiàn)有方案更安全，更高效。
    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.
    • HTML全文
  • 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.
  • 加載中
計(jì)量
  • 文章訪問數(shù):  1265
  • HTML全文瀏覽量:  205
  • PDF下載量:  280
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2015-12-01
  • 修回日期:  2016-07-12
  • 刊出日期:  2016-10-19

目錄

    /

    返回文章
    返回