Quantum homomorphic encryption from quantum codes

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.

8 pages, double column, 3 figures, strengthened security proof

References in corpus (4)

• Verifiable measurement-only blind quantum computing with stabilizer testing
• Quantum walks with encrypted data
• Limitations on information theoretically secure quantum homomorphic encryption
• Self-guaranteed measurement-based quantum computation

Cited by in corpus (22)

• 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
• Computing on Quantum Shared Secrets for General Quantum Access Structures
• Quantum homomorphic encryption for polynomial-sized circuits
• Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
• Fundamental limits on quantum cloning from the no-signalling principle
• Delegating Quantum Computation in the Quantum Random Oracle Model
• Quantum delegated and federated learning via quantum homomorphic encryption
• Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
• Blindly Factorizing 21 Quantumly
• Limitations on Transversal Computation through Quantum Homomorphic Encryption
• Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption
• A quantum homomorphic encryption scheme for polynomial-sized circuits
• 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