Zama at FHE.org 2026: Eight Contributions from Taipei

FHE.org is the annual gathering of the Fully Homomorphic Encryption research community. What started five years ago as a small gathering in Trondheim, Norway, has become the go-to event for FHE research.

This year's edition, the 5th Annual FHE.org Conference, took place on March 8th in Taipei, co-located with Real World Crypto 2026 and in cooperation with IACR. It attracted 168 registered attendees, 55 submissions, 10 accepted talks, and 23 accepted posters — along with sponsors including Apple, AWS, and Google.

The Zama research team was there. Here is a recap of everything we presented.

Three Talks

Accelerating TFHE with Sorted Bootstrapping Techniques

Bootstrapping is one of the most compute-intensive operations in FHE. Loris Bergerat, from Zama and Université Caen Normandie, presented new sorting-based techniques that make it significantly faster — a concrete step toward more practical TFHE deployments.

Watch the presentation

Randomization in FHE and TFHE

Nigel Smart, from Zama and KU Leuven, presented a deep dive into how randomization can be systematically leveraged in FHE schemes to improve security and efficiency. Lots of interesting directions opening up here.

Watch the presentation

Iterated Hash Functions over Encrypted Data: News from the Front

Homomorphic evaluation of hash functions is a key building block for many real-world applications. Marc Joye presented the latest advances and what they unlock.

Watch the presentation

Five Posters

Complex Elections via Threshold (Fully) Homomorphic Encryption

Private, verifiable, and scalable voting — made possible with Threshold FHE. Real-world democracy applications for FHE are taking shape.

Presented by Charlotte Bonte, Georgio Nicolas and Nigel Smart.

See the poster

Sub-Millisecond TFHE Bootstrapping on GPU

Breaking the sub-millisecond barrier for TFHE bootstrapping on GPU — a major step toward real-time encrypted computation at scale.

Presented by Pedro Geraldo M. R. Alves, Beka Barbakadze, Enzo Di Maria, Jakub Klemsa, Agnes Leroy and Guillermo Oyarzun.

See the poster

Practical SNARGs for Matrix Multiplications over Encrypted Data

Verifiable computation over encrypted matrices, combining SNARGs with FHE. The implications for confidential ML and AI are significant.

Presented by Michael Walter, Louis Tremblay Thibault and Jiapeng Zhang.

See the poster

Concrete Estimation of Correctness and IND-CPA-D Security for FHE via Rare Event Simulation

Rigorous correctness and security estimation for FHE using rare event simulation — a more principled foundation for correctness guarantees and decryption security in FHE schemes.

Presented by Mathieu Ballandras, Jean-Baptiste Orfila and Samuel Tap.

See the poster

Let's Talk: How TFHE Became Practical

A look back at the journey — from early theory to production-ready implementations. Years of research, engineering, and community building that made TFHE what it is today.

Presented by Pierre Gardrat, Agnès Leroy, Arthur Meyre, Jean-Baptiste Orfila and Samuel Tap.

See the poster

The Field Is Accelerating

FHE.org is not just a research conference. It is a signal: Stronger submissions year after year, more industry names joining as sponsors, and a community that keeps expanding. The field is moving, and fast.

All video resources from the conference are available at fhe.org/2026/resources. The full conference playlist is also available on YouTube.

The Zama research papers and publications are tracked in our awesome-zama repository on GitHub.

Want to start building with FHE?

Check out Zama's open-source repositories.

Additional Links

• Zama on X and Telegram
• Contact the Zama team

‍