A fully homomorphic encryption system hides data from unauthorized parties while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more powerful server without revealing their inputs, a fully homomorphic cryptosystem can be used as a building block in the construction of a number of cryptographic functionalities. Designing such a scheme remained an open problem until 2009, decades after the idea was first conceived, and the past few years have seen the generalization of this functionality to the world of quantum machines. Quantum schemes prior to the one implemented here were able to replicate some features in particular use cases often associated with homomorphic encryption but lacked other crucial properties, for example, relying on continual interaction to perform a computation or leaking information about the encrypted data. We present the first experimental realization of a quantum fully homomorphic encryption scheme. To demonstrate the versatility of a a quantum fully homomorphic encryption scheme, we further present a toy two-party secure computation task enabled by our scheme.

, ,
Physical Review X
Quantum Computation with Bounded Space , WISE Women In Science Excel
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Tham, W. K., Ferretti, H., Bonsma-Fisher, K., Brodutch, A., Sanders, B., Steinberg, A., & Jeffery, S. (2020). Experimental demonstration of quantum fully homomorphic encryption with application in a two-party secure protocol. Physical Review X, 10(1). doi:10.1103/PhysRevX.10.011038