Skip to content
Permalink

Comparing changes

Choose two branches to see what’s changed or to start a new pull request. If you need to, you can also or learn more about diff comparisons.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also . Learn more about diff comparisons here.
base repository: CryptoExperts/bpr-boolean-fhe
Failed to load repositories. Confirm that selected base ref is valid, then try again.
Loading
base: main
Choose a base ref
...
head repository: virtualsecureplatform/bpr-boolean-fhe
Failed to load repositories. Confirm that selected head ref is valid, then try again.
Loading
compare: main
Choose a head ref
Can’t automatically merge. Don’t worry, you can still create the pull request.
  • 2 commits
  • 1 file changed
  • 1 contributor

Commits on Oct 12, 2023

  1. Update README.md

    @nicolasbon38
    nicolasbon38 authored Oct 12, 2023
    Copy the full SHA
    2e6fbd2 View commit details

Commits on Oct 13, 2023

  1. Update README.md

    @nicolasbon38
    nicolasbon38 authored Oct 13, 2023
    Copy the full SHA
    ba28a37 View commit details
Showing with 7 additions and 2 deletions.
  1. +7 −2 README.md
9 changes: 7 additions & 2 deletions README.md
View file
Original file line number Diff line number Diff line change
@@ -1,5 +1,10 @@
- The folder `search_algorithm` contains the implementations of the deterministic search alogorithn of Section 4 of the paper (and the heuristic presented in Appendix). Also it contains the execution of these algorith;s on the crypto primitives we considered in Section 6.
This repository contains the code related to the paper **Optimized Homomorphic Evaluation of Boolean Functions**.


- The folder `search_algorithm` contains the implementations of the deterministic search algorithm of Section 4 of the paper (and the heuristic presented in Appendix). Also it contains the execution of these algorithms on the crypto primitives we considered in Section 6.

- The folder `aes` contains the implementation of the algorithms presented in Section 5 splitting a Boolean circuits into evaluable Boolean functions. Also, these algorithms are applied to the use-case of AES presented at the end of the paper.

- The folder `implementations_crypto_primitives` contains our fork of the library `tfhe-rs` (https://github.com/zama-ai/tfhe-rs). It also contains the implementations we present in Section 6 of the paper.
- The folder `implementations_crypto_primitives` contains our fork of the library `tfhe-rs` (https://github.com/zama-ai/tfhe-rs). It also contains the implementations we present in Section 6 of the paper.

Code by Nicolas Bon.