FHERMA Cookbook: FHE Components for Privacy-Preserving Applications
Jul 19, 2025·,,,,,,
,,,,,,,,,,,,·
0 min read
Janis adamek
Aikata aikata
Ahmad al badawi
Andreea alexandru
Armen arakelov
Philipp binfet
Victor correa
Jules Dumezy
Sergey gomenyuk
Valentina kononova
Dmitrii lekomtsev
Vivian maloney
Chi hieu nguyen
Yuriy polyakov
Daria pianykh
Hayim shaul
Moritz schulze darup
Dieter teichrib
Dmitry tronin
Gurgen arakelov
Abstract
Fully Homomorphic Encryption (FHE) enables computation over encrypted data and is considered a fundamental tool for privacy-preserving systems. Despite significant theoretical progress, its practical adoption remains limited. One contributing factor is the absence of reusable, application-level components suitable for integration into real-world systems. This work introduces a library of FHE components developed through a competition-based framework. The components are outcomes of a series of formalized challenges published on the FHERMA platform, each targeting a specific challenge—such as comparison, sorting, or matrix operations—under concrete cryptographic and performance constraints. This initial release includes contributions from independent researchers and reflects a variety of approaches across different FHE schemes. The library is intended to expand over time as new challenges are introduced and solved, forming a foundation for building and evaluating privacy-preserving applications.
Type
Publication
In 13th Workshop on Encrypted Computing and Applied Homomorphic Computing
Authors
Authors
Authors
Authors
Authors
Authors
Authors

Authors
Jules Dumezy
(he/him)
PhD Student
I am a second-year PhD student at the Université Paris Saclay/CEA-List in mathematic and computer science.
The main focus of my PhD is fully homomorphic encryption, and more specifically efficient computations in FHE and new FHE computation paradigm.
Authors
Authors
Authors
Authors
Authors
Authors
Authors
Authors
Authors
Authors
Authors
Authors