Optimizing parameters for efficient computation with fully homomorphic encryption schemes

In this study, we aim to provide a parameter selection approach for the BFVrns scheme, one of the prominent fully homomorphic encryption (FHE) schemes. Selecting parameters for lattice-based FHE schemes poses a practical challenge for both experts and nonexperts. To solve this problem, we introduce a hybrid approach that combines theoretical approach with experimental analysis. First, we employ regression analysis to examine the impact of parameters on both performance and security. The varying behavior of FHE parameters in terms of performance, security, and ciphertext expansion factor (CEF) makes parameter selection more challenging. To address this issue, we employ a multi-objective optimization algorithm to determine the optimal parameter set for performance, CEF, and security simultaneously. As a result of this optimization, we obtain an improved parameter set that enhances performance at a given security level while ensuring correctness and resistance to lattice-based attacks, maintaining at least 128-bit security. Our results achieve an average ∼ 5× reduction in CEF and generally better performance compared to the parameter sets in a previous BFVrns study. Our approach serves as a semi-automated parameter selection method for the PALISADE homomorphic encryption library, a widely recognized FHE library. This study sets a precedent for other FHE libraries.

Authors

Publication Details

Journal
TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
Published
2025-03-21
DOI
https://doi.org/10.55730/1300-0632.4117
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimizing parameters for efficient computation with fully homomorphic encryption schemes

Kurt Rohloff, CAVİDAN YAKUPOĞLU KARAAĞAÇ
1 links
TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
Coding theory and cryptography
article

Optimizing parameters for efficient computation with fully homomorphic encryption schemes

Kurt Rohloff, CAVİDAN YAKUPOĞLU KARAAĞAÇ
article en

Abstract

In this study, we aim to provide a parameter selection approach for the BFVrns scheme, one of the prominent fully homomorphic encryption (FHE) schemes. Selecting parameters for lattice-based FHE schemes poses a practical challenge for both experts and nonexperts. To solve this problem, we introduce a hybrid approach that combines theoretical approach with experimental analysis. First, we employ regression analysis to examine the impact of parameters on both performance and security. The varying behavior of FHE parameters in terms of performance, security, and ciphertext expansion factor (CEF) makes parameter selection more challenging. To address this issue, we employ a multi-objective optimization algorithm to determine the optimal parameter set for performance, CEF, and security simultaneously. As a result of this optimization, we obtain an improved parameter set that enhances performance at a given security level while ensuring correctness and resistance to lattice-based attacks, maintaining at least 128-bit security. Our results achieve an average ∼ 5× reduction in CEF and generally better performance compared to the parameter sets in a previous BFVrns study. Our approach serves as a semi-automated parameter selection method for the PALISADE homomorphic encryption library, a widely recognized FHE library. This study sets a precedent for other FHE libraries.

TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCESVol. 33(2)
Openalex Percentile: Top 97%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.