期刊文献+

云存储下基于代数签名的数据持有性检查方法 被引量:1

Algebraic signature based data possession checking for cloud storage
下载PDF
导出
摘要 在远程数据持有性验证的基础上应用代数签名技术,提出了适用于云存储的数据完整性检查方案.引入前向纠错码,能够在少量数据丢失的情况下复原数据以提高数据的完整性.检查者在检查过程中并不需要持有原始数据,这将极大地降低通讯开销,同时,云用户的存储开销也限制在字节级.实验结果表明:所提方法是安全可证明的;系统的性能瓶颈是由磁盘速率决定的. Cloud computing has been envisioned as a next generation information technology (IT) paradigm. The risk of losing data stored with any untrustworthy service provider is the key barrier to widespread uptake of cloud computing. This paper proposes an algebraic signature based remote data possession checking (RDPC) scheme to verify the integrity of the data stored in the cloud. This scheme integrates forward error-correcting codes to enhance the data possession guarantee, which can recover the data when a small amount of file has been deleted. The scheme allows verification without the need for the auditor to compare against the original data, which reduces the communication complexity dramatically. The Storage complexity of cloud user is reduced to several bytes information. Extensive security analysis and simulation show that the proposed scheme is highly provably secure. Finally, experiment results reveal that the computation performance is effective,and bounded by disk I/O.
出处 《东北师大学报(自然科学版)》 CAS CSCD 北大核心 2013年第4期55-61,共7页 Journal of Northeast Normal University(Natural Science Edition)
基金 国家重点基础研究发展计划项目 国家自然科学基金资助项目(61001023) 西安市科技支撑计划项目
关键词 云存储 数据持有性检查 前向纠错码 代数签名 cloud storage data possession checking forward error-correcting code algebraic signature
  • 相关文献

参考文献12

  • 1GRAY J. What next? a few remaining problems in information technology [R]. 1998.
  • 2ATENIESE G, BURNS R, CURTMOLA, et al. Provable data possession at untrusted stores [C]//Proeeedings of the 14th ACM Conference on Computer and Communications Security, New York: ACM,2007:598-609.
  • 3ATENIESE G,PIETRO R D, MANCINI I. V, et al. Scalable and efficient provable data possession [C]//Proceedings of the 4th International Conference on Security and Privacy in Communication Networks, New York: ACM,2008: 1-10.
  • 4JUELS A,KALISKI B S. Proofs of retrievability for large files [C]//Proceedings of the 14th ACM Conference on Computer and Communications Security, New York : ACM, 2007 : 584-597.
  • 5BOWERS K D,JUELS A,OPREA A. HAIL:a high-availability and integrity layer for cloud storage [C]//Proceedings of the 16th ACM Conference on Computer and Communications Security, New York: ACM, 2009 : 187-198.
  • 6DODIS Y, VADHAN S,WICHS D. Proofs of retrievability via hardness amplification [C]//Proceedings of the 6tb Theory of Cryptography Conference, Berlin : Sringer-Verlag, 2009 : 109-127.
  • 7SHAH M A,SWAMINATHAN R,BAKER M. Privacy-preserving audit and extraction of digital contents [R]. 2008:186.
  • 8WANG Q, WANG C, REN K, et al. Enabling public auditability and data dynamics for storage security in cloud computing [J].IEEE Transactions on Parallel and Distributed System, 2011,22 : 847-858.
  • 9肖达,舒继武,陈康,郑纬民.一个网络归档存储中实用的数据持有性检查方案[J].计算机研究与发展,2009,46(10):1660-1668. 被引量:24
  • 10CHEN L. Using algebraic signatures for remote data possession [C]//International Conference on Cyber-enabled Distributed Computing and Knowledge Discovery. NW Washington:IEEE Computer Society,2011:289-294.

二级参考文献16

  • 1Cooper B, Garcia-Molina H. Peer to peer data trading to preserve information [J]. ACM Trans on Information Systems, 2002, 20(2): 133-170.
  • 2Goh E, Shacham H, Mndadugu N, et al. SiRiUS: Securing remote untrustcd storage [C]//Proc of the 10th Network and Distributed Systems Security Syrup (NDSS'03). Reston, VA: Internet Society, 2003:131-145.
  • 3Kallahalla M, Riedel E, Swaminathan R, et al. Plutus: Scalable secure file sharing on untrusted storage [C] //Proc of the 2nd USENIX Conf on File and Storage Technologies (FAST'03). Berkeley, CA: USENIX, 2003:29-42.
  • 4Tompa M, Woll H. How to share a secret with cheaters [J]. Journal of Cryptography, 1988. 1(2): 133-138.
  • 5Krawczyk H. Distributed fingerprints and secure information dispersal [C] //Proc of the 12th ACM Symp on Principles of Distributed Computing ( PODC' 93). New York: ACM, 1993:207-218.
  • 6Shah M, Baker M, Mogul J, et al. Auditing to keep online storage services honest[C] //Proc of HotOS XL Berkeley, CA: USENIX, 2007.
  • 7Luby M, Rackoff C. How to construct pseudorandom permutations and pseudorandom functions [J]. SIAM Journal on Computing, 1988, 17:373-386.
  • 8Be/lare M, Canetti R, Krawczyk H. Keying hash functions for message authentication [G]//LNCS 1109: Proc of the 16th Annual Int Cryptology Conf (Crypto' 96). Berlin:Springer, 1996:1-19.
  • 9Ateniese G, Burns R, Curtmola R, et al. Provable data possession at untrusted stores [C]//Proc of the 14th ACM Conf on Computer and Communications Security (CCS'07). New York:ACM, 2007:598-609.
  • 10Filho D, Baretto P. Demonstrating data possession and uneheatable data transfer [EB/OL]. [2008-02-10]. http:// eprint. iacr. org/2006/150. pdf.

共引文献23

同被引文献7

引证文献1

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部