Next meetup scheduled: Towards Practical Transciphering for FHE with Setup Independent of the Plaintext Space
on February 8th, 4pm CEST (Paris, FR)
Greetings cryptographers!
đď¸ The next FHE.org meetup is scheduled for Thursday, February 8th at 4pm CEST (Paris, FR).
The meetup features Jeongeun Park, a cryptographer, mainly studying FHE and its applications, currently working at COSIC, KU Leuven as a postdoctoral researcher, presenting Towards Practical Transciphering for FHE with Setup Independent of Plaintext Space.
Here is the link to register:
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 of 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.
This talk introduces 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 {0,1} to send its input data encrypted bit-by-bit, then the server can choose a precision p depending on the application and homomorphically transforms the encrypted bits into FHE ciphertexts encrypting integers in Z_p. This talk shows an efficient evaluation of the new technique using FiLIP cipher and adapt the most practical homomorphic evaluation technique [CCS'22] to keep the practical latency. The practical running time as a proof-of-concept implementation will be also given at the end of this talk.
About the speakers
Jeongeun Park is a cryptographer, mainly studying FHE and its applications, currently working at COSIC, KU Leuven as a postdoctoral researcher.
She has developed existing FHE schemes to handle multiple users securely and efficiently, which allows FHE to be realized in more general application scenarios.
She also has designed efficient privacy preserving protocols such as PIR, machine learning algorithms as applications of FHE.
Resources from last meetup
Weâre happy to have had Erin Hales this week presenting on Designs for practical SHE schemes based on Ring-LWR. You can access those resources on the FHE.org website here.
Earlier in the month we also had Duhyeong Kim presenting on High-precision RNS-CKKS on small word-size architectures. In case the video wasnât working for you at the time, you can watch it now at on the FHE.org website here (click the âVideo recordingâ link).
Donât miss the 3rd FHE.org conference
The 3rd Annual FHE.org Conference colocated with Real World Crypto 2024 will be held at the Arcadian Loft in Toronto, Canada on Sunday, March 24, 2024.
Join us for a full day of interesting presentations, tutorials, poster presentations, contributed and invited talks, as well as our very own after-party event. All info about the conference on the official page here.
Never miss an update
Join the discord server to discuss FHE related topics with the community: discord.fhe.org
See you soon!
The FHE.org team