Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption

Abstract

Quantum homomorphic encryption, which allows computation by a server directly on encrypted data, is a fundamental primitive out of which more complex quantum cryptography protocols can be built. For such constructions to be possible, quantum homomorphic encryption must satisfy two privacy properties: data privacy which ensures that the input data is private from the server, and circuit privacy which ensures that the ciphertext after the computation does not reveal any additional information about the circuit used to perform it, beyond the output of the computation itself. While circuit privacy is well-studied in classical cryptography and many homomorphic encryption schemes can be equipped with it, its quantum analogue has received little attention. Here we establish a definition of circuit privacy for quantum homomorphic encryption with information-theoretic security. Furthermore, we reduce quantum oblivious transfer to quantum homomorphic encryption. By using this reduction, our work unravels fundamental trade-offs between circuit privacy, data privacy and correctness for a broad family of quantum homomorphic encryption protocols, including schemes that allow only the computation of Clifford circuits.

References in corpus (18)

• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• Insecurity of Quantum Secure Computations
• Universal blind quantum computation
• Blind quantum computation protocol in which Alice only makes measurements
• Quantum homomorphic encryption for circuits of low $T$-gate complexity
• The Impossibility Of Secure Two-Party Classical Computation
• Limitations on information theoretically secure quantum homomorphic encryption
• Quantum homomorphic encryption from quantum codes
• A quantum approach to homomorphic encryption
• Quantum weak coin flipping with arbitrarily small bias
• Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
• Imperfect 1-out-of-2 quantum oblivious transfer: bounds, a protocol, and its experimental implementation
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Practical quantum somewhat-homomorphic encryption with coherent states
• Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security
• The Impossibility of Efficient Quantum Weak Coin-Flipping
• Permutational-key quantum homomorphic encryption with homomorphic quantum error-correction

Cited by in corpus (3)

• Fundamental limits on quantum cloning from the no-signalling principle
• Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
• Partial Blind Quantum Computation: A Framework for Selective Circuit Protection