18510254. Fully Homomorphic Encryption Transpiler for High-level Languages simplified abstract (Google LLC)

Fully Homomorphic Encryption Transpiler for High-level Languages

Organization Name

Google LLC

Inventor(s)

Robert Coleman Springer, Iv of Campbell CA (US)

Bryant Gipson of Campbell CA (US)

Shruthi Gorantala of Mountain View CA (US)

Sean Purser-haskell of Mountain View CA (US)

Fully Homomorphic Encryption Transpiler for High-level Languages - A simplified explanation of the abstract

This abstract first appeared for US patent application 18510254 titled 'Fully Homomorphic Encryption Transpiler for High-level Languages

Simplified Explanation

The method described in the abstract involves converting high-level programming language code into an intermediate representation, then into a Boolean intermediate representation, and finally transpiling it back into high-level programming language code to perform operations on ciphertext using fully homomorphic encryption (FHE).

• Obtaining first code in a high-level programming language representing a function for operations on plaintext
• Converting the first code into an intermediate representation comprising a list of nodes with logical operations
• Converting the intermediate representation into a Boolean intermediate representation with single-bit logical operations
• Transpiling the Boolean intermediate representation into second code representing a function for operations on ciphertext using FHE

Potential Applications

This technology could be applied in secure data processing, privacy-preserving computations, and confidential information sharing.

Problems Solved

This technology solves the problem of securely performing operations on sensitive data without exposing the plaintext, ensuring privacy and confidentiality.

Benefits

The benefits of this technology include enhanced data security, protection of sensitive information, and the ability to perform computations on encrypted data without decryption.

Potential Commercial Applications

A potential commercial application of this technology could be in secure cloud computing services, data analytics platforms, and financial institutions requiring secure data processing.

Possible Prior Art

One possible prior art in this field is the development of homomorphic encryption techniques for secure data processing, but the specific method described in the patent application may offer unique advancements in this area.

How does this method compare to existing homomorphic encryption techniques in terms of efficiency and performance?

This article does not provide a direct comparison with existing homomorphic encryption techniques in terms of efficiency and performance.

What are the potential limitations or drawbacks of transpiling code between different representations in terms of computational overhead?

This article does not address the potential limitations or drawbacks of transpiling code between different representations in terms of computational overhead.

Original Abstract Submitted

A method includes obtaining first code in a high-level programming language. The first code represents a first function for performing one or more operations on plaintext. The method also includes converting the first code into an intermediate representation comprising a list of nodes. Each node of the list of nodes includes one or more logical operations. The method also includes converting the intermediate representation into a Boolean intermediate representation that includes a plurality of single-bit logical operations. The method also includes transpiling the Boolean intermediate representation into second code in the high-level programming language. The second code represents a second function for performing, using fully homomorphic encryption (FHE), the one or more operations on ciphertext.