Paper 2011/645

Fully Homomorphic Encryption Based on Approximate Matrix GCD

Gu Chunsheng

Abstract

We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption scheme (FHE) based on the variant AMGCD, whose security depends on the hardness assumption of the variant AMGCD problem.

Note: We have found a security problem for previous version.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Fully Homomorphic EncryptionApproximate Matrix GCDLearning with ErrorApproximate GCD
Contact author(s)
guchunsheng @ gmail com
History
2011-12-04: last of 3 revisions
2011-11-30: received
See all versions
Short URL
https://ia.cr/2011/645
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/645,
      author = {Gu Chunsheng},
      title = {Fully Homomorphic Encryption Based on Approximate Matrix GCD},
      howpublished = {Cryptology ePrint Archive, Paper 2011/645},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/645}},
      url = {https://eprint.iacr.org/2011/645}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.