Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?

被引:48
作者
Costache, Ana [1 ]
Smart, Nigel P. [1 ]
机构
[1] Univ Bristol, Dept Comp Sci, Bristol, Avon, England
来源
TOPICS IN CRYPTOLOGY - CT-RSA 2016 | 2016年 / 9610卷
关键词
D O I
10.1007/978-3-319-29485-8_19
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The purpose of this paper is to compare side-by-side the NTRU and BGV schemes in their non-scale invariant (messages in the lower bits), and their scale invariant (message in the upper bits) forms. The scale invariant versions are often called the YASHE and FV schemes. As an additional optimization, we also investigate the ffect of modulus reduction on the scale-invariant schemes. We compare the schemes using the "average case" noise analysis presented by Gentry et al. In addition we unify notation and techniques so as to show commonalities between the schemes. We find that the BGV scheme appears to be more efficient for large plaintext moduli, whilst YASHE seems more efficient for small plaintext moduli (although the benefit is not as great as one would have expected).
引用
收藏
页码:325 / 340
页数:16
相关论文
共 17 条
[1]  
[Anonymous], LNCS
[2]  
[Anonymous], MULTIPARTY COMPUTATI
[3]  
[Anonymous], FULLY HOMOMORPHIC EN
[4]  
[Anonymous], DES CODES C IN PRESS
[5]  
[Anonymous], 2012, P ITCS 12 CIT
[6]  
[Anonymous], HOMOMORPHIC EVALUATI
[7]  
[Anonymous], 2012, STOC
[8]  
Bos Joppe W., 2013, Cryptography and Coding. 14th IMA International Conference, IMACC 2013. Proceedings: LNCS 8308, P45, DOI 10.1007/978-3-642-45239-0_4
[9]  
Fan J., 2012, 2012144 CRYPT EPRIN
[10]  
Gentry C., 2009, FULLY HOMOMORPHIC EN, V20