.png){kind=icon}
返回
Fully Homomorphic Encryption Using Hidden Ideal Lattice
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2013.2287732.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
All the existing fully homomorphic encryption schemes are based on three different problems, namely the bounded distance decoding problem over ideal lattice, the approximate greatest common divisor problem over integers, and the learning with error problem. In this paper, we unify the first two families of problems by introducing a new class of problems, which can be reduced from both problems. Based on this new problem, namely the bounded distance decoding over hidden ideal lattice, we present a new fully homomorphic encryption scheme. Since it is a combination of the two problems to some extent, the performance of our scheme lies between the ideal lattice based schemes and the integer based schemes. Furthermore, we also show a lower bound and upper bound of the problem that our scheme is based on. Assuming this security conjecture holds, we can incorporate smaller parameters, which will result in a scheme that is more efficient than both lattice based and integer based schemes. Hence, our scheme makes a perfect alternative to the state-of-art ring learning with error based schemes.
Keyword:
Hidden lattice
ideal lattice
bounded distance decoding problem
fully homomorphic encryption
approximate greatest common divisor
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
引用论文
Response and Prediction of Improvement in Gait Speed From Functional Electrical Stimulation in Persons With Poststroke Drop Foot.png)
PM&R
PM&RIF0
PREAI
分享收藏分享收藏
查看更多内容