REVIEW 1 cited by
Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.