期刊文献+

基于单服务器的群上幂指数安全外包计算方案 被引量:4

Secure and Verifiable Protocol for Outsourcing Group Power Exponent to a Single Server
下载PDF
导出
摘要 随着云计算的快速发展和大数据时代的到来,如何将一些耗时的计算任务安全地外包给不完全可信的公共云服务器引起了广泛关注.基于单服务器模型,提出了一个新的具有隐私保护的群域上的幂指数运算安全外包方案GEXP(outsourcing power exponent on a group field),能够有效避免双服务器模型存在的共谋攻击问题.与已有方案相比,方案GEXP能够以100%的概率检测出云服务器返回的错误计算结果,确保了用户对外包计算结果的可完全验证.此外,给出了方案GEXP在现有广泛研究的云存储数据完整性验证的具体应用. With the rapid development of cloud computing and the arrival of large data age,users are confronted with huge data and information to be processed which means massive amounts of difficult tasks.Consequently,how to securely outsource some time-consuming computing tasks to an untrusted public cloud server has aroused widespread concern.To realize the data privacy protection and the verifiability of calculation results in outsourcing computing,based on the single server model,this paper proposes a new privacy-preserving protocol for outsourcing power exponent on a group field,called GEXP(outsourcing power exponent on a group field).The scheme can prevent adversaries from getting any input output data.Moreover,it effectively avoids the collusion attack in the dual server model.Compared with the existing schemes,GEXP can detect the wrong result returned by the cloud server with 100%probability,which ensures that the user can fully verify the result of outsourcing calculation.The formal security analysis and experiments indicate that our scheme is to protect privacy and highly efficient.In experiments,we compare our scheme with other state-of-the-art schemes to further demonstrate the superiorities in security and efficiency.In addition,in order to prove the practicality of our scheme,this paper gives the specific application of GEXP in cloud storage data integrity verification.
作者 李帅 付安民 苏铓 陈珍珠 孙银霞 Li Shuai;Fu Anmin;Su Mang;Chen Zhenzhu;Sun Yinxia(School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094;Guizhou Provincial Key Laboratory of Public Big Data,Guizhou University,Guiyang 550025;School of Computer Science and Technology,Nanjing Normal University,Nanjing 210023)
出处 《计算机研究与发展》 EI CSCD 北大核心 2018年第11期2482-2489,共8页 Journal of Computer Research and Development
基金 国家自然科学基金项目(61572255 61502237 61702266) 江苏省"六大人才高峰"高层次人才项目(XYDXXJS-032) 江苏省自然科学基金项目(BK20150787) 贵州省公共大数据重点实验室开放课题基金项目(2017BDKFJJ031) 赛尔网络下一代互联网技术创新项目(NGII20170205)~~
关键词 云计算 指数运算 外包计算 可验证计算 隐私保护 cloud computing exponent calculation outsourcing computation verifiable computation privacy-preserving
  • 相关文献

参考文献8

二级参考文献88

  • 1Sun Microsystems, Inc. Building customer trust in cloud computing with transparent security. 2009. https://www.sun. com/offers/det ails/sun_transparency.xml.
  • 2Gentry C. Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing. Maryland, 2009. 169-178.
  • 3Gentry C. Toward basing fully homomorphic encryption on worst-case hardness. In: Proceedings of the 30th Annual Cryptology Conference. Santa Barbara, 2010. 116-137.
  • 4van Dijk M, Gentry C, Halevi S, et al. Fully homomorphic encryption over integers, In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 24-43.
  • 5Smart N P, Vercauteren F. Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Pro- ceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography. Paris, 2010. 420-443.
  • 6Stehle D, Steinfeld R. Faster fully homomorphic encryption. In: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. Singapore, 2010. 377-394.
  • 7Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Riviera, 2010. 1-23.
  • 8Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption (standard) LWE. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). Palm Springs, 2011. 97-106.
  • 9Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Proceedings of the 31st Annual Cryptology Conference. Santa Barbara, 2011. 501-521.
  • 10Benjamin D, Atallah M J. Private and cheating-free outsourcing of algebraic computations. In: Proceedings of the 6th Conference on Privacy, Security, and Trust (PST). New Brunswick, 2008. 240 -245.

共引文献250

同被引文献9

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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