Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 11 min ago
PreprintCC BY 4.0arXiv

GKS Fully Homomorphic Encryption: Security Analysis

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.

Related

  1. Fully Homomorphic Encryption for Statistical Modeling
    Balasubramanian Narasimhan
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Homomorphic Encryption with Coset Code Construction
    Haodong Yang, Venkata Gandikota
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Ideals of homomorphic images of the enveloping algebra of the Witt algebra
    Tuan Anh Pham
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Homomorphic Quantum Error Correction
    Kornikar Sen, Miguel A. Martin-Delgado
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  5. TCA-Oriented Attractor Editing in a Discrete Memristive Rulkov Neuron with Application to Lightweight IoV Image Encryption
    Shan Gao, Hongjie Wang, Weiyao Xu +3
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
BibTeX
@misc{graham2026fully,
  title = {{GKS Fully Homomorphic Encryption: Security Analysis}},
  author = {John Graham and Soundes Marzougui and Miloš Pavlović and Vladimir Shpilrain},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.37061},
  eprint = {2610.37061},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.37061},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - GKS Fully Homomorphic Encryption: Security Analysis
AU  - John Graham
AU  - Soundes Marzougui
AU  - Miloš Pavlović
AU  - Vladimir Shpilrain
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.37061
UR  - https://arxiv.org/abs/2610.37061
AB  - 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.
ER  -