Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption
arXiv:1809.08719
Abstract
In this brief note, we review and extend existing limitations on information-theoretically (IT) secure quantum fully homomorphic encryption (QFHE). The essential ingredient remains Nayak's bound, which provides a tradeoff between the number of homomorphically implementable functions of an IT-secure QHE scheme and its efficiency. Importantly, the bound is robust to imperfect IT-security guarantees. We summarize these bounds in the context of existing QHE schemes, and discuss subtleties of the imposed restrictions.
arXiv commentBrief note adapted from author's thesis, 7 pages
References in corpus (5)
- Programmable quantum gate arrays
- Limitations on information theoretically secure quantum homomorphic encryption
- Quantum homomorphic encryption from quantum codes
- Quantum Private Information Retrieval has linear communication complexity
- Practical quantum somewhat-homomorphic encryption with coherent states