Limitations on information theoretically secure quantum homomorphic encryption

Abstract

Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has raised the question of whether quantum mechanics may be used to achieve information theoretically secure fully homomorphic encryption. Here we show, via an information localisation argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.

4 pages, 1 figure

References in corpus (2)

• Quantum private queries
• Quantum walks with encrypted data

Cited by in corpus (4)

• Practical quantum computing on encrypted data
• Quantum fully homomorphic encryption scheme based on quantum fault-tolerant construction
• Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
• A framework for quantum homomorphic encryption with experimental demonstration