Paris, France

Quentin Bourgerie

This inventor holds 1 USPTO granted patent and 2 EPO patents. Top assignee: Zama Sas. Active years: 2025.


% Patents Active = 100.0

 

Average Co-Inventor Count = 3.0

ph-index = 1


Company Filing History:


Years Active: 2025

Loading Chart...
Loading Chart...
1 patent (USPTO):Explore Patents

Title: Innovations of Quentin Bourgerie

Introduction

Quentin Bourgerie is an innovative inventor based in Paris, France. He has made significant contributions to the field of encrypted computation, showcasing his expertise through his patent. His work focuses on optimizing encrypted computation parameters, which is crucial for enhancing the efficiency of encrypted data processing.

Latest Patents

Quentin holds a patent titled "Optimizing Encrypted Computation Parameters." This invention involves a computer-implemented method for determining encrypted computation parameters necessary for executing computations on noisy ciphertexts. The method includes dividing a computation graph into multiple subgraphs, each defined by specific types and instantiation parameters. By optimizing these parameters, the computational cost of performing encrypted computations is minimized while adhering to noise constraints.

Career Highlights

Quentin Bourgerie is currently employed at Zama Sas, where he applies his knowledge and skills in encrypted computation. His innovative approach has positioned him as a valuable asset in the field, contributing to advancements in secure data processing.

Collaborations

Quentin collaborates with talented individuals such as Damien Ligier and Samuel Jacques Jean Tap. Their combined expertise fosters a creative environment that drives innovation in their projects.

Conclusion

Quentin Bourgerie's work in optimizing encrypted computation parameters represents a significant advancement in the field of secure data processing. His contributions are paving the way for more efficient and secure computational methods.

This text is generated by artificial intelligence and may not be accurate.
Please report any incorrect information to [email protected]
Loading…