Toolspublished

Google Showcases HEIR, an Encrypted-AI Compiler, With Four Private-Inference Demos

The open-source tool is meant to turn a cryptography-heavy conversion task into a development workflow. Its four CPU-based examples show possible uses; promised accelerator latency results remain ahead.

By 2 min read
Google Showcases HEIR, an Encrypted-AI Compiler, With Four Private-Inference Demos
Google Showcases HEIR, an Encrypted-AI Compiler, With Four Private-Inference Demos

Listen to this story

The audio brief

About 1:32
0:001:32
Read transcript
Google is showcasing HEIR, an open-source compiler designed to make private AI inference much easier to build. Its purpose is to convert pretrained models that expect ordinary, unencrypted data so they can work with encrypted inputs instead. That matters because homomorphic encryption allows a service to compute directly on ciphertext—the encrypted form of data—and return an encrypted result, without seeing the underlying user information. In practice, that could let a recommendation system use someone’s personal features, or a detector inspect activity, without exposing the data to the provider. The trade-off is significant computational overhead, and adapting applications efficiently has typically required cryptography specialists. HEIR is meant to turn that specialist task into something closer to a one-click production workflow. Google demonstrated four examples: recommendation, credit-card fraud detection, Kitsune-based network anomaly detection, and hotword recognition that could protect audio recordings. The source code is available on GitHub. But the current evidence has a clear limit. The reported latency measurements came from a single-threaded CPU. Google says it is working with Belfort, Niobium, Cornami, and Optalysys on homomorphic-encryption accelerators, but has not yet shown those results. Google also says four peer-reviewed papers already use HEIR, with work involving Georgia Tech, Carnegie Mellon, and Purdue. The key question is whether those future accelerator measurements make encrypted inference practical beyond these demonstrations.

Story brief

3 key points

Google’s HEIR project is moving encrypted AI inference toward a reusable compiler workflow: its open-source toolchain translates pretrained models for homomorphic-encryption inputs, rather than requiring cryptography specialists to adapt each application manually. Four demos—recommendations, fraud detection, network anomaly detection, and hotword recognition—ran on a single-threaded CPU, but Google provided no...

  1. 01

    The demos cover recommendation, credit-card fraud, Kitsune network anomaly detection, and hotword detection; source code is available on GitHub.

  2. 02

    Current latency evidence is limited to single-threaded CPU measurements; accelerator benefits remain a future claim to validate.

  3. 03

    HEIR targets a one-click path for production developers, reducing the specialist cryptography work normally needed for encrypted inference.

Google is showcasing HEIR, an open-source compiler toolchain that converts pretrained AI models built for ordinary data to operate on encrypted inputs. The project aims to let a provider produce an AI result without accessing the underlying user data.

The trade-off behind encrypted inference

Google describes a tension in conventional data protection. End-to-end encryption can protect information from breaches, but it can also stop a service from performing functions that require examining it, such as spam or virus detection. Processing data locally avoids sending it to a provider, but device capacity can be limited and sending proprietary models to devices can risk exposing them.

Homomorphic encryption permits computation directly on ciphertext, meaning encrypted data, with an encrypted result returned to the user. Google says this would allow a recommendation service to use a person’s features without learning them, although the technique still carries a nontrivial cost overhead.

From specialist work to a compiler layer

Manually adapting an existing program for homomorphic encryption efficiently requires cryptography expertise, Google says. HEIR, short for Homomorphic Encryption Intermediate Representation, is designed to take on part of that conversion: it changes pretrained models that work on unencrypted data so they can accept encrypted inputs.

Four demonstrations define the present scope

Google compiled four private-inference applications with HEIR and presented latency figures for a single-threaded CPU. Source code for all four examples is available in the project’s GitHub repository.

  • A content-recommendation model developed with Belfort Labs, LG and New York University.
  • A credit-card fraud detector developed with Niobium and hardshell.ai.
  • Kitsune-based anomaly detection for encrypted network traffic, intended to identify anomalies without exposing packet contents to the provider.
  • A hotword detector that Google says could recognize hotwords while protecting audio recordings.

Hardware latency is the next proof point

Google says it has partnered with homomorphic-encryption accelerator companies Belfort, Niobium, Cornami and Optalysys. It plans to demonstrate the accelerators’ latency benefits in the future; those results will be the more relevant performance evidence beyond the CPU demonstrations.

HEIR also serves as a research platform. Google says four peer-reviewed publications had been built on it by the August 14 announcement, alongside collaborations with universities including Georgia Tech, Carnegie Mellon and Purdue.

Sources

  1. blog.googleHow Google is Making Private AI Practical with Homomorphic Encryption