{"ID":2887162,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.02943","arxiv_id":"2508.02943","title":"Reliable Non-Leveled Homomorphic Encryption for Web Services","abstract":"With the ubiquitous deployment of web services, ensuring data confidentiality has become a challenging imperative. Fully Homomorphic Encryption (FHE) presents a powerful solution for processing encrypted data; however, its widespread adoption is severely constrained by two fundamental bottlenecks: substantial computational overhead and the absence of a built-in automatic error correction mechanism. These limitations render the deployment of FHE in real-world, complex network environments impractical. To address this dual challenge, this work puts forward a new FHE framework that enhances computational efficiency and integrates an automatic error correction capability through new encoding techniques and an algebraic reliability layer.Our prototype is evaluated through encrypted low-degree activation timing, one experimental public Refresh skeleton invocation, and transport-fault simulations for the Ring--BCH layer. Our current prototype quantifies the cost of encrypted low-degree activation evaluation, the additional latency of an experimental public Refresh skeleton, and the robustness gained from the Ring--BCH transport layer. The Refresh prototype should be interpreted as a skeleton rather than a complete CKKS bootstrapping implementation, since it uses a low-degree surrogate rather than a validated EvalMod circuit. In transport-fault simulations, the BCH interleaver reduces failure rates to below $0.5\\%$ under bursty faults and keeps the modeled accuracy within $0.5$ percentage points of the plaintext baseline.","short_abstract":"With the ubiquitous deployment of web services, ensuring data confidentiality has become a challenging imperative. Fully Homomorphic Encryption (FHE) presents a powerful solution for processing encrypted data; however, its widespread adoption is severely constrained by two fundamental bottlenecks: substantial computati...","url_abs":"https://arxiv.org/abs/2508.02943","url_pdf":"https://arxiv.org/pdf/2508.02943v3","authors":"[\"Baigang Chen\",\"Dongfang Zhao\"]","published":"2025-08-04T22:53:36Z","proceeding":"cs.CR","tasks":"[\"cs.CR\"]","methods":"[]","has_code":false}