Quantum Fully Homomorphic Encryption with Verification

TY - GEN

T1 - Quantum Fully Homomorphic Encryption with Verification

AU - Alagic, Gorjan

AU - Dulek, Yfke

AU - Schaffner, Christian

AU - Speelman, Florian

PY - 2017/11/30

Y1 - 2017/11/30

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-70694-8_16

DO - 10.1007/978-3-319-70694-8_16

M3 - Article in proceedings

SN - 978-3-319-70693-1

VL - 1

T3 - Lecture notes in computer science

SP - 438

EP - 467

BT - Advances in Cryptology – ASIACRYPT 2017

A2 - Takagi, Tsuyoshi

A2 - Peyrin, Thomas

PB - Springer

T2 - 23rd International Conference on the Theory<br/>and Applications of Cryptology and Information Security

Y2 - 3 December 2017 through 7 December 2017

ER -