Limitations on information-theoretically-secure quantum homomorphic encryption
- 10 November 2014
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 90 (5), 050303
- https://doi.org/10.1103/physreva.90.050303
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 localization argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.Keywords
Funding Information
- Neurosciences Research Foundation (NRF-NRFF2013-01)
This publication has 18 references indexed in Scilit:
- Optimal Blind Quantum ComputationPhysical Review Letters, 2013
- Blind quantum computation protocol in which Alice only makes measurementsPhysical Review A, 2013
- Random numbers certified by Bell’s theoremNature, 2010
- Quantum Private QueriesPhysical Review Letters, 2008
- A Survey of Homomorphic Encryption for NonspecialistsEURASIP Journal on Information Security, 2007
- Quantum-Enhanced Measurements: Beating the Standard Quantum LimitScience, 2004
- Insecurity of quantum secure computationsPhysical Review A, 1997
- Unconditionally Secure Quantum Bit Commitment is ImpossiblePhysical Review Letters, 1997
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channelsPhysical Review Letters, 1993
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen statesPhysical Review Letters, 1992