mlsanityData to 7 Oct 2026

Towards Automated Homomorphic Encryption Parameter Selection with Fuzzy Logic and Linear Programming

arXiv 2302.08930 ↗First posted 17 Feb 2023cs.CR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Homomorphic Encryption (HE) is a set of powerful properties of certain cryptosystems that allow for privacy-preserving operation over the encrypted text. Still, HE is not widespread due to limitations in terms of efficiency and usability. Among the challenges of HE, scheme parametrization (i.e., the selection of appropriate parameters within the algorithms) is a relevant multi-faced problem. First, the parametrization needs to comply with a set of properties to guarantee the security of the underlying scheme. Second, parametrization requires a deep understanding of the low-level primitives since the parameters have a confronting impact on the precision, performance, and security of the scheme. Finally, the circuit to be executed influences, and it is influenced by, the parametrization. Thus, there is no general optimal selection of parameters, and this selection depends on the circuit and the scenario of the application. Currently, most of the existing HE frameworks require cryptographers to address these considerations manually. It requires a minimum of expertise acquired through a steep learning curve. In this paper, we propose a unified solution for the aforementioned challenges. Concretely, we present an expert system combining Fuzzy Logic and Linear Programming. The Fuzzy Logic Modules receive a user selection of high-level priorities for the security, efficiency, and performance of the cryptosystem. Based on these preferences, the expert system generates a Linear Programming Model that obtains optimal combinations of parameters by considering those priorities while preserving a minimum level of security for the cryptosystem. We conduct an extended evaluation where we show that an expert system generates optimal parameter selections that maintain user preferences without undergoing the inherent complexity of analyzing the circuit.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 37 references that are in the map. First posted on arXiv 17 Feb 2023.

Builds on

7 of 37 references.

References · 7

  1. 2018A generic framework for privacy preserving deep learningcited by 103
  2. 2018nGraph-HE: A Graph Compiler for Deep Learning on Homomorphically Encrypted Datacited by 24
  3. 2019nGraph-HE2: A High-Throughput Framework for Neural Network Inference on Encrypted Datacited by 21
  4. 2019EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computationcited by 20
  5. 2013Classical Hardness of Learning with Errorscited by 11
  6. 2021SoK: Fully Homomorphic Encryption Compilerscited by 9
  7. 2013Security and Privacy Issues in Cloud Computingcited by 2

Built on by

Not cited yet.