• Corpus ID: 119185375

Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption

@article{Newman2018FurtherLO,
  title={Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption},
  author={Michael Newman},
  journal={arXiv: Quantum Physics},
  year={2018}
}
  • M. Newman
  • Published 24 September 2018
  • Computer Science, Mathematics
  • arXiv: Quantum Physics
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… 

Figures from this paper

A quantum homomorphic encryption scheme for polynomial-sized circuits
  • Li Yu
  • Computer Science, Mathematics
    ArXiv
  • 2018
TLDR
This paper proposes an information-theoretically-secure QHE scheme suitable for quantum circuits of size polynomial in the number of data qubits, which keeps the data perfectly secure, and the circuit quite secure with the help of a polynometric amount of entanglement and classical communication.
Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
TLDR
Using this reduction, this work unravels fundamental trade-off between circuit privacy, data privacy and correctness for a broad family of quantum homomorphic encryption protocols, including schemes that allow only computation of Clifford circuits.
Quantum preprocessing for security enhancement in classical two-party computation
  • Li Yu
  • Computer Science, Mathematics
    ArXiv
  • 2019
TLDR
This work proposes two bipartite quantum protocols with possible aborts for approximately generating such bipartites classical correlations with varying degrees of privacy, without introducing a third party.
A ug 2 01 9 Quantum preprocessing for security enhancement in classical two-party computation
  • Li Yu
  • Computer Science, Mathematics
  • 2019
TLDR
This work proposes two bipartite quantum protocols with possible aborts for approximately generating such bipartites classical correlations with varying degrees of privacy, without introducing a third party.
Quantum preprocessing for information-theoretic security in two-party computation
  • Li Yu
  • Computer Science, Mathematics
  • 2019
TLDR
It is shown how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption.
Quantum preprocessing for information-theoretic security in two-party computation
  • Li Yu
  • Computer Science, Mathematics
  • 2019
TLDR
It is shown how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption.
Quantum preprocessing for information-theoretic security in two-party computation
  • Li Yu
  • Computer Science, Mathematics
  • 2019
TLDR
It is shown how to use the generated one-time tables to achieve nontrivial information-theoretic security in generic two-party classical or quantum computation tasks, including (interactive) quantum homomorphic encryption.
Quantum preprocessing for information-theoretic security in two-party computation
  • Li Yu
  • Computer Science, Mathematics
  • 2019
TLDR
It is shown how to use the generated one-time tables to achieve nontrivial informationtheoretic security in generic two-party classical or quantum computation tasks.
A framework for quantum homomorphic encryption with experimental demonstration
TLDR
A framework for (interactive) QHE based on the universal circuit approach, which contains a subprocedure of calculating a classical linear polynomial, which can be implemented with quantum or classical methods; apart from the subprocesure, the framework has low requirement on the quantum capabilities of the party who provides the circuit.
Limitations on transversal computation through quantum homomorphic encryption
TLDR
This work builds on almost any QECC, and implements that code's transversal gate set homomorphically, implying that any ITS quantum homomorphic scheme (ITS-QFHE) implementing the full set of classical reversible functions must be highly inefficient.
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Limitations on information theoretically secure quantum homomorphic encryption
TLDR
It is shown, via an information localization argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required.
On statistically-secure quantum homomorphic encryption
TLDR
This work provides a limitation for the first question that an ITS quantum FHE necessarily incurs exponential overhead and proposes a QHE scheme for the instantaneous quantum polynomial-time (IQP) circuits.
Quantum Fully Homomorphic Encryption with Verification
TLDR
This work states that quantum FHE (or QFHE) can be delegated and verified in a non-interactive manner in the quantum setting.
Quantum homomorphic encryption from quantum codes
TLDR
A quantum encryption scheme which is homomorphic for arbitrary classical and quantum circuits which have at most some constant number of non-Clifford gates is presented.
Classical Homomorphic Encryption for Quantum Circuits
  • U. Mahadev
  • Computer Science, Mathematics
    2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
TLDR
The scheme allows a classical client to blindly delegate a quantum computation to a quantum server: an honest server is able to run the computation while a malicious server is unable to learn any information about the computation.
Private quantum computation: an introduction to blind quantum computing and related protocols
TLDR
A review of the progress to date in quantum cryptography protocols addressing the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation.
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
TLDR
This work formally defines and gives schemes for quantum homomorphic encryption, which is the encryption of quantum information such that quantum computations can be performed given the ciphertext only.
Quantum Homomorphic Encryption for Polynomial-Sized Circuits
TLDR
A new scheme for quantum homomorphic encryption which is compact and allows for efficient evaluation of arbitrary polynomial-sized quantum circuits, and a three-round scheme for blind delegated quantum computation which puts only very limited demands on the quantum abilities of the client.
A quantum approach to homomorphic encryption
TLDR
This work uses the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data.
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
TLDR
In this work, a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem is described, with a new technique for building FHE schemes called the approximate eigenvector method.
...
...