Quantum Fully Homomorphic Encryption With Verification

TL;DR

This paper introduces a quantum fully homomorphic encryption scheme with verification that allows secure, non-interactive quantum computations with classical verification methods, enabling new applications like quantum one-time programs.

Contribution

It constructs the first non-interactive quantum FHE scheme with verification, combining classical verification with quantum encryption for secure quantum computation.

Findings

Provides a scheme for quantum FHE with verification

Enables non-interactive quantum computation verification

Facilitates construction of quantum one-time programs from classical ones

Abstract

Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantum setting. However, a crucial ingredient in almost all applications of FHE is circuit verification. Classically, verification is performed by checking a transcript of the homomorphic computation. Quantumly, this strategy is impossible due to no-cloning. This leads to an important open question: can quantum computations be delegated and verified in a non-interactive manner? In this work, we answer this question in the affirmative, by constructing a scheme for QFHE with verification (vQFHE). Our scheme provides authenticated encryption, and enables arbitrary polynomial-time quantum computations without the need of interaction between client and server. Verification is almost entirely classical; for computations that start and end with classical states, it is completely classical. As a first application, we show how to construct quantum one-time programs from classical one-time programs and vQFHE.