Skip to content
Preprint

GKS Fully Homomorphic Encryption: Security Analysis

Oct 2026 · 0 citations · 43 references
Computer Science Mathematics

Abstract

All 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. This paper presents a formal security analysis of the Gribov-Kahrobaei-Shpilrain (GKS) private-key FHE scheme. GKS requires no bootstrapping or de-linearization, produces bit-exact decryption, supports native encrypted search, and scales to unbounded depth.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.