node-tfhe

---

📃 Read Handbook | 📒 Documentation | 💛 Community support | 📚 FHE resources by Zama

About

$3

TFHE-rs is a pure Rust implementation of TFHE for boolean and integer arithmetics over encrypted data.

It includes:
- a Rust API
- a C API
- and a client-side WASM API

TFHE-rs is designed for developers and researchers who want full control over
what they can do with TFHE, while not having to worry about the low-level
implementation. The goal is to have a stable, simple, high-performance, and
production-ready library for all the advanced features of TFHE.

$3

- Low-level cryptographic library that implements Zama’s variant of TFHE, including programmable bootstrapping
- Implementation of the original TFHE boolean API that can be used as a drop-in replacement for other TFHE libraries
- Short integer API that enables exact, unbounded FHE integer arithmetics with up to 8 bits of message space
- Size-efficient public key encryption
- Ciphertext and server key compression for efficient data transfer
- Full Rust API, C bindings to the Rust High-Level API, and client-side JavaScript API using WASM.

Learn more about TFHE-rs features in the documentation.

Table of Contents

- Getting started
- Cargo.toml configuration
- A simple example
- Resources
- TFHE deep dive
- Tutorials
- Documentation
- Working with TFHE-rs
- Disclaimers
- Citations
- Contributing
- License
- Support

Getting started

> [!Important]
> TFHE-rs released its first stable version v1.0.0 in February 2025, stabilizing the high-level API for the x86 CPU backend.

$3

To use the latest version of TFHE-rs in your project, you first need to add it as a dependency in your Cargo.toml:

``toml
tfhe = { version = "*", features = ["boolean", "shortint", "integer"] }
`

> [!Note]
> Note: You need Rust version 1.84 or newer to compile TFHE-rs. You can check your version with rustc --version.

> [!Note]
> Note: AArch64-based machines are not supported for Windows as it's currently missing an entropy source to be able to seed the CSPRNGs used in TFHE-rs.


↑ Back to top


$3

Here is a full example:

` rust
use tfhe::prelude::*;
use tfhe::{generate_keys, set_server_key, ConfigBuilder, FheUint32, FheUint8};

