跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.37061 · v1

GKS Fully Homomorphic Encryption: Security Analysis

John GrahamSoundes MarzouguiMiloš PavlovićVladimir Shpilrain
cs.CRmath.RA
首次提交 2026-10-27 19:28
版本更新 2026-10-27 19:28
雷达观测 2026-10-29 00:35
arXiv ↗PDF ↗

摘要

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.

作者备注：41 pages

查看 arXiv 原文 ↗阅读 PDF ↗

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存，登录后共享已有结果。

版本差异

目前只观测到一个版本，无法比较变化。之后收录新版本时，会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。

v1 · 2026-10-27 19:28 · 最新观测版本

GKS Fully Homomorphic Encryption: Security Analysis

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.

查看此版本解读 →查看此版本原文 ↗