Litcius/Paper detail

Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space

Pierrick Méaux, Jeongeun Park, Hilder V. L. Pereira

2024IACR Communications in Cryptology10 citationsDOIOpen Access PDF

Abstract

Fully Homomorphic Encryption (FHE) is a powerful tool to achieve non-interactive privacy preserving protocols with optimal computation/communication complexity. However, the main disadvantage is that the actual communication cost (bandwidth) is high due to the large size of FHE ciphertexts. As a solution, a technique called transciphering (also known as Hybrid Homomorphic Encryption) was introduced to achieve almost optimal bandwidth for such protocols. However, all existing works require clients to fix a precision for the messages or a mathematical structure for the message space beforehand. It results in unwanted constraints on the plaintext size or underlying structure of FHE based applications. In this article, we introduce a new approach for transciphering which does not require fixed message precision decided by the client, for the first time. In more detail, a client uses any kind of FHE-friendly symmetric cipher for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo stretchy="false">{</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">}</mml:mo> </mml:mrow> </mml:math> to send its input data encrypted bit-by-bit, then the server can choose a precision <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> </mml:mrow> </mml:math> depending on the application and homomorphically transforms the encrypted bits into FHE ciphertexts encrypting integers in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>ℤ</mml:mi> <mml:mi>p</mml:mi> </mml:msub> </mml:mrow> </mml:math>. To illustrate our new technique, we evaluate a transciphering using FiLIP cipher and adapt the most practical homomorphic evaluation technique [CCS'22] to keep the practical latency. As a result, our proof-of-concept implementation for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> </mml:mrow> </mml:math> from <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mn>2</mml:mn> </mml:msup> </mml:mrow> </mml:math> to <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mn>2</mml:mn> <mml:mn>8</mml:mn> </mml:msup> </mml:mrow> </mml:math> takes only from <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>13</mml:mn> </mml:mrow> </mml:math> ms to <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>137</mml:mn> </mml:mrow> </mml:math> ms.

Topics & Concepts

AlgorithmComputer sciencePlaintextHomomorphic encryptionEncryptionComputer networkCryptography and Data SecurityCryptographic Implementations and SecurityCoding theory and cryptography
Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space | Litcius