Lattices, Homomorphic Encryption, and CKKS
cs.CRarXiv:2205.03511
Vir Pathak
Published May 7, 2022
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.
Author comment
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)
More in cs.CR
- Understanding the Resource Cost of Fully Homomorphic Encryption in Quantum Federated LearningLukas Böhm, Arjhun Swaminathan, Anika Hannemann +1
- FHE-SQL: Fully Homomorphic Encrypted SQL DatabasePo-Yu Tseng, Po-Chu Hsu, Shih-Wei Liao
- Leveraging ASIC AI Chips for Homomorphic EncryptionJianming Tong, Tianhao Huang, Jingtian Dang +9
- Revisiting Fully Homomorphic Encryption SchemesNimish Jain, Aswani Kumar Cherukuri
- IEEE Big Data Cup 2022: Privacy Preserving Matching of Encrypted Images with Deep LearningVrizlynn L. L. Thing