• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (4): 167-170.

• 论文 • Previous Articles     Next Articles

An Efficient Verification for Outsourced Data Based on Subtree

WANG Zhengfei   

  1. (1.Institute of Computer Science,Hunan Business College,Changsha 410205;
    2.School of Computer Science,National University of Defense Technology,Changsha 410073,China)
  • Received:2011-11-05 Revised:2012-02-10 Online:2012-04-26 Published:2012-04-25

Abstract:

In the model of cloud computing, data are stored in the cloud service providers, users need to verify the authectication and completeness of the returned data . Efficient verfication are becoming an important aspect of the cloud computing. We propose an approach based on subtree, that constructs an Merkle B tree to store the related information, and verify the authentication and completeness of data through computing the least validation subtree. In contrast with the previous work such as MB and EMB, this approach increases the verification rate by  15%.

Key words: database outsourced;completenesss;authentictity;verfication