Fully Homomorphic Encryption
MetadataShow full item record
In this paper we consider fully homomorphic encryption based on the learning with errorsproblem. We present the problem as introduced by Oded Regev in 2009 and explain asimple public key cryptosystem based on it. We show how the scheme can be modified tobe more suitable for homomorphic operations, and introduce bootstrapping, using the ideasproposed by Craig Gentry in 2009. Finally we examine bootstrapping techniques proposedby Chilotti et al. in 2016, which is the main topic of this paper.