2000 character limit reached
Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption (1809.08719v1)
Published 24 Sep 2018 in quant-ph
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.