Lattices, Homomorphic Encryption, and CKKS
Cryptography and Security
2022-05-10 v1
Abstract
This is a survey on some topics in Lattice based cryptography and Homomorphic Encryption. In particular, we define some lattice problems, LWE and RLWE, and state the reductions given by Regev and Peikert. We also give a full treatment of the recent CKKS homomorphic encryption scheme and give some worked out examples.
Cite
@article{arxiv.2205.03511,
title = {Lattices, Homomorphic Encryption, and CKKS},
author = {Vir Pathak},
journal= {arXiv preprint arXiv:2205.03511},
year = {2022}
}
Comments
One should note that CKKS has been proven to have some vulnerabilities due to an attack from Micciancio and Li. In particular, CKKS does not satisfy the security definition which they propose for for approximate encryption schemes (CKKS is one such approximate encryption scheme)