Corpus ID: 1467571

Somewhat Practical Fully Homomorphic Encryption

@article{Fan2012SomewhatPF,
  title={Somewhat Practical Fully Homomorphic Encryption},
  author={Junfeng Fan and F. Vercauteren},
  journal={IACR Cryptol. ePrint Arch.},
  year={2012},
  volume={2012},
  pages={144}
}

Junfeng Fan, F. Vercauteren

Published 2012

Computer Science

IACR Cryptol. ePrint Arch.

In this paper we port Brakerski’s fully homomorphic scheme based on the Learning With Errors (LWE) problem to the ring-LWE setting. [...] Key Method We provide a detailed, but simple analysis of the various homomorphic operations, such as multiplication, relinearisation and bootstrapping, and derive tight worst case bounds on the noise caused by these operations. The analysis of the bootstrapping step is greatly simplified by using a modulus switching trick. Finally, we derive concrete parameters for which the…Expand Abstract

View Paper

eprint.iacr.org

Save to Library

Create Alert

Cite

Launch Research Feed