基于LWR问题的无证书全同态加密方案
Certificateless Fully Homomorphic Encryption Scheme Based on the LWR Problem
摘要: 无证书全同态加密(CLFHE)把全同态加密和无证书加密两者的优势结合了起来，它吸引了人们关注的目光。目前人们基于带误差学习(LWE)问题提出了几个CLFHE方案。带舍入学习(LWR)问题是LWE问题的变形。它免除了LWE问题中计算代价高昂的高斯噪声抽样。迄今为止人们尚未提出基于LWR问题的CLFHE方案。本文利用Gentry、Sahai和Waters提出的近似特征向量技术，基于LWR问题设计了一个CLFHE方案，并在随机预言机模型下证明了它满足INDr-CPA安全性。与已有的基于LWE问题的CLFHE方案相比，所设计的方案免除了耗时的高斯噪声抽样而具有更高的计算效率。
Abstract: Certificateless fully homomorphic encryption (CLFHE) combines the advantages of fully homomor-phic encryption and certificateless encryption. Itcatches the attention of researchers. Several CLFHE schemes have been proposed based on the learning with errors (LWE) problem. The learning with rounding (LWR) problem is a variant of the LWE problem. It dispenses withthe costly Gaussian noise sampling required in the LWE problem. So far, no CLFHE scheme based on the LWR problem has been proposed. This paper designs a CLFHE scheme based on the LWR problem using Gentry, Sahai, and Waters’s approximate eigenvector technique and proves that the designed scheme satisfies INDr-CPA securityin the random oracle model. Compared with existing CLFHE schemes based on the LWE problem, the proposedschemedispenses with the costly Gaussian noise sampling and en-joys higher computational efficiency.
文章引用：李明祥. 基于LWR问题的无证书全同态加密方案[J]. 计算机科学与应用, 2023, 13(10): 1948-1964. https://doi.org/10.12677/CSA.2023.1310193

参考文献

[1] Gentry, C. (2009) Fully Homomorphic Encryption Using Ideal Lattices. Proceedings of the 41st Annual ACM Symposi-um on Theory of Computing, Bethesda, 31 May 2009-2 June 2009, 169-178. [Google Scholar] [CrossRef] 
[2] Gentry, C., Sahai, A. and Waters, B. (2013) Homomorphic Encryp-tion from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based. In: Canetti, R., Garay, J.A., Eds., Advances in Cryptology—CRYPTO 2013. Lecture Notes in Computer Science, vol. 8042, Springer, Berlin, 75-92. [Google Scholar] [CrossRef] 
[3] Regev, O. (2009) On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. Journal of the ACM, 56, 1-40. [Google Scholar] [CrossRef] 
[4] Al-Riyami, S.S. and Paterson, K.G. (2003) Certificateless Public Key Cryptography. In: Laih, C.S., Ed., Advances in Cryptology—ASIACRYPT 2003. Lecture Notes in Computer Science, vol. 2894, Springer, Berlin, 452-473. [Google Scholar] [CrossRef] 
[5] Boneh, D. and Franklin, M. (2001) Identity-Based Encryption from the Weil Pairing. In: Kilian, J., Ed., Advances in Cryptology—CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139, Springer, Berlin, 213-229. [Google Scholar] [CrossRef] 
[6] Chen, H., Hu, Y. and Lian, Z. (2017) Leveled Homomorphic En-cryption in Certificateless Cryptosystem. Chinese Journal of Electronics, 26, 1213-1220. [Google Scholar] [CrossRef] 
[7] Li, M. (2020) Leveled Certificateless Fully Homomorphic Encryption Schemes from Learning with Errors. IEEE Access, 8, 26749-26763. [Google Scholar] [CrossRef] 
[8] Banerjee, A., Peikert, C. and Rosen, A. (2012) Pseudoran-dom Functions and Lattices. In: Pointcheval, D., Johansson, T., Eds., Advances in Cryptology—EUROCRYPT 2012. Lecture Notes in Computer Science, vol 7237, Springer, Berlin, 719-737. [Google Scholar] [CrossRef] 
[9] 李明祥, 刘照, 张明艳. 无高斯噪声的全同态加密方案[J]. 计算机应用, 2017, 37(12): 3430-3434.
[10] Luo, F., Wang, F., Wang K., et al. (2018) LWR-Based Fully Homomor-phic Encryption, Revisited. Security and Communication Networks, 2018, 5967635. [Google Scholar] [CrossRef] 
[11] Peikert, C. (2014) A Decade of Lattice Cryptography. Foundations and Trends in Theoretical Computer Science, 10, 283-424. http://dx.doi.org/10.1561/0400000074 [Google Scholar] [CrossRef] 
[12] Alwen, J. and Peikert, C. (2011) Generating Shorter Bases for Hard Random Lattices. Theory of Computing Systems, 48, 535-553. [Google Scholar] [CrossRef] 
[13] Gentry, C., Peikert, C. and Vaikuntanathan, V. (2008) Trapdoors for Hard Lattices and New Cryptographic Constructions. Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 17-20 May 2008, 197-206. [Google Scholar] [CrossRef] 
[14] Micciancio, D. and Regev, O. (2007) Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM Journal on Compu-ting, 37, 267-302. [Google Scholar] [CrossRef] 
[15] Micciancio, D. and Peikert, C. (2012) Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. In: Pointcheval, D., Johansson, T., Eds., Advances in Cryptolo-gy—EUROCRYPT 2012. Lecture Notes in Computer Science, vol. 7237, Springer, Berlin, 700-718. [Google Scholar] [CrossRef]