Checked quantum preprocessing generates one-time tables and gives asymptotically secure two-party computation, including interactive quantum homomorphic encryption, without a trusted initializer.
Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum preprocessing for information-theoretic security in two-party computation
Checked quantum preprocessing generates one-time tables and gives asymptotically secure two-party computation, including interactive quantum homomorphic encryption, without a trusted initializer.