Dulek, Y.

Schaffner, C.

Speelman, F.

English

We present a new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary quantum circuits, as long as those circuits are of size, polynomial in the security parameter. Building on the framework of Broadbent and Jeffery (CRYPTO’15) and recent results in the area of instantaneous non-local quantum computation by Speelman (TQC’16), we show how to construct quantum gadgets that allow perfect correction of the errors which occur during the homomorphic evaluation of T gates on encrypted quantum data. Our scheme can be based on any classical (leveled) fully homomorphic encryption (FHE) scheme and requires no computational assumptions besides those already used by the classical scheme. The size of our quantum gadget depends on the space complexity of the classical decryption function—which aligns well with the current efforts to minimize the complexity of the decryption function. Our scheme (or slight variants of it) offers a number of additional advantages such as ideal compactness, the ability to supply gadgets “on demand,” circuit privacy for the evaluator against passive adversaries, and a three-round scheme for blind delegated quantum computation which puts only very limited demands on the quantum abilities of the client.</p

International Migration, Integration and Social Cohesion online publications

Quantum homomorphic encryption for polynomial-size circuits

https://pure.uva.nl/ws/files/45950018/v014a007.pdf

Quantum homomorphic encryption for polynomial-size circuits

Abstract

Similar works

Full text

Available Versions

International Migration, Integration and Social Cohesion online publications