期刊文献+

一个全同态代理重加密方案 被引量:3

A Fully Homomorphic Proxy Re-encryption Scheme Based on LWE
在线阅读 下载PDF
导出
摘要 针对现有全同态加密方案仅能对用同一密钥加密的密文进行计算的局限性,在Brakerski等构造的全同态加密方案基础上,结合密钥隐私(key-private)代理重加密的思想,并利用私钥置换技术,把某用户的密文置换成其他用户的私钥可以解密的新密文,从而构造密钥隐私的全同态代理重加密方案。该方案可以使拥有重加密密钥的代理者在不改变明文的情况下,把用委托方Alice的公钥加密后的密文转换为可以用受理方Bob的私钥解密,且代理者无法获知Alice和Bob的身份,同时,根据同态运算的性质,代理者可以对转换后的密文进行同态运算,即方案同时具有全同态的性质和代理重加密的性质,从而实现对用不同密钥加密的密文进行任意计算。另外,假如用户不使用重加密的功能,该方案将自动退化为高效的全同态加密方案(BGV方案)。所以对于不同应用需求,该方案具有较为良好的适应性。最后,在标准模型下证明了方案的CPA安全性和代理重加密的密钥隐私性。 Based on Brakerski et. al's scheme and by applying the idea of key-private proxy re-encryption,combining with the Switchkey process,the first key-private fully homomorphic proxy re-encryption scheme was presented. This scheme allows a proxy with the reencryption key to change a ciphertext under delegator's( Alice's) public key into one that can be decrypted using delegatee's( Bob's) private key,and the identity of Alice and Bob will not revealed. According to the homomorphic property,the proxy can operate on the changed ciphertexts,thus evaluate on ciphertexts encrypted under different keys,which means that the proposed scheme is a FHE and a proxy re-encryption scheme. Moreover,if users don't use the function of proxy re-encryption,the scheme will turn into an efficient fully homomorphic scheme. At last,CPA security and key-private property of the above proxy re-encryption scheme in the standard model were proved.
出处 《四川大学学报(工程科学版)》 EI CAS CSCD 北大核心 2016年第1期99-105,共7页 Journal of Sichuan University (Engineering Science Edition)
基金 国家自然科学基金资助项目(61272492 61572521 61202492) 陕西省自然科学基础研究计划资助项目(2015JM6353) 武警工程大学基础基金资助项目(WJY201521)
关键词 公钥密码系统 全同态加密 代理重加密 LWE问题 public key system fully homomorphic encryption proxy re-encryption LWE problem
作者简介 周潭平(1989-),男,博士生.研究方向:同态密码的构造与应用.E-mail:850301775@qq.com.
  • 相关文献

参考文献16

  • 1Zhang Wei,Liu Shuguang,Yang Xiaoyuan. Multi-bit homo- morphic encryption based on learning with errors over rings [ J ]. IACR Cryptology ePrint Archive, 2013,22 ( 6 ) : 138 - 138.
  • 2Benaloh J. Dense probabilistie eneryption [ C/OL ]//Pro- eeedings of the Workshop on Selected Areas of Cryptogra- phy. 1994 : 120 - 128 [ 2012 - 12 - 24 ]. http ://eiteseerx. ist. psu. edu/viewdoe/summary? doi = 10.1.1.33. 3710.
  • 3Gentry C. Fully homomorphic encryption using ideal lat- tices [ C ]//Proceedings of the 41 st Annual ACM Symposium on Theory of Computing, STOC. New York: ACM ,2009 : 169 - 178.
  • 4Boneh D,Goh E J, Nissim K. Evaluating 2-DNF formulas on eiphertexts [ M]//Theory of Cryptography. Berlin: Springer,2005 : 325 - 341.
  • 5Brakerski Z, Vaikuntanathan V. Efficient fully homomor- phic encryption from (standard) LWE [ J ]. SIAM Journal on Computing,2014,43 (2) : 831 - 871.
  • 6Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping [ C]//Pro- eeedings of the 3rd Innovations in Theoretieal Computer Science Conference. New York:ACM,2012:309 -325.
  • 7Halevi S, Shoup V. Design and implementation of a homo- morphic-encryption library [ EB/OL ]. [ 2012 - 04 - 09 ]. ht- tp ://eprint. iacr. org/2012/181.
  • 8Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors : Conceptually-simpler, asymptotically-fas- ter, attribute-based [ C ]//Advances in Cryptology--CRYPTO 2013. Berlin:Springer,2013:75 -92.
  • 9Brakerski Z,Vaikuntanathan V. Lattice-based FIlE as secure as PKE[C]//Proceedings of the 5th conference on Innova- tions in theoretical computer science. New York :ACM,2014:1 - 12.
  • 10Barrington D. Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1 [ C]//Proceedings of the eighteenth annual ACM sympo- sium on Theory of computing. New York: ACM, 1986 : 1 - 5.

二级参考文献2

共引文献7

同被引文献16

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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