[Resource Topic] 2011/645: Fully Homomorphic Encryption Based on Approximate Matrix GCD

Welcome to the resource topic for 2011/645

Title:
Fully Homomorphic Encryption Based on Approximate Matrix GCD

Authors: 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.

ePrint: https://eprint.iacr.org/2011/645

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .