Affiliation:
1. Royal Holloway, University of London
Abstract
This paper develops Central Limit arguments for analysing the noise in ciphertexts in two homomorphic encryption schemes that are based on Ring-LWE. The first main contribution of this paper is to present and evaluate an average-case noise analysis for the BGV scheme. Our approach relies on the recent work of Costache et al.(SAC 2023) that gives the approximation of a polynomial product as a multivariate Normal distribution. We show how this result can be applied in the BGV context and evaluate its efficacy. We find this average-case approach can much more closely model the noise growth in BGV implementations than prior approaches, but in some cases it can also underestimate the practical noise growth. Our second main contribution is to develop a Central Limit framework to analyse the noise growth in the homomorphic Ring-LWE cryptosystem of Lyubashevsky, Peikert and Regev (Eurocrypt 2013, full version). Our approach is very general: apart from finite variance, no assumption on the distribution of the noise is required (in particular, the noise need not be subgaussian). We show that our approach leads to tighter bounds for the probability of decryption failure than those of prior work.
Publisher
International Association for Cryptologic Research
Reference48 articles.
1. On Lattices, Learning with Errors, Random Linear Codes and
Cryptography;O. Regev,2005
2. The Learning with Errors Problem (Invited Survey);O. Regev,2010
3. Lattice-based Cryptography;D. Micciancio,2009
4. A Decade of Lattice Cryptography;Chris Peikert;Foundations and Trends in Theoretical Computer Science,2016
5. Efficient Public Key Encryption Based on Ideal Lattices;D. Stehlé,2009