Paper analyzes security of the GKS private-key FHE scheme
Original title: GKS Fully Homomorphic Encryption: Security Analysis
The authors say GKS needs no bootstrapping, decrypts bit-exactly, and supports native encrypted search at unbounded depth.
The paper gives a formal security analysis of the Gribov-Kahrobaei-Shpilrain private-key fully homomorphic encryption scheme. It contrasts FHE with schemes that must decrypt data before use, and notes practical limits of existing FHE. The authors state that GKS avoids bootstrapping and de-linearization, produces bit-exact decryption, supports native encrypted search, and scales to unbounded depth.
Unconfirmed: Claims about GKS properties come from the authors' analysis; independent confirmation is not stated.
- The subject is the private-key GKS fully homomorphic scheme.
- Authors say GKS requires no bootstrapping or de-linearization.
- They claim bit-exact decryption and native encrypted search.
- They also claim the scheme scales to unbounded depth.
From the original article
1 min read at arxiv.orgAll traditional encryption schemes share a fundamental operational vulnerability: encrypted data must be decrypted before it can be used. Fully homomorphic encryption eliminates this vulnerability by enabling computation directly on encrypted data, but existing FHE schemes impose substantial practical constraints that limit deployment.
By John Graham · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.