Efficient method to verify the integrity of data with supporting dynamic data in cloud computing
暂无分享,去创建一个
Cheng Guo | Yingmo Jie | Bin Feng | Xinyu Tang | Bin Feng | Cheng Guo | Xinyu Tang | Yingmo Jie
[1] Cong Wang,et al. Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing , 2011, IEEE Transactions on Parallel and Distributed Systems.
[2] Roberto Di Pietro,et al. Scalable and efficient provable data possession , 2008, IACR Cryptol. ePrint Arch..
[3] Michiel H. M. Smid,et al. On the false-positive rate of Bloom filters , 2008, Inf. Process. Lett..
[4] Seema Bawa,et al. RITS-MHT: Relative indexed and time stamped Merkle hash tree based data auditing protocol for cloud computing , 2017, J. Netw. Comput. Appl..
[5] Kenneth J. Christensen,et al. A new analysis of the false positive rate of a Bloom filter , 2010, Inf. Process. Lett..
[6] Yi Mu,et al. Efficient Public Verification of Data Integrity for Cloud Storage Systems from Indistinguishability Obfuscation , 2017, IEEE Transactions on Information Forensics and Security.
[7] Reza Curtmola,et al. Provable data possession at untrusted stores , 2007, CCS '07.
[8] George Varghese,et al. An Improved Construction for Counting Bloom Filters , 2006, ESA.
[9] Jin Wang,et al. Mutual Verifiable Provable Data Auditing in Public Cloud Storage , 2015 .