期刊文献+

HES:一种更小公钥的同态加密算法

HES:A Homomorphic Encryption Scheme with Better Public Key Size
下载PDF
导出
摘要 随着第三方计算的快速发展,如何保证私有数据在加密下供第三方操作是目前的研究热点。同态加密可对加密数据进行运算,但目前从理论到工程应用仍然有许多问题需要研究。提出一种适用于云平台数据存储的同态加密算法,命名为HES(Homomorphic Encryption Scheme)。HES同态加密算法同时满足加法和乘法同态,其安全性基于近似最大公因子问题,相对DGHV方案和SDC方案,HES方案有更小的公钥尺寸,且不需要暴露密钥给服务器。在此基础上,提出了一种基于同态加密的密文优化检索算法,既实现了密文准确检索,又解决了关键字比较短的问题,保证了用户与云计算海量数据之间的安全关系。实验结果表明,HES算法加解密速度快,检索效率高,能很好的保证数据的安全性及密文数据的检索,为云平台中同态加密算法的研究提供参考。 With the rapid development of the cloud computing,how to ensure the private data to operate in secrecy for a third part has been a major focus.Homomorphic encryption can compute the encrypted data,but there are still many problems need to solve from theory to engineering application.We present a homomorphic encryption algorithm which can applied to a cloud platform data store.It is named HES(Homomorphic Encryption Scheme).HES satisfy its homomorphic addition and multiplication with state.The security of HES is based on an approximate greatest common divisor problem,HES has a better public key size compared with DGHV and CAFED.It's private key does not need to be exposed.On the basis of HES,we proposed a ciphertext optimization retrieval algorithm,which can achieve the ciphertext and solve the key problem of relatively short.It can be ensured the security between the user and cloud computing of the big data.Experimental results show that HES encryption algorithm has high speed and high retrieval efficiency.It can guarantee the data security and the encrypted data retrieval effectively.This paper can provide guidance for further study of homomorphic encryption algorithm.
作者 李浪 余孝忠
出处 《衡阳师范学院学报》 2016年第3期19-25,2,共7页 Journal of Hengyang Normal University
基金 国家自然科学基金资助项目(61572174) 湖南省自然科学基金资助项目(2015JJ4011) 湖南省教育厅资助科研重点项目(15A029) 衡阳师范学院大学生研究性学习和创新性实验计划项目(CX1639) "文化遗产与地理信息技术"大学生创新训练中心资助项目
关键词 同态加密 云计算 密文检索 homomorphic encryption cloud computing cipher retrieval
  • 相关文献

参考文献25

  • 1R.L.Rivest, L.Adleman, M.l,.Dertouzos,On data banks and privacy homomorphisms [J].Foundatkms of Security Com- putation,Academic Press. 1978,41 : 169-180.
  • 2Gentry Craig. Fully Homomorphic Encryption Using Ideal 1,attices [C]//Proc of the 41st Annual ACM Symposium on Theory of Computing. New York: ACM Press. 2009 : 169-178.
  • 3C. Jean Sebastien, A. Mandal, D. Nacache. Fully homo morphic encryption over the inlegers with shorter public kwys [C]//Proc of the 31st Annual Conference on Advances in CRYPTOLOGY. Berlin: Springer- Verlag,2011:487-504.
  • 4D. Stehle, R. Steinfeld. Fast fully homomorphic encryption [C]//Proc of ASICRYPT.2010 : 377-394.
  • 5Z.Brakerski.Fully homomorphic encryption without modulus switching from classical GapSVP [C]//Advances in Cryp tology CRYPTO. Berlin : Springer, 2012 : 868-886.
  • 6N. P. Smart. F. Vercauteren. Fully homomorphic SIMI) operations [C]//Designs. Codes and Cryptography. [S.l.] :Springer,2012 : 1-25.
  • 7C. Gentey, S. Halevi. Implementing Gentry ' s fully-homo- morphic encryption scheme [C]// Proc of the 30th Annual International Conference on Theory and Applica- tions Cryptographic Techniques: Advances in Cryptology. Berlin: Springer-Verlag,2011 : 129-148.
  • 8Van D M, Gentry C, Halevi S. Fully homomorphic en- cryption over the integers [C]//Proc of Advances in cryptology- EUROCRYPT 2010. Berlin: Springer, 2010: 24-43.
  • 9Gentry G. Computing arbitrary functions of encrypted data [J]. Communications of The ACM, 2010,53 (3): 97-105.
  • 10汤殿华,祝世雄,曹云飞.一个较快速的整数上的全同态加密方案[J].计算机工程与应用,2012,48(28):117-122. 被引量:35

二级参考文献122

  • 1Shun-DongLi Yi-QiDai.Secure Two-Party Computational Geometry[J].Journal of Computer Science & Technology,2005,20(2):258-263. 被引量:36
  • 2李顺东,戴一奇,游启友.姚氏百万富翁问题的高效解决方案[J].电子学报,2005,33(5):769-773. 被引量:43
  • 3向广利,陈莘萌,马捷,张俊红.实数范围上的同态加密机制[J].计算机工程与应用,2005,41(20):12-14. 被引量:18
  • 4Huang R W, Gui X L, Yu S, Zhuang W. Study of privacypreserving framework for cloud storage. Computer Science and Information Systems, 2011, 8(3):801-819.
  • 5Liu Q, Wang G J, Wu J. An efficient privacy preserving keyword search scheme in cloud computing//Proceedings of the 12th IEEE International Conference on Computational Science and Engineering (CSE' 09). Vancouver, Canada, 2009:715-720.
  • 6Bonech D, Crescenzo G D, Ostrovsky R, Persiano G. Public-key eneryption with keyword search//Proceedings oI the Eurocrypt 2004. Interlaken, Switzerland, 2004: 506-522.
  • 7Song D X, Wagner P, Perrig P. Practical techniques for searches on encrypted data//Proceedings of the 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, 2000:44-55.
  • 8Wang W C, Li Z W, Owens R, Bhargava B. Secure and efficient access to outsourced data//Proceedings of the 2009 ACM Workshop on Cloud Computing Security. Chicago, Illinois, USA, 2009:55-66.
  • 9Bellovin S M, Cheswick W R. Privacy-enhanced searches using encrypted bloom filters. Technical Report 2004/022, IACR ePrint Cryptography Archive, 2004.
  • 10Ohtaki Y. Partial disclosure of searchable encrypted data with support for boolean queries//Proeeedings of the 3th International Conference on Availability, Reliability and Seeurity(ARES'2008). Barcelona, Spain, 2008: 1083-1090.

共引文献176

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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