Google HEIR Compiler Advances Encrypted Computing with Reduced Technical Effort

This title was summarized by AI from the post below.

Google just made an announcement that has been part of the long march of encrypted computing maturation and adoption. Their new Google HEIR compiler converts pre-trained AI models to run on encrypted data, greatly reducing the technical effort need, with demos built alongside hardware accelerator companies like Niobium, Belfortt, Cornami, Inc., and Optalysys. Google's framing: homomorphic encryption is "rapidly maturing," and the trade-off is now cost, not capability. And the cost is falling fast. When we started this work under DARPA programs that invested in Fully Homomorphic Encryption (#FHE) in the early 2010s, FHE was originally a mathematical curiosity, millions of times too slow. Over a decade, a layered ecosystem emerged: open-source libraries (including OpenFHE, which I co-founded and which compilers like HEIR target as a backend), then hardware acceleration (Defense Advanced Research Projects Agency (DARPA)'s DPRIVE program seeded much of today's accelerator landscape). IARPA made some fundamental early investments in compilers for FHE, but the field has moved forward and now compilers like HEIR let a much wider range of developers use it all without a cryptography team. Duality Technologies has been deploying this operational FHE-protected secure data collaboration software stacks for governments and regulated enterprises for years. We're happy to support and be a part of the open-source ecosystem for FHE, along with Google and the many other collaborators and contributors in the domain. Alon Kaufman Rina S. shafi goldwasser Vinod Vaikuntanathan Yuriy Polyakov Andreea Alexandru Ahmad Al Badawi, PhD https://lnkd.in/ggz8CtDh

To view or add a comment, sign in

Explore content categories