Computer Science ›› 2014, Vol. 41 ›› Issue (6): 108-112.doi: 10.11896/j.issn.1002-137X.2014.06.022

Previous Articles     Next Articles

Data Assured Deletion Scheme Based on Trust Value for Cloud Storage

FENG Gui-lan and TAN Liang   

  • Online:2018-11-14 Published:2018-11-14

Abstract: The data assured deletion is a spot for cloud storage security.The data assured deletion approach which is distributed is not account for nodes’ trust in the DHT,so it will lead user can’t access data before the deadline.To solve this problem,a data assured deletion scheme based on trust value for cloud storage (DDTV) was proposed.The core of DDTV is evaluation of DHT nodes and choosing high nodes to store key shares.The dynamic property of DHT network makes keys to be deleted periodically,causing the sensitive data in cloud computing to be automatically destroyed after the expiration time.Compared with the data assured deletion approach which is distributed,the difference is that keys are pushed to DHT network based on trust value after partitioned by secret sharing scheme,especially the nodes which have high trust value will be chosen in the DDTV.This difference improves the possibility of decrypting the data before the deadline.The experiment results show that the method can not only identify the malicious node in the DHT,but also improve the success rate of key share extract.The high rate of key share extract can increase the rate of user access to sensitive data in the authorized time.

Key words: Cloud storage,Data deletion,Node trust value,Data confidentiality

[1] 武永卫,黄小猛.云存储[J].中国计算机学会通讯,2009,5(6):44-52
[2] Kohno G T,Levy A,Levy H M.Vanish:Increasing data privacy with self-destructing data [C]∥Proceedings of the 18th USENIX Seeurity Symposium.2009
[3] Yue Feng-shun,Wang Guo-jun,Liu Qin.A secure self-destructing scheme for electronic data[C]∥Proc of EUC2010.New York:IEEE Press,2010:651-658
[4] Zeng Ling-fang,Shi Zhan,Xu Sheng-jie,et al.Safevanish:An improved data self-destruction for protecting data privacy[C]∥Proc of CloudCom 2010.New York:IEEE Press,2010:521-528
[5] 王丽娜,任正伟,余荣威.一种适于云存储的数据确定性删除方法[J].电子学报,2012(2):266-273
[6] Perlman R.File System Design with Assured Delete[C]∥SISW’05Proceeding of the Third IEEE International Security in Storage Workshop.2005:83-88
[7] Tang Yang,Lee P P C,Lui J C S,et al.FADE:Secure overlay cloud storage with file assure ddeletion[C]∥Proc of the SecureComm’10.New York:ACM Press,2010.380-397
[8] Stoica I,Morris R,Karger D,et al.Chord:A scalable peer-topeer lookup service for internet applications[C]∥Proc of the SIGCOMM 2001.New York:ACM Press,2001:149-160
[9] Dabek F.A Distributed Hash Table [D].Massachusetts:Massachusetts Institute of Technology,2005
[10] Falkner J,Piatek M,John J,et al.Profiling a million user DHT[C]∥Proc of the 7th ACM SIGCOMM Conference on Internet Measurement.New York:ACM Press,2007:129-134
[11] Rhea S,Godfrey B,Karp B,et al.OpenDHT:A public DHTservice and its uses[C]∥Proceedings of ACM SIGCOMM.2005:73-84
[12] Azureus.http://www.vuze.com/
[13] Shamir A.How to share a secret [J].Communications of the ACM,1979,22(11):612-613
[14] Dou W,Wang H M,Jia Y,et al.A recommendation-based Peer-to-Peer trust model[J].Journal of Software,2004,5(4):571-583
[15] The Stanford P2P sociology project.http://p2p.standford.edu/
[16] Vanish.[EB/OL].http://vanish.cs.washington.edu/.2011-07-29

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!