期刊文献+

格上基于同态加密的数据完整性验证方案 被引量:5

Data Integrity Verification Scheme Based on Homomorphic Encryption on Lattices
下载PDF
导出
摘要 为使用户存储在半可信云服务器上的数据不被篡改或丢失,提出一种基于格密码算法的数据完整性验证方案。方案安全性基于LWE困难问题,用户运用同态加密算法对数据块进行加密,并将加密密文和原始数据上传至服务器中。分析结果表明,该方案可以实现数据持有者对数据的完整性验证,且支持数据的动态更新。 In order to ensure that the data stored on the semi trusted cloud server is not tampered or lost,a data integrity verification scheme based on lattices cipher algorithm is proposed. The security of the scheme is based on the LWE difficult problem. The user encrypts the data block by using the homomorphic encryption algorithm and uploads the encrypted ciphertext and the original data to the server. Analysis results show that the scheme can achieve data integrity verification by data holders and support dynamic updating of data.
作者 牛淑芬 田苗 王彩芬 杜小妮 NIU Shufen,TIAN Miao,WANG Caifen,DU Xiaoni(College of Computer Science and Engineering, Northwest Normal University,Lanzhou 730070, Chin)
出处 《计算机工程》 CAS CSCD 北大核心 2018年第8期174-178,183,共6页 Computer Engineering
基金 国家自然科学基金(61562077 61462077 61662071 61662069) 甘肃省杰出青年基金(1308RJDA007) 西北师范大学青年教师科研能力提升计划项目(NWNU-LKQN-14-7)
关键词 格密码 公钥同态加密 数据完整性验证 动态更新 量子攻击 LWE困难问题 lattices cryptography pubfic key homomorphic encryption data integrity verification dynamic updating quantum attack LWE difficult problem
  • 相关文献

参考文献6

二级参考文献96

  • 1李进,张方国,王燕鸣.两个高效的基于分级身份的签名方案[J].电子学报,2007,35(1):150-152. 被引量:13
  • 2Ateniese G, Burns R, Curtmola R, etal. Provable data possession atuntrusted stores [C]. Proc. of the 14th ACM conference on Computer andCommunications Security (CCS). New York: ACM Press, 2007. 598-609.
  • 3Shacham H, Waters B. Compact proofs of retrievability[C]. Advancesin Cryptology—ASIACRYPT 2008. Berlin, Heidelberg: Springer—Verlag,2008. 90-107.
  • 4Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing[C]. Advances in Cryptology—ASIACRYPT 2001. Berlin, Heidelberg:Springer—Verlag, 2001. 514-532.
  • 5Dodis Y, Vadhan S, Wichs D. Proofs of retrievability via hardnessamplification[C]. Proc. of the 6th Theory of Cryptography Conference(TCC). Berlin, Heidelberg: Springer—Verlag, 2009. 109—127.
  • 6Wang Q, Wang C, Li J, etal. Enabling public verifiability and datadynamics for storage security in cloud computing[CJ. Proc. of the 14thEuropean Symposium on Research in Computer Security (ESORICS).Berlin, Heidelberg: Springer—Verlag, 2009. 355—370.
  • 7Merkle RC. Protocols for public key cryptosystem [C]. Proc. of theIEEE Symp. on Security and Privacy. Washington: IEEE ComputerSociety, 1980.122-134.
  • 8Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices andnew cryptographic constructions [C].Proc. of the STOC 2008. Victoria,British Columbia, Canada, 2008.197—206.
  • 9Cash D, Hofheinz D, Kiltz E, etal. Bonsai trees, or how to delegatea lattice basis [C], Proc. of the EUROCRYPT 2010. French Riviera,France. LNCS 6110. Berlin: Springer—Verlag, 2010.523-552.
  • 10Boyen X. Lattice mixing and vanishing trapdoors: A framework forfully secure short signatures and more [Cj. Proc. of the PKC 2010. Paris,France. LNCS 6056. Berlin: Springer—Verlag, 2010.499—517.

共引文献29

同被引文献43

引证文献5

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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