Feature: primitives for binFHE?

Library Questions
1

As part of my project to create an OpenFHE back-end for the T2 benchmark platform (GitHub - TrustworthyComputing/T2-FHE-Compiler-and-Benchmarks: A cross compiler and standardized benchmarks for fully homomorphic encryption), I’ve created primitives for the binFHE interface, which operate on arbitrary word sizes for subtraction, addition, multiplication, increment, decrement, boolean operations, mutex, left shift, right shift, and their logical equivalent.

Would the project team be interested in these primitives?

Regards,
Shawn Emery
PhD student (University of Colorado Colorado Springs)

2

Thank you for the post.

I briefly looked at the repository. It says it supports PALISADE v1.11.9 as a backend. Is there support for OpenFHE?

PALISADE v1.11.9 only supported Boolean arithmetic. We added support support for larger plaintext spaces only to OpenFHE (later). Does this imply that currently the T2 framework performs all homomorphic computations using Boolean arithmetic? Or is there a newer branch?

3

Hi Yuriy,

I’ve developed a backend for OpenFHE but have not sent a pull request for these changes to the T2 project. I was waiting until the associated paper is submitted and accepted. In the mean time I could contribute the functional units that were developed for the BinFHE tests that were required to execute the benchmark suite. Do you think that would be beneficial to the OpenFHE project?

Shawn.