• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xiao Da, Shu Jiwu, Chen Kang, Zheng Weimin. A Practical Data Possession Checking Scheme for Networked Archival Storage[J]. Journal of Computer Research and Development, 2009, 46(10): 1660-1668.
Citation: Xiao Da, Shu Jiwu, Chen Kang, Zheng Weimin. A Practical Data Possession Checking Scheme for Networked Archival Storage[J]. Journal of Computer Research and Development, 2009, 46(10): 1660-1668.

A Practical Data Possession Checking Scheme for Networked Archival Storage

More Information
  • Published Date: October 14, 2009
  • Data possession checking (DPC) is used in networked archival storage to check in real time if the remote server holds a file intact before the actual access to the file occurs. The authors present a practical DPC scheme. In a challenge-response protocol, the checker ascertains the possession of a file by asking the server to compute a hash value of some randomly appointed data blocks of the file and return it together with a corresponding verification block. With this random sampling verification method, the computational and communication overheads of possession checking are reduced while a sufficiently high confidence level is obtained. A challenge renewal mechanism based on verification block circular queue is also proposed to allow the dynamic increase of the number of effective challenges which can be issued by the checker. Analysis shows that the storage overhead on the checker side and the communications overhead between the checker and the server are constant. Experimental results show that the computational overhead of a check with a confidence level of 99.4% is 1.8ms, which is negligible compared with the cost of disk I/O; The computational overhead of file preprocessing is reduced by three orders of magnitude by avoiding using public-key cryptosystem.
  • Related Articles

    [1]Xie Qin, Zhang Qinghua, Wang Guoyin. An Adaptive Three-way Spam Filter with Similarity Measure[J]. Journal of Computer Research and Development, 2019, 56(11): 2410-2423. DOI: 10.7544/issn1000-1239.2019.20180793
    [2]Song Jinfeng, Wen Lijie, Wang Jianmin. A Similarity Measure for Process Models Based on Task Occurrence Relations[J]. Journal of Computer Research and Development, 2017, 54(4): 832-843. DOI: 10.7544/issn1000-1239.2017.20151176
    [3]Zhao Yongwei, Zhou Yuan, Li Bicheng. Object Retrieval Based on Enhanced Dictionary and Spatially-Constrained Similarity Measurement[J]. Journal of Computer Research and Development, 2016, 53(5): 1043-1052. DOI: 10.7544/issn1000-1239.2016.20150070
    [4]Wang Shaopeng, Wen Yingyou, Zhao Hong. Similarity Query Processing Algorithm over Data Stream Based on LCSS[J]. Journal of Computer Research and Development, 2015, 52(9): 1976-1991. DOI: 10.7544/issn1000-1239.2015.20140479
    [5]Xiao Yu and Yu Jian. A Weighted Self Adaptive Similarity Measure[J]. Journal of Computer Research and Development, 2013, 50(9): 1876-1882.
    [6]Shen Qingni, Du Hong, Wen Han, Qing Sihan. A Data Sealing Approach Based on Integrity Measurement Architecture[J]. Journal of Computer Research and Development, 2012, 49(1): 210-216.
    [7]Zhu Yangyong, Dai Dongbo, and Xiong Yun. A Survey of the Research on Similarity Query Technique of Sequence Data[J]. Journal of Computer Research and Development, 2010, 47(2): 264-276.
    [8]Xing Chunxiao, Gao Fengrong, Zhan Sinan, Zhou Lizhu. A Collaborative Filtering Recommendation Algorithm Incorporated with User Interest Change[J]. Journal of Computer Research and Development, 2007, 44(2): 296-301.
    [9]Liu Bing, Yan Heping, Duan Jiangjiao, Wang Wei, and Shi Baile. A Bottom-Up Distance-Based Index Tree for Metric Space[J]. Journal of Computer Research and Development, 2006, 43(9): 1651-1657.
    [10]Xiu Yu, Wang Shitong, Wu Xisheng, Hu Dewen. The Directional Similarity-Based Clustering Method DSCM[J]. Journal of Computer Research and Development, 2006, 43(8): 1425-1431.

Catalog

    Article views (831) PDF downloads (511) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return