Quantum homomorphic encryption from quantum codes
arXiv:1508.00938 · doi:10.1103/PhysRevA.98.042334
Abstract
The recent discovery of fully-homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumptions that solving certain computation problems are intractable. Here we present a quantum encryption scheme which is homomorphic for arbitrary classical and quantum circuits which have at most some constant number of non-Clifford gates. Unlike classical schemes, the security of the scheme we present is information theoretic and hence independent of the computational power of an adversary.
arXiv comment8 pages, double column, 3 figures, strengthened security proof
References in corpus (27)
- Quantum secret sharing
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Random Numbers Certified by Bell's Theorem
- How to share a quantum secret
- The operational meaning of min- and max-entropy
- On the Theory of Quantum Secret Sharing
- Experimental Demonstration of Blind Quantum Computing
- Methodology for quantum logic gate constructions
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Quantum computing on encrypted data
- Experimental verification of quantum computations
- Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
- Quantum Gambling
- Reexamination of Quantum Bit Commitment: the Possible and the Impossible
- Quantum walks with encrypted data
- Efficient universal blind computation
- Unconditionally Secure Bit Commitment with Flying Qudits
- Optimal Blind Quantum Computation
- Symmetric quantum fully homomorphic encryption with perfect security
- Limitations on information theoretically secure quantum homomorphic encryption
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Self-guaranteed measurement-based quantum computation
- A quantum approach to homomorphic encryption
- Quantum entropic security and approximate quantum encryption
Cited by in corpus (23)
- Unconditionally verifiable blind computation
- QFactory: classically-instructed remote secret qubits preparation
- Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security
- Succinct Blind Quantum Computation Using a Random Oracle
- Quantum Encryption and Generalized Quantum Shannon Impossibility
- Quantum Fully Homomorphic Encryption by Integrating Pauli One-time Pad with Quaternions
- Quantum homomorphic encryption for polynomial-sized circuits
- Computing on Quantum Shared Secrets for General Quantum Access Structures
- Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
- Fundamental limits on quantum cloning from the no-signalling principle
- Quantum delegated and federated learning via quantum homomorphic encryption
- Delegating Quantum Computation in the Quantum Random Oracle Model
- Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
- Limitations on Transversal Computation through Quantum Homomorphic Encryption
- Blindly Factorizing 21 Quantumly
- A quantum homomorphic encryption scheme for polynomial-sized circuits
- Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption
- Demonstrating Quantum Homomorphic Encryption Through Simulation
- Quantum preprocessing for information-theoretic security in two-party computation
- A framework for quantum homomorphic encryption with experimental demonstration
- Quantum Private Function Evaluation
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- Quantum Search on Encrypted Data Based on Quantum Homomorphic Encryption