fn main() -> Result<(), Box> {
// Basic configuration to use homomorphic integers
let config = ConfigBuilder::default().build();

// Key generation
let (client_key, server_keys) = generate_keys(config);

let clear_a = 1344u32;
let clear_b = 5u32;
let clear_c = 7u8;

// Encrypting the input data using the (private) client_key
// FheUint32: Encrypted equivalent to u32
let mut encrypted_a = FheUint32::try_encrypt(clear_a, &client_key)?;
let encrypted_b = FheUint32::try_encrypt(clear_b, &client_key)?;

// FheUint8: Encrypted equivalent to u8
let encrypted_c = FheUint8::try_encrypt(clear_c, &client_key)?;

// On the server side:
set_server_key(server_keys);

// Clear equivalent computations: 1344 * 5 = 6720
let encrypted_res_mul = &encrypted_a * &encrypted_b;

// Clear equivalent computations: 6720 >> 5 = 210
encrypted_a = &encrypted_res_mul >> &encrypted_b;

// Clear equivalent computations: let casted_a = a as u8;
let casted_a: FheUint8 = encrypted_a.cast_into();

// Clear equivalent computations: min(210, 7) = 7
let encrypted_res_min = &casted_a.min(&encrypted_c);

// Operation between clear and encrypted data:
// Clear equivalent computations: 7 & 1 = 1
let encrypted_res = encrypted_res_min & 1_u8;

// Decrypting on the client side:
let clear_res: u8 = encrypted_res.decrypt(&client_key);
assert_eq!(clear_res, 1_u8);

Ok(())
}
`

To run this code, use the following command:


cargo run --release

> [!Note]
> Note that when running code that uses TFHE-rs, it is highly recommended
to run in release mode with cargo's --release flag to have the best performance possible.

Find an example with more explanations in this part of the documentation


↑ Back to top


Resources

$3

A document containing scientific and technical details about algorithms implemented into the library is available here: TFHE-rs: A (Practical) Handbook.

$3

- TFHE Deep Dive - Part I - Ciphertext types
- TFHE Deep Dive - Part II - Encodings and linear leveled operations
- TFHE Deep Dive - Part III - Key switching and leveled multiplications
- TFHE Deep Dive - Part IV - Programmable Bootstrapping

$3

- [[Video tutorial] Implement signed integers using TFHE-rs ](https://www.zama.ai/post/video-tutorial-implement-signed-integers-sing-tfhe-rs)
- Homomorphic parity bit
- Homomorphic case changing on Ascii string
- Boolean SHA256 with TFHE-rs
- Dark market with TFHE-rs
- Regular expression engine with TFHE-rs

Explore more useful resources in TFHE-rs tutorials and Awesome Zama repo

$3

Full, comprehensive documentation is available here: https://docs.zama.ai/tfhe-rs.

↑ Back to top

Working with TFHE-rs

$3

#### Security estimation

Security estimations are done using the
Lattice Estimator
with red_cost_model = reduction.RC.BDGL16.

When a new update is published in the Lattice Estimator, we update parameters accordingly.

$3

By default, the parameter sets used in the High-Level API have a failure probability $\le 2^{-128}$ to securely work in the IND-CPA^D model using the algorithmic techniques provided in our code base [1].
If you want to work within the IND-CPA security model, which is less strict than the IND-CPA-D model, the parameter sets can easily be changed and would have slightly better performance. More details can be found in the TFHE-rs documentation.

[1] Bernard, Olivier, et al. "Drifting Towards Better Error Probabilities in Fully Homomorphic Encryption Schemes". https://eprint.iacr.org/2024/1718.pdf

[2] Li, Baiyu, et al. "Securing approximate homomorphic encryption using differential privacy." Annual International Cryptology Conference. Cham: Springer Nature Switzerland, 2022. https://eprint.iacr.org/2022/816.pdf

#### Side-channel attacks

Mitigation for side-channel attacks has not yet been implemented in TFHE-rs,
and will be released in upcoming versions.




$3

To cite TFHE-rs in academic papers, please use the following entry:

`text
@Misc{TFHE-rs,
title={{TFHE-rs: A Pure Rust Implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data}},
author={Zama},
year={2022},
note={\url{https://github.com/zama-ai/tfhe-rs}},
}
``

$3

There are two ways to contribute to TFHE-rs:

- Open issues to report bugs and typos, or to suggest new ideas
- Request to become an official contributor by emailing hello@zama.ai.

Becoming an approved contributor involves signing our Contributor License Agreement (CLA). Only approved contributors can send pull requests, so please make sure to get in touch before you do!

$3

This software is distributed under the BSD-3-Clause-Clear license. Read this for more details.

#### FAQ
Is Zama’s technology free to use?
>Zama’s libraries are free to use under the BSD 3-Clause Clear license only for development, research, prototyping, and experimentation purposes. However, for any commercial use of Zama's open source code, companies must purchase Zama’s commercial patent license.
>
>Everything we do is open source and we are very transparent on what it means for our users, you can read more about how we monetize our open source products at Zama in this blogpost.

What do I need to do if I want to use Zama’s technology for commercial purposes?
>To commercially use Zama’s technology you need to be granted Zama’s patent license. Please contact us hello@zama.ai for more information.

Do you file IP on your technology?
>Yes, all Zama’s technologies are patented.

Can you customize a solution for my specific use case?
>We are open to collaborating and advancing the FHE space with our partners. If you have specific needs, please email us at hello@zama.ai.

↑ Back to top

Support

🌟 If you find this project helpful or interesting, please consider giving it a star on GitHub! Your support helps to grow the community and motivates further development.

↑ Back to top