Title: Homomorphic Encryption of Quantum Data

Abstract

Future quantum computers are based on the laws of quantum mechanics, and will be able to execute certain computations much faster than classical computers. These computers will be so radically different, that new hardware and software has to be developed. Classical computers are based on bits which can be 0 or 1, but quantum computers are based on qubits, which can be in a superposition of 0 and 1.
The topic of this talk is about a special form of encryption of such qubits. Existing encryption methods for classical computers are not suited to encrypt data on quantum computers. Homomorphic encryption is a special encryption method which allows third parties to perform computations on encrypted data without having to expose the data itself. This is useful when computations are being made on sensitive data by external parties, for instance on super computers or in the cloud.
In 2009, it was discovered that such homomorphic encryption methods are possible for classical bits. Since then attempts have been made to design similar encryption methods for qubits, but none of these were successful.
In this talk, I'll present a solution to this problem and prove the existence of homomorphic encryption methods for quantum data. No previous knowledge about quantum computing nor cryptography is required to follow the talk.

Joint work with Yfke Dulek and Florian Speelman

https://arxiv.org/abs/1603.09717

appeared at CRYPTO 2016 and QIP 2017
 

Location: KdVI meeting room, Science Park 107, room F3.20