8000 Determine if "Optimized Homomorphic Evaluation of Boolean Functions" can be ported to HEIR · Issue #1613 · google/heir · GitHub
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content

Determine if "Optimized Homomorphic Evaluation of Boolean Functions" can be ported to HEIR #1613

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
j2kun opened this issue Mar 24, 2025 · 0 comments
Open

Determine if "Optimized Homomorphic Evaluation of Boolean Functions" can be ported to HEIR #1613

j2kun opened this issue Mar 24, 2025 · 0 comments
Assignees
@WoutLegiest
Labels
research synthesis Reading papers to figure out which ideas can be incorporated

Comments

@j2kun
Copy link
Collaborator
j2kun commented Mar 24, 2025

https://eprint.iacr.org/2023/1589

Paper 2023/1589
Optimized Homomorphic Evaluation of Boolean Functions
Nicolas Bon, CryptoExperts (France), DIENS, Ecole normale supérieure, PSL University, CNRS, Inria, Paris, France
David Pointcheval, DIENS, Ecole normale supérieure, PSL University, CNRS, Inria, Paris, France
Matthieu Rivain, CryptoExperts (France)

Abstract
We propose a new framework to homomorphically evaluate Boolean functions using the Torus Fully Homomorphic Encryption (TFHE) scheme. Compared to previous approaches focusing on Boolean gates, our technique can evaluate more complex Boolean functions with several inputs using a single bootstrapping. This allows us to greatly reduce the number of bootstrapping operations necessary to evaluate a Boolean circuit compared to previous works, thus achieving significant improvements in terms of performances. We define theoretically our approach which consists in adding an intermediate homomorphic layer between the plain Boolean space and the ciphertext space. This layer relies on so-called p-encodings embedding bits into Z/p. We analyze the properties of these encodings to enable the evaluation of a given Boolean function and provides a deterministic algorithm (as well as an efficient heuristic) to find valid sets of encodings for a given function. We also propose a method to decompose any Boolean circuit into Boolean functions which are efficiently evaluable using our approach. We apply our framework to homomorphically evaluate various cryptographic primitives, and in particular the AES cipher. Our implementation results show significant improvements compared to the state of the art.
@j2kun j2kun added the research synthesis Reading papers to figure out which ideas can be incorporated label Mar 24, 2025
@WoutLegiest WoutLegiest self-assigned this Apr 17, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@WoutLegiest WoutLegiest

Labels
research synthesis Reading papers to figure out which ideas can be incorporated
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@j2kun @WoutLegiest
0