When HEAAN Meets FV: A New Somewhat Homomorphic Encryption with Reduced Memory Overhead
Authors:
- 15 December 2021
- book chapter
- Published by Springer Nature
- p. 265-285
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On perspective of security and privacy-preserving solutions in the internet of thingsComputer Networks, 2016
- On the concrete hardness of Learning with ErrorsJournal of Mathematical Cryptology, 2015
- Assessment of cloud-based health monitoring using Homomorphic Encryption2013
- Fully homomorphic SIMD operationsDesigns, Codes and Cryptography, 2012
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- On Ideal Lattices and Learning with Errors over Rings2010
- Fully homomorphic encryption using ideal lattices2009
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes1999
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Probabilistic encryption & how to play mental poker keeping secret all partial information1982