![]() ![]() Huan-ping, L.I.U., Yi-xian, Y.A.N.G.: Generalized (k, n) - threshold scheme. Massachusetts Institute of Technology, Massachusetts (2005) ACM Press, New York (2001)ĭabek, F.: A Distributed Hash Table. Stoica, I., Morris, R., Karger, D., et al.: Chord: a scalable peer-to-peer lookup service for internet applications. DHT network used Vuze DHT the validity period of the data is 8 h that DHT network. University of Electronic Science and Technology (2011) Even if there is a backup of the cipher text in the cloud storage. Wei, A.: DHT Network Measurement and Analysis. Wang, W., Li, Z., Owens, R., et al.: Secure and efficient access to outsourced data. Wang, Li-na, Ren, Zheng-wei, Yu, Rong-wei, Han, Feng, Dong, Yong-feng: A method for deterministic data removal for cloud storage. Zhang, K., Yang, C., Ma, J., Zhang, J.: Study on deterministic deletion of cloud data based on cipher text sampling fragmentation. Zeng, L., Shi, Z., Xu, S., et al.: Safevanish: animproved data self-destruction for protecting data privacy. Yue, F., Wang, G., Liu, Q.: A secure self-destruct-ing scheme for electronic data. The bittorrent library/script was made as a method for discovery of bittorrent peers and bittorrent nodes. In: Proceedings of the SecureComm 2010, pp. I need to mention that not all bittorrent peers were DHT nodes, but looking through the vuze docs intuitively Id say that all vuze peers are vuze nodes, but this is not clear from the documentation. Tang, Y., Lee, P.P.C, Lui, J.C.S., et al.: FADE: secure overlay cloud storage with file assured deletion. In: SISW 2005 Proceeding of the Third IEEE International Security in Storage Workshop, pp. ![]() Perlman, R.: File system design with assured delete. The theoretical analysis and experimental results show that the scheme can effectively delete some fragmented cipher texts and key, and has low performance cost, which can meet the requirements for deterministic deletion of excessive data or backup files in cloud storage system. Using the idea of fragmented cipher text dynamic deletion, in the unauthorized time even if in the case that the key is leaked, illegal user can not get all the cipher text and key, and can not restore the complete data. The core of this scheme is to use the dynamic characteristics of DHT network to realize the periodic deletion of fragmented cipher text. For this reason, this paper proposes a data deletion scheme that is dynamic deletion is based on fragmented cipher text and key. libdht works, its only issue is that it doesnt use a bencoded protocol. Once the key or the cloud backup of the cipher text is stolen, data privacy will be threatened. Azureus uses its DHT as a tracker backup or supplement, while mainline uses it. As upload speed only counts PER torrent youre downloading. However, the existing scheme simply deletes the key or the cipher text. During the life cycle of the cloud data, the technique of data deterministic deletion is designed to completely destroy the data and ensures that cloud data that is out of date or backed up in the cloud server is completely deleted or will never be decrypted or accessed. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |