期刊文献+

An Improved Ciphertext Retrieval Scheme Based on Fully Homomorphic Encryption

An Improved Ciphertext Retrieval Scheme Based on Fully Homomorphic Encryption
原文传递
导出
摘要 In order to guarantee the user's privacy and the integrity of data when retrieving ciphertext in an untrusted cloud environment, an improved ciphertext retrieval scheme was proposed based on full homomorphic encryption. This scheme can encrypt two bits one time and improve the efficiency of retrieval. Moreover, it has small key space and reduces the storage space. Meanwhile, the homomorphic property of this scheme was proved in detail. The experimental results and comparisons show that the proposed scheme is characterized by increased security, high efficiency and low cost. In order to guarantee the user's privacy and the integrity of data when retrieving ciphertext in an untrusted cloud environment, an improved ciphertext retrieval scheme was proposed based on full homomorphic encryption. This scheme can encrypt two bits one time and improve the efficiency of retrieval. Moreover, it has small key space and reduces the storage space. Meanwhile, the homomorphic property of this scheme was proved in detail. The experimental results and comparisons show that the proposed scheme is characterized by increased security, high efficiency and low cost.
出处 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2019年第3期218-222,共5页 武汉大学学报(自然科学英文版)
基金 Supported by the Research Program of Chongqing Education Commission(JK15012027,JK1601225) the Chongqing Research Program of Basic Research and Frontier Technology(cstc2017jcyjBX0008) the Graduate Student Research and Innovation Foundation of Chongqing(CYB17026) the Basic Applied Research Program of Qinghai Province(2019-ZJ-7099)
关键词 fully homomorphic ENCRYPTION PUBLIC key size the GREATEST common divisor(GCD) problem CIPHERTEXT RETRIEVAL fully homomorphic encryption public key size the greatest common divisor(GCD) problem ciphertext retrieval
  • 相关文献

参考文献7

二级参考文献61

  • 1赵洋,刘勇,王佳昊,秦志光.一种改进的两方安全议价协议[J].电子科技大学学报,2007,36(3):538-540. 被引量:3
  • 2Rivest R L, Adleman L, Dertouzos M L.On data banks and privacy homomorphisms[Z].Foundations of Secure Computation, 1978.
  • 3Gentry C.Fully homomorphic encryption using ideal lattices[C]//STOC' 09,2009 : 169-178.
  • 4Gentry C.A fully homomorphic encryption scheme[D/OL]. Stanford University , 2009.http : //crypto.stanford.edu/craig.
  • 5van Dijk M, Gentry C, Halevi S, et al.Fully homomorphic encryption over the integers[C]//Volume 6110 of LNCS : Proc of Eurocrypt, 2010 : 24-43.
  • 6Smart N P, Vercauteren F.Fully homomorphic encryption with relatively small key and ciphertext sizes[C]// Volume 6056 of Lecture Notes in Computer Science: Public Key Cryptography-PKC' 10, Springer, 2010.
  • 7Stehle D, Steinfeld R.Faster fully homomorphic encryption, Cryptology ePrint Archive, Report 2010/299[EB/OL]. (2010).http://eprint.iacr.org/.
  • 8Howgrave-Graham N.Approximate integer common divisors[C]//Volume 2146 of Lecture Notes in Computer Science: CaLC' 01.[S.l.] : Springer, 2001 : 51-66.
  • 9RIVEST R, SHAMIR A, ADLEMAN L. A method for obtaining di- gital signatures and public-key cryptosystems [ J ]. Communications of the ACM,1978,21 (2) :120-126.
  • 10RIVEST R, SHAMIR A, DERTOUZOS M, On data banks and pri-va- cy homomorphisms [ J ]. Foundations of Secure Computation, 1978,7 ( 1 ) : 169-177.

共引文献72

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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